ABCDEFGHIJKLMNOPQRSTUVWXY
1
YearAuthor(s)Paper Title
Notes
2
1842Menabrea and LovelaceA sketch of the analytical engine invented by Charles Babbage
3
1887Peirce, C. S. Logical Machines, Am J. Psych. 1, p. 165
4
1922Scheyer, Emmanuel When perforated paper goes to work, Sci. Am., 127, p. 395
5
1936Turing
On computable numbers, with an application to the Entscheidungsproblem
6
1938AikenProposed automatic calculating machine
7
1938ShannonA symbolic analysis of relays and switching circuits
8
1943McCulloch and PittsA logical calculus of the ideas immanent in nervous activity
9
1945BushAs we may think
10
1945von NeumannFirst draft of a report on the EDVAC
11
1946Burks, Goldstine, von Neumann
Preliminary discussion of the logical design of an electronic computing instrument
12
1948ShannonA mathematical theory of communication
13
1948von NeumannThe general and logical theory of automata
14
1949McCullochThe brain as a computing machine
15
1950HammingError detecting and error correcting codes
16
1950ShannonProgramming a computer for playing chess
17
1950TuringComputing Machinery and Intelligence
18
1952HopperThe education of a computer
19
1953ShannonComputers and automata
20
1955
McCarthy, Minsky, Rochester, Shannon
A proposal for the Dartmouth summer institute on artifical intelligence
21
1956BardeenSemiconductor research leading to the point contact transistor
22
1956Newell and SimonThe logic theory machine
23
1957Backus et al.The FORTRAN automatic coding system
24
1958Rosenblatt
The perceptron: A probabilistic model for information storage and organization in the brain
25
1959Rabin and ScottFinite automata and their decision problems
26
1960LickliderMan-Computer Symbiosis
27
1960Baran
Reliable digital communications systems utilizing unreliable network repeater nodes
28
1960McCarthy
Recursive functions of symbolic expressions and their computation by machine, Part I
29
1962Corbato, Daggett, DaleyAn experimental time-sharing system
30
1962EngelbartAugmenting human intellect
31
1962HoareQuicksort
32
1962Kilburn et al.One-level storage system
33
1962WarshallA theorem on boolean matrices
34
1963Hartmanis and StearnsOn the computational complexity of algorithms
35
1963SutherlandSketchpad, a man-machine communication system
36
1964Amdahl et al.Architecture of the IBM System/360
37
1964BaranOn distributed communications
38
1964KilbyMiniaturized electronic circuits
39
1965EdmondsPaths, trees, and flowers
40
1965Cooley and TukeyAn 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
1965KnuthOn the translation of languages from left to right
42
1965MooreCramming more components onto integrated circuits
43
1965SutherlandThe ultimate display
44
1965WilkesSlave memories and dynamic storage allocation
45
1966Weizenbaum
ELIZA -- A computer program for the study of natural langauage communication between man and machine
46
1967Blum
A machine-independent theory of the complexity of recursive functions
47
1967DijkstraThe structure of the "THE" multiprogramming system
48
1967Floyd, R.Assigning meanings to programs
49
1967TomasuoloAn efficient algorithm for exploiting multiple arithmetic units
50
1968Daley and DennisVirtual memory, processes, and sharing in MULTICS
51
1968Denning, P.The working set model for program behavior
52
1968DijkstraGo To Statement considered harmful
53
1968EnglebartFJCC "The mother of all demos"
54
1968Myer & SutherlandOn the design of display processors
55
1969HoareAn axiomatic basis for computer programming
56
1969StrassenGaussian Elimination is not Optimal
57
1970CoddA reltional model for large shared data banks
58
1970EarleyAn efficient context-free parsing algorithm
59
1970EngelbartIntellectual implications of multi-access computer networks
60
1970Licklider and TaylorThe computer as a communication device
61
1970McCarthyThe home information terminal
62
1970ScottOutline of a mathematical theory of computation
63
1971CookThe complexity of theorem-proving procedures
64
1971Scott and StracheyToward a mathematical semantics of programming languages
65
1972CoddRelational completeness of data base sublanguages
66
1972KarpReducibility among combinatorial problems
67
1972Spärck Jones
A statistical interpretation of term specificity and its application in retrieval
68
1973Blum, Floyd, Pratt, Rivest, TarjanTime bounds for selection
69
1973LevinUniversal search problems
70
1974CatmullA subdivision algorithm for display of curved surfaces
71
1974Cerf and KahnA protocol for packet network intercommunication
72
1974Liskov and ZillesProgramming with abstract data types
73
1974Ritchie and ThompsonThe UNIX time-sharing system
74
1975Gray, Lorie, PutzoluGranularity of locks in a shared data base
75
1975Salton, Wong, YangA vector space model for automatic indexing
76
1976Allen and CockeA program data flow analysis procedure
77
1976Denning, D.A lattice model of secure information flow
78
1976Metcalfe and BoggsEthernet: Distributed Packet switching for local computer networks
79
1977Kay and GoldbergPersonal dynamic media
80
1977Liskov et al.Abstraction mechanisms in CLU
81
1977MilnerA theory of type polymorphism in programming
82
1977Newell and BlinnThe progression of realism in computer generated images
83
1978LamportTime, clocks, and the ordering of events in a distributed system
84
1978HoareCommunicating sequential processes
85
1978Rivest, Shamir, Adleman
A method for obtaining digital signatures and public-key cryptosystems
86
1978RussellThe Cray-1 computer system
87
1979Carter and WegmanUniversal classes of hash functions
88
1979Demillo, Lipton, PerlisSocial processes and proofs of theorems and programs
89
1980SearleMinds, Brains, and Programs
90
1980WittedAn improved illumination model for shaded display
91
1981BlockPsychologism and Behaviorism
92
1981Saltzer, Reed, ClarkEnd to end arguments in system design
93
1982Damas and MilnerPrincipal type-schemes for functional languages
94
1982KnuthLiterate programming
95
1982NaurFormalization in program development
96
1983GoodmanUsing cache memory to reduce processor-memory traffic
97
1983LampsonHints for computer system design
98
1984Goldwasser and MicaliProbabilistic encryption
99
1984ValiantA theory of the learnable
100
1985Goldwasser, Micali, RackoffThe knowledge complexity of interactive proof systems