A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | Year | Author(s) | Paper Title | Notes | |||||||||||||||||||||
2 | 1842 | Menabrea and Lovelace | A sketch of the analytical engine invented by Charles Babbage | ||||||||||||||||||||||
3 | 1887 | Peirce, C. S. | Logical Machines, Am J. Psych. 1, p. 165 | ||||||||||||||||||||||
4 | 1922 | Scheyer, Emmanuel | When perforated paper goes to work, Sci. Am., 127, p. 395 | ||||||||||||||||||||||
5 | 1936 | Turing | On computable numbers, with an application to the Entscheidungsproblem | ||||||||||||||||||||||
6 | 1938 | Aiken | Proposed automatic calculating machine | ||||||||||||||||||||||
7 | 1938 | Shannon | A symbolic analysis of relays and switching circuits | ||||||||||||||||||||||
8 | 1943 | McCulloch and Pitts | A logical calculus of the ideas immanent in nervous activity | ||||||||||||||||||||||
9 | 1945 | Bush | As we may think | ||||||||||||||||||||||
10 | 1945 | von Neumann | First draft of a report on the EDVAC | ||||||||||||||||||||||
11 | 1946 | Burks, Goldstine, von Neumann | Preliminary discussion of the logical design of an electronic computing instrument | ||||||||||||||||||||||
12 | 1948 | Shannon | A mathematical theory of communication | ||||||||||||||||||||||
13 | 1948 | von Neumann | The general and logical theory of automata | ||||||||||||||||||||||
14 | 1949 | McCulloch | The brain as a computing machine | ||||||||||||||||||||||
15 | 1950 | Hamming | Error detecting and error correcting codes | ||||||||||||||||||||||
16 | 1950 | Shannon | Programming a computer for playing chess | ||||||||||||||||||||||
17 | 1950 | Turing | Computing Machinery and Intelligence | ||||||||||||||||||||||
18 | 1952 | Hopper | The education of a computer | ||||||||||||||||||||||
19 | 1953 | Shannon | Computers and automata | ||||||||||||||||||||||
20 | 1955 | McCarthy, Minsky, Rochester, Shannon | A proposal for the Dartmouth summer institute on artifical intelligence | ||||||||||||||||||||||
21 | 1956 | Bardeen | Semiconductor research leading to the point contact transistor | ||||||||||||||||||||||
22 | 1956 | Newell and Simon | The logic theory machine | ||||||||||||||||||||||
23 | 1957 | Backus et al. | The FORTRAN automatic coding system | ||||||||||||||||||||||
24 | 1958 | Rosenblatt | The perceptron: A probabilistic model for information storage and organization in the brain | ||||||||||||||||||||||
25 | 1959 | Rabin and Scott | Finite automata and their decision problems | ||||||||||||||||||||||
26 | 1960 | Licklider | Man-Computer Symbiosis | ||||||||||||||||||||||
27 | 1960 | Baran | Reliable digital communications systems utilizing unreliable network repeater nodes | ||||||||||||||||||||||
28 | 1960 | McCarthy | Recursive functions of symbolic expressions and their computation by machine, Part I | ||||||||||||||||||||||
29 | 1962 | Corbato, Daggett, Daley | An experimental time-sharing system | ||||||||||||||||||||||
30 | 1962 | Engelbart | Augmenting human intellect | ||||||||||||||||||||||
31 | 1962 | Hoare | Quicksort | ||||||||||||||||||||||
32 | 1962 | Kilburn et al. | One-level storage system | ||||||||||||||||||||||
33 | 1962 | Warshall | A theorem on boolean matrices | ||||||||||||||||||||||
34 | 1963 | Hartmanis and Stearns | On the computational complexity of algorithms | ||||||||||||||||||||||
35 | 1963 | Sutherland | Sketchpad, a man-machine communication system | ||||||||||||||||||||||
36 | 1964 | Amdahl et al. | Architecture of the IBM System/360 | ||||||||||||||||||||||
37 | 1964 | Baran | On distributed communications | ||||||||||||||||||||||
38 | 1964 | Kilby | Miniaturized electronic circuits | ||||||||||||||||||||||
39 | 1965 | Edmonds | Paths, trees, and flowers | ||||||||||||||||||||||
40 | 1965 | Cooley and Tukey | An algorithm for the machine calculation of complex Fourier seris | http://www.ams.org/journals/mcom/1965-19-090/S0025-5718-1965-0178586-1/S0025-5718-1965-0178586-1.pdf | |||||||||||||||||||||
41 | 1965 | Knuth | On the translation of languages from left to right | ||||||||||||||||||||||
42 | 1965 | Moore | Cramming more components onto integrated circuits | ||||||||||||||||||||||
43 | 1965 | Sutherland | The ultimate display | ||||||||||||||||||||||
44 | 1965 | Wilkes | Slave memories and dynamic storage allocation | ||||||||||||||||||||||
45 | 1966 | Weizenbaum | ELIZA -- A computer program for the study of natural langauage communication between man and machine | ||||||||||||||||||||||
46 | 1967 | Blum | A machine-independent theory of the complexity of recursive functions | ||||||||||||||||||||||
47 | 1967 | Dijkstra | The structure of the "THE" multiprogramming system | ||||||||||||||||||||||
48 | 1967 | Floyd, R. | Assigning meanings to programs | ||||||||||||||||||||||
49 | 1967 | Tomasuolo | An efficient algorithm for exploiting multiple arithmetic units | ||||||||||||||||||||||
50 | 1968 | Daley and Dennis | Virtual memory, processes, and sharing in MULTICS | ||||||||||||||||||||||
51 | 1968 | Denning, P. | The working set model for program behavior | ||||||||||||||||||||||
52 | 1968 | Dijkstra | Go To Statement considered harmful | ||||||||||||||||||||||
53 | 1968 | Englebart | FJCC "The mother of all demos" | ||||||||||||||||||||||
54 | 1968 | Myer & Sutherland | On the design of display processors | ||||||||||||||||||||||
55 | 1969 | Hoare | An axiomatic basis for computer programming | ||||||||||||||||||||||
56 | 1969 | Strassen | Gaussian Elimination is not Optimal | ||||||||||||||||||||||
57 | 1970 | Codd | A reltional model for large shared data banks | ||||||||||||||||||||||
58 | 1970 | Earley | An efficient context-free parsing algorithm | ||||||||||||||||||||||
59 | 1970 | Engelbart | Intellectual implications of multi-access computer networks | ||||||||||||||||||||||
60 | 1970 | Licklider and Taylor | The computer as a communication device | ||||||||||||||||||||||
61 | 1970 | McCarthy | The home information terminal | ||||||||||||||||||||||
62 | 1970 | Scott | Outline of a mathematical theory of computation | ||||||||||||||||||||||
63 | 1971 | Cook | The complexity of theorem-proving procedures | ||||||||||||||||||||||
64 | 1971 | Scott and Strachey | Toward a mathematical semantics of programming languages | ||||||||||||||||||||||
65 | 1972 | Codd | Relational completeness of data base sublanguages | ||||||||||||||||||||||
66 | 1972 | Karp | Reducibility among combinatorial problems | ||||||||||||||||||||||
67 | 1972 | Spärck Jones | A statistical interpretation of term specificity and its application in retrieval | ||||||||||||||||||||||
68 | 1973 | Blum, Floyd, Pratt, Rivest, Tarjan | Time bounds for selection | ||||||||||||||||||||||
69 | 1973 | Levin | Universal search problems | ||||||||||||||||||||||
70 | 1974 | Catmull | A subdivision algorithm for display of curved surfaces | ||||||||||||||||||||||
71 | 1974 | Cerf and Kahn | A protocol for packet network intercommunication | ||||||||||||||||||||||
72 | 1974 | Liskov and Zilles | Programming with abstract data types | ||||||||||||||||||||||
73 | 1974 | Ritchie and Thompson | The UNIX time-sharing system | ||||||||||||||||||||||
74 | 1975 | Gray, Lorie, Putzolu | Granularity of locks in a shared data base | ||||||||||||||||||||||
75 | 1975 | Salton, Wong, Yang | A vector space model for automatic indexing | ||||||||||||||||||||||
76 | 1976 | Allen and Cocke | A program data flow analysis procedure | ||||||||||||||||||||||
77 | 1976 | Denning, D. | A lattice model of secure information flow | ||||||||||||||||||||||
78 | 1976 | Metcalfe and Boggs | Ethernet: Distributed Packet switching for local computer networks | ||||||||||||||||||||||
79 | 1977 | Kay and Goldberg | Personal dynamic media | ||||||||||||||||||||||
80 | 1977 | Liskov et al. | Abstraction mechanisms in CLU | ||||||||||||||||||||||
81 | 1977 | Milner | A theory of type polymorphism in programming | ||||||||||||||||||||||
82 | 1977 | Newell and Blinn | The progression of realism in computer generated images | ||||||||||||||||||||||
83 | 1978 | Lamport | Time, clocks, and the ordering of events in a distributed system | ||||||||||||||||||||||
84 | 1978 | Hoare | Communicating sequential processes | ||||||||||||||||||||||
85 | 1978 | Rivest, Shamir, Adleman | A method for obtaining digital signatures and public-key cryptosystems | ||||||||||||||||||||||
86 | 1978 | Russell | The Cray-1 computer system | ||||||||||||||||||||||
87 | 1979 | Carter and Wegman | Universal classes of hash functions | ||||||||||||||||||||||
88 | 1979 | Demillo, Lipton, Perlis | Social processes and proofs of theorems and programs | ||||||||||||||||||||||
89 | 1980 | Searle | Minds, Brains, and Programs | ||||||||||||||||||||||
90 | 1980 | Witted | An improved illumination model for shaded display | ||||||||||||||||||||||
91 | 1981 | Block | Psychologism and Behaviorism | ||||||||||||||||||||||
92 | 1981 | Saltzer, Reed, Clark | End to end arguments in system design | ||||||||||||||||||||||
93 | 1982 | Damas and Milner | Principal type-schemes for functional languages | ||||||||||||||||||||||
94 | 1982 | Knuth | Literate programming | ||||||||||||||||||||||
95 | 1982 | Naur | Formalization in program development | ||||||||||||||||||||||
96 | 1983 | Goodman | Using cache memory to reduce processor-memory traffic | ||||||||||||||||||||||
97 | 1983 | Lampson | Hints for computer system design | ||||||||||||||||||||||
98 | 1984 | Goldwasser and Micali | Probabilistic encryption | ||||||||||||||||||||||
99 | 1984 | Valiant | A theory of the learnable | ||||||||||||||||||||||
100 | 1985 | Goldwasser, Micali, Rackoff | The knowledge complexity of interactive proof systems |