Algorithms and Data Structures

ρ-approximation algorithm

0-based indexing

2-choice hashing

Absolute performance guarantee

Abstract data type

Accepting state

Ackermann's function

Active data structure

Acyclic directed graph

Adaptive heap sort

Adaptive Huffman coding

Adaptive k-d tree

Address-calculation sort

Adjacency-list representation

Adjacency-matrix representation

Admissible vertex

Algorithmically solvable

All pairs shortest path

All simple paths

Alpha Skip Search algorithm

Alternating path

Alternating Turing machine

American flag sort

Apostolico-Crochemore

Apostolico-Giancarlo algorithm

Approximate string matching

Approximation algorithm

Arithmetic coding

Articulation point

Assignment problem

Association list

Associative array

Asymptotic bound

Asymptotic lower bound

Asymptotic space complexity

Asymptotic time complexity

Asymptotic upper bound

Asymptotically tight bound

Augmenting path

Average-case cost

Axiomatic semantics

Balanced binary search tree

Balanced binary tree

Balanced k-way merge sort

Balanced merge sort

Balanced multiway merge

Balanced multiway tree

Balanced quicksort

Balanced two-way merge sort

Baum Welch algorithm

Bellman-Ford algorithm

Best-first search

Biconnected component

Biconnected graph

Bidirectional bubble sort

Bin packing problem

Binary function

Binary insertion sort

Binary knapsack problem

Binary priority queue

Binary relation

Binary search tree

Binary tree representation of trees

Bipartite graph

Bipartite matching

Block addressing index

Boolean expression

Boolean function

Boruvka's algorithm

Bottleneck traveling salesman

Bottom-up tree automaton

Boundary-based representation

Bounded error probability in polynomial time

Boyer-Moore-Horspool

Branch and bound

Breadth-first search

Bresenham's algorithm

British Museum technique

Brute force string search

Brute force string search with mismatches

Bucketing method

Burrows-Wheeler transform

Byzantine generals

Calculus of Communicating Systems

Candidate consistency testing

Candidate verification

Canonical complexity class

Capacitated facility location

Capacity constraint

Cascade merge sort

Cell probe model

Cellular automaton

Chinese postman problem

Chinese remainder theorem

Christofides algorithm

Chromatic index

Chromatic number

Circuit complexity

Circuit value problem

Clustering free

Coalesced chaining

Collatz problem

Collective recursion

Collision resolution scheme

Communicating Sequential Processes

Comparison sort

Competitive analysis

Competitive ratio

Complete binary tree

Completely connected graph

Complexity class

Concave function

Concurrent flow

Concurrent read, concurrent write

Concurrent read, exclusive write

Confluently persistent data structure

Connected components

Connected graph

Constant function

Continuous knapsack problem

Critical path problem

Cutting stock problem

Cutting theorem

DAG shortest paths

Decidable language

Decision problem

Decomposable searching problem

Depoissonization

Depth-first search

Deterministic algorithm

Deterministic finite automata string search

Deterministic finite automaton

Deterministic finite tree automaton

Deterministic pushdown automaton

Deterministic tree automaton

Deutsch-Jozsa algorithm

Diagonalization

Dichotomic search

Digital search tree

Dijkstra's algorithm

Diminishing increment sort

Dining philosophers

Direct chaining

Discrete p-center

Distribution sort

Distributional complexity

Distributive partitioning sort

Divide and conquer

Divide and marriage before conquest

Division method

Dominance tree sort

Double left rotation

Double metaphone

Double right rotation

Double-ended priority queue

Doubly linked list

Dual linear program

Dutch national flag

Dynamic hashing

Dynamic programming

Dynamization transformation

Easy split, hard merge

Edge connectivity

Edge-weighted graph

Elastic-bucket trie

Element uniqueness

Euclidean algorithm

Euclidean distance

Euclidean Steiner tree

Euclidean traveling salesman problem

Exact string matching

