Navigation
  • Home
  • Recent
  • Most Active
  • Popular
  • Blog
  • Credits
  • RSS
  •   Interaction
  • Register
  • Statistics
  •   Help
  • Suggestions
  • Contact Us
  • How to Edit
  • Help



  • [Edit]







        List of important publications in computer science
                On computable numbers, with an application to the Entscheidungsproblem
                On certain formal properties of grammars
                Finite automata and their decision problem
                Introduction to Automata Theory, Languages, and Computation
                Computability: An introduction to recursive function theory
                On the computational complexity of algorithms
                The complexity of theorem proving procedures
                Karps_21_NP-complete_problems|Reducibility among combinatorial problems
                Computers and Intractability: A Guide to the Theory of NP-Completeness
                Theory and Applications of Trapdoor functions
                The Knowledge Complexity of Interactive Proof Systems
                How to Construct Random Functions
                Algebraic methods for interactive proof systems
                IP (complexity)|IP PSPACE
                Interactive Proofs and the Hardness of Approximating Cliques
                Probabilistic Checking of Proofs: A New Characterization of NP
                Proof Verification and the Hardness of Approximation Problems
                Computational complexity theory|Computational Complexity
                A machine program for theorem proving
                A Machine-Oriented Logic Based on the Resolution Principle
                Optimization by simulated annealing
                The Art of Computer Programming
                Introduction to Algorithms
                How to Solve It By Computer
                The Design and Analysis of Computer Algorithms
                Algorithms
                Algorithms + Data Structures Programs
                A formal theory of inductive inference
                Algorithmic information theory
                A mathematical theory of communication
                Error detecting and error correcting codes
                A Method for the Construction of Minimum Redundancy Codes
                A Universal Algorithm for Sequential Data Compression
                Elements of Information Theory
                An experimental timesharing system.
                 The Unix|UNIX Time-Sharing System
                Operating Systems: Design and implementation
                Scheduling Techniques for Concurrent Systems
                A relational model for large shared data banks
                The Entity Relationship Model & Towards a Unified View of Data
                Mining association rules between sets of items in large databases
                Principles of Transaction-Oriented Database Recovery
                Communication Theory of Secrecy Systems
                New directions in cryptography
                A Method for Obtaining Digital Signatures and Public Key Cryptosystems
                How to Share a Secret
                How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design
                How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority
                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
                Language identification in the limit
                On the uniform convergence of relative frequencies of events to their probabilities
                A theory of the learnable
                Learnability and the Vapnik-Chervonenkis dimension
                Cryptographic limitations on learning boolean formulae and finite automata
                 The strength of weak learnability
                 Learning in the presence of malicious errors
                 The Phase correlation|Phase Correlation Image Alignment Method
                 An Iterative image registration|Image Registration Technique with an Application to Binocular vision|Stereo Vision
                 The Laplacian Pyramid as a compact image code
                 Snakes algorithm|Snakes: Active contour models
                 Condensation algorithm|Condensation -- conditional density propagation for visual tracking
                On the translation of languages from left to right
                Semantics of Context-Free Languages.
                YACC: Yet another compiler-compiler
                Compilers: Principles, Techniques and Tools
                 Assigning meanings to programs
                 An axiomatic basis for computer programming
                The temporal logic of programs
                Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints
                Model Checking
                The Computer from Pascal to von Neumann
                A History of Computing in the Twentieth Century
                Software engineering: Report of a conference sponsored by the NATO Science Committee
                Goto|Go To Statement Considered harmful|Considered Harmful
                On the criteria to be used in decomposing systems into modules
                The Mythical Man-Month: Essays on Software Engineering
                No Silver Bullet: Essence and Accidents of Software Engineering
                The Cathedral and the Bazaar
                Design Patterns: Elements of Reusable Object Oriented Software
                The Structure of "THE"-Multiprogramming System
                 How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
                LogP: Towards a realistic model of parallel computation
                Ethernet: Distributed packet switching for local computer networks
                A Dynamic Network Architecture
                Computer Networks
                The Byzantine Generals Problem
                Impossibility of Distributed Consensus with One Faulty process
            See also

    top

    On computable numbers, with an application to the Entscheidungsproblem

    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

    top

    On certain formal properties of grammars
      Information and Control 2 (1959), 137–167.
    Description: This article introduced what is now known as the Chomsky hierarchy, a containment hierarchy of classes of formal grammars that generate formal languages.

    Importance: Topic creator, Breakthrough, Influence

    top

    Finite automata and their decision problem
      IBM J. Research and Development, 3:114–125, 1959.

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

    Importance: Topic creator, Breakthrough, Influence, Introduction

    top

    Introduction to Automata Theory, Languages, and Computation

    Description: A popular textbook.

    Importance: Introduction

    top

    Computability: An introduction to recursive function theory
      Cambridge University Press, 1980, ISBN 0-521-29465-7

    Description: A popular textbook.

    Importance: Introduction

    top

    On the computational complexity of algorithms
      Trans. Amer. Math. Soc. 117 (1965), 285–306.
    Description: This paper gave computational complexity its name and seed.

    Importance: Topic creator, Breakthrough, Influence

    top

    The complexity of theorem proving procedures
      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

    top

    Karps_21_NP-complete_problems|Reducibility among combinatorial problems
      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

    top

    Computers and Intractability: A Guide to the Theory of NP-Completeness
      Freeman, New York, 1979
      ISBN 0-7167-1045-5

    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

    top

    Theory and Applications of Trapdoor functions
      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

    top

    The Knowledge Complexity of Interactive Proof Systems

    Description: This paper introduced the concept of zero knowledge.

    Importance: Topic creator, Breakthrough

    top

    How to Construct Random Functions
    Description: This paper showed that the existence of one way functions leads to computational randomness.

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

    top

    Algebraic methods for interactive proof systems
      Carsten Lund, Lance Fortnow, Howard Karloff, and Noam Nisan
    Description: This paper showed that PH is contained in IP.

    Importance: Breakthrough

    top

    IP (complexity)|IP PSPACE
    Description: IP is a complexity class whose characterization (based on interactive proof systems) is quite different from the usual time/space bounded computational classes.
    In this paper, Shamir extended the technique of the previous paper by Lund, et al., to show that PSPACE is contained in IP, and hence IP = PSPACE, so that each problem in one complexity class is solvable in the other.

    Importance: Breakthrough

    top

    Interactive Proofs and the Hardness of Approximating Cliques

    top

    Probabilistic Checking of Proofs: A New Characterization of NP

    top

    Proof Verification and the Hardness of Approximation Problems

    Description: These three papers established the surprising fact that certain problems in NP remain hard even when only an approximative solution is required.

    Importance: Topic creator, Breakthrough, Influence

    top

    Computational complexity theory|Computational Complexity

    Description: This book provides a very good introduction to Computational Complexity

    Importance: Introduction

    top

    A machine program for theorem proving
    Description: The DLL algorithm. The basic algorithm for SAT and other NP-Complete problems.

    Importance: Breakthrough, Influence

    top

    A Machine-Oriented Logic Based on the Resolution Principle
    Description: First description of resolution and unification used in theorem proving; used in Prolog & logic programming.

    Importance: Topic Creator, Breakthrough, Influence

    top

    Optimization by simulated annealing
      Science, Number 4598, 13, pages 671–680, May 1983.

    Description: This article described simulated annealing which is now a very common heuristic for NP-Complete problems.

    Importance: Influence

    top

    The Art of Computer Programming

    Description: This monograph has three popular algorithms books and a number of fascicles. The algorithms are written in both English and MIX assembly language (or MMIX assembly language in more recent fascicles). This makes algorithms both understandable and precise. However, the use of a low-level programming language frustrates some programmers more familiar with modern structured programming languages.

    Importance: Influence

    top

    Introduction to Algorithms
      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

    top

    How to Solve It By Computer

    Description: Explains the Whys of algorithms and data-structures.
    Explains the Creative Process, the Line of Reasoning, the Design Factors behind innovative solutions.

    Importance: Introduction

    See Also: How to Solve It

    top

    The Design and Analysis of Computer Algorithms
      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

    top

    Algorithms

      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 elementary) than Aho, Hopcroft, and Ullman. There are more recent editions.

    Importance: Influence

    top

    Algorithms + Data Structures Programs
      Prentice Hall, 1976, ISBN 0-13-022418-9

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

    Importance: Influence

    top

    A formal theory of inductive inference

    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

    top

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

    Importance: Introduction

    top

    A mathematical theory of communication

    Description: This paper created communication theory and information theory.

    Importance: Topic creator, Breakthrough, Introduction, Influence

    top

    Error detecting and error correcting codes

    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

    top

    A Method for the Construction of Minimum Redundancy Codes
      Proceedings of the Institute of Radio Engineers, September 1952, Volume 40, Number 9, pp. 1098–1101.

    Description: The Huffman coding.

    Importance: Influence, Breakthrough

    top

    A Universal Algorithm for Sequential Data Compression

    Description: The LZ77 compression algorithm.

    Importance: Influence, Breakthrough

    top

    Elements of Information Theory
    Description: A good and popular introduction to information theory.

    Importance: Influence, Introduction

    top

    An experimental timesharing system.
      Proceedings of the AFIPS FJCC, pages 335–344, 1962.

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

    Importance: Influence

    top

    The Unix|UNIX Time-Sharing System

    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

    top

    Operating Systems: Design and implementation
      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

    top

    Scheduling Techniques for Concurrent Systems
      Proceedings of Third International Conference on Distributed Computing Systems, 1982, 22—30.
    Description: Algorithms for coscheduling of related processes were given

    Importance: Influence

    top

    A relational model for large shared data banks

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

    Importance: Topic creator, Breakthrough, Influence

    top

    The Entity Relationship Model & Towards a Unified View of Data

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

    Importance: Breakthrough, Influence

    top

    Mining association rules between sets of items in large databases
      Proc. of the ACM SIGMOD Conference on Management of Data, pages 207–216, Washington, D.C., May 1993

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

    Importance: Topic creator, Introduction, Influence

    top

    Principles of Transaction-Oriented Database Recovery
      ACM Computing Surveys 15(4), May 1983

    Description: Introduced the ACID-Paradigma for transactions.

    Importance: Topic creator, Introduction, Influence

    top

    Communication Theory of Secrecy Systems

    Description: Information theory based analysis of cryptography.

    Importance: Breakthrough, Introduction, Influence

    top

    New directions in cryptography

    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...)

    top

    A Method for Obtaining Digital Signatures and Public Key Cryptosystems

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

    Importance: Breakthrough, Influence

    top

    How to Share a Secret

    Description: A safe method for sharing a secret.

    Importance: Topic creator, Breakthrough

    top

    How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design
      CRYPTO, LNCS vol 263, pp. 171–185, 1987

    Description: This paper explains how to construct a zero-knowledge proof system for any language in NP.

    Importance: Breakthrough, Influence

    top

    How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority
      STOC, pgs. 218-229, 1987

    Description: Seminal paper in secure function evaluation

    Importance: Breakthrough, Influence

    top

    Computing machinery and intelligence
      Mind, 59:433–460, 1950.

    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

    top

    A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence

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

    Importance: Influence

    top

    Fuzzy sets
      Information and Control, Vol. 8, pp. 338-353. (1965).

    Description: The seminal paper published in 1965 provides details on the mathematics of fuzzy set theory.

    Importance: Topic creator, Influence

    top

    Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
      ISBN 1-55860-479-0 Publisher: Morgan Kaufmann Pub, 1988

    Description: This book introduced Bayesian methods to AI.

    Importance: Topic creator, Influence

    top

    Artificial Intelligence: A Modern Approach
      Prentice Hall, Englewood Cliffs, New Jersey, 1995, ISBN 0-13-080302-2

    Description: The standard textbook in Artificial Intelligence. The authors claim that it used in over 900 colleges and universities in 89 countries.

    Importance: Introduction, Influence



    top

    Language identification in the limit

    Description: This paper created Algorithmic learning theory.

    Importance: Topic creator, Breakthrough, Influence

    top

    On the uniform convergence of relative frequencies of events to their probabilities
      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

    top

    A theory of the learnable

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

    Importance: Topic creator, Breakthrough, Influence

    top

    Learnability and the Vapnik-Chervonenkis dimension

    Description: The complete characterization of PAC learnability using the VC dimension.

    Importance: Breakthrough, Influence

    top

    Cryptographic limitations on learning boolean formulae and finite automata
      In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 433–444, New York. ACM.
    Description: Proving negative results for PAC learning.

    Importance: Influence

    top

    The strength of weak learnability
      Machine Learning, 5(2):197–227, 1990.
    Description: Proving that weak and strong learnability are equivalent in the noise free PAC framework.

    Importance: Breakthrough, Influence

    top

    Learning in the presence of malicious errors
    Description: Proving possibility and imposibility result in the malicious errors framework.

    Importance: Breakthrough, Influence

    top

    The Phase correlation|Phase Correlation Image Alignment Method
      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

    top

    An Iterative image registration|Image Registration Technique with an Application to Binocular vision|Stereo Vision
      Proceedings of the 7th International Joint Conference on Artificial Intelligence, 674–679,Vancouver, Canada,1981

    Description: This paper provides efficient technique for image registration

    Importance: Influence

    top

    The Laplacian Pyramid as a compact image code

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

    Importance: Influence

    top

    Snakes algorithm|Snakes: Active contour models

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

    Importance: Influence, topic creator

    top

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

    Description: A technique for visual tracking

    Importance: Influence

    top

    On the translation of languages from left to right
      D. E. Knuth
      Information and Control 8 (1965), 607-639.

    Description: Bottom up parsing for deterministic context-free languages from which later the LALR approach of Yacc developed.

    Importance: Breakthrough, Influence

    top

    Semantics of Context-Free Languages.
      D.E. Knuth
      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.

    Importance: Breakthrough, Influence

    top

    YACC: Yet another compiler-compiler
      Unix Programmer's Manual Vol 2b, 1979

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

    Importance: Influence

    top

    Compilers: Principles, Techniques and Tools

    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

    top

    Assigning meanings to programs
      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

    top

    An axiomatic basis for computer programming
    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

    top

    The temporal logic of programs
      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

    top

    Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints
      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.

    top

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

    Importance: Introduction

    top

    The Computer from Pascal to von Neumann

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

    Importance:

    top

    A History of Computing in the Twentieth Century
    edited by:

    Description: Several chapters by pioneers of computing.

    Importance:

    top

    Software engineering: Report of a conference sponsored by the NATO Science Committee
      Garmisch, Germany, 7–11 October 1968, Brussels, Scientific Affairs Division, NATO (1969) 231pp.

    Description: Conference of leading figures in software field circa 1968

    Importance: Defined the field of Software engineering

    top

    Goto|Go To Statement Considered harmful|Considered Harmful

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

    Importance: Topic creator, Influence

    top

    On the criteria to be used in decomposing systems into modules

    Description: The importance of modularization and information hiding.

    Importance: Influence

    top

    The Mythical Man-Month: Essays on Software Engineering
      Addison Wesley Professional. 2nd edition, 1995.

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

    Importance: Influence

    top

    No Silver Bullet: Essence and Accidents of Software Engineering

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

    Importance: Influence

    top

    The Cathedral and the Bazaar

    Description: Open source methodology.

    Importance: Influence

    top

    Design Patterns: Elements of Reusable Object Oriented Software

    Description: This book was the first to define and list design patterns in computer science

    Importance: Topic creator, Influence

    top

    The Structure of "THE"-Multiprogramming System

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

    Importance: Breakthrough, Influence

    top

    How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
    Description: Requirements that guarantee the correct execution of multi process programs were defined.

    Importance: Breakthrough, Influence

    top

    LogP: Towards a realistic model of parallel computation
      D. Culler, R. 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.

    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

    top

    Ethernet: Distributed packet switching for local computer networks

    Description: The Ethernet protocol.

    Importance: Influence, Latest and greatest

    top

    A Dynamic Network Architecture

    Description: Network software in distributed systems.

    Importance: Influence

    top

    Computer Networks
      Prentice Hall, mid '80s

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

    Importance: Influence

    top

    The Byzantine Generals Problem

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

    Importance: Influence, Breakthrough

    top

    Impossibility of Distributed Consensus with One Faulty process

    Description: Impossibility to achieve consensus in asynchronous systems if one process is faulty .

    Importance: Influence, Breakthrough

    top

    See also
      DBLP (Digital Bibliography & Library Project in computer science)
     
    Search more:
     

       
    Source Privacy License Download Contact Us Atlas
    Scientus.org Dictionary (Yet Another Wiki) RC : 1.39
    MIT OpenCourseWare
    This article is licensed under the GNU Free Documentation License [copyleft]. It uses material from the Wikipedia article "List of important publications in computer science". link