This is a list of important publications in

computer science Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to Applied science, practical discipli ...

, organized by field. Some reasons why a particular publication might be regarded as important: *Topic creator – A publication that created a new topic *Breakthrough – A publication that changed scientific knowledge significantly *Influence – A publication which has significantly influenced the world or has had a massive impact on the teaching of computer science.

Artificial intelligence

''Computing Machinery and Intelligence''

Alan Turing Alan Mathison Turing (; 23 June 1912 – 7 June 1954) was an English mathematician, computer scientist, logician, cryptanalyst, philosopher, and theoretical biologist. Turing was highly influential in the development of theoretical com ...

* Mind, 59:433–460, 1950.
Online copy
Description: This paper discusses the various arguments on why a machine can not be intelligent and asserts that none of those arguments are convincing. The paper also suggested the

Turing test The Turing test, originally called the imitation game by Alan Turing in 1950, is a test of a machine's ability to artificial intelligence, exhibit intelligent behaviour equivalent to, or indistinguishable from, that of a human. Turing propos ...

, which it calls "The Imitation Game" as according to Turing it is pointless to ask whether or not a machine can ''think'' intelligently, and checking if it can ''act'' intelligently is sufficient.

''A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence''

* John McCarthy *

Marvin Minsky Marvin Lee Minsky (August 9, 1927 – January 24, 2016) was an American cognitive and computer scientist concerned largely with research of artificial intelligence (AI), co-founder of the Massachusetts Institute of Technology's AI laboratory, an ...

* N. Rochester *

C.E. Shannon Claude Elwood Shannon (April 30, 1916 – February 24, 2001) was an American mathematician, electrical engineer, and cryptographer known as a "father of information theory". As a 21-year-old master's degree student at the Massachusetts Insti ...

Online copy
Description: This summer research proposal inaugurated and defined the field. It contains the first use of the term

artificial intelligence Artificial intelligence (AI) is intelligence—perceiving, synthesizing, and inferring information—demonstrated by machines, as opposed to intelligence displayed by animals and humans. Example tasks in which this is done include speech re ...

and this succinct description of the philosophical foundation of the field: "every aspect of learning or any other feature of intelligence can in principle be so precisely described that a machine can be made to simulate it." (See

philosophy of AI The philosophy of artificial intelligence is a branch of the philosophy of technology that explores artificial intelligence and its implications for knowledge and understanding of intelligence, ethics, consciousness, epistemology, and free will ...

) The proposal invited researchers to the

Dartmouth conference The Dartmouth Conference is the longest continuous bilateral dialogue between American and Soviet (now Russian) representatives. The first Dartmouth Conference took place at Dartmouth College in 1961. Subsequent conferences were held through 1990 ...

, which is widely considered the "birth of AI". (See history of AI.)

''Fuzzy sets''

Lotfi Zadeh Lotfi Aliasker Zadeh (; az, Lütfi Rəhim oğlu Ələsgərzadə; fa, لطفی علی‌عسکرزاده; 4 February 1921 – 6 September 2017) was a mathematician, computer scientist, electrical engineer, artificial intelligence researcher, an ...

* Information and Control, Vol. 8, pp. 338–353. (1965). Description: The seminal paper published in 1965 provides details on the mathematics of

fuzzy set In mathematics, fuzzy sets (a.k.a. uncertain sets) are sets whose elements have degrees of membership. Fuzzy sets were introduced independently by Lotfi A. Zadeh in 1965 as an extension of the classical notion of set. At the same time, defined ...

theory.

''Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference''

