This introduction is brief on purpose. Here is more explanation and a search form.

- α - adversary
- Aho-Corasick - arc
- arithmetic coding - balanced binary search tree
- balanced binary tree - binary function
- binary GCD - block
- block addressing index - breadth-first search
- Bresenham's algorithm - Calculus of Communicating Systems
- calendar queue - circuit complexity
- circuit value problem - comparison sort
- competitive analysis - counting sort
- covering - decimation
- decision problem - diagonalization
- diameter - divide and marriage before conquest
- domain - dynamic Huffman coding
- dynamic programming - Euler cycle
- Eulerian graph - external quicksort
- external radix sort - finitary tree
- finite Fourier transform - fractional knapsack problem
- fractional solution - graph drawing
- graph isomorphism - heap
- heapify - ideal merge
- ideal random shuffle - intersection
- interval tree - k-ary heap
- k-ary Huffman coding - k-way merge
- k-way merge sort - linear hash
- linear hashing - lower bound
- lower triangular matrix - maximum-flow problem
- MBB - model of computation
- moderately exponential - multiway tree
- Munkres' assignment algorithm - nonterminal node
- nor - open addressing
- optimal - oriented acyclic graph
- oriented graph - partial recursive function
- partition - pile
- pipelined divide and conquer - postorder traversal
- Post's correspondence problem - proper binary tree
- proper coloring - radix tree
- ragged matrix - rectangular matrix
- rectilinear - relaxation
- relaxed balance - R-tree
- run time - semidefinite programming
- separate chaining - sift up
- signature - solvable
- sort - stack tree
- star encoding - string
- string editing problem - superimposed code
- superset - three-way merge sort
- three-way radix quicksort - traveling salesman
- treap - two-dimensional
- 2-left hashing - universal hashing
- universal state - walk
- WCET - Zipf's law
- zipper - ZPP

This page's URL is https://www.nist.gov/dads/terms2.html