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.
Note: Many, but not all, of the definitions in the Dictionary of Algorithms and Data Structures are in the public domain, since they were written by employees of the U.S. Federal Government acting as agents of the government. However, some are contributed by outside contributors, and are therefore not in the public domain. Please only submit material from this work to Wikipedia when you have confirmed that this particular item is in the public domain.
This list of terms was originally derived from the index of this document, and should be 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:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
- OBDD
- objective function
- occurrence
- octree
- off-line algorithm
- offset
- omega
- omicron
- one-based indexing
- one-dimensional
- online algorithm
- open addressing
- optimal
- optimal cost
- optimal hashing
- optimal merge
- optimal mismatch
- optimal polygon triangulation problem
- optimal polyphase merge
- optimal polyphase merge sort
- optimal solution
- optimal triangulation problem
- optimal value
- optimization problem
- or
- oracle set
- oracle tape
- oracle Turing machine
- order
- ordered array
- ordered binary decision diagram
- ordered linked list
- ordered tree
- order preserving hash
- order preserving minimal perfect hashing
- oriented acyclic graph
- oriented graph
- oriented tree
- orthogonal drawing
- orthogonal lists
- orthogonally convex rectilinear polygon
- oscillating merge sort
- out-branching
- out-degree
- overlapping subproblems
P
Q
R
S
T
U
V
W
X
Y
Z
Last updated: 08-25-2005 08:36:28
