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
see more benefits

Buy this book

eReference $399.00
price for USA (gross)
  • ISBN 978-0-387-30162-4
  • Free shipping for individuals worldwide
About this Reference Work

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.

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)

Table of contents (485 chapters)

  • Abelian Hidden Subgroup Problem

    Mosca, Michele

    Pages 1-4

  • Adaptive Partitions

    Deng, Ping (et al.)

    Pages 4-7

  • Adword Auction

    Kao, Ming-Yang

    Pages 7-7

  • Adwords Pricing

    Bu, Tian-Ming

    Pages 7-9

  • Ad-Hoc Networks

    Kao, Ming-Yang

    Pages 7-7

Buy this book

eReference $399.00
price for USA (gross)
  • ISBN 978-0-387-30162-4
  • Free shipping for individuals worldwide
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Encyclopedia of Algorithms
Editors
  • Ming-Yang Kao
Copyright
2008
Publisher
Springer US
Copyright Holder
Springer-Verlag US
eReference ISBN
978-0-387-30162-4
Edition Number
1
Number of Pages
CVI, 1166
Topics