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 - compact trie
- comparison sort - CORDIC
- counting sort - decidable problem
- decimation - DFTA
- diagonalization - divide and conquer
- divide and marriage before conquest - dynamic hashing
- dynamic Huffman coding - Euclid's algorithm
- Euler cycle - external node
- external quicksort - find k
^{th}least element - finitary tree - forward index
- fractional knapsack problem - graph concentration
- graph drawing - head
- heap - HyperLogLog
- IBLT - interpolation-sequential search
- interpolation sort - Karp-Rabin
- Karp reduction - k
^{th}smallest element - k²-tree - LIFO
- linear - longest common subsequence
- longest common substring - maximally connected component
- Maximal Shift - mixed integer linear program
- mode - multiway decision
- multiway merge - nondeterministic polynomial time
- nondeterministic tree automaton - 1-based indexing
- one-dimensional - order-preserving hash
- order-preserving Huffman coding - partially ordered set
- partially persistent data structure - persistent data structure
- phonetic coding - postfix traversal
- Post machine - procedure
- process algebra - quicksort
- Rabin-Karp - reachable
- rebalance - relation
- relational structure - RP
- R
^{+}-tree - self-loop - self-organizing list - shuffle sort
- sibling - Smith algorithm
- Smith-Waterman algorithm - SSTable
- stable - strictly increasing
- strictly lower triangular matrix - suffix array
- suffix automaton - threaded binary tree
- threaded tree - transitive closure
- transitive reduction - twin grid file
- twisted tabulation hashing - union
- union of automata - Viterbi algorithm
- Vitter's algorithm - 0-1 knapsack problem
- Zhu-Takaoka - ZPP

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