Cover for Algorithms and Complexity

Algorithms and Complexity

A volume in Handbook of Theoretical Computer Science

Book1990

Edited by:

JAN VAN LEEUWEN

Algorithms and Complexity

A volume in Handbook of Theoretical Computer Science

Book1990

 

Cover for Algorithms and Complexity

Edited by:

JAN VAN LEEUWEN

Browse this book

Book description

This first part presents chapters on models of computation, complexity theory, data structures, and efficient computation in many recognized sub-disciplines of Theoretical Computer ... read full description

Browse content

Table of contents

Actions for selected chapters

Select all / Deselect all

  1. Full text access
  2. Book chapterAbstract only

    CHAPTER 1 - Machine Models and Simulations

    Peter van EMDE BOAS

    Pages 1-66

  3. Book chapterAbstract only

    CHAPTER 2 - A Catalog of Complexity Classes

    David S. JOHNSON

    Pages 67-161

  4. Book chapterAbstract only

    CHAPTER 3 - Machine-Independent Complexity Theory

    Joel I. SEIFERAS

    Pages 163-186

  5. Book chapterAbstract only

    CHAPTER 4 - Kolmogorov Complexity and its Applications

    Ming LI and Paul M.B. VITÁNYI

    Pages 187-254

  6. Book chapterAbstract only

    CHAPTER 5 - Algorithms for Finding Patterns in Strings

    Alfred V. AHO

    Pages 255-300

  7. Book chapterAbstract only

    CHAPTER 6 - Data Structures

    K. MEHLHORN and A. TSAKALIDIS

    Pages 301-341

  8. Book chapterAbstract only

    CHAPTER 7 - Computational Geometry

    F. Frances YAO

    Pages 343-389

  9. Book chapterAbstract only

    CHAPTER 8 - Algorithmic Motion Planning in Robotics

    Jacob T. SCHWARTZ and Micha SHARIR

    Pages 391-430

  10. Book chapterAbstract only

    CHAPTER 9 - Average-Case Analysis of Algorithms and Data Structures

    Jeffrey Scott VITTER and Philippe FLAJOLET

    Pages 431-524

  11. Book chapterAbstract only

    CHAPTER 10 - Graph Algorithms

    J. van LEEUWEN

    Pages 525-631

  12. Book chapterAbstract only

    CHAPTER 11 - Algebraic Complexity Theory

    Volker STRASSEN

    Pages 633-672

  13. Book chapterAbstract only

    CHAPTER 12 - Algorithms in Number Theory

    A.K. LENSTRA and H.W. LENSTRA

    Pages 673-715

  14. Book chapterAbstract only

    CHAPTER 13 - Cryptography

    Ronald L. RIVEST

    Pages 717-755

  15. Book chapterAbstract only

    CHAPTER 14 - The Complexity of Finite Functions

    Ravi B. BOPPANA and Michael SIPSER

    Pages 757-804

  16. Book chapterAbstract only

    CHAPTER 15 - Communication Networks

    Nicholas PIPPENGER

    Pages 805-833

  17. Book chapterAbstract only

    CHAPTER 16 - VLSI Theory

    Thomas LENGAUER

    Pages 835-868

  18. Book chapterAbstract only

    CHAPTER 17 - Parallel Algorithms for Shared-Memory Machines

    Richard M. KARP and Vijaya RAMACHANDRAN

    Pages 869-941

  19. Book chapterAbstract only

    CHAPTER 18 - General Purpose Parallel Architectures

    L.G. VALIANT

    Pages 943-971

  20. Book chapterNo access

    Subject Index

    Pages 973-996

About the book

Description

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.

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.

Details

ISBN

978-0-444-88071-0

Language

English

Published

1990

Copyright

Copyright © 1990 Elsevier B.V. All rights reserved.

Imprint

Elsevier Science

You currently don’t have access to this book, however you can purchase separate chapters directly from the table of contents or buy the full version.

Purchase the book

Editors

JAN VAN LEEUWEN

Utrecht University, The Netherlands