Judea Pearl Judea Pearl (born September 4, 1936) is an Israeli-American computer scientist and philosopher, best known for championing the probabilistic approach to artificial intelligence and the development of Bayesian networks (see the article on beli ...

* Publisher: Morgan Kaufmann Pub, 1988 Description: This book introduced

Bayesian method Bayesian inference is a method of statistical inference in which Bayes' theorem is used to update the probability for a hypothesis as more evidence or information becomes available. Bayesian inference is an important technique in statistics, and e ...

s to AI.

''Artificial Intelligence: A Modern Approach''

Stuart J. Russell Stuart Jonathan Russell (born 1962) is a British computer scientist known for his contributions to artificial intelligence (AI). He is a professor of computer science at the University of California, Berkeley and was from 2008 to 2011 an adjunct ...

and

Peter Norvig Peter Norvig (born December 14, 1956) is an American computer scientist and Distinguished Education Fellow at the Stanford Institute for Human-Centered AI. He previously served as a director of research and search quality at Google. Norvig is t ...

* Prentice Hall, Englewood Cliffs, New Jersey, 1995,
Textbook's website
Description: The standard textbook in Artificial Intelligence
The book web site
lists over 1100 colleges.

Machine learning

''An Inductive Inference Machine''

Ray Solomonoff Ray Solomonoff (July 25, 1926 – December 7, 2009) was the inventor of algorithmic probability, his General Theory of Inductive Inference (also known as Universal Inductive Inference),Samuel Rathmanner and Marcus Hutter. A philosophical treatise ...

* ''IRE Convention Record'', Section on Information Theory, Part 2, pp. 56–62, 1957 * (A longer version of this, a privately circulated report, 1956, i
online
. Description: The first paper written on

machine learning Machine learning (ML) is a field of inquiry devoted to understanding and building methods that 'learn', that is, methods that leverage data to improve performance on some set of tasks. It is seen as a part of artificial intelligence. Machine ...

. Emphasized the importance of training sequences, and the use of parts of previous solutions to problems in constructing trial solutions to new problems.

''Language identification in the limit''

* E. Mark Gold * '' Information and Control'', 10(5):447–474, 1967 * Online version
(HTML)(PDF)
Description: This paper created

Algorithmic learning theory Algorithmic learning theory is a mathematical framework for analyzing machine learning problems and algorithms. Synonyms include formal learning theory and algorithmic inductive inference. Algorithmic learning theory is different from statistica ...

''On the uniform convergence of relative frequencies of events to their probabilities''

* V. Vapnik, A. Chervonenkis *''Theory of Probability and Its Applications'', 16(2):264—280, 1971 Description:

Computational learning theory In computer science, computational learning theory (or just learning theory) is a subfield of artificial intelligence devoted to studying the design and analysis of machine learning algorithms. Overview Theoretical results in machine learning m ...

VC theory VC may refer to: Military decorations * Victoria Cross, a military decoration awarded by the United Kingdom and also by certain Commonwealth nations ** Victoria Cross for Australia ** Victoria Cross (Canada) ** Victoria Cross for New Zealand * Vic ...

, statistical uniform convergence and the

VC dimension VC may refer to: Military decorations * Victoria Cross, a military decoration awarded by the United Kingdom and also by certain Commonwealth nations ** Victoria Cross for Australia ** Victoria Cross (Canada) ** Victoria Cross for New Zealand * Vic ...

. While the bounds in this paper are not the best possible, it would take 50 years before the best bound was obtained by Michael Naaman in 2021.

A theory of the learnable
'

Leslie Valiant Leslie Gabriel Valiant (born 28 March 1949) is a British American computer scientist and computational theorist. He was born to a chemical engineer father and a translator mother. He is currently the T. Jefferson Coolidge Professor of Compu ...

* ''

Communications of the ACM ''Communications of the ACM'' is the monthly journal of the Association for Computing Machinery (ACM). It was established in 1958, with Saul Rosen as its first managing editor. It is sent to all ACM members. Articles are intended for readers with ...

'', 27(11):1134–1142 (1984) Description: The

Probably approximately correct learning In computational learning theory, probably approximately correct (PAC) learning is a framework for mathematical analysis of machine learning. It was proposed in 1984 by Leslie Valiant.L. Valiant. A theory of the learnable.' Communications of the ...

(PAC learning) framework.

''Learning representations by back-propagating errors''

* David E. Rumelhart, Geoffrey E. Hinton and

Ronald J. Williams Ronald J. Williams is professor of computer science at Northeastern University, and one of the pioneers of neural networks. He co-authored a paper on the backpropagation algorithm which triggered a boom in neural network research. He also made fund ...

* Nature, 323, 533–536, 1986

Seppo Linnainmaa Seppo Ilmari Linnainmaa (born 28 September 1945) is a Finnish mathematician and computer scientist. He was born in Pori. In 1974 he obtained the first doctorate ever awarded in computer science at the University of Helsinki. In 1976, he became Assi ...

's reverse mode of

automatic differentiation In mathematics and computer algebra, automatic differentiation (AD), also called algorithmic differentiation, computational differentiation, auto-differentiation, or simply autodiff, is a set of techniques to evaluate the derivative of a function s ...

Linnainmaa, Seppo (1970). The representation of the cumulative rounding error of an algorithm as a Taylor expansion of the local rounding errors. Master's Thesis, Univ. Helsinki, 6-7.Griewank, Andreas (2012). Who Invented the Reverse Mode of Differentiation? Optimization Stories, Documenta Matematica, Extra Volume ISMP (2012), 389-400. (first applied to neural networks by

Paul Werbos Paul John Werbos (born 1947) is an American social scientist and machine learning pioneer. He is best known for his 1974 dissertation, which first described the process of training artificial neural networks through backpropagation of errors. He ...

) is used in experiments by

David Rumelhart David Everett Rumelhart (June 12, 1942 – March 13, 2011) was an American psychologist who made many contributions to the formal analysis of human cognition, working primarily within the frameworks of mathematical psychology, symbolic artif ...

, Geoff Hinton and

to learn internal representations.

''Induction of Decision Trees''

* J.R. Quinlan * Machine Learning, 1. 81—106, 1986. Description:

Decision Tree A decision tree is a decision support tool that uses a tree-like model of decisions and their possible consequences, including chance event outcomes, resource costs, and utility. It is one way to display an algorithm that only contains condit ...

s are a common learning algorithm and a decision representation tool. Development of decision trees was done by many researchers in many areas, even before this paper. Though this paper is one of the most influential in the field.

''Learning Quickly When Irrelevant Attributes Abound: A New Linear-threshold Algorithm''

Nick Littlestone Nick may refer to: * Nick (given name) * A cricket term for a slight deviation of the ball off the edge of the bat * British slang for being arrested * British slang for a police station * British slang for stealing * Short for nickname Pla ...

* Machine Learning 2: 285–318, 1988
Online version(PDF)
Description: One of the papers that started the field of on-line learning. In this learning setting, a learner receives a sequence of examples, making predictions after each one, and receiving feedback after each prediction. Research in this area is remarkable because (1) the algorithms and proofs tend to be very simple and beautiful, and (2) the model makes no statistical assumptions about the data. In other words, the data need not be random (as in nearly all other learning models), but can be chosen arbitrarily by "nature" or even an adversary. Specifically, this paper introduced the

winnow algorithm The winnow algorithm Nick Littlestone (1988). "Learning Quickly When Irrelevant Attributes Abound: A New Linear-threshold Algorithm" ''Machine Learning'' 285–318(2) is a technique from machine learning for learning a linear classifier from labeled ...

''Learning to predict by the method of Temporal difference''

* Richard S. Sutton * Machine Learning 3(1): 9–44
Online copy(PDF)
Description: The

Temporal difference Temporal difference (TD) learning refers to a class of model-free reinforcement learning methods which learn by bootstrapping from the current estimate of the value function. These methods sample from the environment, like Monte Carlo methods, a ...

method for

reinforcement learning Reinforcement learning (RL) is an area of machine learning concerned with how intelligent agents ought to take actions in an environment in order to maximize the notion of cumulative reward. Reinforcement learning is one of three basic machine ...

''Learnability and the Vapnik–Chervonenkis dimension''

* A. Blumer * A. Ehrenfeucht * D. Haussler * M. K. Warmuth *

Journal of the ACM The ''Journal of the ACM'' is a peer-reviewed scientific journal covering computer science in general, especially theoretical aspects. It is an official journal of the Association for Computing Machinery. Its current editor-in-chief is Venkatesan ...

, 36(4):929–965, 1989. Description: The complete characterization of PAC learnability using the

''Cryptographic limitations on learning boolean formulae and finite automata ''

* M. Kearns * L. G. Valiant * In Proceedings of the 21st Annual ACM

Symposium on Theory of Computing The Annual ACM Symposium on Theory of Computing (STOC) is an academic conference in the field of theoretical computer science. STOC has been organized annually since 1969, typically in May or June; the conference is sponsored by the Association for ...

, pages 433–444, New York. ACM. Description: Proving negative results for

PAC learning In computational learning theory, probably approximately correct (PAC) learning is a framework for mathematical analysis of machine learning. It was proposed in 1984 by Leslie Valiant.L. Valiant. A theory of the learnable.' Communications of the A ...

''The strength of weak learnability''

* Robert E. Schapire * Machine Learning, 5(2):197–227, 1990.
Online version(PDF)
Description: Proving that weak and strong learnability are equivalent in the noise free PAC framework. The proof was done by introducing the boosting method.

''A training algorithm for optimum margin classifiers''

* Bernhard E. Boser * Isabelle M. Guyon *

Vladimir N. Vapnik Vladimir Naumovich Vapnik (russian: Владимир Наумович Вапник; born 6 December 1936) is one of the main developers of the Vapnik–Chervonenkis theory of statistical learning, and the co-inventor of the support-vector machin ...

* Proceedings of the Fifth Annual Workshop on Computational Learning Theory 5 144–152, Pittsburgh (1992).
Online version(HTML)
Description: This paper presented support vector machines, a practical and popular machine learning algorithm. Support vector machines often use the

kernel trick In machine learning, kernel machines are a class of algorithms for pattern analysis, whose best known member is the support-vector machine (SVM). The general task of pattern analysis is to find and study general types of relations (for example ...

''A fast learning algorithm for deep belief nets''

* Geoffrey E. Hinton * Simon Osindero * Yee-Whye Teh * Neural Computation (2006)
Online PDF
Description: This paper presented a tractable greedy layer-wise learning algorithm for

deep belief network In machine learning, a deep belief network (DBN) is a generative graphical model, or alternatively a class of deep neural network, composed of multiple layers of latent variables ("hidden units"), with connections between the layers but not bet ...

s which led to great advancement in the field of

deep learning Deep learning (also known as deep structured learning) is part of a broader family of machine learning methods based on artificial neural networks with representation learning. Learning can be supervised, semi-supervised or unsupervised. De ...

''Knowledge-based analysis of microarray gene expression data by using support vector machines''

* MP Brown * WN Grundy * D Lin *

Nello Cristianini Nello Cristianini (born 1968) is a Professor of Artificial Intelligence in the Department of Computer Science at the University of Bristol. Education Cristianini holds a degree in physics from the University of Trieste, a Master in computation ...

* CW Sugnet * TS Furey * M Ares Jr, *

David Haussler David Haussler (born 1953) is an American bioinformatician known for his work leading the team that assembled the first human genome sequence in the race to complete the Human Genome Project and subsequently for comparative genome analysis that d ...

PNAS ''Proceedings of the National Academy of Sciences of the United States of America'' (often abbreviated ''PNAS'' or ''PNAS USA'') is a peer-reviewed multidisciplinary scientific journal. It is the official journal of the National Academy of Scien ...

2000 January 4;97(1):262–7
Description: The first application of supervised learning to

gene expression Gene expression is the process by which information from a gene is used in the synthesis of a functional gene product that enables it to produce end products, protein or non-coding RNA, and ultimately affect a phenotype, as the final effect. The ...

data, in particular Support Vector Machines. The method is now standard, and the paper one of the most cited in the area.

Compilers

''On the translation of languages from left to right''

* Description:

LR parser In computer science, LR parsers are a type of bottom-up parser that analyse deterministic context-free languages in linear time. There are several variants of LR parsers: SLR parsers, LALR parsers, Canonical LR(1) parsers, Minimal LR(1) parse ...

, which does bottom up parsing for

deterministic context-free languages In formal language theory, deterministic context-free languages (DCFL) are a proper subset of context-free languages. They are the context-free languages that can be accepted by a deterministic pushdown automaton. DCFLs are always unambiguous, mea ...

. Later derived parsers, such as the

LALR parser In computer science, an LALR parser or Look-Ahead LR parser is a simplified version of a canonical LR parser, to parse a text according to a set of production rules specified by a formal grammar for a computer language. ("LR" means left-to-rig ...

, have been and continue to be standard practice, such as in

Yacc Yacc (Yet Another Compiler-Compiler) is a computer program for the Unix operating system developed by Stephen C. Johnson. It is a Look Ahead Left-to-Right Rightmost Derivation (LALR) parser generator, generating a LALR parser (the part of a com ...

and descendants.

''Semantics of Context-Free Languages.''

Donald Knuth Donald Ervin Knuth ( ; born January 10, 1938) is an American computer scientist, mathematician, and professor emeritus at Stanford University. He is the 1974 recipient of the ACM Turing Award, informally considered the Nobel Prize of computer sc ...

* ''Math. Systems Theory'' 2:2 (1968), 127–145. Description: About grammar attribution, the base for yacc's s-attributed and zyacc's LR-attributed approach.

''Compiler Construction for Digital Computers''

* Description: The first textbook on compilers.

Dick Grune Dick Grune is a Dutch computer scientist and university lecturer best known for inventing and developing the first version of the Concurrent Versions System (CVS). Grune was involved in the construction of Algol 68 compilers in the 1970s and the A ...

says that entire generations of compiler constructors grew up with it and have not regretted it. One of the first texts to be produced using

punched cards A punched card (also punch card or punched-card) is a piece of stiff paper that holds digital data represented by the presence or absence of holes in predefined positions. Punched cards were once common in data processing applications or to d ...

input to a formatting program. The cards and formatting program are preserved at the Stanford Computer History Exhibits. See David Gries#Textbooks for links.

''A Unified Approach to Global Program Optimization''

Gary Kildall Gary Arlen Kildall (; May 19, 1942 – July 11, 1994) was an American computer scientist and microcomputer entrepreneur. During the 1970s, Kildall created the CP/M operating system among other operating systems and programming tools, an ...

* Proceedings of ACM SIGACT-SIGPLAN 1973

Symposium on Principles of Programming Languages The annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) is an academic conference in the field of computer science, with focus on fundamental principles in the design, definition, analysis, and implementation of progr ...

.
pdf
Description: Formalized the concept of

data-flow analysis In computing, dataflow is a broad concept, which has various meanings depending on the application and context. In the context of software architecture, data flow relates to stream processing or reactive programming. Software architecture Dataf ...

fixpoint A fixed point (sometimes shortened to fixpoint, also known as an invariant point) is a value that does not change under a given transformation. Specifically, in mathematics, a fixed point of a function is an element that is mapped to itself by th ...

computation over

lattice Lattice may refer to: Arts and design * Latticework, an ornamental criss-crossed framework, an arrangement of crossing laths or other thin strips of material * Lattice (music), an organized grid model of pitch ratios * Lattice (pastry), an orna ...

s, and showed that most static analyses used for program optimization can be uniformly expressed within this framework.

''A program data flow analysis procedure''

Frances E. Allen Frances Elizabeth Allen (August 4, 1932August 4, 2020) was an American computer scientist and pioneer in the field of optimizing compilers. Allen was the first woman to become an IBM Fellow, and in 2006 became the first woman to win the Turing ...

, J. Cocke * Commun. ACM, 19, 137–147, 1976 Description: From the abstract: "The global data relationships in a program can be exposed and codified by the static analysis methods described in this paper. A procedure is given which determines all the definitions which can possibly reach each node of the control flow graph of the program and all the definitions that are live on each edge of the graph."

''YACC: Yet another compiler-compiler''

* Stephen C. Johnson * ''Unix Programmer's Manual'' Vol 2b, 1979
Online copy (HTML)
Description:

is a tool that made

compiler In computing, a compiler is a computer program that translates computer code written in one programming language (the ''source'' language) into another language (the ''target'' language). The name "compiler" is primarily used for programs that ...

writing much easier.

''gprof: A Call Graph Execution Profiler''

* Susan L. Graham,

Peter B. Kessler Peter may refer to: People * List of people named Peter, a list of people and fictional characters with the given name * Peter (given name) ** Saint Peter (died 60s), apostle of Jesus, leader of the early Christian Church * Peter (surname), a su ...

Marshall Kirk McKusick Marshall Kirk McKusick (born January 19, 1954) is a computer scientist, known for his extensive work on BSD UNIX, from the 1980s to FreeBSD in the present day. He was president of the USENIX Association from 1990 to 1992 and again from 2002 ...

* Proceedings of the ACM SIGPLAN 1982 Symposium on Compiler Construction, SIGPLAN Notices 17, 6, Boston, MA. June 1982.
Online copypdf
Description: The

gprof Gprof is a performance analysis tool for Unix applications. It used a hybrid of instrumentation and samplingSusan L. Graham, Peter B. Kessler, and Marshall K. Mckusick''gprof: a Call Graph Execution Profiler''// Proceedings of the SIGPLAN '82 Sy ...

profiler

''Compilers: Principles, Techniques and Tools ''

* Alfred V. Aho *

Ravi Sethi Ravi Sethi (born 1947) is an Indian computer scientist retired from executive roles at Bell Labs and Avaya Labs. He also serves as a member of the National Science Foundation's Computer and Information Science and Engineering (CISE) Advisory Co ...

Jeffrey D. Ullman Jeffrey David Ullman (born November 22, 1942) is an American computer scientist and the Stanford W. Ascherman Professor of Engineering, Emeritus, at Stanford University. His textbooks on compilers (various editions are popularly known as the ...

Monica Lam Monica Sin-Ling Lam is an American computer scientist. She is a professor in the Computer Science Department at Stanford University. Professional biography Monica Lam received a B.Sc. from University of British Columbia in 1980 and a Ph.D. in ...

Addison-Wesley Addison-Wesley is an American publisher of textbooks and computer literature. It is an imprint of Pearson PLC, a global publishing and education company. In addition to publishing books, Addison-Wesley also distributes its technical titles through ...

, 1986. Description: This book became a classic in compiler writing. It is also known as the Dragon book, after the (red) dragon that appears on its cover.

Computer architecture

''Colossus computer''

* T. H. Flowers * ''Annals of the History of Computing'', Vol. 5 (No. 3), 1983, pp. 239–252.
The Design of Colossus
Description: The ''Colossus'' machines were early computing devices used by British

codebreakers Cryptanalysis (from the Greek language, Greek ''kryptós'', "hidden", and ''analýein'', "to analyze") refers to the process of analyzing information systems in order to understand hidden aspects of the systems. Cryptanalysis is used to breach C ...

to break German messages encrypted with the

Lorenz Cipher The Lorenz SZ40, SZ42a and SZ42b were German rotor stream cipher machines used by the German Army during World War II. They were developed by C. Lorenz AG in Berlin. The model name ''SZ'' was derived from ''Schlüssel-Zusatz'', meaning ''cipher ...

during

World War II World War II or the Second World War, often abbreviated as WWII or WW2, was a world war that lasted from 1939 to 1945. It involved the vast majority of the world's countries—including all of the great powers—forming two opposin ...

. Colossus was an early

binary Binary may refer to: Science and technology Mathematics * Binary number, a representation of numbers using only two digits (0 and 1) * Binary function, a function that takes two arguments * Binary operation, a mathematical operation that ta ...

electronic digital

computer A computer is a machine that can be programmed to Execution (computing), carry out sequences of arithmetic or logical operations (computation) automatically. Modern digital electronic computers can perform generic sets of operations known as C ...

. The design of Colossus was later described in the referenced paper.

''First Draft of a Report on the EDVAC''

John von Neumann John von Neumann (; hu, Neumann János Lajos, ; December 28, 1903 – February 8, 1957) was a Hungarian-American mathematician, physicist, computer scientist, engineer and polymath. He was regarded as having perhaps the widest cove ...

* June 30, 1945, the

ENIAC ENIAC (; Electronic Numerical Integrator and Computer) was the first programmable, electronic, general-purpose digital computer, completed in 1945. There were other computers that had these features, but the ENIAC had all of them in one packa ...

project.
First Draft of a report on the EDVAC
(PDF) Description: It contains the first published description of the logical design of a computer using the stored-program concept, which has come to be known as the

von Neumann architecture The von Neumann architecture — also known as the von Neumann model or Princeton architecture — is a computer architecture based on a 1945 description by John von Neumann, and by others, in the '' First Draft of a Report on the EDVAC''. T ...

. See ''

First Draft of a Report on the EDVAC The ''First Draft of a Report on the EDVAC'' (commonly shortened to ''First Draft'') is an incomplete 101-page document written by John von Neumann and distributed on June 30, 1945 by Herman Goldstine, security officer on the classified ENIAC pro ...

.''

''Architecture of the IBM System/360''

Gene Amdahl Gene Myron Amdahl (November 16, 1922 – November 10, 2015) was an American computer architect and high-tech entrepreneur, chiefly known for his work on mainframe computers at IBM and later his own companies, especially Amdahl Corporation ...

Fred Brooks Frederick Phillips Brooks Jr. (April 19, 1931 – November 17, 2022) was an American computer architect, software engineer, and computer scientist, best known for managing the development of IBM's System/360 family of computers and the O ...

, G. A. Blaauw * IBM Journal of Research and Development, 1964. *
Architecture of the IBM System/360
' Description: The

IBM System/360 The IBM System/360 (S/360) is a family of mainframe computer systems that was announced by IBM on April 7, 1964, and delivered between 1965 and 1978. It was the first family of computers designed to cover both commercial and scientific applica ...

(S/360) is a

mainframe computer A mainframe computer, informally called a mainframe or big iron, is a computer used primarily by large organizations for critical applications like bulk data processing for tasks such as censuses, industry and consumer statistics, enterpris ...

system family announced by IBM on April 7, 1964. It was the first family of computers making a clear distinction between

architecture Architecture is the art and technique of designing and building, as distinguished from the skills associated with construction. It is both the process and the product of sketching, conceiving, planning, designing, and constructing building ...

and implementation.

''The case for the reduced instruction set computer''

* DA Patterson, DR Ditzel * Computer ArchitectureNews, vol. 8, no. 6, October 1980, pp 25–33.
Online version(PDF)
Description: The ''reduced instruction set computer''(''

RISC In computer engineering, a reduced instruction set computer (RISC) is a computer designed to simplify the individual instructions given to the computer to accomplish tasks. Compared to the instructions given to a complex instruction set comput ...

'')

CPU design Processor design is a subfield of computer engineering and electronics engineering (fabrication) that deals with creating a processor, a key component of computer hardware. The design process involves choosing an instruction set and a certain ...

philosophy. The RISC is a

philosophy that favors a reduced set of simpler instructions.

''Comments on "the Case for the Reduced Instruction Set Computer"''

* DW Clark,

WD Strecker WD may refer to: Arts and entertainment * The Walking Dead (TV series), ''The Walking Dead'' (TV series) * White Dwarf (magazine), ''White Dwarf'' (magazine) Businesses and organizations Government agencies * Royal Canadian Air Force Wome ...

* Computer Architecture News, 1980.
Online version(PDF)
Description:

''The CRAY-1 Computer System''

* RM Russell * Communications of the ACM, January 1978, volume 21, number 1, pages 63–72.
Online version(PDF)
Description: The Cray-1 was a

supercomputer A supercomputer is a computer with a high level of performance as compared to a general-purpose computer. The performance of a supercomputer is commonly measured in floating-point operations per second ( FLOPS) instead of million instructions ...

Seymour Cray Seymour Roger Cray (September 28, 1925 – October 5, 1996
) was an American

Cray Research Cray Inc., a subsidiary of Hewlett Packard Enterprise, is an American supercomputer manufacturer headquartered in Seattle, Washington. It also manufactures systems for data storage and analytics. Several Cray supercomputer systems are listed i ...

. The first Cray-1 system was installed at

Los Alamos National Laboratory Los Alamos National Laboratory (often shortened as Los Alamos and LANL) is one of the sixteen research and development laboratories of the United States Department of Energy (DOE), located a short distance northwest of Santa Fe, New Mexico, ...

in 1976, and it went on to become one of the best known and most successful supercomputers in history.

''Validity of the Single Processor Approach to Achieving Large Scale Computing Capabilities''

* AFIPS 1967 Spring Joint Computer Conference, Atlantic City, N.J.
Online version(PDF)
Description: The

Amdahl's Law In computer architecture, Amdahl's law (or Amdahl's argument) is a formula which gives the theoretical speedup in latency of the execution of a task at fixed workload that can be expected of a system whose resources are improved. It states tha ...

''A Case for Redundant Arrays of Inexpensive Disks (RAID)''

* David A. Patterson,

Garth Gibson __NOTOC__ Garth Alan Gibson is a computer scientist from Carnegie Mellon University. Gibson's developed the RAID taxonomy of redundant data storage systems, along with David A. Patterson and Randy Katz. Born in Aurora, Ontario, he holds a Ph. ...

, Randy H. Katz * In International Conference on Management of Data, pages 109–116, 1988.
Online version(PDF)
Description: This paper discusses the concept of

RAID Raid, RAID or Raids may refer to: Attack * Raid (military), a sudden attack behind the enemy's lines without the intention of holding ground * Corporate raid, a type of hostile takeover in business * Panty raid, a prankish raid by male college ...

disks, outlines the different levels of RAID, and the benefits of each level. It is a good paper for discussing issues of reliability and fault tolerance of computer systems, and the cost of providing such fault-tolerance.

''The case for a single-chip multiprocessor''

* Kunle Olukotun,

Basem Nayfeh Basem ( ar, باسم) is an Arabic male given name. Notable people with this name include: * Basem Al-Montashari (born 1990), Saudi Arabian football player * Basem Al-Sherif (born 1984), Saudi football player * Basem Ali (born 1988), Egyptian ...

, Lance Hammond, Ken Wilson, Kunyung Chang * In SIGOPS Oper. Syst. Rev. 30, pages 2–11, 1996. Description: This paper argues that the approach taken to improving the performance of processors by adding multiple instruction issue and out-of-order execution cannot continue to provide speedups indefinitely. It lays out the case for making single chip processors that contain multiple "cores". With the mainstream introduction of multicore processors by

Intel Intel Corporation is an American multinational corporation and technology company headquartered in Santa Clara, California. It is the world's largest semiconductor chip manufacturer by revenue, and is one of the developers of the x86 seri ...

in 2005, and their subsequent domination of the market, this paper was shown to be prescient.

Computer graphics

''The Rendering Equation''

* J. Kajiya * SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques pages 143—150

''Elastically deformable models''

Demetri Terzopoulos Demetri Terzopoulos is an Academy Award winning Greek-Canadian-American computer scientist, university professor, author, and entrepreneur. He is best known for pioneering the physics-based approach to computer graphics and vision that has he ...

, John Platt, Alan Barr, Kurt Fleischer * Computer Graphics, 21(4), 1987, 205–214, Proc. ACM

SIGGRAPH SIGGRAPH (Special Interest Group on Computer Graphics and Interactive Techniques) is an annual conference on computer graphics (CG) organized by the ACM SIGGRAPH, starting in 1974. The main conference is held in North America; SIGGRAPH Asia ...

'87 Conference, Anaheim, CA, July 1987.
Online version(PDF)
Description: The Academy of Motion Picture Arts and Sciences cited this paper as a "milestone in computer graphics".

''Sketchpad, a Man-Machine Graphical Communication System''

Ivan Sutherland Ivan Edward Sutherland (born May 16, 1938) is an American computer scientist and Internet pioneer, widely regarded as a pioneer of computer graphics. His early work in computer graphics as well as his teaching with David C. Evans in that subje ...

Online version(PDF)
Description: One of the founding works on computer graphics.

Computer vision

'' The Phase Correlation Image Alignment Method ''

* C.D. Kuglin and

D.C. Hines DC, D.C., D/C, Dc, or dc may refer to: Places * Washington, D.C. (District of Columbia), the capital and the federal territory of the United States * Bogotá, Distrito Capital, the capital city of Colombia * Dubai City, as distinct from the ...

* IEEE 1975 Conference on Cybernetics and Society, 1975, New York, pp. 163–165, September Description: A correlation method based upon the inverse

Fourier transform A Fourier transform (FT) is a mathematical transform that decomposes functions into frequency components, which are represented by the output of the transform as a function of frequency. Most commonly functions of time or space are transformed, ...

''Determining Optical Flow''

* Berthold K.P. Horn and B.G. Schunck * Artificial Intelligence, Volume 17, 185–203, 1981 * OA article here: Description: A method for estimating the image motion of world points between 2 frames of a video sequence.

''An Iterative Image Registration Technique with an Application to Stereo Vision''

* Lucas, B.D. and Kanade, T. * Proceedings of the 7th

International Joint Conference on Artificial Intelligence The International Joint Conference on Artificial Intelligence (IJCAI) is the leading conference in the field of Artificial Intelligence. The conference series has been organized by the nonprofit IJCAI Organization since 1969, making it the oldest p ...

, 674–679, Vancouver, Canada, 1981 Description: This paper provides efficient technique for image registration

''The Laplacian Pyramid as a compact image code''

* Peter J. Burt and Edward H. Adelson *

IEEE Transactions on Communications ''IEEE Transactions on Communications'' is a monthly peer-reviewed scientific journal published by the IEEE Communications Society that focuses on all aspects of telecommunication technology, including telephone, telegraphy, facsimile, and point-to ...

, volume = "COM-31,4", pp. 532–540, 1983. Description: A technique for image encoding using local operators of many scales.

''Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images''

Stuart Geman Stuart Alan Geman (born March 23, 1949) is an American mathematician, known for influential contributions to computer vision, statistics, probability theory, machine learning, and the neurosciences. ikipediaList of important publications in comp ...

and

Donald Geman Donald Jay Geman (born September 20, 1943) is an American applied mathematician and a leading researcher in the field of machine learning and pattern recognition. He and his brother, Stuart Geman, are very well known for proposing the Gibbs sampl ...

* IEEE Transactions on Pattern Analysis and Machine Intelligence, 1984 Description: introduced (1) MRFs for image analysis, (2) the

Gibbs sampling In statistics, Gibbs sampling or a Gibbs sampler is a Markov chain Monte Carlo (MCMC) algorithm for obtaining a sequence of observations which are approximated from a specified multivariate probability distribution, when direct sampling is dif ...

which revolutionized computational

Bayesian statistics Bayesian statistics is a theory in the field of statistics based on the Bayesian interpretation of probability where probability expresses a ''degree of belief'' in an event. The degree of belief may be based on prior knowledge about the event, ...

and thus had paramount impact in many other fields in addition to Computer Vision.

''Snakes: Active contour models''

* Michael Kass,

Andrew Witkin Andrew Paul Witkin (July 22, 1952 – September 12, 2010) was an American computer scientist who made major contributions in computer vision and computer graphics. Education Witkin studied psychology at Columbia College, Columbia University, ...

, and

Description: An interactive variational technique for image segmentation and visual tracking.

''Condensation – conditional density propagation for visual tracking''

* M. Isard and A. Blake *

International Journal of Computer Vision The ''International Journal of Computer Vision'' (IJCV) is a journal published by Springer. The senior editor-in-chief is Jean Ponce, and the editors-in-chief are Jiri Matas, Yasuyuki Matsushita, and Svetlana Lazebnik Svetlana Lazebnik (born 197 ...

, 29(1):5–28, 1998. Description: A technique for visual tracking

''Object recognition from local scale-invariant features ''

* David Lowe *

International Conference on Computer Vision The International Conference on Computer Vision (ICCV) is a research conference sponsored by the Institute of Electrical and Electronics Engineers (IEEE) held every other year. It is considered to be one of the top conferences in computer vision, ...

, pp. 1150–1157, 1999 Description: A technique (

scale-invariant feature transform The scale-invariant feature transform (SIFT) is a computer vision algorithm to detect, describe, and match local ''features'' in images, invented by David Lowe in 1999. Applications include object recognition, robotic mapping and navigation, ima ...

) for robust feature description

Concurrent, parallel, and distributed computing

Topics covered:

concurrent computing Concurrent computing is a form of computing in which several computations are executed '' concurrently''—during overlapping time periods—instead of ''sequentially—''with one completing before the next starts. This is a property of a syst ...

parallel computing Parallel computing is a type of computation in which many calculations or processes are carried out simultaneously. Large problems can often be divided into smaller ones, which can then be solved at the same time. There are several different fo ...

, and

distributed computing A distributed system is a system whose components are located on different computer network, networked computers, which communicate and coordinate their actions by message passing, passing messages to one another from any system. Distributed com ...

Databases

''A relational model for large shared data banks''

E. F. Codd Edgar Frank "Ted" Codd (19 August 1923 – 18 April 2003) was an English computer scientist who, while working for IBM, invented the relational model for database management, the theoretical basis for relational databases and relational da ...

* ''

'', 13(6):377–387, June 1970 Description: This paper introduced the relational model for databases. This model became the number one model.

''Binary B-Trees for Virtual Memory''

Rudolf Bayer Rudolf Bayer (born 3 March 1939) is a German computer scientist. He is professor emeritus of Informatics at the Technical University of Munich where he had been employed since 1972. He is noted for inventing three data sorting structures: the B- ...

* ACM-SIGFIDET Workshop 1971, San Diego, California, Session 5B, p. 219–235. Description: This paper introduced the

B-Tree In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree generalizes the binary search tree, allowing for ...

data structure In computer science, a data structure is a data organization, management, and storage format that is usually chosen for efficient access to data. More precisely, a data structure is a collection of data values, the relationships among them, a ...

. This model became the number one model.

''Relational Completeness of Data Base Sublanguages''

* In: R. Rustin (ed.): Database Systems: 65–98, Prentice Hall and IBM Research Report RJ 987, San Jose, California : (1972)
Online version (PDF)
Description: Completeness of Data Base Sublanguages

''The Entity Relationship Model – Towards a Unified View of Data''

Peter Chen Peter Pin-Shan Chen (; born 3 January 1947) is a Taiwanese American computer scientist. He is a (retired) distinguished career scientist and faculty member at Carnegie Mellon University and Distinguished Chair Professor Emeritus at LSU. He is ...

* ''

ACM Transactions on Database Systems The ''ACM Transactions on Database Systems'' (''ACM TODS'') is one of the journals produced by the Association for Computing Machinery. ''TODS'' publishes one volume yearly. Each volume has four issues, which appear in March, June, September and D ...

''
Vol. 1, No. 1, March 1976, pp. 9–36
Description: This paper introduced the entity-relationship diagram(ERD) method of database design.

''SEQUEL: A structured English query language''

Donald D. Chamberlin Donald D. Chamberlin is an American computer scientist who is one of the principal designers of the original SQL language specification with Raymond Boyce. He also made significant contributions to the development of XQuery. Chamberlin was e ...

, Raymond F. Boyce * International Conference on Management of Data, Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control, Ann Arbor, Michigan, pp. 249–264 Description: This paper introduced the SQL language.

''The notions of consistency and predicate locks in a database system''

* Kapali P. Eswaran, Jim Gray, Raymond A. Lorie, Irving L. Traiger * Communications of the ACM 19, 1976, 624—633 Description: This paper defined the concepts of transaction,

consistency In classical deductive logic, a consistent theory is one that does not lead to a logical contradiction. The lack of contradiction can be defined in either semantic or syntactic terms. The semantic definition states that a theory is consistent ...

and schedule. It also argued that a transaction needs to lock a logical rather than a physical subset of the database.

''Federated database systems for managing distributed, heterogeneous, and autonomous databases''

Amit Sheth Amit Sheth is a computer scientist at University of South Carolina in Columbia, South Carolina. He is the founding Director of the Artificial Intelligence Institute, and a Professor of Computer Science and Engineering. From 2007 to June 2019, h ...

, J.A. Larson," * ''ACM Computing Surveys - Special issue on heterogeneous databases Surveys'', Volume 22 Issue 3, Pages 183 - 236, Sept. 1990
ACM source
Description: Introduced federated database systems concept leading huge impact on data interoperability and integration of hetereogeneous data sources.

''Mining association rules between sets of items in large databases''

* Rakesh Agrawal, Tomasz Imielinski, Arun Swami * ''Proc. of the

ACM SIGMOD Conference on Management of Data SIGMOD is the Association for Computing Machinery's Special Interest Group on Management of Data, which specializes in large-scale data management problems and databases. The annual ACM SIGMOD Conference, which began in 1975, is considered one of ...

'', pages 207–216, Washington, D.C., May 1993 Description:

Association rules Association rule learning is a rule-based machine learning method for discovering interesting relations between variables in large databases. It is intended to identify strong rules discovered in databases using some measures of interestingness.P ...

, a very common method for data mining.

History of computation

''The Computer from Pascal to von Neumann''

* Description: Perhaps the first book on the history of computation.

''A History of Computing in the Twentieth Century''

edited by: *

Nicholas Metropolis Nicholas Constantine Metropolis (Greek: ; June 11, 1915 – October 17, 1999) was a Greek-American physicist. Metropolis received his BSc (1937) and PhD in physics (1941, with Robert Mulliken) at the University of Chicago. Shortly afterwards, ...

* J. Howlett *

Gian-Carlo Rota Gian-Carlo Rota (April 27, 1932 – April 18, 1999) was an Italian-American mathematician and philosopher. He spent most of his career at the Massachusetts Institute of Technology, where he worked in combinatorics, functional analysis, pro ...

Academic Press Academic Press (AP) is an academic book publisher founded in 1941. It was acquired by Harcourt, Brace & World in 1969. Reed Elsevier bought Harcourt in 2000, and Academic Press is now an imprint of Elsevier. Academic Press publishes reference ...

, 1980, Description: Several chapters by pioneers of computing.

Information retrieval

''A Vector Space Model for Automatic Indexing''

Gerard Salton Gerard A. "Gerry" Salton (8 March 1927 in Nuremberg – 28 August 1995) was a Professor of Computer Science at Cornell University. Salton was perhaps the leading computer scientist working in the field of information retrieval during his time, an ...

, A. Wong, C. S. Yang * Commun. ACM 18(11): 613–620 (1975) Description: Presented the

vector space model Vector space model or term vector model is an algebraic model for representing text documents (and any objects, in general) as vectors of identifiers (such as index terms). It is used in information filtering, information retrieval, indexing and ...

''Extended Boolean Information Retrieval''

, Edward A. Fox, Harry Wu * Commun. ACM 26(11): 1022–1036 (1983) Description: Presented the

inverted index In computer science, an inverted index (also referred to as a postings list, postings file, or inverted file) is a database index storing a mapping from content, such as words or numbers, to its locations in a table, or in a document or a set of d ...

''A Statistical Interpretation of Term Specificity and Its Application in Retrieval''

Karen Spärck Jones Karen Sparck Jones is a computer science researcher and innovator who pioneered the search engine algorithm known as inverse document frequency (IDF). While many early information scientists and computer engineers were focused on developing progr ...

* Journal of Documentation 28: 11–21 (1972). . Description: Conceived a statistical interpretation of term specificity called Inverse document frequency (IDF), which became a cornerstone of term weighting.

Networking

A Protocol for Packet Network Intercommunication

Vint Cerf Vinton Gray Cerf (; born June 23, 1943) is an American Internet pioneer and is recognized as one of " the fathers of the Internet", sharing this title with TCP/IP co-developer Bob Kahn. He has received honorary degrees and awards that include ...

, Robert Kahn * IEEE Transactions on Communications, 1974.
Online copy (PDF)
Description: This paper contains a lot of the ideas that later became TCP and IP, two foundational protocols that make up the Internet. Cerf and Kahn received the ACM Turning Award, in part for the work contained in this paper.

The Design Philosophy of the DARPA Internet Protocols

* David Clark * ACM SIGCOMM Computer Communications Review, Vol. 18, No. 4, pp. 106–114, August 1988.
Online copy (PDF)
Description: This paper describes some of the design principles behind the Internet, and how those design principles are realized in the Internet.

End-To-End Arguments in System Design

* Description: This paper presents the "end-to-end argument", a classic design principle widely used to guide the design of many of the Internet's protocols and systems.

Congestion Avoidance and Control

Van Jacobson Van Jacobson (born 1950) is an American computer scientist, renowned for his work on TCP/IP network performance and scaling.

, Michael J. Karels * ACM SIGCOMM, 1988.
Online copy (HTML)
Description: This paper identifies the problem of network congestion, and presents an algorithm for how protocols can reduce their sending rate to reduce congestion. This approach was incorporated into the TCP protocol, and influenced design of many other data transport protocols.

Analysis and Simulation of a Fair Queuing Algorithm

* Alan Demers,

Srinivasan Keshav Srinivasan Keshav is an American-Canadian Computer Scientist of Indian descent who is currently the Robert Sansom Professor of Computer Science at the University of Cambridge. Biography After undergraduate studies at the Indian Institute of Tech ...

Scott Shenker Scott J. Shenker (born January 24, 1956 in Alexandria, Virginia) is an American computer scientist, and professor of computer science at the University of California, Berkeley. He is also the leader of the Extensible Internet Group at the Intern ...

* ACM SIGCOMM CCR, Vol. 19, No. 4, September 1989.
Online copy (PDF)
Description: This paper presents "fair queuing", a buffer allocation algorithm nearly universally deployed on Internet routers.

Scalable High Speed IP Routing Lookups

* M. Waldvogel, G. Varghese, J. Turner, B. Plattner * ACM SIGCOMM, August 1997.
Online copy (PDF)
Description: This paper describes an algorithmic approach to finding the prefix (supernet) containing a particular IP address, a process which is now nearly universally-used on Internet routers.

Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications

* Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan * ACM SIGCOMM, August 2001
Online copy (PDF)
Description: This paper presents the concept of a Distributed Hash Table (DHT), a distributed data structure that had influenced the design of a number of

peer-to-peer Peer-to-peer (P2P) computing or networking is a distributed application architecture that partitions tasks or workloads between peers. Peers are equally privileged, equipotent participants in the network. They are said to form a peer-to-peer n ...

systems, distributed filesystems, and other large-scale distributed systems.
Also see the "Top Ten Networking Papers" lists published i
ACM SIGCOMM CCR
* "10 Networking Papers: Recommended Reading,"

Jon Crowcroft Jonathan Andrew Crowcroft (born 23 November 1957) is the Marconi Professor of Communications Systems in the Department of Computer Science and Technology, University of Cambridge and the chair of the programme committee at the Alan Turing Insti ...

Online copy (PDF)
* "10 Papers for the Ph.D. Student in Networking,"

Craig Partridge Dr. Craig Partridge is an American computer scientist, best known for his contributions to the technical development of the Internet. Partridge graduated in 1979 from Woodrow Wilson High School in Washington D.C. He received his A.B. in history i ...

Online copy (PDF)
* "10 Networking Papers: Recommended Reading," Jim Kurose
Online copy (PDF)
* "10 Networking Papers: Reading for Protocol Design,
David Wetherall
https://dl.acm.org/doi/pdf/10.1145/1140086.1140096 * "10 Networking Papers: A Blast from the Past," Mostafa H. Ammar.

Operating systems

''An experimental timesharing system.''

Fernando J. Corbató Fernando José "Corby" Corbató (July 1, 1926 – July 12, 2019) was a prominent American computer scientist, notable as a pioneer in the development of time-sharing operating systems. Career Corbató was born on July 1, 1926 in Oakland, Califo ...

, M. Merwin-Daggett, and

R.C. Daley R&C, RC, R/C, Rc, or rc may refer to: Science and technology Computing * rc, the default Command line interface in Version 10 Unix and Plan 9 from Bell Labs * .rc (for "run commands"), a filename extension for configuration files in UNIX-like e ...

* Proceedings of the AFIPS FJCC, pages 335–344, 1962.
Online copy (HTML)
Description: This paper discuss

time-sharing In computing, time-sharing is the sharing of a computing resource among many users at the same time by means of multiprogramming and multi-tasking.DEC Timesharing (1965), by Peter Clark, The DEC Professional, Volume 1, Number 1 Its emergence a ...

as a method of sharing computer resource. This idea changed the interaction with computer systems.

''The Working Set Model for Program Behavior''

* Peter J. Denning * Communications of the ACM, Vol. 11, No. 5, May 1968, pp 323–333
Online version(PDF)
Description: The beginning of

cache Cache, caching, or caché may refer to: Places United States * Cache, Idaho, an unincorporated community * Cache, Illinois, an unincorporated community * Cache, Oklahoma, a city in Comanche County * Cache, Utah, Cache County, Utah * Cache County ...

. For more information se
SIGOPS Hall of Fame

''Virtual Memory, Processes, and Sharing in MULTICS''

* Robert C. Daley,

Jack B. Dennis Jack Bonnell Dennis (born October 13, 1931) is a computer scientist and Emeritus Professor of Computer Science and Engineering at Massachusetts Institute of Technology. The work of Dennis in computer systems and computer languages is recogniz ...

* Communications of the ACM, Vol. 11, No. 5, May 1968, pp. 306–312.
Online version(PDF)
Description: The classic paper on

Multics Multics ("Multiplexed Information and Computing Service") is an influential early time-sharing operating system based on the concept of a single-level memory.Dennis M. Ritchie, "The Evolution of the Unix Time-sharing System", Communications of t ...

, the most ambitious operating system in the early history of computing. Difficult reading, but it describes the implications of trying to build a system that takes information sharing to its logical extreme. Most operating systems since Multics have incorporated a subset of its facilities.

The nucleus of a multiprogramming system

Per Brinch Hansen Per Brinch Hansen (13 November 1938 – 31 July 2007) was a Danish-American computer scientist known for his work in operating systems, concurrent programming and parallel and distributed computing. Biography Early life and education Per B ...

* Communications of the ACM, Vol. 13, No. 4, April 1970, pp. 238–242
Online version(PDF)
Description: Classic paper on the extensible nucleus architecture of the

RC 4000 multiprogramming system The RC 4000 Multiprogramming System (also termed Monitor or RC 4000 depending on reference) is a discontinued operating system developed for the RC 4000 minicomputer in 1969. For clarity, this article mostly uses the term Monitor. Over ...

, and what became known as the

operating system kernel The kernel is a computer program at the core of a computer's operating system and generally has complete control over everything in the system. It is the portion of the operating system code that is always resident in memory and facilitates in ...

and

microkernel In computer science, a microkernel (often abbreviated as μ-kernel) is the near-minimum amount of software that can provide the mechanisms needed to implement an operating system (OS). These mechanisms include low-level address space management, ...

architecture.

Operating System Principles

* Per Brinch Hansen * Prentice Hall, Englewood Cliffs, NJ, July 1973
Online version (ACM Digital Library)
Description: The first comprehensive textbook on operating systems. Includes the first

monitor Monitor or monitor may refer to: Places * Monitor, Alberta * Monitor, Indiana, town in the United States * Monitor, Kentucky * Monitor, Oregon, unincorporated community in the United States * Monitor, Washington * Monitor, Logan County, West ...

notation (Chapter 7).

''A note on the confinement problem''

Butler W. Lampson Butler W. Lampson, ForMemRS, (born December 23, 1943) is an American computer scientist best known for his contributions to the development and implementation of distributed personal computing. Education and early life After graduating from the ...

* Communications of the ACM, 16(10):613–615, October 1973.
Online version(PDF)
Description: This paper addresses issues in constraining the flow of information from untrusted programs. It discusses covert channels, but more importantly it addresses the difficulty in obtaining full confinement without making the program itself effectively unusable. The ideas are important when trying to understand containment of malicious code, as well as aspects of trusted computing.

'' The UNIX Time-Sharing System''

* Dennis M. Ritchie and

Ken Thompson Kenneth Lane Thompson (born February 4, 1943) is an American pioneer of computer science. Thompson worked at Bell Labs for most of his career where he designed and implemented the original Unix operating system. He also invented the B programmi ...

17(7), July 1974.
Online copy
Description: The

Unix Unix (; trademarked as UNIX) is a family of multitasking, multiuser computer operating systems that derive from the original AT&T Unix, whose development started in 1969 at the Bell Labs research center by Ken Thompson, Dennis Ritchie, and ot ...

operating system An operating system (OS) is system software that manages computer hardware, software resources, and provides common services for computer programs. Time-sharing operating systems schedule tasks for efficient use of the system and may also in ...

and its principles were described in this paper. The main importance is not of the paper but of the operating system, which had tremendous effect on operating system and computer technology.

''Weighted voting for replicated data''

* David K. Gifford * Proceedings of the 7th ACM Symposium on Operating Systems Principles, pages 150–159, December 1979. Pacific Grove, California
Online copy (few formats)
Description: This paper describes the consistency mechanism known as quorum consensus. It is a good example of algorithms that provide a continuous set of options between two alternatives (in this case, between the read-one write-all, and the write-one read-all consistency methods). There have been many variations and improvements by researchers in the years that followed, and it is one of the consistency algorithms that should be understood by all. The options available by choosing different size quorums provide a useful structure for discussing of the core requirements for consistency in distributed systems.

''Experiences with Processes and Monitors in Mesa''

, David D. Redell * Communications of the ACM, Vol. 23, No. 2, February 1980, pp. 105–117.
Online copy (PDF)
Description: This is the classic paper on synchronization techniques, including both alternate approaches and pitfalls.

''Scheduling Techniques for Concurrent Systems''

* J. K. Ousterhout * Proceedings of Third International Conference on Distributed Computing Systems, 1982, 22—30. Description: Algorithms for

coscheduling Coscheduling is the principle for concurrent systems of scheduling related processes to run on different processors at the same time (in parallel). There are various specific implementations to realize this. If an application consists of a colle ...

of related processes were given

''A Fast File System for UNIX''

Marshall Kirk Mckusick Marshall Kirk McKusick (born January 19, 1954) is a computer scientist, known for his extensive work on BSD UNIX, from the 1980s to FreeBSD in the present day. He was president of the USENIX Association from 1990 to 1992 and again from 2002 ...

William N. Joy William Nelson Joy (born November 8, 1954) is an American computer engineer and venture capitalist. He co-founded Sun Microsystems in 1982 along with Scott McNealy, Vinod Khosla, and Andy Bechtolsheim, and served as Chief Scientist and CTO at ...

, Samuel J. Leffler, Robert S. Fabry * IACM Transactions on Computer Systems, Vol. 2, No. 3, August 1984, pp. 181–197.
Online copy (PDF)
Description: The

file system In computing, file system or filesystem (often abbreviated to fs) is a method and data structure that the operating system uses to control how data is stored and retrieved. Without a file system, data placed in a storage medium would be one larg ...

UNIX Unix (; trademarked as UNIX) is a family of multitasking, multiuser computer operating systems that derive from the original AT&T Unix, whose development started in 1969 at the Bell Labs research center by Ken Thompson, Dennis Ritchie, and ot ...

. One of the first papers discussing how to manage disk storage for high-performance file systems. Most file-system research since this paper has been influenced by it, and most high-performance file systems of the last 20 years incorporate techniques from this paper.

''The Design of the UNIX Operating System''

* Maurice J. Bach,

AT&T Bell Labs Nokia Bell Labs, originally named Bell Telephone Laboratories (1925–1984), then AT&T Bell Laboratories (1984–1996) and Bell Labs Innovations (1996–2007), is an American industrial research and scientific development company owned by mult ...

* Prentice Hall • 486 pp • Published 05/27/1986 This definitive description principally covered the System V Release 2 kernel, with some new features from Release 3 and

BSD The Berkeley Software Distribution or Berkeley Standard Distribution (BSD) is a discontinued operating system based on Research Unix, developed and distributed by the Computer Systems Research Group (CSRG) at the University of California, Berk ...

''The Design and Implementation of a Log-Structured File System''

* Mendel Rosenblum, J. K. Ousterhout * ACM Transactions on Computer Systems, Vol. 10, No. 1 (February 1992), pp. 26–52.
Online version
Description:

Log-structured file system A log-structured filesystem is a file system in which data and metadata are written sequentially to a circular buffer, called a log. The design was first proposed in 1988 by John K. Ousterhout and Fred Douglis and first implemented in 1992 by ...

''Microkernel operating system architecture and Mach''

* David L. Black, David B. Golub, Daniel P. Julin, Richard F. Rashid, Richard P. Draves, Randall W. Dean, Alessandro Forin, Joseph Barrera, Hideyuki Tokuda, Gerald Malan,

David Bohman David (; , "beloved one") (traditional spelling), , ''Dāwūd''; grc-koi, Δαυΐδ, Dauíd; la, Davidus, David; gez , ዳዊት, ''Dawit''; xcl, Դաւիթ, ''Dawitʿ''; cu, Давíдъ, ''Davidŭ''; possibly meaning "beloved one". w ...

* Proceedings of the USENIX Workshop on Microkernels and Other Kernel Architectures, pages 11–30, April 1992. Description: This is a good paper discussing one particular

architecture and contrasting it with monolithic kernel design. Mach underlies

Mac OS X macOS (; previously OS X and originally Mac OS X) is a Unix operating system developed and marketed by Apple Inc. since 2001. It is the primary operating system for Apple's Mac (computer), Mac computers. Within the market of ...

, and its layered architecture had a significant impact on the design of the

Windows NT kernel The architecture of Windows NT, a line of operating systems produced and sold by Microsoft, is a layered design that consists of two main components, user mode and kernel mode. It is a preemptive, reentrant multitasking operating system, whic ...

and modern microkernels like L4. In addition, its memory-mapped files feature was added to many monolithic kernels.

''An Implementation of a Log-Structured File System for UNIX''

Margo Seltzer Margo Ilene Seltzer is a professor and researcher in computer systems. She is currently the Canada 150 Research Chair in Computer Systems and the Cheriton Family Chair in Computer Science at the University of British Columbia. Previously, Seltzer ...

, Keith Bostic,

, Carl Staelin * Proceedings of the Winter 1993

USENIX Conference The USENIX Annual Technical Conference (USENIX ATC, or, canonically, USENIX) is a conference of computing professions sponsored by the USENIX association. The conference includes computing tutorials, and a single track technical session for presen ...

, San Diego, CA, January 1993, 307-326 Description: The paper was the first production-quality implementation of that idea which spawned much additional discussion of the viability and short-comings of log-structured filesystems. While "The Design and Implementation of a Log-Structured File System" was certainly the first, this one was important in bringing the research idea to a usable system.

''Soft Updates: A Solution to the Metadata Update problem in File Systems''

* G. Ganger, M. McKusick, C. Soules, Y. Patt * ACM Transactions on Computer Systems 18, 2. pp 127–153, May 2000 * Online version
Description: A new way of maintaining filesystem consistency.

Programming languages

''The FORTRAN Automatic Coding System''

John Backus John Warner Backus (December 3, 1924 – March 17, 2007) was an American computer scientist. He directed the team that invented and implemented FORTRAN, the first widely used high-level programming language, and was the inventor of the Backu ...

et al. * Proceedings of the WJCC (Western Joint Computer Conference), Los Angeles, California, February 1957.
Online version(PDF)
Description: This paper describes the design and implementation of the first FORTRAN compiler by the IBM team. Fortran is a general-purpose, procedural,

imperative programming In computer science, imperative programming is a programming paradigm of software that uses statements that change a program's state. In much the same way that the imperative mood in natural languages expresses commands, an imperative program c ...

language that is especially suited to numeric computation and scientific computing.

''Recursive functions of symbolic expressions and their computation by machine, part I''

* John McCarthy. * Communications of the ACM, 3(4):184–195, April 1960.
Several online versions
Description: This paper introduced

LISP A lisp is a speech impairment in which a person misarticulates sibilants (, , , , , , , ). These misarticulations often result in unclear speech. Types * A frontal lisp occurs when the tongue is placed anterior to the target. Interdental lisping ...

, the first

functional programming language In computer science, functional programming is a programming paradigm where programs are constructed by applying and composing functions. It is a declarative programming paradigm in which function definitions are trees of expressions that m ...

, which was used heavily in many areas of computer science, especially in AI. LISP also has powerful features for manipulating LISP programs within the language.

''ALGOL 60''

Revised Report on the Algorithmic Language Algol 60
by Peter Naur, et al. – The very influential ALGOL definition; with the first formally defined syntax. *

Brian Randell Brian Randell (born 1936) is a British computer scientist, and Emeritus Professor at the School of Computing, Newcastle University, United Kingdom. He specialises in research into software fault tolerance and dependability, and is a noted auth ...

and L. J. Russell, ''ALGOL 60 Implementation: The Translation and Use of ALGOL 60 Programs on a Computer''. Academic Press, 1964. The design of the Whetstone Compiler. One of the early published descriptions of implementing a

. See the related papers
Whetstone Algol Revisited
an
The Whetstone KDF9 Algol Translator
by

* Edsger W. Dijkstra, ''Algol 60 translation: an Algol 60 translator for the x1 and making a translator for Algol 60'', report MR 35/61. Mathematisch Centrum, Amsterdam, 1961. Description: Algol 60 introduced block structure.

''The next 700 programming languages''

Peter Landin Peter John Landin (5 June 1930 – 3 June 2009) was a British computer scientist. He was one of the first to realise that the lambda calculus could be used to model a programming language, an insight that is essential to the development of bo ...

* Communications of the ACM 9(3):157–65, March 1966 Description: This seminal paper proposed an ideal language

ISWIM ISWIM (acronym for If you See What I Mean) is an abstract computer programming language (or a family of languages) devised by Peter Landin and first described in his article "The Next 700 Programming Languages", published in the Communications ...

, which without being ever implemented influenced the whole later development.

''Fundamental Concepts in Programming Languages''

Christopher Strachey Christopher S. Strachey (; 16 November 1916 – 18 May 1975) was a British computer scientist. He was one of the founders of denotational semantics, and a pioneer in programming language design and computer time-sharing.F. J. Corbató, et al. ...

pdf
Description: ''

Fundamental Concepts in Programming Languages ''Fundamental Concepts in Programming Languages'' were an influential set of lecture notes written by Christopher Strachey for the International Summer School in Computer Programming at Copenhagen in August, 1967. It introduced much programming l ...

'' introduced much programming language terminology still in use today, including ''R-values'', ''L-values'', ''parametric polymorphism'', and ''ad hoc polymorphism''.

''Lambda Papers''

Gerald Jay Sussman Gerald Jay Sussman (born February 8, 1947) is the Panasonic Professor of Electrical Engineering at the Massachusetts Institute of Technology (MIT). He received his S.B. and Ph.D. degrees in mathematics from MIT in 1968 and 1973 respectively. ...

and

Guy L. Steele, Jr. Guy Lewis Steele Jr. (; born October 2, 1954) is an American computer scientist who has played an important role in designing and documenting several computer programming languages and technical standards. Biography Steele was born in Missouri ...

AI Memo AI is artificial intelligence, intellectual ability in machines and robots. Ai, AI or A.I. may also refer to: Animals * Ai (chimpanzee), an individual experimental subject in Japan * Ai (sloth) or the pale-throated sloth, northern Amazonian ma ...

s, 1975–1980
Links to pdf's
Description: This series of papers and reports first defined the influential

Scheme A scheme is a systematic plan for the implementation of a certain idea. Scheme or schemer may refer to: Arts and entertainment * ''The Scheme'' (TV series), a BBC Scotland documentary series * The Scheme (band), an English pop band * ''The Schem ...

programming language and questioned the prevailing practices in programming language design, employing

lambda calculus Lambda calculus (also written as ''λ''-calculus) is a formal system in mathematical logic for expressing computation based on function abstraction and application using variable binding and substitution. It is a universal model of computation ...

extensively to model programming language concepts and guide efficient implementation without sacrificing expressive power.

''Structure and Interpretation of Computer Programs''

Harold Abelson Harold Abelson (born April 26, 1947) is the Class of 1922 Professor of Computer Science and Engineering in the Department of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology (MIT), a fellow of the Institute ...

and

MIT Press The MIT Press is a university press affiliated with the Massachusetts Institute of Technology (MIT) in Cambridge, Massachusetts (United States). It was established in 1962. History The MIT Press traces its origins back to 1926 when MIT publish ...

, 1984, 1996 Description: This textbook explains core computer programming concepts, and is widely considered a classic text in computer science.
Online course

''Comprehending Monads''

Philip Wadler Philip Lee Wadler (born April 8, 1956) is an American computer scientist known for his contributions to programming language design and type theory. He is the chair of Theoretical Computer Science at the Laboratory for Foundations of Computer S ...

* Mathematical structures in computer science 2.04 (1992): 461–493.
Online copy
Description: This paper introduced monads to functional programming.

''Towards a Theory of Type Structure''

* John Reynolds * Programming Symposium. Springer Berlin Heidelberg, 1974.
online copy
Description: This paper introduced

System F System F (also polymorphic lambda calculus or second-order lambda calculus) is a typed lambda calculus that introduces, to simply typed lambda calculus, a mechanism of universal quantification over types. System F formalizes parametric polymorph ...

and created the modern notion of

Parametric polymorphism In programming languages and type theory, parametric polymorphism allows a single piece of code to be given a "generic" type, using variables in place of actual types, and then instantiated with particular types as needed. Parametrically polymorph ...

''An axiomatic basis for computer programming''

Tony Hoare Sir Charles Antony Richard Hoare (Tony Hoare or C. A. R. Hoare) (born 11 January 1934) is a British computer scientist who has made foundational contributions to programming languages, algorithms, operating systems, formal verification, and c ...

* Communications of the ACM, Volume 12 Issue 10, Oct. 1969, Pages 576-580 Description: This paper introduce

Hoare logic Hoare logic (also known as Floyd–Hoare logic or Hoare rules) is a formal system with a set of logical rules for reasoning rigorously about the correctness of computer programs. It was proposed in 1969 by the British computer scientist and log ...

, which forms the foundation of program verification

Scientific computing

* *

Computational linguistics

* :Contains the first presentation of stochastic context-free grammars. * :The first published description of computational

morphology Morphology, from the Greek and meaning "study of shape", may refer to: Disciplines * Morphology (archaeology), study of the shapes or forms of artifacts * Morphology (astronomy), study of the shape of astronomical objects such as nebulae, galaxies ...

using

finite state transducer A finite-state transducer (FST) is a finite-state machine with two memory ''tapes'', following the terminology for Turing machines: an input tape and an output tape. This contrasts with an ordinary finite-state automaton, which has a single tape ...

s. (Kaplan and Kay had previously done work in this field and presented this at a conference; the linguist Johnson had remarked the possibility in 1972, but not produced any implementation.) * :An overview of

hidden Markov model A hidden Markov model (HMM) is a statistical Markov model in which the system being modeled is assumed to be a Markov process — call it X — with unobservable ("''hidden''") states. As part of the definition, HMM requires that there be an ob ...

s geared toward

speech recognition Speech recognition is an interdisciplinary subfield of computer science and computational linguistics that develops methodologies and technologies that enable the recognition and translation of spoken language into text by computers with the m ...

and other NLP fields, describing the Viterbi and forward-backward algorithms. * :Describes a now commonly used POS tagger based on transformation-based learning. * :Textbook on statistical and probabilistic methods in NLP. * :This survey documents relatively less researched importance of lazy functional programming languages (i.e. Haskell (programming language), Haskell) to construct Natural Language Processors and to accommodated many linguistic theories.

Software engineering

''Software engineering: Report of a conference sponsored by the NATO Science Committee''

* Peter Naur, Brian Randell (eds.) * Garmisch, Germany, 7–11 October 1968, Brussels, Scientific Affairs Division, NATO (1969) 231pp.
Online copy (PDF)
Description: Conference of leading people in software field c. 1968
The paper defined the field of Software engineering

''A Description of the Model-View-Controller User Interface Paradigm in the Smalltalk-80 System''Model View Controller History
. C2.com (2012-05-11). Retrieved on 2013-12-09.

* Krasner, Glenn E.; Pope, Stephen T. * ''The Journal of Object Technology'', Aug-Sep 1988
Online copy (PDF)
Description: A description of the system that originated the (now dominant) GUI programming paradigm of Model–view–controller

''Go To Statement Considered Harmful''

* Edsger Dijkstra, Dijkstra, E. W. * ''

'', 11(3):147–148, March 1968
Online copy
Description: Don't use goto – the beginning of structured programming.

''On the criteria to be used in decomposing systems into modules''

* David Parnas *

, Volume 15, Issue 12:1053–1058, December 1972.
Online copy (PDF)
Description: The importance of modularization and information hiding. Note that information hiding was first presented in a different paper of the same author – "Information Distributions Aspects of Design Methodology", Proceedings of IFIP Congress '71, 1971, Booklet TA-3, pp. 26–30

''Hierarchical Program Structures''

* Ole-Johan Dahl, C. A. R. Hoare * in Dahl, Dijkstra and Hoare, Structured Programming, Academic Press, London and New York, pp. 175–220, 1972. Description: The beginning of Object-oriented programming. This paper argued that programs should be decomposed to independent components with small and simple interfaces. They also argued that objects should have both data and related methods.

''A Behavioral Notion of Subtyping''

* Barbara Liskov, Barbara H. Liskov, Jeannette Wing, Jeannette M. Wing * ACM Transactions on Programming Languages and Systems (TOPLAS),1994 Description: Introduces Liskov substitution principle and establishes behavioral subtyping rules.

''A technique for software module specification with examples''

* David Parnas * Comm. ACM 15, 5 (May 1972), 330–336.
Online copy (PDF)
Description: Specification, software specification.

''Structured Design''

* Wayne Stevens (software engineer), Wayne Stevens, Glenford Myers, and Larry Constantine * ''IBM Systems Journal, 13'' (2), 115–139, 1974.
On-line copy (PDF)
Description: Seminal paper on Structured Systems Analysis and Design Method, Structured Design, data flow diagram, Coupling (computer science), coupling, and cohesion (computer science), cohesion.

''The Emperor's Old Clothes''

* C.A.R. Hoare * Communications of the ACM, Vol. 24, No. 2, February 1981, pp. 75–83.
Archived copy (PDF)
Description: Illustrates the "second-system effect" and the importance of simplicity.

''The Mythical Man-Month: Essays on Software Engineering''

* Fred Brooks, Brooks, Jr., F. P. * Addison Wesley Professional. 2nd edition, 1995. Description: Throwing more people at the task will not speed its completion...

''No Silver Bullet: Essence and Accidents of Software Engineering''

* Description: Brooks argues that "there is no single development, in either technology or management technique, which by itself promises even one order of magnitude [tenfold] improvement within a decade in productivity, in reliability, in simplicity." He also states that "we cannot expect ever to see two-fold gains every two years" in software development, as there is in hardware development (Moore's law).

''The Cathedral and the Bazaar''

* Eric S Raymond, Raymond, E.S. * ''First Monday (journal), First Monday'', 3, 3 (March 1998)
Online copy (HTML)
Description: Open-source software, Open source Methodology (software engineering), methodology.

''Design Patterns: Elements of Reusable Object Oriented Software''

* Erich Gamma, E. Gamma, Richard Helm, R. Helm, Ralph Johnson (computer scientist), R. Johnson, John Vlissides, J. Vlissides * Addison–Wesley, Reading, Massachusetts, 1995. Description: This book was the first to define and list Design pattern (computer science), design patterns in computer science.

''Statecharts: A Visual Formalism For Complex Systems''

* David Harel * D. Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8:231—274, 1987
Online version
Description: Statecharts are a visual modeling method. They are an extension of state machine that might be exponentially more efficient. Therefore, statcharts enable formal modeling of applications that were too complex before. Statecharts are part of the Unified Modeling Language, UML diagrams.

Security and privacy

Anonymity and Privacy

* David Chaum
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM, 4(2):84–88, February 1981. * Cynthia Dwork, Frank McSherry, Kobbi Nissim, Adam Smith
Calibrating Noise to Sensitivity in Private Data Analysis
In Theory of Cryptography Conference (TCC), Springer, 2006. . Th
full version
appears in Journal of Privacy and Confidentiality, 7 (3), 17–51.

Cryptography

* Whitfield Diffie and Martin E. Hellman, New Directions in Cryptography, IEEE Transactions on Information Theory, November 1976 * R. L. Rivest and A. Shamir and L. M. Adelman, A Method For Obtaining Digital Signatures And Public-Key Cryptosystems, MIT/LCS/TM-82, 1977 * Merkle, R
Security, Authentication, and Public Key Systems
PhD Thesis, 1979 Stanford University.

Passwords

* Morris, Robert and Thompson, Ken
Password security: a case history
Communications of the ACM CACM Homepage archive Volume 22 Issue 11, Nov. 1979 Pages 594–597
PDF

System security

* Dennis and Van Horn
Programming Semantics for Multiprogrammed Computations
ACM Conference on Programming Languages and Pragmatics (August 1965) * Saltzer and Schroeder
The Protection of Information in Computer Systems
ACM Symposium on Operating System Principles (October 1973
HTMLHTML2
* Karger and Schell
Thirty Years later: Lessons from the Multics Security Evaluation
ACSAC 2002 * Lampson, Butler
A Note on the Confinement Problem
Communications of the ACM, 16:10 (Oct. 1973), pp. 613–615
PDF
* Thompson, Ken
Reflections on Trusting Trust
Communications of the ACM, 27:8, Aug 1984 * J.E. Forrester and B.P. Miller
An Empirical Study of the Robustness of Windows NT Applications Using Random Testing
4th USENIX Windows Systems Symposium, Seattle, August 2000.

Usable security

* Whitten, Alma and Tygar, J.D.
Why Johnny Can't Encrypt: A Usability Evaluation of PGP 5.0
Proceedings of the 8th conference on USENIX Security Symposium, Volume 8, Pages 14–28 * Garfinkel, Simson and Shelat, Abhi
Remembrance of Data Passed
IEEE Security and Privacy, Volume 1 Issue 1, January 2003, Page 17-27

Theoretical computer science

Topics covered: theoretical computer science, including computability theory, computational complexity theory, algorithms, algorithmic information theory, information theory and formal verification.

References

* * Brian Randell, Randell, Brian (ed). (1982). ''The Origins of Digital Computers: Selected Papers.'' 3rd ed. Berlin: Springer-Verlag. . * Turning Points in Computing: 1962–1999, Special Issue, ''IBM Systems Journal, 38'' (2/3),1999. * Ed Yourdon, Yourdon, Edward (ed.) (1979) ''Classics in Software Engineering.'' New York: Yourdon Press.

External links

ACM Classic Books Series

50 most influential papers ACM SIGPLAN papers published in PLDI from 1979 through 1999
organized into a special SIGPLAN proceedings.

Academic search engines

Google Scholar

CiteSeer

Live Academic

Odysci

ISI Web of Science
{{Important publications Computer science papers, History of computer science Lists of publications in science, Computer science Artificial intelligence publications Computing-related lists, Computer science

Artificial intelligence

''Computing Machinery and Intelligence''

''A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence''

''Fuzzy sets''

''Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference''

''Artificial Intelligence: A Modern Approach''

Machine learning

''An Inductive Inference Machine''

''Language identification in the limit''

''On the uniform convergence of relative frequencies of events to their probabilities''

A theory of the learnable'

''Learning representations by back-propagating errors''

''Induction of Decision Trees''

''Learning Quickly When Irrelevant Attributes Abound: A New Linear-threshold Algorithm''

''Learning to predict by the method of Temporal difference''

''Learnability and the Vapnik–Chervonenkis dimension''

''Cryptographic limitations on learning boolean formulae and finite automata ''

''The strength of weak learnability''

''A training algorithm for optimum margin classifiers''

''A fast learning algorithm for deep belief nets''

''Knowledge-based analysis of microarray gene expression data by using support vector machines''

Compilers

''On the translation of languages from left to right''

''Semantics of Context-Free Languages.''

''Compiler Construction for Digital Computers''

''A Unified Approach to Global Program Optimization''

''A program data flow analysis procedure''

''YACC: Yet another compiler-compiler''

''gprof: A Call Graph Execution Profiler''

''Compilers: Principles, Techniques and Tools ''

Computer architecture

''Colossus computer''

''First Draft of a Report on the EDVAC''

''Architecture of the IBM System/360''

''The case for the reduced instruction set computer''

''Comments on "the Case for the Reduced Instruction Set Computer"''

''The CRAY-1 Computer System''

''Validity of the Single Processor Approach to Achieving Large Scale Computing Capabilities''

''A Case for Redundant Arrays of Inexpensive Disks (RAID)''

''The case for a single-chip multiprocessor''

Computer graphics

''The Rendering Equation''

''Elastically deformable models''

''Sketchpad, a Man-Machine Graphical Communication System''

Computer vision

'' The Phase Correlation Image Alignment Method ''

''Determining Optical Flow''

''An Iterative Image Registration Technique with an Application to Stereo Vision''

''The Laplacian Pyramid as a compact image code''

''Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images''

''Snakes: Active contour models''

''Condensation – conditional density propagation for visual tracking''

''Object recognition from local scale-invariant features ''

Concurrent, parallel, and distributed computing

Databases

''A relational model for large shared data banks''

''Binary B-Trees for Virtual Memory''

''Relational Completeness of Data Base Sublanguages''

''The Entity Relationship Model – Towards a Unified View of Data''

''SEQUEL: A structured English query language''

''The notions of consistency and predicate locks in a database system''

''Federated database systems for managing distributed, heterogeneous, and autonomous databases''

''Mining association rules between sets of items in large databases''

History of computation

''The Computer from Pascal to von Neumann''

''A History of Computing in the Twentieth Century''

Information retrieval

''A Vector Space Model for Automatic Indexing''

''Extended Boolean Information Retrieval''

''A Statistical Interpretation of Term Specificity and Its Application in Retrieval''

Networking

A Protocol for Packet Network Intercommunication

The Design Philosophy of the DARPA Internet Protocols

End-To-End Arguments in System Design

Congestion Avoidance and Control

Analysis and Simulation of a Fair Queuing Algorithm

Scalable High Speed IP Routing Lookups

Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications

Operating systems

''An experimental timesharing system.''

A theory of the learnable
'

''A Description of the Model-View-Controller User Interface Paradigm in the Smalltalk-80 System''Model View Controller History
. C2.com (2012-05-11). Retrieved on 2013-12-09.