List of publications in computer science

=Computability=

== On computable numbers, with an application to the Entscheidungsproblem ==

Alan Turing

Proceedings of the London Mathematical Society, Series 2, 42 (submitted May 28 1936, read November 12 1936), pp 230–265. Errata appeared in Series 2, 43 (1937), pp 544–546.

[http://www.abelard.org/turpap2/tp2-ie.asp Online version (MS IExplorer only)]

Description: This article set the limits of computer science. It defined the Turing Machine, a model for all computations. On the other hand it proved the undecidability of the halting problem and Entscheidungsproblem and by doing so found the limits of possible computation.

Importance: Topic creator, Breakthrough, Influence

== On certain formal properties of grammars ==

*Noam Chomsky

Information and Control 2 (1959), 137–167.

Description: The Chomsky hierarchy, a containment hierarchy of classes of formal grammar that generate formal language was introduced.

Importance: Topic creator, Breakthrough, Influence

== Finite automata and their decision problem ==

Michael O. Rabin and Dana Scott

IBM J. Research and Development, 3:114–125, 1959.

*[http://domino.research.ibm.com/tchjr/journalindex.nsf/0/cdf6b2949432156385256bfa00683d63OpenDocument Online version]

Description: Mathematical treatment of Finite state machine, proof of core properties, and definition of non-deterministic finite automaton

Importance: Topic creator, Breakthrough, Influence, Introduction

== Introduction to Automata Theory, Languages, and Computation ==

John E. Hopcroft

Jeffrey D. Ullman

Addison-Wesley, 1979, ISBN 0-201-02988-X

Description: A popular textbook.

Importance: Introduction

== Computability: An introduction to recursive function theory ==

Nigel J. Cutland

Cambridge University Press, 1980, ISBN 0-521-29465-7

Description: A popular textbook.

Importance: Introduction

=Computational complexity theory=

== On the computational complexity of algorithms ==

Juris Hartmanis

Richard Stearns

Trans. Amer. Math. Soc. 117 (1965), 285–306.

Description: This paper gave Computational complexity theory its name and seed.

Importance: Topic creator, Breakthrough, Influence

== The complexity of theorem proving procedures ==

*Stephen Cook

Proceedings of the 3rd Annual ACM Symposium on Theory of Computing (1971), pp. 151–158.

Description: This paper introduced the concept of NP-Completeness and proved that Boolean satisfiability problem(SAT) is NP-Complete.

Importance: Topic creator, Breakthrough, Influence

== Reducibility among combinatorial problems ==

*Richard Karp *In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations , pages 85–103. Plenum Press, New York, NY, 1972.

Description: This paper showed that 21 different problems are NP-Complete and showed the importance of the concept.

Importance: Influence

== Computers and Intractability: A Guide to the Theory of NP-Completeness ==

*Michael R. Garey, David S. Johnson *Freeman, New York, 1979 *ISBN 0716710455

Description: The main importance of this book is due to its extensive list of more than 300 NP-Complete problems. This list became a common reference and definition. It is important to note that though the book was published only few years after the concept was defined such an extensive list was found.

Importance: Introduction, Influence, Latest and greatest

== Theory and Applications of Trapdoor functions ==

*Andrew Chi-Chih Yao

Proc. 23rd Symposium on the Foundations of Computer Science (1982), pp. 80–91

Description: This paper introduced the concept of Trapdoor functions and described some of its application, like in Cryptography.

Importance: Topic creator, Breakthrough

== The Knowledge Complexity of Interactive Proof Systems ==

*Shafi Goldwasser, Silvio Micali, Charles Rackoff

SIAM Journal of Computing , 18(1):186–208, February 1989.

Description: This paper introduced the concept of zero knowledge.

Importance: Topic creator, Breakthrough

== How to Construct Random Functions ==

*Oded Goldreich, Shafi Goldwasser, Silvio Micali

Journal of the ACM , 33(4), 1984, 792-807.

*[http://theory.lcs.mit.edu/~cis/pubs/shafi/1986-jacm.pdf Online copy (PDF)] Description: This paper showed that the existence of One way function leads to computational randomness.

Importance: Topic creator, Breakthrough, Latest and greatest, Influence

== Interactive proof system = PSPACE ==

*Adi Shamir

Journal of the ACM, 39(4):869–877, 1992.

Description: Interactive proof system is a complexity class whose characterization is quite different from the usual time/space bounded computational classes. In this paper Shamir showed the IP = PSPACE, hence each problem in one complexity class is solvable in the other.

Importance: Breakthrough

== Computational complexity theory ==

Christos Papadimitriou

Addison-Wesley, 1994. ISBN 0201530821

Description: This book provides a very good introduction to Computational complexity theory

Importance: Introduction

=Algorithms=

== A machine program for theorem proving ==

*Martin Davis, G. Logemann, D. Loveland

Communications of the ACM , 5:394–397, 1962.

Description: The DLL algorithm. The basic algorithm for SAT and other NP-Complete problems.

Importance: Breakthrough, Influence

== A Machine-Oriented Logic Based on the Resolution Principle ==

*J. Alan Robinson

Communications of the ACM , 5:23–41, 1965.

Description: First description of resolution and unification used in theorem proving; used in Prolog & Logical programming.

Importance: Topic Creator, Breakthrough, Influence

== Optimization by simulated annealing ==

*Scott Kirkpatrick, Gelatt, C., & Vecchi, M.

Science, Number 4598, 13, pages 671–680, May 1983.

*[http://citeseer.ist.psu.edu/kirkpatrick83optimization.html Online copy]

Description: A very common heuristic for NP-Complete problems.

Importance: Influence

== The Art of Computer Programming ==

Donald Knuth

Description: This set of textbooks used to be very popular algorithms books. The algorithms were written in both English and MIX assembly language. Due to that, the algorithms were both understandable and very precise. However, they are not structured , which can make them difficult to translate to modern structured programming Computer language.

Importance: Influence

== Introduction to Algorithms ==

Thomas H. Cormen

Charles E. Leiserson

Ron Rivest

Clifford Stein

MIT Press and McGraw-Hill. 2nd Edition, 2001. 1st Edition (with first three authors) published in 1991.

Description: As its name indicates this textbook is a very good introduction to algorithms. This book became so popular that it is almost the de facto standard for basic algorithms teaching.

Importance: Introduction, Influence

== The Design and Analysis of Computer Algorithms ==

Alfred V. Aho

John E. Hopcroft

Jeffrey D. Ullman

Addison-Wesley, 1974, ISBN 0-201-00029-6

Description: One of the standard texts on algorithms for the period of approximately 1975–1985.

Importance: Influence, Introduction

== Algorithms ==

Robert Sedgewick (computer scientist)

Addison-Wesley, 1983, ISBN 0-201-06672-6

Description: A very popular text on algorithms in the late 1980s. It was more accessible and readable (but more elementry) than Aho, Hopcroft, and Ullman. There are more recent editions.

Importance: Influence

== Algorithms + Data Structures = Programs ==

Niklaus Wirth

Prentice-Hall, 1976, ISBN 0-13-022418-9

Description: An early, influential book on algorithms and data structures, with implementations in Pascal.

Importance: Influence

=Algorithmic information theory=

== A formal theory of inductive inference ==

*Ray Solomonoff

Information and Control, vol. 7, pp. 1–22, March 1964; pp. 224–254, June 1964.

Description: This was the beginning of Algorithmic information theory and Kolmogorov complexity. Note that though Kolmogorov complexity is named after Andrey Kolmogorov, he said that the seeds of that idea are due to Ray Solomonoff. Andrey Kolmogorov contributed a lot to this area but in later articles.

Importance: Topic creator, Breakthrough, Influence

== Algorithmic information theory ==

*Gregory Chaitin

IBM Journal of Research and Development 21 (1977), pp. 350–359, 496.

[http://www.cs.auckland.ac.nz/CDMTCS/chaitin/ibm.pdf Online version]

Description: A good introduction to Algorithmic information theory by one of the important people in the area.

Importance: Introduction

=Information theory=

== A mathematical theory of communication ==

*Claude E. Shannon

Bell System Technical Journal , 27:379–423,623–656, 1948

*[http://cm.bell-labs.com/cm/ms/what/shannonday/paper.html Online copy (HTML)]

Description: This paper created communication theory and information theory.

Importance: Topic creator, Breakthrough, Introduction, Influence

== Error detecting and error correcting codes ==

*Richard Hamming

Bell Systems Technical Journal , vol. 29, pp. 147–160, 1950

*[http://www.engelschall.com/~sb/hamming/page=1 Online copy]

Description: In this paper, Hamming introduced the idea of error-correcting code. He created the Hamming code and the Hamming distance and developed methods for code optimality proofs.

Importance: Topic creator, Breakthrough, Introduction, Influence

== A Method for the Construction of Minimum Redundancy Codes ==

*David A. Huffman

Proceedings of the Institute of Radio Engineers, September 1952, Volume 40, Number 9, pp. 1098–1101.

Description: The Huffman coding.

Importance: Influence, Breakthrough

== A Universal Algorithm for Sequential Data Compression ==

Jacob Ziv

Abraham Lempel

IEEE Transactions on Information Theory, Vol. 23, No. 3, pp. 337–343.

[http://citeseer.nj.nec.com/ziv77universal.html Online copy]

Description: The LZ77 compression algorithm.

Importance: Influence, Breakthrough

== Elements of Information Theory ==

T. M. Cover

J. A. Thomas

Wiley, 1991.

Description: A good and popular introduction to information theory.

Importance: Influence, Introduction

=Operating system=

== An experimental timesharing system. ==

Fernando J. Corbató,M. Merwin-Daggett, and R.C. Daley

Proceedings of the AFIPS FJCC, pages 335–344, 1962.

[http://larch-www.lcs.mit.edu:8001/~corbato/sjcc62/ Online copy (HTML)]

Description: This paper discuss time-sharing as a method of sharing computer resource. This idea changed the interaction with computer systems.

Importance: Influence

== The UNIX Time-Sharing System ==

Dennis M. Ritchie and Ken Thompson

Communications of the ACM 7, 7, July 1974.

[http://citeseer.ist.psu.edu/ritchie74unix.html Online copy (few formats)]

Description: The Unix operating system 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.

Importance: Influence, Breakthrough

== Operating Systems: Design and implementation ==

Andrew S. Tanenbaum

Prentice Hall, 1987

Description: Theoretical as well as practical textbook of the operating systems, with Minix as the example. The book is often referred to as the Minix bible, as it includes the full source.

Importance: Breakthrough, influence

== Scheduling Techniques for Concurrent Systems ==

*John Ousterhout

Proceedings of Third International Conference on Distributed Computing Systems, 1982, 22—30.

Description: Algorithms for coscheduling of related processes were given

Importance: Influence

=Databases=

== A relational model for large shared data bank ==

*Edgar F. Codd

Communications of the ACM , 13(6):377–387, June 1970

Description: This paper introduced the relational model for databases. This model became the number one model.

Importance: Topic creator, Breakthrough, Influence

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

*P.P-S. Chen

ACM Transactions on Database Systems , Vol. 1, No. 1, March 1976, pp. 9–36

Description: This paper introduced the Entity-relationship diagram(ERD) method of database design.

Importance: Breakthrough, Influence

== 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 , pages 207–216, Washington, D.C., May 1993

*[http://citeseer.nj.nec.com/agrawal93mining.html Online copy (HTML)]

Description: Association rules, a very common method for data mining.

Importance: Topic creator, Introduction, Influence

=Cryptography=

== Communication Theory of Secrecy Systems ==

*Claude E. Shannon

Communication Theory of Secrecy Systems , Bell System Technical Journal, vol.28-4, page 656–715, 1949.

*[http://www.cs.ucla.edu/~jkong/research/security/shannon1949.pdf Online copy (PDF)]

Description: Information theory based analysis of cryptography.

Importance: Breakthrough, Introduction, Influence

== New directions in cryptography ==

*Whitfield Diffie, Martin Hellman

IEEE Transactions on Information Theory , IT-22, 6, 1976, pp. 644–654

*[http://citeseer.nj.nec.com/340126.html Online copy (HTML)]

Description: This paper suggested public key cryptography and presented Diffie-Hellman key exchange.

Importance: Topic creator, Breakthrough, Introduction, Influence, Latest and greatest (A great paper from every perspective...)

== A Method for Obtaining Digital Signatures and Public Key Cryptosystems ==

*Ron Rivest, Adi Shamir, Len Adleman

Communications of the ACM , Vol. 21 (2), 1978, pages 120–126

*[http://citeseer.nj.nec.com/rivest78method.html Online copy (HTML)]

Description: The RSA encryption method. The first public key encryption method.

Importance: Breakthrough, Influence

== How to Share a Secret ==

*Adi Shamir

Communications of the ACM , vol. 22, no. 11, pp. 612–613 (November 1979)

*[http://szabo.best.vwh.net/secret.html Online copy (HTML)]

Description: A safe method for sharing a secret.

Importance: Topic creator, Breakthrough

=Artificial intelligence=

== Computing machinery and intelligence ==

Alan Turing

Mind, 59:433–460, 1950.

[http://www.abelard.org/turpap/turpap.htm Online copy]

Description: This paper discusses whether machine can think and suggested the Turing test as a method for checking it. In a sense, this was the beginning of artificial intelligence

Importance: Topic creator, Breakthrough, Influence

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

John McCarthy (computer scientist)

Marvin Minsky

N. Rochester

*Claude E. Shannon

[http://www-formal.stanford.edu/jmc/history/dartmouth/dartmouth.html Online copy]

Description: This summer research proposal marks the areas of research in artificial intelligence since then. It was a very long summer.

Importance: Influence

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

Judea Pearl

*ISBN: 1558604790 Publisher: Morgan Kaufmann Pub, 1988

Description: This book introduced Bayesian methods to AI.

Importance: Topic creator, Influence

Unformated list of reading considered as seminal works in the field of artificial intelligence:

ISBN 0130803022

Understanding Understanding: Essays on Cybernetics and Cognition by Heinz von Foerster

In the Image of the Brain: Breaking the Barrier Between Human Mind and Intelligent Machines by Jim Jubak

Today s Computers, Intelligent Machines and Our Future by Hans Moravec, Stanford University

The Society of Mind by Marvin Minsky, ISBN 0671657135 15 March 1998

by HP Newquist ISBN 0672304120.

=Machine learning=

== Language identification in the limit ==

*E. M. Gold

Information and Control , 10:447–474, 1967

Description: This paper created Algorithmic learning theory.

Importance: Topic creator, Breakthrough, Influence

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

*Vladimir Vapnik, Alexey Chervonenkis

Theory of Probability and its Applications , 16(2):264--280, 1971

Description: Computational learning theory, VC theory, statistical uniform convergence and the VC dimension.

Importance: Breakthrough, Influence

== A theory of the learnable ==

*Leslie Valiant

Communications of the ACM , 27(11):1134–1142 (1984)

Description: The Probably approximately correct learning (PAC learning) framework.

Importance: Topic creator, Breakthrough, Influence

== Learnability and the Vapnik-Chervonenkis dimension ==

A. Blumer

A. Ehrenfeucht

D. Haussler

M. K. Warmuth

Journal of the ACM, 36(4):929–965, 1989.

Description: The complete characterization of Probably approximately correct learning using the VC dimension.

Importance: Breakthrough, Influence

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

M. Kearns

Leslie Valiant

In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 433–444, New York. ACM.

*[http://citeseer.ist.psu.edu/kearns89cryptographic.html Online version(HTML)] Description: Proving negative results for Probably approximately correct learning.

Importance: Influence

== The strength of weak learnability ==

Robert E. Schapire

Machine Learning, 5(2):197–227, 1990.

*[http://citeseer.nj.nec.com/schapire90strength.html Online version(HTML)] Description: Proving that weak and strong learnability are equivalent in the noise free Probably approximately correct learning.

Importance: Breakthrough, Influence

== Learning in the presence of malicious errors ==

Michael Kearns

Ming Li

Journal on Computing, 22(4):807–837, August 1993.

*[http://citeseer.nj.nec.com/kearns93learning.html Online version(HTML)] Description: Proving possibility and imposibility result in the malicious errors framework.

Importance: Breakthrough, Influence

=Computer vision=

== The Phase correlation Image Alignment Method ==

C.D. Kuglin and D.C. Hines

IEEE 1975 Conference on Cybernetics and Society, 1975, New York, pp. 163–165, September

Description: A correlation method based upon the inverse Fourier transform

Importance: Influence

== An Iterative Image Registration Technique with an Application to Binocular vision ==

Lucas, B.D. and Kanade, T.

Proceedings of the 7th International Joint Conference on Artificial Intelligence, 674–679,Vancouver, Canada,1981

[http://citeseer.ist.psu.edu/lucas81iterative.html Online version]

Description: This paper provides efficient technique for image registration

Importance: Influence

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

Peter J. Burt and Edward H. Adelson

IEEE Transactions on Communications, volume = COM-31,4 , pp. 532–540, 1983.

[http://citeseer.ist.psu.edu/burt83laplacian.html Online version]

Description: A technique for image encoding using local operators of many scales

Importance: Influence

== Snakes algorithm: Active contour models ==

Michael Kass, Andrew Witkin, and Demetri Terzopoulos

International Journal of Computer Vision, 1(4):321–331, 1988. (Marr Prize Special Issue)

[http://www.mrl.nyu.edu/~dt/papers/ijcv88/ijcv88.pdf Online version]

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

Importance: Influence, topic creator

== Condensation algorithm -- conditional density propagation for visual tracking ==

M. Isard and A. Blake

International Journal of Computer Vision, 29(1):5–28, 1998.

[http://citeseer.ist.psu.edu/isard98condensation.html Online version]

Description: A technique for visual tracking

Importance: Influence

=Compilers=

== YACC: Yet another compiler-compiler ==

*Stephen C. Johnson

Unix Programmer s Manual Vol 2b, 1979

*[http://citeseer.nj.nec.com/johnson79yacc.html Online copy (HTML)]

Description: Yacc is a tool that made Compiler writing much easier.

Importance: Influence

== Compilers: Principles, Techniques and Tools ==

Alfred V. Aho

Ravi Sethi

Jeffrey D. Ullman

Addison-Wesley, 1986. ISBN 0201100886

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.

Importance: Introduction, Influence

=Formal verification=

== Assigning meanings to programs ==

Robert W. Floyd

Mathematical Aspects of Computer Science, pages 19–32, 1967

Description: Introduced the idea of attaching logical assertions to points in a program in order to prove its correctness and influenced C. A. R. Hoare s seminal work on program verification.

Importance: Topic creator, Breakthrough, Influence, Introduction

== An axiomatic basis for computer programming ==

C. A. R. Hoare

Communications of the ACM, 12:576–580, 1969

Description: Axiomatic foundation for program correctness proofs was laid. The importance of the use of formal methods is explained.

Importance: Topic creator, Breakthrough, Influence, Introduction

== The temporal logic of programs ==

Amir Pnueli

*In Proc. 18th IEEE Symposium on Foundation of Computer Science, pages 46–57, 1977. Description: The use of temporal logic was suggested as a method for formal verification.

Importance: Topic creator, Influence

== Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints ==

Patrick Cousot and Radhia Cousot

*In Proc. 4th ACM Symposium on Principles of Programming Languages, 238–252, 1977 Description: Introducing abstract interpretation for the verification of computer programs by sound approximations.

Importance: Topic creator, Influence.

== Model Checking ==

Edmund M. Clarke, Orna Grumberg, Doron A. Peled

MIT Press, 1999

Description: An overview of Model checking, an automatic formal verification technique

Importance: Introduction

= History of Computation =

== The Computer from Pascal to von Neumann ==

Herman H. Goldstine

Princton University Press, 1972, ISBN 0-691-08104-2

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

Importance:

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

edited by:

Nicholas Metropolis

J. Howlett

Gian-Carlo Rota

Academic Press, 1980, ISBN 0-12-491650-3

Description: Several chapters by pioneers of computing.

Importance:

=Software engineering =

== Science Committee ==

Peter Naur, Brian Randell (eds.)

Garmisch, Germany, 7–11 October 1968, Brussels, Scientific Affairs Division, NATO (1969) 231pp.

[http://homepages.cs.ncl.ac.uk/brian.randell/NATO/nato1968.PDF Online copy (PDF)]

Description: Conference of leading figures in sofware field circa 1968

Importance: Defined the field of Software engineering

== Goto Statement Considered Harmful ==

Edsger Dijkstra

Communications of the ACM , 11(3):147–148, March 1968

[http://www.acm.org/classics/oct95/ Online copy (HTML)]

Description: Don t use goto – the beginning of structured programming.

Importance: Topic creator, Influence

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

David Parnas

Communications of the ACM, December:1053–1058, December 1972.

[http://www.acm.org/classics/may96/ Online copy (HTML)]

Description: The importance of modularization and information hiding.

Importance: Influence

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

Fred Brooks

Addison Wesley Professional. 2nd edition, 1995.

Description: Throwing more people at the task will not speed its completion...

Importance: Influence

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

Fred Brooks

Computer (magazine) , 20(4):10–19, April 1987

[http://www.virtualschool.edu/mon/SoftwareEngineering/BrooksNoSilverBullet.html Online copy (HTML)]

Description: We will keep having problems with software...

Importance: Influence

== The Cathedral and the Bazaar ==

*Eric S Raymond

First Monday , 3, 3 (March 1998)

*[http://www.redhat.com/support/wpapers/community/cathedral/whitepaper_cathedral.html Online copy (HTML)]

Description: Open source Methodology (software engineering).

Importance: Influence

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

Erich Gamma, Richard Helm, R. Johnson, J. Vlissides

Addison-Wesley, Reading, Massachusetts, 1995.

Description: This book was the first to define and list Design pattern (computer science)s in computer science

Importance: Topic creator, Influence

=Parallel computing=

== The Structure of THE -Multiprogramming System ==

Edsger Dijkstra

Communication of the ACM, Vol. 11, No. 5 May 1968, pp. 345–346

[http://www.acm.org/classics/mar96/ Online copy (HTML)]

Description: The introduction of basic primitives like mutex as the basis of multiprocessing programming.

Importance: Breakthrough, Influence

== How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs ==

Leslie Lamport

IEEE Transactions on Computers, volume C-28, number 9, pp. 690–691, September 1979.

Description: Requirements that guarantee the correct execution of multi process programs were defined.

Importance: Breakthrough, Influence

== LogP: Towards a realistic model of parallel computation ==

*D. Culler, Richard Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, and T. von Eicken *In Proceedings 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, May 1993.

[http://citeseer.ist.psu.edu/culler93logp.html Online version]

Description: The LogP framework for parallel computing was suggested. The LogP provided a way to bridge the gap between theoretical analysis of algorithm and building real world systems.

Importance: Influence

=Computer networks=

== Ethernet: Distributed packet switching for local computer networks ==

*Robert Metcalfe, D.R. Boggs

Communications of the ACM 19, 7 (July 1976), 395–404

*[http://www.acm.org/classics/apr96/ Online copy (HTML)]

Description: The Ethernet protocol.

Importance: Influence, Latest and greatest

== A Dynamic Network Architecture ==

*Sean W. O Malley, Larry L. Peterson

ACM Transactions on Computer Systems , 10(2), May 1992

*[http://citeseer.ist.psu.edu/malley92dynamic.html Online copy]

Description: Network software in distributed systems.

Importance: Influence

== Computer Networks ==

Andrew S. Tanenbaum

Prentice Hall, mid 80s

Description: Textbook description of all network standards at the time. In 2005, it is in its fourth edition, include all current networking technology.

Importance: Influence

=Distributed computing=

== The Byzantine Generals Problem ==

Leslie Lamport, Robert Shostak, Marshall Pease

*Advances in Ultra-Dependable Distributed Systems, N. Suri, C. J. Walter, and M. M. Hugue (Eds.), IEEE Computer Society Press *[http://citeseer.ist.psu.edu/lamport82byzantine.html Online version]

Description: Impossibility result for distributed computing, see Byzantine failure.

Importance: Influence, Breakthrough

= See also =

List of publications in science

List of software engineering topics#Notable publications

List of open problems in computer science

DBLP (Digital Bibliography & Library Project)

= External links =

Academic Search Engines

http://scholar.google.com/

http://citeseer.ist.psu.edu/