Skip to main content
  • Living reference work
  • © 2020

Encyclopedia of Algorithms

Editors:

(view affiliations)
  • 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, access via your institution.

Table of contents (475 entries)

  1. k-Best Enumeration

    • David Eppstein
  2. O(log logn)-Competitive Binary Search Tree

    • Chengwen Chris Wang, Daniel Sleator
  3. Active Learning - Modern Learning Theory

    • Maria-Florina Balcan, Ruth Urner
  4. Adaptive Partitions

    • Ping Deng, Weili Wu, Eugene Shragowitz, Ding-Zhu Du
  5. Additive Spanners

    • Shiri Chechik
  6. Adwords Pricing

    • Tian-Ming Bu
  7. Alternate Parameterizations

    • Neeldhara Misra
  8. AMS Sketch

    • Graham Cormode

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.

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

  • 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