This first part presents chapters on models of computation, complexity theory, data structures, and efficient computation in many recognized sub-disciplines of Theoretical Computer Science.
Author(s): Jan van Leeuwen (ed.)
Publisher: Elsevier; MIT Press
Year: 1990
Language: English
Pages: 975
City: Amsterdam
Preface, Pages i-ii
List of Contributors to Volume A, Page iii
CHAPTER 1 - Machine Models and Simulations, Pages 1,3-66
CHAPTER 2 - A Catalog of Complexity Classes, Pages 67,69-161
CHAPTER 3 - Machine-Independent Complexity Theory, Pages 163,165-186
CHAPTER 4 - Kolmogorov Complexity and its Applications, Pages 187,189-254
CHAPTER 5 - Algorithms for Finding Patterns in Strings, Pages 255,257-300
CHAPTER 6 - Data Structures, Pages 301,303-341
CHAPTER 7 - Computational Geometry, Pages 343,345-389
CHAPTER 8 - Algorithmic Motion Planning in Robotics, Pages 391,393-430
CHAPTER 9 - Average-Case Analysis of Algorithms and Data Structures, Pages 431,433-524
CHAPTER 10 - Graph Algorithms, Pages 525,527-631
CHAPTER 11 - Algebraic Complexity Theory, Pages 633,635-672
CHAPTER 12 - Algorithms in Number Theory, Pages 673,675-715
CHAPTER 13 - Cryptography, Pages 717,719-755
CHAPTER 14 - The Complexity of Finite Functions, Pages 757,759-804
CHAPTER 15 - Communication Networks, Pages 805,807-833
CHAPTER 16 - VLSI Theory, Pages 835,837-868
CHAPTER 17 - Parallel Algorithms for Shared-Memory Machines, Pages 869,871-941
CHAPTER 18 - General Purpose Parallel Architectures, Pages 943,945-971
Subject Index, Pages 973-996
