No comparable reference work on algorithms is currently available
Structured in an A-Z organization that allows easy, intuitive access for professionals and researchers interested in a particular aspect of algorithms
Includes targeted literature references that provide additional value to researchers looking to study a topic in more detail
The Encyclopedia of Algorithms provides a comprehensive set of solutions to important algorithmic problems for students and researchers, including high-impact solutions from the most recent decade.
A must-have for computer scientists, this encyclopedic reference has been edited by Ming Yang Kao, Editor-in-Chief of the top journal in the field, Algorithmica.
All of the entries have been written and peer-reviewed by experts in the field. Nearly 400 entries are organized alphabetically by problem, with subentries for distinct solutions.
Extensive cross-references support efficient, user-friendly searches for immediate access to useful information.
This defining reference is published both in print and online. The print publication includes an index of subjects and authors as well as a chronology for locating recent solutions. The online edition supplements this index with hyperlinks as well as including internal hyperlinks to related entries in the text, CrossRef citations, and links to additional significant research.
Open problems, links to downloadable code, experimental results, data sets, and illustrations are included.
Content Level »Professional/practitioner
Keywords »Algorithmica - Algorithms - All-pairs shortest paths - Approximating - Arithmetic Coding for Data Compression - Bin Packing - Communication Algorithms - Decoding - Dynamic Tree Problems - Factoring - Fully Dynamic Connectivity - Local Alignment - MRWMay2006 - Maximum - Minimum - Optimal - Randomized - Stable - Weighted Caching