Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, 1990

Jan van Leeuwen (Ed.): Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity. Elsevier and MIT Press 1990, ISBN 0-444-88071-2,0-262-22038-5

Peter van Emde Boas: Machine Models and Simulation. 1-66
David S. Johnson: A Catalog of Complexity Classes. 67-161
Joel I. Seiferas: Machine-Independent Complexity Theory. 163-186
Ming Li, Paul M. B. Vitányi: Kolmogorov Complexity and its Applications. 187-254
Alfred V. Aho: Algorithms for Finding Patterns in Strings. 255-300
Kurt Mehlhorn, Athanasios K. Tsakalidis: Data Structures. 301-342
F. Frances Yao: Computational Geometry. 343-389
Jacob T. Schwartz, Micha Sharir: Algorithmic Motion Planning in Robotics. 391-430
Jeffrey Scott Vitter, Philippe Flajolet: Average-Case Analysis of Algorithms and Data Structures. 431-524
Jan van Leeuwen: Graph Algorithms. 525-631
Volker Strassen: Algebraic Complexity Theory. 633-672
Arjen K. Lenstra, Hendrik W. Lenstra Jr.: Algorithms in Number Theory. 673-716
Ronald L. Rivest: Cryptography. 717-755
Ravi B. Boppana, Michael Sipser: The Complexity of Finite Functions. 757-804
Nicholas Pippenger: Communication Networks. 805-834
Thomas Lengauer: VLSI Theory. 835-868
Richard M. Karp, Vijaya Ramachandran: Parallel Algorithms for Shared-Memory Machines. 869-942
Leslie G. Valiant: General Purpose Parallel Architectures. 943-972

Last update Thu May 17 01:38:17 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page