This book is an introductory textbook on the design and analysis of algorithms. The author uses a careful selection of a few topics to illustrate the tools for

This first part presents chapters on models of computation, complexity theory, data structures, and efficient computation in many recognized sub-disciplines of

This book constitutes the refereed conference proceedings of the 12th International Conference on Algorithms and Complexity, CIAC 2019, held as a virtual event,

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.

Computability and complexity theory are two central areas of research in theoretical computer science. This book provides a systematic, technical development of