Complexity Theory: Exploring the Limits of Efficient Algorithms

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

The author is a full professor at the Computer Science Department of Dortmund University. He is the author of 8 monographs and more than 150 journal and conference articles. He was head of the German youth competition in computer science and has obtained the university medal for excellent teaching. He is an elected member of the German Academy of Sciences and was head of the committee reviewing computer research projects in Germany.