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- 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
- Alfred V. Aho: Algorithms for Finding Patterns in Strings. 255-300
- F. Frances Yao: Computational Geometry. 343-389
- 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
- Ronald L. Rivest: Cryptography. 717-755
- Nicholas Pippenger: Communication Networks. 805-834
- Thomas Lengauer: VLSI Theory. 835-868
- Leslie G. Valiant: General Purpose Parallel Architectures. 943-972
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team