Skip to main content

Encyclopedia of Algorithms

  • Living reference work
  • © 2020


  • 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

This is a preview of subscription content, log in via an institution to check access.

Access this book

Other ways to access

Licence this eBook for your library

Institutional subscriptions

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.

Table of contents (475 entries)


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

  • Dept. Electrical Engineering & Computer Science, Northwestern University, Evanston, USA

    Ming-Yang Kao

About the editor

Ming-Yang  Kao is Professor of Computer Science at the Northwestern University, Evanston. He got a B.S. in Mathematics, 1978 at the National Taiwan University, Republic of China (Taiwan) and his Ph.D. in Computer Science, 1986, at Yale University, USA.
Prof. Kao studies the design, analysis and implementation of algorithms. His work spans a broad range of applications including bioinformatics, computational finance, electronic commerce, and nanotechnology. Kao's most recent research includes work on DNA self-assembly, variants of the traveling salesman problem, and graph labeling problems.

Kao heads the EECS Computing, Algorithms & Applications Division and is the editor-in-chief of Algorithmica.

Bibliographic Information

Publish with us