Editors:
- No comparable reference work on Algorithms is currently available
- A-Z organization allows easy, intuitive access to professionals and researchers interested in a particular aspect of Algorithms
- Targeted literature references provide additional value for researchers looking to study a topic in more detail
- Useful for scholars, researchers, and professionals who work in other fields — such as mathematics, statistics, biology, economics, financial software, medical informatics, and data mining
- Editor-in-Chief is leader in field, with name recognition as EiC of top journal (Algorithmica)
- Top-quality editorial board, both scientifically and geographically diverse – ensures balanced coverage
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (485 entries)
-
Front Matter
-
A
About this book
The Encyclopedia of Algorithms will provide a comprehensive set of solutions to important algorithmic problems for students and researchers interested in quickly locating useful information. The first edition of the reference will focus on high-impact solutions from the most recent decade; later editions will widen the scope of the work.
Nearly 500 entries will be organized alphabetically by problem, with subentries allowing for distinct solutions and special cases to be listed by the year. An entry will include: a description of the basic algorithmic problem; the input and output specifications; the key results; examples of applications; citations to the key literature.
Open problems, links to downloadable code, experimental results, data sets, and illustrations may be provided. All entries will be written by experts with links to Internet sites that outline their research work will be provided. The entries will be peer-reviewed.
This defining reference will be published in print and on line. The print publication will include an index of subjects and authors as well as a chronology for locating recent solutions. The online edition will supplement this index with hyperlinks as well as include hyperlinks in the text of the entries to related entries, xRefer citations, and other useful URLs mentioned above.
Keywords
Reviews
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)Editors and Affiliations
-
Department of Electrical Engineering and Computer ScienceMcCormick School of Engineering and Applied Science, Northwestern University, Evanston, USA
Ming-Yang Kao
Bibliographic Information
Book Title: Encyclopedia of Algorithms
Editors: Ming-Yang Kao
DOI: https://doi.org/10.1007/978-0-387-30162-4
Publisher: Springer New York, NY
eBook Packages: Computer Science, Reference Module Computer Science and Engineering
Copyright Information: Springer-Verlag US 2008
eBook ISBN: 978-0-387-30162-4Published: 07 July 2008
Edition Number: 1
Number of Pages: CVI, 1166
Topics: Theory of Computation, Electrical Engineering, Applications of Mathematics, Artificial Intelligence, Computational Mathematics and Numerical Analysis