the nist dictionary of algorithms and data structures is a reference work maintained by the u.s. national institute of standards and technology. it defines a large number of terms relating to algorithms and data structures. for algorithms and data structures not necessarily mentioned here, see list of algorithms and list of data structures. this list of terms was originally derived from the index of that document, and is in the public domain, as it was compiled by a federal government employee as part of a federal government work. some of the terms defined are: __notoc__  == a == * absolute performance guarantee * abstract data type (adt) * (a,b)-tree * accepting state * ackermann's function * active data structure * acyclic directed graph * adaptive heap sort * adaptive huffman coding * adaptive k-d tree * adaptive sort * address-calculation sort * adjacency-list representation * adjacency-matrix representation * adversary * algorithm * algorithm bstw * algorithm fgk * algorithmic efficiency * 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 relation * ap * apostolicoâcrochemore * apostolicoâgiancarlo algorithm * approximate string matching * approximation algorithm * arborescence * arithmetic coding * array * array index * array merging * array search * articulation point * 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 == b == * backtracking * bag * baillie-psw primality test * balanced binary search tree * balanced binary tree * balanced k-way merge sort * balanced merge sort * balanced multiway merge * balanced multiway tree * balanced quicksort * balanced tree * balanced two-way merge sort * bang file * batcher sort * baum welch algorithm * bb Î± tree * bdd * bd-tree * bellmanâford algorithm * benford's law * best case * best-case cost * best-first search * 
Algorithms_and_data_structures Lists_of_computer_terms Mathematics-related_lists