Reflects recent developments in its emphasis on randomized and approximation algorithms and communication models

All topics are considered from an algorithmic point of view stressing the implications for algorithm design

This book assembles some of the most important problems and solutions in theoretical computer science-from computability, logic, circuit theory, and complexity. The book presents these important results with complete proofs in an understandable form. It also presents previously open problems that have found (perhaps unexpected) solutions, and challenges the reader to pursue further active research in computer science.

Reflects recent developments in its emphasis on randomized and approximation algorithms and communication models

All topics are considered from an algorithmic point of view stressing the implications for algorithm design