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

• α - Aho-Corasick
• algorithm - array merging
• array search - balanced quicksort
• balanced tree - binary tree
• binary tree representation of trees - bottleneck traveling salesman
• bottom-up tree automaton - bucket sort
• bucket trie - chain
• chaining - comb sort
• Commentz-Walter - Cook's theorem
• CORDIC - decomposable searching problem
• degree - digital search tree
• digital tree - double metaphone
• double right rotation - elastic-bucket trie
• element uniqueness - extendible hashing
• external chaining - FIFO
• filial-heir chain - forward index
• fractional knapsack problem - graph partition
• Gray code - height-balanced tree
• heuristic - information theoretic bound
• in-order traversal - Johnson-Trotter
• JSort - Kruskal's algorithm
• kth order Fibonacci numbers - linear hash
• linear hashing - lucky sort
• LZW compression - merge
• merge sort - move-to-front heuristic
• move-to-root heuristic - NIST
• node - occurrence
• octree - ordered binary decision diagram
• ordered linked list - partially ordered set
• partially persistent data structure - pipelined divide and conquer
• planar graph - predicate
• prefix - pth order Fibonacci numbers
• P-tree - randomized search tree
• Randomized-Select - red-black tree
• reduced basis - root balance
• rooted tree - selection sort
• select k^th element - shuffle sort
• sibling - solvable
• sort - state machine
• state transition - strongly connected component
• strongly connected graph - target
• temporal logic - towers of Hanoi
• tractable - Turing transducer
• twin grid file - universal state
• universal Turing machine - weighted graph
• window - ZPP

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

To the National Institute of Standards and Technology home page.