Exhaustive search

Existential state

Expandable hashing

Extended binary tree

Extended Euclid's algorithm

Extended k-d tree

Extendible hashing

External chaining

External memory algorithm

External memory data structure

External quicksort

External radix sort

Extrapolation search

Facility location

Fast fourier transform

Feasible region

Feasible solution

Feedback edge set

Feedback vertex set

Ferguson-Forcade algorithm

Fibonacci number

Fibonaccian search

Finite Fourier transform

Finite state automaton

Finite state machine minimization

Finite state transducer

First come, first served

First-in, first-out

Fisher-Yates shuffle

Fixed-grid method

Flow conservation

Floyd-Warshall algorithm

Ford-Fulkerson method

Forest editing problem

Formal language

Formal verification

Fractional solution

Frequency count heuristic

Full binary tree

Full inverted index

Fully dynamic graph problem

Fully persistent data structure

Fully polynomial approximation scheme

Galil-Giancarlo

Geometric optimization problem

Graph concentration

Graph isomorphism

Graph partition

Greedy algorithm

Greedy heuristic

Grover's algorithm

Halting problem

Hamiltonian cycle

Hamiltonian path

Hamming distance

Hard split, easy merge

Hash table delete

Hausdorff distance

Heaviest common subsequence

Height-balanced binary search tree

Height-balanced tree

Hidden Markov model

Horizontal visibility map

Hungarian algorithm

Hybrid algorithm

In-order traversal

Inclusion-exclusion principle

Incompressible string

Incremental hashing

Independent set

Information theoretic bound

Integer linear program

Integer multi-commodity flow

Integer polyhedron

Interactive proof system

Interior-based representation

Interpolation-sequential search

Inverted file index

Johnson's algorithm

Johnson-Trotter

K-ary Huffman coding

K-connected graph

K-dominant match

K-way merge sort

Karmarkar's algorithm

Kolmogorov complexity

Kraft's inequality

Kripke structure

Kruskal's algorithm

Kth order Fibonacci numbers

Las Vegas algorithm

Last-in, first-out

Lempel-Ziv-Welch

Level-order traversal

Lexicographical order

Linear congruential generator

Linear probing sort

Linear quadtree

List contraction

Little-o notation

Local alignment

Longest common substring

Lower triangular matrix

Lowest common ancestor

Malhotra-Kumar-Maheshwari blocking flow

Manhattan distance

Many-one reduction

Matrix-chain multiplication problem

Max-heap property

Maximal independent set

Maximally connected component

Maximum-flow problem

Min-heap property

Minimal perfect hashing

Minimum path cover

Minimum spanning tree

Minimum vertex cut

Mixed integer linear program

Model of computation

Moderately exponential

Monotone priority queue

Monotonically decreasing

Monotonically increasing

Monte Carlo algorithm

Move-to-front heuristic

Move-to-root heuristic

Multi suffix tree

Multi-commodity flow

Multikey Quicksort

Multilayer grid file

Multiplication method

Multiprocessor model

Multiway decision

Multiway search tree

NC many-one reducibility

Nearest neighbor

Nonbalanced merge

Nonbalanced merge sort

Nondeterministic

Nondeterministic algorithm

Nondeterministic polynomial time

Nondeterministic tree automaton

Nondeterministic Turing machine

NP-complete language

Nullary function

Objective function

Off-line algorithm

On-line algorithm

One-based indexing

One-dimensional

Open addressing

Optimal hashing

Optimal mismatch

Optimal polygon triangulation problem

Optimal polyphase merge

Optimal polyphase merge sort

Optimal solution

Optimal triangulation problem

Optimization problem

Oracle Turing machine

Order preserving minimal perfect hashing

Ordered linked list

Orthogonal drawing

Orthogonal lists

Orthogonally convex rectilinear polygon

Oscillating merge sort

Padding argument

Parallel computation thesis

Parallel prefix computation

Parallel random-access machine

