Handbook of Theoretical Computer Science : Formal Models and Semantics (Hardcover)

by Jan van Leeuwen (Editor) "The theory of finite automata has preserved from its origins a great diversity of aspects..." (more)
Key Phrases: additional bibliographic comments, database scheme design, monomorphic specification, New York, System Sci, Principles of Programming Languages (more...)

Editorial Reviews

Review
Addressing the central areas of theoretical computer science, the handbook provides the student or professional with a comprehensive perspective on the main results and developments in this field. Consisting of 37 chapters, written by American and European researchers, it will be ideally suited for study and reference. -- Current Awareness Bulletin

The editor, Jan van Leeuwen, deserves high praise for a job well done. -- S. Bloom, Zentralblatt für Mathematik

The editor, Jan van Leeuwen, deserves high praise for a job well done. -- S. Bloom, Zentralblatt für Mathematik

The volumes are an intellectual feast and a delight to read. They are excellently edited and beautifully produced. No serious researcher or self-respecting library can afford to do without them. -- S. Kaicker, Journal of Scientific& Industrial Research

Review
Addressing the central areas of theoretical computer science, the handbook provides the student or professional with a comprehensive perspective on the main results and developments in this field. Consisting of 37 chapters, written by American and European researchers, it will be ideally suited for study and reference.
Current Awareness Bulletin
S. Bloom
The editor, Jan van Leeuwen, deserves high praise for a job well done.
Zentralblatt für Mathematik


See all Editorial Reviews

Product Details

• Hardcover: 1280 pages
• Publisher: Elsevier Science; 1st repr. 1992 edition (October 1, 1990)
• Language: English
• ISBN-10: 0444880747
• ISBN-13: 978-0444880741
• Product Dimensions: 9.5 x 6.8 x 2.9 inches
• Shipping Weight: 5.4 pounds (View shipping rates and policies)
• Average Customer Review: 5.0 out of 5 stars See all reviews (1 customer review)
• Amazon.com Sales Rank: #4,023,182 in Books (See Bestsellers in Books)

Customer Reviews

Most Helpful Customer Reviews

8 of 8 people found the following review helpful:

5.0 out of 5 stars Massive collection on computer science, February 21, 2001

By	Dr. Lee D. Carlson (Baltimore, Maryland USA) - See all my reviews (TOP 100 REVIEWER)    (REAL NAME)

This review is from: Handbook of Theoretical Computer Science - 2 Vol Set (Paperback)

This collection of articles on the foundations of computer science is a nice addition addition to the literature and guides the reader to further reading on the subject. I did not read all of the chapters so I will concentrate my remarks on the ones that I did: Chapter 4 on Kolmogorov complexity puts emphasis on the applications and the authors endeavor to bring the reader quickly to the level of understanding needed for applications. The ones discussed are primarily in the area of parallel computation and branching programs. The chapter on algorithms for finding patterns in strings is nicely written and the authors do a good job of summarizing the main results. Computational biologists dealing with string matching algorithms may find the presentation very helpful. The author uses pseudocode to illustrate the main algorithms, such as Knuth-Morriss-Platt, Boyer-Moore, Aho-Corasick, and Commentx-Walter. Concrete examples are given for each of these algorithms. The chapter on computational geometry discusses the main algorithms for finding convex hulls and Voronoi diagrams are discussed in fairly good detail. Linear programming, triangulation, and point locating are given a fast treatment. The author does make use of pictures to illustrate the the algorithms. The only disappointment was that combinatorial geometry was given only a very cursory treatment. Of particular importance to me was the chapter on algorithms in number theory. Interestingly, the authors jump right into a discussion of elliptic curves and actually do a fairly good job (within 4 pages) of summarizing this massive area of mathematics. The authors return to elliptic curves in a later section on factoring integers, after discussing algorithms for finite abelian groups. The Shanks baby-step-giant-step, Pollard's rho method, the Chinese Remainder theorem, and the index calculus algorithm are discussed concisely. Elliptic curves are again used in the section on primality testing. There is a good summary of cryptography in Chapter 13, with the most interesting discussions on probabilistic encryption, "over-the-phone" poker, and zero-knowledge interactive proofs. In Volume B, those interested in the foundations of logic and functional programming, Chapter 6 on rewrite systems covers the main points. The chapter is fairly long an detailed. Functional programming and lambda calculus are contained in the next chapter with proofs given of the main results. The most interesting section is on denotational semantics. LISP is discussed a little at the end of the chapter. Chapter 10 also discusses logic programming in a fairly detailed manner. The most interesting sections are the ones on the completion of programs and deductive databases. The author ends the chapter with a brief history of logic programming. In reading this I found out that there has been work done on developing a theory of logic programming based on 3-valued logic and useful references were given. The theory of relational databases in covered in Chapter 17. This is of overwhelming importance today and the author does a decent job of outlining what relational databases are all about. The section on query optimization is particularly illuminating. Although the text is very formal and very far away from the everday practice of database management, reading it does give a deeper appreciation of the foundations of the subject. Overall, a very fine addition to the literature...I hope the publishers decide to move ahead with an updated edition.