Encyclopedia of Algorithms
Editors: Kao, Ming-Yang (Ed.)
- 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
Buy this book
- eReference 367,71 €
price for China (P.R.) (gross)
- The eBook version of this title will be available soon
- ISBN 978-0-387-30162-4
- Free shipping for individuals worldwide
- About this book
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.
From the reviews:
"This book was designed to provide a comprehensive overview of developments in solving important algorithmic problems. … This encyclopedia provides an efficient reference for the definitions and key results of algorithmic problems. … The entries are in alphabetical order. There are over 300 entries and over 4,000 additional references. … In conclusion, the book is a valuable resource for theoretical computer scientists and people working in operations research and optimization." (Haris Aziz, ACM Computing Reviews, April, 2009)“This is an encyclopedia of algorithms that sets out the solutions to important algorithmic problems. It aims to be a comprehensive collection and is designed to provide quick and easy access for both students and researchers.” (Kybernetes, Vol. 38 (1/2), 2009)