Dictionary of Algorithms and Data Structures (DADS)

The Dictionary of Algorithms and Data Structures (DADS) is an online, publicly accessible dictionary of generally useful algorithms, data structures, algorithmic techniques, archetypal problems, and related definitions. In addition to brief definitions, some entries have links to related entries, links to implementations, and additional information. DADS is meant to be a resource for the practicing programmer, although students and researchers may find it a useful starting point. DADS has fundamental entries in areas such as theory, cryptography and compression, graphs, trees, and searching, for instance, Ackermann's function, quick sort, traveling salesman, big O notation, merge sort, AVL tree, hash table, and Byzantine generals. DADS also has index pages that list entries by area and by type. Currently DADS does not include algorithms particular to business data processing, communications, operating systems or distributed algorithms, programming languages, AI, graphics, or numerical analysis.

Data and Resources

Field Value
accessLevel public
bureauCode {006:55}
catalog_@context https://project-open-data.cio.gov/v1.1/schema/data.json
catalog_conformsTo https://project-open-data.cio.gov/v1.1/schema
catalog_describedBy https://project-open-data.cio.gov/v1.1/schema/catalog.json
identifier FDB59097469D5200E043065706813E54165
landingPage https://data.nist.gov/od/id/mds2-165
language {en}
modified 2022-03-14 00:00:00
programCode {006:052}
publisher National Institute of Standards and Technology
resource-type Dataset
rights Some definitions are copyright CRC Press, such as depoissonization. You must get CRC Press permission for those. All others are public domain. Most of the definitions, as well as the site itself, were originally developed at NIST.
source_datajson_identifier true
source_hash 4cac2fec148b0a0b153816164a447f2d04d92daf
source_schema_version 1.1
theme {"Information Technology:Software research","Software testing","Software performance","Software assurance"}
Groups
  • AmeriGEOSS
  • National Provider
  • North America
Tags
  • algorithmic-techniques
  • algorithms
  • amerigeo
  • amerigeoss
  • ckan
  • data-structures
  • geo
  • geoss
  • national
  • north-america
  • united-states
isopen False
license_id notspecified
license_title License not specified
maintainer Paul E. Black
maintainer_email paul.black@nist.gov
metadata_created 2025-11-22T21:58:43.058721
metadata_modified 2025-11-22T21:58:43.058725
notes The Dictionary of Algorithms and Data Structures (DADS) is an online, publicly accessible dictionary of generally useful algorithms, data structures, algorithmic techniques, archetypal problems, and related definitions. In addition to brief definitions, some entries have links to related entries, links to implementations, and additional information. DADS is meant to be a resource for the practicing programmer, although students and researchers may find it a useful starting point. DADS has fundamental entries in areas such as theory, cryptography and compression, graphs, trees, and searching, for instance, Ackermann's function, quick sort, traveling salesman, big O notation, merge sort, AVL tree, hash table, and Byzantine generals. DADS also has index pages that list entries by area and by type. Currently DADS does not include algorithms particular to business data processing, communications, operating systems or distributed algorithms, programming languages, AI, graphics, or numerical analysis.
num_resources 1
num_tags 11
title Dictionary of Algorithms and Data Structures (DADS)