Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity [Paperback]

Jan van Leeuwen (Author)

Book Description

Series: Handbook of Theoretical Computer Science | Publication Date: January 4, 1994

The Handbook of Theoretical Computer Science provides professionals and students with a comprehensive overview of the main results and developments in this rapidly evolving field. Volume A covers models of computation, complexity theory, data structures, and efficient computation in many recognized subdisciplines of theoretical computer science. Volume B takes up the theory of automata and rewriting systems, the foundations of modern programming languages, and logics for program specification and verification, and presents several studies on the theoretic modeling of advanced information processing.

The two volumes contain thirty-seven chapters, with extensive chapter references and individual tables of contents for each chapter. There are 5,387 entry subject indexes that include notational symbols, and a list of contributors and affiliations in each volume.

Editorial Reviews

Review

"This is a reference which has a place in every computer science library."
—Raymond Lauzzana, Languages of Design

"Of all the books I have covered in the Forum to date, this set is the most unique and possibly the most useful to the SIGACT community, in support both of teaching and research.... The books can be used by anyone wanting simply to gain an understanding of one of these areas, or by someone desiring to be in research in a topic, or by instructors wishing to find timely information on a subject they are teaching outside their major areas of expertise."
—Rocky Ross, SIGACT News

About the Author

Matthew Paterson is Senior Lecturer in International Relations at Keele University. He is author of Global Warming and Global Politics (1996) and Understanding Global Environmental Politics (2003), as well as many articles and book chapters on these subjects. He is currently working on cars and global environmental politics. He is Associate Editor of Global Environmental Politics. --This text refers to an out of print or unavailable edition of this title.

Product Details

• Paperback: 1006 pages
• Publisher: The MIT Press (January 4, 1994)
• Language: English
• ISBN-10: 0262720140
• ISBN-13: 978-0262720144
• Product Dimensions: 9.9 x 7 x 2 inches
• Shipping Weight: 3.8 pounds
• Average Customer Review: 4.0 out of 5 stars  See all reviews (2 customer reviews)
• Amazon Best Sellers Rank: #2,659,809 in Books (See Top 100 in Books)

Customer Reviews

Most Helpful Customer Reviews

5 of 5 people found the following review helpful:

5.0 out of 5 stars A book well worth putting on your shelf., August 30, 1999

By A Customer

This review is from: Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity (Paperback)

This book is a collection of articles on complexity theory written by a number of very competent authors. The article by Li/Vitanyi on Kolmogorov complexity and the article by Aho on pattern matching in strings stand out in particular. All articles however are very well written and packed full of useful information, even for readers who are mainly interested in applications. Extensive references are found at the end of each article, lightening the burden of doing further reading on the topics.

2 of 2 people found the following review helpful:

3.0 out of 5 stars Just what you expect from a handbook, April 1, 2003

By 

Ashish Batra (Woodstock, IL United States) - See all my reviews
(REAL NAME)   

This review is from: Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity (Hardcover)

This is probably the best or may be the only handbook on theeretical computer science. If one wants to get a good idea on any topic in this field, just open the book and you do not have to run around looking into different books.

On the other hand, this is a huge field, and no handbook can put all of this in one book. I found that many topics that I was looking in were not in good detail at all. For instance I was looking in Fortune's voronoi construction, the terse way of explaining things does not give the reader enough insight.