User:Netcse/Books/Algorithms
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| 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). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
List of Algorithm - 1[edit]
S.M.AMRAN[edit]
- Combinatorics
- 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
- PageRank
- TrustRank
- Flow network
- Dinic's algorithm
- Time complexity
- Maximum flow problem
- Edmonds–Karp algorithm
- Ford–Fulkerson algorithm
- Karger's algorithm
- Minimum cut
- 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
- Telephone exchange
- 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
- B*
- Backtracking
- Beam search
- Best-first search
- Beam stack search
- Priority queue
- Bidirectional search
- Bloom filter
- Breadth-first search
- D*
- Incremental heuristic search
- Depth-first search
- General Problem Solver
- Iterative deepening depth-first search
- Jump point search
- Lexicographic breadth-first search
- Uniform-cost search
- Tree traversal
- SSS*
- Bron–Kerbosch algorithm
- Clique (graph theory)
- Strongly connected component
- Path-based strong component algorithm
- Kosaraju's algorithm
- Tarjan's strongly connected components algorithm
- Sequence
- Bitap algorithm
- Phonetic algorithm
- Daitch–Mokotoff Soundex
- Soundex
- Metaphone
- 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
- Fibonacci number
- Jump search
- Interpolation search
- Magnitude (mathematics)
- Uniform binary search
- Merge algorithm
- Permutation
- 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
- Quicksort
- Bogosort
- Stooge sort
- Flashsort
- Introsort
- Timsort
- Insertion sort
- Library sort
- Patience sorting
- Shellsort
- Tree sort
- Cycle sort
- Merge sort
- Strand sort
- Bead sort
- Bucket sort
- Burstsort
- Counting sort
- Pigeonhole sort
- Radix sort
- Heapsort
- Selection sort
- Smoothsort
- Bitonic sorter
- Pancake sorting
- Samplesort
- Subsequence
- Maximum subarray problem
- Longest common subsequence problem
- Longest increasing subsequence
- Shortest common supersequence
- Substring
- Longest common substring problem
- String searching algorithm
- Aho–Corasick string matching algorithm
- Trie
- Boyer–Moore string search algorithm
- Sublinear function
- 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
- List of algorithms
- Abstract algebra
- Chien search
- Schreier–Sims algorithm
- Strong generating set
- Permutation group
- Todd–Coxeter algorithm
- Coset
- Symbolic computation
- Buchberger's algorithm
- Gröbner basis
- Cantor–Zassenhaus algorithm
- Faugère's F4 and F5 algorithms
- Gosper's algorithm
- Knuth–Bendix completion algorithm
- Rewriting
- Polynomial
- Pollard's kangaroo algorithm
- Polynomial long division
- Risch algorithm
- Antiderivative
- Computational geometry
- Closest pair of points problem
- Collision detection
- Cone algorithm
- Convex hull algorithms
- Convex hull
- Set (mathematics)
- Graham scan
- QuickHull
- Gift wrapping algorithm
- Chan's algorithm
- Kirkpatrick–Seidel algorithm
- Distance transform
- Geometric hashing
- Affine transformation
- Gilbert–Johnson–Keerthi distance algorithm
- Convex set
- 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
- Shoelace formula
- Triangulation (geometry)
- Delaunay triangulation
- Ruppert's algorithm
- Chew's second algorithm
- Constrained Delaunay triangulation
- Marching triangles
- Polygon triangulation
- Voronoi diagram
- Duality (mathematics)
- Bowyer–Watson algorithm
- Fortune's algorithm
- Quasi-triangulation
- Number theory
- Binary GCD algorithm
- Booth's multiplication algorithm
- Chakravala method
- Pell's equation
- 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
- Prime number
- 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
- 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
- Pi
- Bailey–Borwein–Plouffe formula
- Division algorithm
- Long division
- Newton's method
- Multiplicative inverse
- Elementary function
- BKM algorithm
- CORDIC
- Addition-chain exponentiation
- Exponentiation by squaring
- Arbitrary-precision arithmetic
- Modular arithmetic
- Montgomery reduction
- Fürer's algorithm
- Computational complexity theory
- Rounding
- 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
- Extrapolation
- Interpolation
- 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
- B-spline
- 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
- Band matrix
- Symmetric matrix
- 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
- Calculus
- 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
- Metaheuristic
- Interior point method
- Linear programming
- Vector optimization
- Benson's algorithm
- 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
- Minimax
- Metric space
- Best bin first
- Newton's method in optimization
- Nonlinear programming
- Broyden–Fletcher–Goldfarb–Shanno algorithm
- Gauss–Newton algorithm
- Least squares
- Levenberg–Marquardt algorithm
- Nelder–Mead method
- Simulated annealing
- Stochastic tunneling
- Subset sum problem
- Computational science
- Astronomical algorithm
- Doomsday rule
- Zeller's congruence
- Computus
- Bioinformatics
- BLAST
- Kabsch algorithm
- Root-mean-square deviation
- Velvet assembler
- De Bruijn graph
- Sequence assembly
- Maximum parsimony (phylogenetics)
- UPGMA
- Earth science
- Vincenty's formulae
- Computational linguistics
- Natural language processing
- Lesk algorithm
- Stemming
- Sukhotin's algorithm
- Medical algorithm
- Heart failure
- Manning criteria
- 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
- Stress (mechanics)
- Fatigue (material)
- 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
- K-means++
- K-medoids
- Medoid
- Linde–Buzo–Gray algorithm
- Lloyd's algorithm
- OPTICS algorithm
- Single-linkage clustering
- SUBCLU
- Ward's method
- Estimation theory
- Ordered subset expectation maximization
- Medical imaging
- Positron emission tomography
- Single-photon emission computed tomography
- X-ray
- Kalman filter
- Dynamical system
- FNN algorithm
- Fractal dimension
- Hidden Markov model
- Baum–Welch algorithm
- Maximum a posteriori estimation
- Forward–backward algorithm
- Viterbi algorithm
- Partial least squares regression
- Queueing theory
- Buzen's algorithm
- Gordon–Newell theorem
- RANSAC
- Scoring algorithm
- Maximum likelihood
- Yamartino method
- Ziggurat algorithm