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

• α - adversary
• Aho-Corasick - arc
• arithmetic coding - balance
• balanced binary search tree - big-O notation
• binary function - blind trie
• block - branch and bound
• breadth-first search - Byzantine generals
• cactus stack - chromatic index
• chromatic number - commutative
• compact DAWG - Cook's theorem
• CORDIC - decidable problem
• decimation - DFTA
• diagonalization - divide and marriage before conquest
• division method - dynamic Huffman coding
• dynamic programming - Euler cycle
• Eulerian graph - external radix sort
• external sort - finite Fourier transform
• finite state automaton - fractional solution
• free edge - graph isomorphism
• graph partition - heapsort
• heaviest common subsequence - inclusion-exclusion principle
• inclusive or - introspective sort
• inverse Ackermann function - k-d-B-tree
• k-dimensional - Las Vegas algorithm
• lattice - linear quadtree
• linear search - map
• Markov chain - metaheuristic
• metaphone - move
• move-to-front heuristic - network flow problem
• next state - nullary function
• null tree - optimal solution
• optimal triangulation problem - packing
• padding argument - P-complete
• PCP - polychotomy
• polyhedron - preorder traversal
• primary clustering - pushdown automaton
• pushdown transducer - randomized search tree
• Randomized-Select - recursive language
• recursively enumerable language - right rotation
• right-threaded tree - search
• search tree - shaker sort
• Shannon-Fano coding - single-pair shortest-path problem
• single program multiple data - sparse graph
• sparse matrix - Steiner ratio
• Steiner tree - subadditive ergodic theorem
• subgraph - temporal logic
• terminal - tournament
• tournament sort - TST
• Turbo-BM - uniform circuit complexity
• uniform circuit family - virtual hashing
• visibility map - Zeller's congruence
• 0-ary function - ZPP

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