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 - branch and bound
• breadth-first search - Byzantine generals
• cactus stack - chromatic index
• chromatic number - commutative
• compact DAWG - Cook reduction
• Cook's theorem - DAWG
• decidable language - DFS
• DFS forest - distributive partitioning sort
• divide and conquer - dynamic
• dynamic array - Euclidean Steiner tree
• Euclidean traveling salesman problem - external memory data structure
• external merge - filial-heir chain
• Find - formal methods
• formal verification - graph
• graph coloring - Hausdorff distance
• hB-tree - hyperedge
• hypergraph - interpolation search
• interpolation-sequential search - jump search
• Karnaugh map - kth order Fibonacci numbers
• k^th shortest path - LIFO
• linear - longest common substring
• Lotka's law - Maximal Shift
• maximum bipartite matching - 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 - phonetic coding
• pigeonhole sort - Post machine
• postman's sort - procedure
• process algebra - quicksort
• Rabin-Karp - rebalance
• recognizer - relational structure
• relative performance guarantee - RP
• R⁺-tree - self-loop
• self-organizing list - shuffle sort
• sibling - Smith algorithm
• Smith-Waterman algorithm - stack
• stack tree - strictly upper triangular matrix
• string - suffix tree
• superimposed code - three-way merge sort
• three-way radix quicksort - traveling salesman
• treap - 2-left hashing
• two-level grid file - universal Turing machine
• universe - weak-heap sort
• weight-balanced tree - ZPP

This page's URL is /terms2.html