Dictionary of Algorithms and Data Structures

Dictionary of Algorithms and Data Structures

"Dictionary of Algorithms and Data Structures
This is a dictionary of algorithms, algorithmic techniques, data structures, archetypical problems, and related definitions. Algorithms include common functions, such as Ackermann's function. Problems include traveling salesman and Byzantine generals. Some entries have links to implementations and more information. Index pages list entries by area and by type. "

This is an uber geek dictionary ...

Here are just the A's...

"A
absolute performance guarantee
abstract data type
(a,b)-tree
accepting state
Ackermann's function
active data structure
acyclic directed graph
acyclic graph
adaptive heap sort
adaptive Huffman encoding
adaptive k-d tree
adaptive sort
address-calculation sort
adjacency-list representation
adjacency-matrix representation
adjacent
admissible vertex
ADT
adversary
algorithm
algorithm B
algorithm BSTW
algorithm FGK
algorithmically solvable
algorithm V
all pairs shortest path
alphabet
Alpha Skip Search algorithm
alternating path
alternating Turing machine
alternation
American flag sort
amortized cost
ancestor
and
ANSI
antichain
antisymmetric
AP
Apostolico-Crochemore
Apostolico-Giancarlo algorithm
approximate string matching
approximation algorithm
arborescence
arc
arithmetic coding
array
array index
array merging
array search
articulation vertex
assignment problem
association list
associative
associative array
asymptotically tight bound
asymptotic bound
asymptotic lower bound
asymptotic space complexity
asymptotic time complexity
asymptotic upper bound
augmenting path
automaton
average case
average-case cost
AVL tree
axiomatic semantics "