Parametric searching

Partial function

Partial recursive function

Partially decidable problem

Partially dynamic graph problem

Partially ordered set

Partially persistent data structure

Passive data structure

Path system problem

Pattern element

Perfect binary tree

Perfect matching

Perfect shuffle

Performance guarantee

Performance ratio

Persistent data structure

Phonetic coding

Pipelined divide and conquer

Planar straight-line graph

Pointer jumping

Pointer machine

Polylogarithmic

Polynomial approximation scheme

Polynomial hierarchy

Polynomial time

Polynomial-time reduction

Polyphase merge

Polyphase merge sort

Postfix traversal

Potential function

Prefix computation

Prefix traversal

Prim-Jarnik algorithm

Primary clustering

Primitive recursive

Principle of optimality

Prisoner's dilemma

Probabilistic algorithm

Probabilistic Turing machine

Probabilistically checkable proof

Process algebra

Proper coloring

Purely functional language

Pushdown transducer

Quadratic probing

Quadtree complexity theorem

Quantum computation

Random access machine

Random number generator

Random sampling

Randomized algorithm

Randomized complexity

Randomized polynomial time

Randomized rounding

Randomized search tree

Randomized-Select

Ratcliff/Obershelp pattern recognition

Rectangular matrix

Rectilinear Steiner tree

Recurrence equations

Recursion termination

Recursive data structure

Recursively enumerable language

Reduced digraph

Reduced ordered binary decision diagram

Regular decomposition

Relational structure

Relaxed balance

Repeated squaring

Restricted universe sort

Reverse Colussi

Right-threaded tree

Search tree property

Secondary clustering

Select and partition

Selection problem

Self-organizing heuristic

Self-organizing list

Self-organizing sequential search

Semidefinite programming

Separation theorem

Shadow merge insert

Shannon-Fano coding

Shor's algorithm

Shortest common supersequence

Shortest common superstring

Sieve of Eratosthenes

Simon's algorithm

Simple uniform hashing

Simulated annealing

Simulation theorem

Single program multiple data

Single-destination shortest-path problem

Single-source shortest-path problem

Singularity analysis

Slope selection

Smith algorithm

Smith-Waterman algorithm

Space-constructible function

Star-shaped polygon

Stirling's approximation

Stirling's formula

Straight-line drawing

Strictly decreasing

Strictly increasing

Strictly lower triangular matrix

Strictly upper triangular matrix

String editing problem

String matching on ordered alphabets

String matching with mismatches

Strongly connected component

Strongly connected graph

Strongly NP-hard

Subadditive ergodic theorem

Subgraph isomorphism

Sublinear time algorithm

Suffix automaton

Superimposed code

Symmetric set difference

Symmetry breaking

Ternary search tree

Threaded binary tree

Three-dimensional

Three-way merge sort

Time-constructible function

Time/space complexity

Top-down radix sort

Top-down tree automaton

Topological order

Topological sort

Totally undecidable problem

Tournament sort

Towers of Hanoi

Transition function

Transitive closure

Transitive reduction

Traveling salesman

Tree contraction

Tree editing problem

Triangle inequality

Triconnected graph

Trinary function

Turbo Reverse Factor

Turing reduction

Turing transducer

Two Way algorithm

Two-dimensional

Two-level grid file

Two-way merge sort

Uncomputable function

Uncomputable problem

Undecidable language

Undecidable problem

Undirected graph

Uniform circuit complexity

Uniform circuit family

Uniform hashing

Union of automata

Universal hashing

Universal state

Universal Turing machine

Unsolvable problem

Upper triangular matrix

Van Emde-Boas priority queue

Vehicle routing problem

Vertex coloring

Vertex connectivity

Vertical visibility map

Virtual hashing

Viterbi algorithm

Vitter's algorithm

Weighted, directed graph

Work-depth model

Work-preserving

Worst-case cost

Worst-case minimum access

Yule distribution

Zeller's congruence