Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarHandbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, 1990
Jan van Leeuwen:
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. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 1-66 - David S. Johnson:
A Catalog of Complexity Classes. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 67-161 - Joel I. Seiferas:
Machine-Independent Complexity Theory. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 163-186 - Ming Li, Paul M. B. Vitányi:
Kolmogorov Complexity and its Applications. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 187-254 - Alfred V. Aho:
Algorithms for Finding Patterns in Strings. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 255-300 - F. Frances Yao:
Computational Geometry. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 343-389 - Jacob T. Schwartz, Micha Sharir:
Algorithmic Motion Planning in Robotics. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 391-430 - Jeffrey Scott Vitter, Philippe Flajolet:
Average-Case Analysis of Algorithms and Data Structures. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 431-524 - Jan van Leeuwen:
Graph Algorithms. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 525-631 - Volker Strassen:
Algebraic Complexity Theory. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 633-672 - Arjen K. Lenstra, Hendrik W. Lenstra Jr.:
Algorithms in Number Theory. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 673-716 - Ravi B. Boppana, Michael Sipser:
The Complexity of Finite Functions. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 757-804 - Nicholas Pippenger:
Communication Networks. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 805-834 - Richard M. Karp, Vijaya Ramachandran:
Parallel Algorithms for Shared-Memory Machines. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 869-942 - Leslie G. Valiant:
General Purpose Parallel Architectures. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 943-972
maintained by 
at 
at 
last updated on 2018-07-16 20:56 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint