An English Persian Dictionary of Algorithms and Data Structures
a
a
zarrabi basu ac ir ghodsi sharif edu
algorithm B A
all pairs shortest path
absolute p erformance guarantee
b
alphab et
abstract data typ e
alternating path
accepting state
alternating Turing machine
d
Ackerman s function
alternation
d
Ackermann s function
amortized cost
acyclic digraph
amortized worst case
acyclic directed graph
ancestor
d
acyclic graph
and
ANSI
b
adaptivek dtree
antichain
antisymmetric
address calculation sort
approximation algorithm
adjacency list representation
arc
adjacency matrix representation
array
array index
adjacency list
array merging
adjacency matrix
articulation p oint
d
adjacent
articulation vertex
d
b
admissible vertex
assignmentproblem
adversary
asso ciation list
algorithm
asso ciative
binary function asso ciative array
binary GCD algorithm asymptotic b ound
binary insertion sort asymptotic lower b ound
binary priority queue asymptotic space complexity
binary relation
binary search asymptotic time complexity
binary trie asymptotic upp er b ound
c
bingo sort asymptotically equal to
bipartite graph asymptotically tightbound
bipartite matching augmenting path
bisector automaton
bit vector automaton simulation
blo ck average case
blo cking ow average case cost
blossom AVL tree
c c
b o olean
b o olean expression
B
b o olean function
B tree
b ottleneck traveling salesman
bag
b ottom up radix sort
balance
b ottom up tree automaton
balanced binary searchtree
b oundary based representation
balanced binary tree
balanced k way merge sort
b ounded queue
k
b ounded stack
balanced merge sort
branch and b ound
balanced multiway merge
branching
balanced no de
breadth rst search
a
balanced quicksort
Bresenham s algorithm
balanced two way merge sort
bricksort
bridge
Bellman Ford algorithm
British Museum algorithm
Benford s law
brute force
b est case
BSP tree
b est case cost
b est rst search
a
bucket
biconnected comp onent
b
bucket array
biconnected graph
bidirectional bubble sort
bucketing metho d
e
big O notation
c
Byzantine Agreement Problem
bin sort
comp etitive ratio
complement Byzantine generals
complete binary tree
complete graph
C
complete tree
Calculus of Communicating Systems
complexity
complexity class
canonical complexity class
computable
computable function
capacitated facility lo cation
concave function
concurrent ow
capacity
con guration
capacity constraint
conjunction
cell prob e mo del
connected comp onent
b
cellular automaton
connected graph
centroid
coNP
c
certi cate
constant function
chain
continuous knapsack problem
child
Chinese p ostman problem
Co ok s theorem
Chinese remainder theorem
Co ok reduction
Christo des algorithm
critical path problem
Christo des heuristic
cut
chromatic index
b
cut vertex
chromatic number
cutting plane
Church Turing thesis
cutting theorem
circuit
cycle
circuit complexity
circuit value problem
D
circular list
DAG shortest paths circular path
circular queue
data structure clique
database clique problem
decidable collective recursion
decidable language collision
decision problem comb sort
decision tree Communicating Sequential Pro cesses
decomp osable searching problem
commutative
degree comparison sort
comp etitive analysis
distributional complexity degree k graph k
divide and conquer delete
divide and marriage b efore conquest dense graph
depth
domain depth rst search
a
Do omsday rule deque
double direction bubble sort derangement
descendant
double hashing deterministic
double rotation deterministic algorithm
doubly ended queue deterministic nite automaton
c
doubly linked list
dual deterministic nite state automaton
dynamic
dynamic array deterministic nite state machine
dynamic hashing
dynamic programming deterministic nite tree automaton
dynamic tree
dynamization transformation deterministic pushdown automaton
deterministic tree automaton
E
Deutsch Jozsa algorithm
edge
DFS forest
a
edge coloring
diagonalization
edge connectivity
diameter
edge crossing
dictionary
e ciency
di erence
element uniqueness
digraph
EM data structure
Dijkstra s algorithm
Euclid s algorithm
diminishing increment sort
Euclidean algorithm
dining philosophers
Euclidean distance
directed acyclic graph
Euclidean Steiner tree
directed acyclic subsequence graph
Euclidean traveling salesman problem
directed graph
Euler cycle
discrete p center p
Euler tour
disjoint set data structure
Eulerian graph
Eulerian path
disjoint set forest
exchange sort
disjointset
exclusiveor
disjunction
existential state
distribution sort
expander graph
formal language exp onential
formal metho ds extended Euclid s algorithm
formal veri cation
fractal external memory algorithm
fractional knapsack problem
external memory data structure
fractional solution
free edge external merge
b
free vertex external merge sort
full array external quicksort
full binary tree external radix sort
fully dynamic graph problem external sort
f e
extreme p oint
c
fully p ersistent data structure
F
fully p olynomial approximation scheme
facility lo cation
f
function
feasible region
fuzzy edge
feasible solution
fuzzy graph
feedbackedge
fuzzy no de
Ferguson Forcade algorithm
fuzzy set
e
Fib onacci number
G
Fib onacci numbers
gamma function nite automaton
geometric optimization problem nite Fourier transform
nite state automaton
global optimum nite state machine
graph nite state machine minimization
graph drawing nite state transducer
graph isomorphism rst in rst out
graph partition xed grid metho d
c
greatest common denominator ash sort
ow
greatest common divisor ow conservation
ow function
greedy algorithm ownetwork
greedy heuristic Floyd Warshall algorithm
grid drawing Ford Bellman
c
Grover s algorithm Ford Fulkerson metho d
c
forest
interactive pro of system H
interior based representation
halting problem
internal no de
Hamiltonian cycle
internal path
hash
internal sort
hash function
interp olation sort
intersection
Hausdor distance
head
intractable
heap sort
intro sort
Herter Heighway Dragon
c
introsp ection sort
heuristic
introsp ectivesort
hidden Markovmodel
irre exive
histogram sort
isomorphic
homeomorphic
iteration
homomorphic
horizontal visibility map
J
Horner s rule
j sort j
hyp eredge
Johnson s algorithm
hyp ergraph
K
I
k coloring k
ideal merge
k dimensional k
implication
k way merge k
implies
k way merge sort k
in branching
Karnaugh map
in degree
Karp reduction
in order traversal
key
in place merging
Ko enigsb erg bridges
in place sort
Ko enigsb erg bridges problem
inclusion exclusion principle
a
inclusiveor
Kolmogorov complexity
incompressible string
Kraft s inequality
indep endentset
Kripke structure
c
information theoretic b ound
Kruskal s algorithm
inorder traversal
kth order Fib onacci numbers
insertion sort
e
k
instantaneous description
e
kth shortest path k
integer multi commo dity ow
KV diagram
c
integer p olyhedron
median L
memoization
l reduction l
merge
lab eled graph
merge sort
language
meromorphic function
last in rst out
min
lattice
minimal antichain decomp osition
layered digraph
layered graph
minimum b ounding b ox
least common multiple
linear
minimum co de spanning tree
linear insertion sort
e
linear order
minimum cost spanning tree
linear probing sort
linear pro duct
minimum cut
link
minimum spanning tree
linked list
b
minimum vertex cut
list
mo de
e
e
little o notation
c
mo del checking
Lm distance Lm
mo del of computation
logarithmic
mo derately exp onential
Lotka s law
monotonically decreasing
lower b ound
monotonically increasing
lower triangular matrix
Mo ore machine
move
M
multi commo dity ow
multi set
Manhattan distance
multigraph
many one reduction
multiway decision
Markovchain
multiway merge
matched edge
b
matched vertex
matching
N
matrix
n ary function n
max
NC many one reducibility
maximal indep endentset
maximally connected comp onent
nearest neighb or search
b
maximum ow problem
negation
maximum bipartite matching
network ow
network ow problem
Mealy machine
next state
mean
NIST
b
optimal triangulation problem no de
nonbalanced merge
optimal value nonbalanced merge sort
optimization problem nondeterministic
or nondeterministic algorithm
oracle set nondeterministic nite automaton
oracle tap e
oracle Turing machine nondeterministic nite state machine
order
ordered binary decision diagram nondeterministic nite tree automaton
ordered linked list nondeterministic p olynomial time
oriented acyclic graph
oriented graph nondeterministic tree automaton
orthogonal drawing
orthogonally convex rectilinear p olygon nondeterministic Turing machine
f
oscillating merge sort noniterativemerge
out branching not
out degree NP complete language
nullary function
P
O
p way merge sort p
e
padding argument O
c
e
parametric searching
O notation
c
partial function
e
o notation
c
partial order
ob jective function
partial recursive function
o line algorithm
partially decidable problem
e
omega
f
e
omicron
partially dynamic graph problem
on line algorithm
one dimensional
e
partially ordered set
optimal
partially p ersistent data structure
optimal cost
optimal merge
path
optimal p olygon triangulation problem
p erfect matching
p erformance guarantee
optimal p olyphase merge
p erformance ratio
optimal p olyphase merge sort
p ersistent data structure
planar graph
optimal solution
planar straight line graph
pseudorandom number
pth order Fib onacci numbers planarity
e
p planarization
f
pointer machine
purely functional language
p oissonization
pushdown automaton
p olyhedron
pushdown transducer
p olylogarithmic
p olynomial
Q
p olynomial time algorithm
qsort q
qm sort qm
p olynomial time approximation scheme
quadtree complexity theorem
p olynomial time Church Turing thesis
quantum computation
queue
p olynomial time reduction
quick sort
p olynomial approximation scheme
quicksort
p olynomial hierarchy
p olynomial time
R
p olyphase merge
r e language
p olyphase merge sort
radix sort
p oset
ragged matrix
Post s corresp ondence problem
random access machine
p ostman s sort
random number
p otential function
random numb er generator
Prim s algorithm
randomization
primitive recursive
randomized algorithm
priority queue
randomized complexity
prisoner s dilemma
randomized rounding
probabilistic algorithm
range
e
probabilistic Turing machine
range sort
reachable
probabilistically checkable pro of
recognizer
rectangular matrix
pro cedure
rectilinear
pro cess algebra
rectilinear distance
prop er
rectilinear Steiner tree
prop er coloring
recurrence equations
prop er subset
recurrence relation
prune and search
recurrences
pseudo random numb er generator
recursion
a
recursion termination
simple merge recursion tree
simple path recursive
simulation theorem recursive data structure
single destination shortest path problem recursive language
recursively enumerable language
single pair shortest path problem
b
reduced basis
single source shortest path problem reduced digraph
b
reduction
singly linked list re exive
singularity analysis regular decomp osition
sink relation
sink sort relational structure
sinking sort relative p erformance guarantee
skew symmetry
slop e selection relaxation
solvable rescalable
sorting algorithm restricted universe sort
b
rho approximation algorithm rho
source
Rice s metho d
space constructible function
rough graph
sparse graph
run time
sparsi cation
square matrix
S
square ro ot
s t cut t s
stable
saturated edge
stack
stack tree
self lo op
star shap ed p olygon
separation theorem
start state
set
state
set complement
state machine
set di erence
state transition
set intersection
Steiner minimum tree
set union
Steiner p oint
shared memory
Steiner ratio
shell sort
Steiner tree
Shell sort
b
Steiner vertex
Shor s algorithm
Stirling s approximation
shortest path
Stirling s formula
shortest spanning tree
sto oge sort
Sierpinski triangle
straight line drawing
signature
f f
strictly decreasing
f
tour strictly increasing
tractable strictly lower triangular matrix
f
transducer
transition strictly upp er triangular matrix
f
transition function
transitive string
f
transitive reduction strongly connected graph
c
traveling salesman subadditive ergo dic theorem
traveling salesman problem
subgraph
travelling salesman subgraph isomorphism
tree automaton subset
tree sort su x automaton
triangle inequality sup erset
d
c
triconnected graph sup ersink
d
trinary function sup ersource
d
Turing machine symmetric
Turing reduction symmetric set di erence
Turing transducer symmetrically linked list
two dimensional
e
two way linked list
c
T
two way list
tail
e
two way merge sort
tail recursion
temp oral logic
U
terminal
unary function text
uncomputable function theta
c
uncomputable problem three dimensional
e
undecidable three way merge sort
undecidable language time space complexity
undecidable problem top down radix sort
undirected graph top down tree automaton
uniform circuit complexity
c
uniform circuit family top sort
uniform matrix top ological order
union top ological sort
union of automata total function
universal state total order
f
universal Turing machine totally decidable problem
universe totally undecidable problem
unsolvable
visibility map unsolvable problem
visible unsorted list
Viterbi algorithm upp er triangular matrix
W V
walk vehicle routing problem
weak heap sort Veitch diagram
weighted graph Venn diagram
b
weighted directed graph vertex
b
worst case vertex coloring
b
worst case cost vertex connectivity
b
vertex cover
b
vertex set
X
vertical visibility map
xor
b
vertices