Buch, Englisch, 1003 Seiten, Format (B × H): 175 mm x 245 mm, Gewicht: 1970 g
Volume a
Buch, Englisch, 1003 Seiten, Format (B × H): 175 mm x 245 mm, Gewicht: 1970 g
ISBN: 978-0-444-88071-0
Verlag: Elsevier Science
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.
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik Mathematik Mathematik Allgemein Grundlagen der Mathematik
- Mathematik | Informatik Mathematik Mathematische Analysis Variationsrechnung
- Mathematik | Informatik Mathematik Operations Research Graphentheorie
- Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
Weitere Infos & Material
Machine Models and Simulations (P. van Emde Boas). A Catalog of Complexity Classes (D.S. Johnson). Machine-Independent Complexity Theory (J.I. Seiferas). Kolmogorov Complexity and its Applications (M. Li, P.M.B. Vitányi). Algorithms for Finding Patterns in Strings (A.V. Aho). Data Structures (K. Mehlhorn, A. Tsakalidis). Computational Geometry (F.F. Yao). Algorithmic Motion Planning in Robotics (J.T. Schwartz, M. Sharir). Average-Case Analysis of Algorithms and Data Structures (J.S. Vitter, Ph. Flajolet). Graph Algorithms (J. van Leeuwen). Algebraic Complexity Theory (V. Strassen). Algorithms in Number Theory (A.K. Lenstra, H.W. Lenstra Jr.). Cryptography (R. Rivest). The Complexity of Finite Functions (R.B. Boppana, M. Sipser). Communication Networks (N. Pippenger). VLSI Theory (Th. Lengauer). Parallel Algorithms for Shared-Memory Machines (R.M. Karp, V. Ramachandran). General Purpose Parallel Architectures (L.G. Valiant). Subject Index.
