From Wikipedia, the free encyclopedia
Jump to: navigation, search

Please select an appropriate cover image for this book. See "Template:Saved book" for instructions."
This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance).
Download PDF ]  [ Download ODT ]  [ Download ZIM ]

Download EPUB ]  [ Open in Book Creator ]  [ Order Printed Book ]

[ About ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ]


List of algorithms
Cycle detection
Stable marriage problem
Pseudorandom number generator
Blum Blum Shub
Lagged Fibonacci generator
Linear congruential generator
Mersenne twister
Graph theory
Graph coloring
Hopcroft–Karp algorithm
Matching (graph theory)
Hungarian algorithm
Prüfer sequence
Tarjan's off-line lowest common ancestors algorithm
Lowest common ancestor
Topological sorting
Graph drawing
Force-directed graph drawing
Spectral layout
Network theory
Girvan–Newman algorithm
HITS algorithm
Flow network
Dinic's algorithm
Time complexity
Edmonds–Karp algorithm
Ford–Fulkerson algorithm
Karger's algorithm
Push–relabel maximum flow algorithm
Edmonds' algorithm
Euclidean minimum spanning tree
Longest path problem
Minimum spanning tree
Borůvka's algorithm
Kruskal's algorithm
Prim's algorithm
Reverse-delete algorithm
Nonblocking minimal spanning switch
Shortest path problem
Bellman–Ford algorithm
Dijkstra's algorithm
Floyd–Warshall algorithm
Johnson's algorithm
Transitive closure
Travelling salesman problem
Christofides algorithm
Nearest neighbour algorithm
Knight's tour
State space search
Graph traversal
A* search algorithm
Beam search
Best-first search
Beam stack search
Priority queue
Bidirectional search
Bloom filter
Breadth-first search
Incremental heuristic search
Depth-first search
General Problem Solver
Iterative deepening depth-first search
Lexicographic breadth-first search
Uniform-cost search
Tree traversal
Bron–Kerbosch algorithm
Clique (graph theory)
Strongly connected component
Path-based strong component algorithm
Kosaraju's algorithm
Tarjan's strongly connected components algorithm
Bitap algorithm
Phonetic algorithm
Daitch–Mokotoff Soundex
Match rating approach
New York State Identification and Intelligence System
String metric
Damerau–Levenshtein distance
Levenshtein distance
Sørensen–Dice coefficient
Jaccard index
Hamming distance
Jaro–Winkler distance
Trigram search
Linear search
Selection algorithm
Ternary search
Sorting algorithm
Binary search algorithm
Fibonacci search technique
Jump search
Interpolation search
Fibonacci number
Uniform binary search
Merge algorithm
Fisher–Yates shuffle
Robinson–Schensted correspondence
Young tableau
Steinhaus–Johnson–Trotter algorithm
Heap's algorithm
Dynamic time warping
Hirschberg's algorithm
Sequence alignment
Needleman–Wunsch algorithm
Smith–Waterman algorithm
Bubble sort
Cocktail sort
Comb sort
Gnome sort
Odd–even sort
Stooge sort
Insertion sort
Library sort
Patience sorting
Tree sort
Cycle sort
Merge sort
Strand sort
Bead sort
Bucket sort
Counting sort
Pigeonhole sort
Radix sort
Selection sort
Bitonic sorter
Pancake sorting
Maximum subarray problem
Longest common subsequence problem
Longest increasing subsequence
Shortest common supersequence
Longest common substring problem
String searching algorithm
Aho–Corasick string matching algorithm
Boyer–Moore string search algorithm
Boyer–Moore–Horspool algorithm
Knuth–Morris–Pratt algorithm
Rabin–Karp algorithm
Zhu–Takaoka string matching algorithm
Ukkonen's algorithm
Online algorithm
Suffix tree
Computational mathematics
Abstract algebra
Chien search
Schreier–Sims algorithm
Strong generating set
Permutation group
Todd–Coxeter algorithm
Symbolic computation
Buchberger's algorithm
Cantor–Zassenhaus algorithm
Faugère's F4 and F5 algorithms
Gosper's algorithm
Knuth–Bendix completion algorithm
Gröbner basis
Pollard's kangaroo algorithm
Polynomial long division
Risch algorithm
Computational geometry
Closest pair of points problem
Collision detection
Cone algorithm
Convex hull algorithms
Graham scan
Gift wrapping algorithm
Chan's algorithm
Kirkpatrick–Seidel algorithm
Distance transform
Geometric hashing
Gilbert–Johnson–Keerthi distance algorithm
Jump-and-Walk algorithm
Laplacian smoothing
Line segment intersection
Sweep line algorithm
Bentley–Ottmann algorithm
Minimum bounding box algorithms
Minimum bounding box
Nearest neighbor search
Point in polygon
Point set registration
Point cloud
Rotating calipers
Antipodal point
Convex and concave polygons
Convex hull
Shoelace formula
Triangulation (geometry)
Delaunay triangulation
Ruppert's algorithm
Chew's second algorithm
Constrained Delaunay triangulation
Marching triangles
Polygon triangulation
Voronoi diagram
Bowyer–Watson algorithm
Fortune's algorithm
Number theory
Binary GCD algorithm
Booth's multiplication algorithm
Chakravala method
Discrete logarithm
Baby-step giant-step
Index calculus algorithm
Pollard's rho algorithm for logarithms
Pohlig–Hellman algorithm
Euclidean algorithm
Greatest common divisor
Extended Euclidean algorithm
Integer factorization
Congruence of squares
Dixon's factorization method
Fermat's factorization method
General number field sieve
Lenstra elliptic curve factorization
Pollard's p − 1 algorithm
Pollard's rho algorithm
Quadratic sieve
Shor's algorithm
Special number field sieve
Trial division
Multiplication algorithm
Karatsuba algorithm
Schönhage–Strassen algorithm
Toom–Cook multiplication
Odlyzko–Schönhage algorithm
Riemann zeta function
Primality test
AKS primality test
Baillie–PSW primality test
Fermat primality test
Lucas primality test
Miller–Rabin primality test
Sieve of Atkin
Sieve of Eratosthenes
Sieve of Sundaram
Numerical analysis
List of numerical analysis topics
Differential equation
Euler method
Backward Euler method
Trapezoidal rule (differential equations)
Linear multistep method
Runge–Kutta methods
Multigrid method
Partial differential equation
Finite difference method
Crank–Nicolson method
Lax–Wendroff method
Verlet integration
Special functions
Approximations of π
Borwein's algorithm
Gauss–Legendre algorithm
Bailey–Borwein–Plouffe formula
BKM algorithm
Elementary function
Addition-chain exponentiation
Exponentiation by squaring
Arbitrary-precision arithmetic
Montgomery reduction
Modular arithmetic
Fürer's algorithm
Computational complexity theory
Spigot algorithm
Mathematical constant
Alpha max plus beta min algorithm
Methods of computing square roots
Nth root algorithm
Shifting nth root algorithm
Binary splitting
Divide and conquer algorithms
Kahan summation algorithm
Radon transform
Level set method
Birkhoff interpolation
Cubic Hermite spline
Hermite interpolation
Linear interpolation
Monotone cubic interpolation
Multivariate interpolation
Bicubic interpolation
Bilinear interpolation
Lanczos resampling
Nearest-neighbor interpolation
Tricubic interpolation
Pareto interpolation
Pareto distribution
Polynomial interpolation
Neville's algorithm
Spline interpolation
Runge's phenomenon
De Boor's algorithm
De Casteljau's algorithm
Bézier spline
Trigonometric interpolation
Numerical linear algebra
Eigenvalue algorithm
Arnoldi iteration
Inverse iteration
Jacobi eigenvalue algorithm
Lanczos algorithm
Power iteration
QR algorithm
Rayleigh quotient iteration
Gram–Schmidt process
Matrix multiplication
Cannon's algorithm
Distributed algorithm
Coppersmith–Winograd algorithm
Freivalds' algorithm
Strassen algorithm
System of linear equations
Biconjugate gradient method
Conjugate gradient method
Gaussian elimination
Gauss–Seidel method
Levinson recursion
Toeplitz matrix
Stone method
Successive over-relaxation
Tridiagonal matrix algorithm
Sparse matrix
Cuthill–McKee algorithm
Minimum degree algorithm
Cholesky decomposition
Symbolic Cholesky decomposition
Monte Carlo method
Gibbs sampling
Metropolis–Hastings algorithm
Probability distribution
Wang and Landau algorithm
Numerical integration
Monte Carlo integration
Root-finding algorithm
Bisection method
False position method
Newton's method
Halley's method
Secant method
Ridders' method
Muller's method
Mathematical optimization
Alpha–beta pruning
Branch and bound
Odds algorithm
Matrix chain multiplication
Combinatorial optimization
Greedy randomized adaptive search procedure
Assignment problem
Constraint satisfaction
AC-3 algorithm
Difference-map algorithm
Min-conflicts algorithm
Chaff algorithm
Davis–Putnam algorithm
DPLL algorithm
Conjunctive normal form
Boolean satisfiability problem
Exact cover
Knuth's Algorithm X
Nondeterministic algorithm
Dancing Links
Cross-entropy method
Importance sampling
Differential evolution
Dynamic programming
Overlapping subproblems
Optimal substructure
Ellipsoid method
Evolutionary computation
Evolution strategy
Gene expression programming
Genetic algorithm
Fitness proportionate selection
Stochastic universal sampling
Truncation selection
Tournament selection
Memetic algorithm
Swarm intelligence
Ant colony optimization algorithms
Bees algorithm
Particle swarm optimization
Gradient descent
Harmony search
Interior point method
Linear programming
Benson's algorithm
Vector optimization
Dantzig–Wolfe decomposition
Column generation
Integer programming
Branch and cut
Cutting-plane method
Karmarkar's algorithm
Simplex algorithm
Line search
Local search (optimization)
Hill climbing
Tabu search
Best bin first
Newton's method in optimization
Nonlinear programming
Broyden–Fletcher–Goldfarb–Shanno algorithm
Gauss–Newton algorithm
Levenberg–Marquardt algorithm
Nelder–Mead method
Simulated annealing
Stochastic tunneling
Subset sum problem
Computational science
Astronomical algorithm
Doomsday rule
Zeller's congruence
Kabsch algorithm
Root-mean-square deviation
Velvet assembler
De Bruijn graph
Sequence assembly
Maximum parsimony (phylogenetics)
Vincenty's formulae
Computational linguistics
Natural language processing
Lesk algorithm
Sukhotin's algorithm
Medical algorithm
Heart failure
Pulmonary embolism
Texas Medication Algorithm Project
Computational physics
Constraint algorithm
Demon algorithm
Microcanonical ensemble
Featherstone's algorithm
Ground state
Calculus of variations
Ritz method
N-body problem
Barnes–Hut simulation
Fast multipole method
Rainflow-counting algorithm
Sweep and prune
VEGAS algorithm
Computational statistics
Algorithms for calculating variance
Approximate counting algorithm
Bayesian statistics
Nested sampling algorithm
Cluster analysis
Canopy clustering algorithm
Complete-linkage clustering
Expectation–maximization algorithm
Fuzzy clustering
FLAME clustering
K-means clustering
Linde–Buzo–Gray algorithm
Lloyd's algorithm
Single-linkage clustering
Ward's method
Estimation theory
Ordered subset expectation maximization
Kalman filter
FNN algorithm
Fractal dimension
Hidden Markov model
Baum–Welch algorithm
Forward–backward algorithm
Viterbi algorithm
Partial least squares regression
Queueing theory
Buzen's algorithm
Gordon–Newell theorem
Yamartino method
Ziggurat algorithm
Tomasulo algorithm
Clipping (computer graphics)
Line clipping
Cohen–Sutherland algorithm
Cyrus–Beck algorithm
Liang–Barsky algorithm
Sutherland–Hodgman algorithm
Vatti clipping algorithm
Weiler–Atherton clipping algorithm
Contour line
Marching cubes
Marching squares
Marching tetrahedra
Flood fill
Global illumination
Ambient occlusion
Beam tracing
Cone tracing
Image-based lighting
Metropolis light transport
Path tracing
Photon mapping
Radiosity (computer graphics)
Ray tracing (graphics)
Hidden surface determination
Newell's algorithm
Painter's algorithm
Scanline rendering
Warnock algorithm
Line drawing algorithm
Bresenham's line algorithm
Digital differential analyzer (graphics algorithm)
Xiaolin Wu's line algorithm
Midpoint circle algorithm
Ramer–Douglas–Peucker algorithm
Gouraud shading
Phong shading
Summed area table
Public-key cryptography
Digital Signature Algorithm
ElGamal encryption
Elliptic curve cryptography
RSA (cryptosystem)
Cryptographic hash function
Hash-based message authentication code
Hash tree (persistent data structure)
Whirlpool (cryptography)
Tiger (cryptography)
Cryptographically secure pseudorandom number generator
Fortuna (PRNG)
Yarrow algorithm
Diffie–Hellman key exchange
Secret sharing
Symmetric-key algorithm
Advanced Encryption Standard
Blowfish (cipher)
Data Encryption Standard
International Data Encryption Algorithm
Tiny Encryption Algorithm
Quine–McCluskey algorithm
Petrick's method
Espresso heuristic logic minimizer
Association rule learning
Apriori algorithm
Boosting (machine learning)
Bootstrap aggregating
Decision tree learning
C4.5 algorithm
ID3 algorithm
K-nearest neighbors algorithm
Locality-sensitive hashing
Artificial neural network
Hopfield network
Pulse-coupled networks
Radial basis function network
Self-organizing map
Random forest
Reinforcement learning
Temporal difference learning
Relevance vector machine
Support vector machine
Structured support vector machine
Winnow (algorithm)
C3 linearization
Chaitin's algorithm
Hindley–Milner type system
Rete algorithm
Sethi–Ullman algorithm
CYK algorithm
Context-free grammar
Chomsky normal form
Earley parser
GLR parser
Inside–outside algorithm
Stochastic context-free grammar
LL parser
LR parser
Canonical LR parser
LALR parser
Operator-precedence parser
Simple LR parser
Simple precedence parser
Parsing expression grammar
Recursive descent parser
Shunting-yard algorithm
Pratt parser
Lexical analysis
Quantum algorithm
Deutsch–Jozsa algorithm
Grover's algorithm
Simon's problem
Theory of computation
Powerset construction
Deterministic automaton
Tarski–Kuratowski algorithm
Arithmetical hierarchy
Analytical hierarchy
Information theory
Signal processing
Error detection and correction
BCH code
Berlekamp–Massey algorithm
Reed–Solomon error correction
BCJR algorithm
Forward error correction
Gray code
Hamming code
Hamming weight
Cyclic redundancy check
Damm algorithm
Fletcher's checksum
Longitudinal redundancy check
Luhn algorithm
Luhn mod N algorithm
Parity bit
Verhoeff algorithm
Burrows–Wheeler transform
Context tree weighting
Delta encoding
Dynamic Markov compression
Dictionary coder
Byte pair encoding
LZ77 and LZ78
Lempel–Ziv–Markov chain algorithm
LZX (algorithm)
Entropy encoding
Arithmetic coding
Range encoding
Huffman coding
Adaptive Huffman coding
Package-merge algorithm
Shannon–Fano–Elias coding
Golomb coding
Truncated binary encoding
Unary coding
Universal code (data compression)
Exponential-Golomb coding
Fibonacci coding
Levenshtein coding
Incremental encoding
Prediction by partial matching
Run-length encoding
Sequitur algorithm
A-law algorithm
Code-excited linear prediction
Linear predictive coding
Μ-law algorithm
Warped linear predictive coding
Image compression
Block Truncation Coding
Embedded Zerotrees of Wavelet transforms
Discrete cosine transform
Fractal compression
Set partitioning in hierarchical trees
Wavelet transform
Transform coding
Vector quantization
Adaptive-additive algorithm
Discrete Fourier transform
Bluestein's FFT algorithm
Bruun's FFT algorithm
Cooley–Tukey FFT algorithm
Fast Fourier transform
Rader's FFT algorithm
Fast folding algorithm
Goertzel algorithm
Karplus–Strong string synthesis
Image processing
Adaptive histogram equalization
Connected-component labeling
Floyd–Steinberg dithering
Ordered dithering
Feature detection
Canny edge detector
Generalised Hough transform
Hough transform
Marr–Hildreth algorithm
Edge detection
Scale-invariant feature transform
Richardson–Lucy deconvolution
Seam carving
Image segmentation
GrowCut algorithm
Region growing
Watershed (image processing)
Cache algorithms
Logical block addressing
Double dabble
Hash function
Fowler–Noll–Vo hash function
Pearson hashing
Zobrist hashing
Unicode collation algorithm
XOR swap algorithm
Algorithms for Recovery and Isolation Exploiting Semantics
Join (SQL)
Block nested loop
Hash join
Nested loop join
Sort-merge join
Bully algorithm
Byzantine fault tolerance
Clock synchronization
Berkeley algorithm
Cristian's algorithm
Intersection algorithm
Marzullo's algorithm
Dijkstra–Scholten algorithm
Huang's algorithm
Partially ordered set
Mutual exclusion
Lamport's Distributed Mutual Exclusion Algorithm
Raymond's algorithm
Ricart–Agrawala algorithm
Paxos (computer science)
Snapshot algorithm
Buddy memory allocation
Garbage collection (computer science)
Boehm garbage collector
Cheney's algorithm
Mark-compact algorithm
Reference counting
Operating system
Banker's algorithm
Page replacement algorithm
Adaptive replacement cache
Network scheduler
Karn's Algorithm
Luleå algorithm
Network congestion
Exponential backoff
Nagle's algorithm
Synchronization (computer science)
Scheduling (computing)
Dekker's algorithm
Lamport's bakery algorithm
Peterson's algorithm
Earliest deadline first scheduling
Fair-share scheduling
Least slack time scheduling
Multilevel feedback queue
Rate-monotonic scheduling
Shortest job next
Shortest remaining time
Top-nodes algorithm
I/O scheduling
Analysis of algorithms
Approximation algorithm
Best, worst and average case
Big O notation
Combinatorial search
Competitive analysis (online algorithm)
Computability theory
Embarrassingly parallel
Emergent algorithm
Evolutionary algorithm
Las Vegas algorithm
Non-blocking algorithm
Monte Carlo algorithm
Polynomial-time approximation scheme
Randomized algorithm
Search algorithm
Super-recursive algorithm