What do berkeley CS student read?

link track:
http://www.cs.berkeley.edu/~christos/classics/cs298.html

Examples of classics:

• Euler's paper on the Konigsberg bridges; do you know of a translation? (or Latin?)
  
• On computable numbers, with an application to the Entscheidungsproblem. Alan Turing 1936
• As We May Think. Vannevar Bush, 1945
  
• First Draft of the Report on EDVAC. John von Neumann 1946
  
• A Mathematical Theory of Communication. Claude E. Shannon 1948
• The Turing Test paper, Alan Turing 1950
  
• Non-Cooperative Games. John Nash, 1951
• Letter from Gödel to von Neumann, 1956; see J. Hartmanis's "Godel, von Neumann and the P=?NP problem," Bulletin of the European Association for Theoretical Computer Science (EATCS), 38 (1989), pp. 101--107.
  

• Edmonds, Jack , Paths, trees, and flowers, Canadian Journal of Mathematics, Vol 17, No -, 449-467, 1965
  
• Three papers on NP-completeness: S. A. Cook The complexity of theorem-proving procedures, 1971 STOC; R.M. Karp. Reducibility among combinatorial problems. In R.E. Miller and J.W. Thatcher, editors, Complexity of Computer Computations, pages 85--103. Plenum Press, 1972; and Levin, Universal Search Problems. [Problemy Peredatsi Informatsii] 9(3):265-266, 1973 (c). Annals of the History of Computing 6(4):384-400, 1984.

• Two papers on the relational model
  
• A Relational Model of Data for Large Shared Data Banks. E. F. Codd 1970
• Relational Completeness of Data Base Sublanguages. E. F. Codd, 1972
• New Directions in Cryptography, Diffie and Hellman, 1976
  
• Simulating physics with computers. Feynman, IJTP 21 1982