Expanding on the highly successful formula of the first edition, this book now serves as the primary textbook of choice for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms.
Aimed at anyone with an interest in computation and algorithms, this comprehensive text explains underlying principles, presents the algorithms, and discusses various optimization techniques as well as the performance of a number of implementations.
The scope of this second edition of the introduction to fundamental distributed programming abstractions has been extended to cover ‘Byzantine fault tolerance’. It includes algorithms to implement these abstractions in vulnerable distributed systems.
Examining communication networks from a mathematical perspective, this volume offers an introductory overview of broadband, optical, wireless and ad hoc networks. Particular topics of interest are design, optimization, robustness and energy consumption.
Exact Exponential Algorithms provides an introduction to the area and explains the most common algorithmic techniques involved. Thorough exercises are included, in addition to notes and suggestions for further reading.
This book reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms. The coverage includes mathematical proofs for many of the given statements.