Dead-end pages
Jump to navigation
Jump to search
The following pages do not link to other pages in Algorithm Wiki.
Showing below up to 500 results in range #501 to #1,000.
View (previous 500 | next 500) (20 | 50 | 100 | 250 | 500)
- Garsia–Wachs algorithm (Alphabetic Tree Problem Optimal Binary Search Trees)
- Gaussian-Jordan Elimination (General Linear System; Positive Definite, Hermitian Matrix; Non-Definite, Symmetric Matrix; Toeplitz Matrix; Vandermonde Matrix Linear System)
- Gaussian Elimination (Exact Laplacian Solver SDD Systems Solvers)
- Gaussian elimination (2-D Polynomial Interpolation Polynomial Interpolation)
- Geert Willems; Tinne Tuytelaars and Luc van Gool (2008) (Corner Detection Feature Detection)
- Geldenhuys-Valmari (SCCs Strongly Connected Components)
- Geman and Geman Markov random fields ( Image Segmentation)
- General number field sieve (Second Category Integer Factoring Integer Factoring)
- Generalized Adaptive A* (GAA*) (Informed Search Informed Search)
- Generalized expectation maximization (GEM) algorithm ( Maximum Likelihood Parameters)
- Generating random permutations
- Gent; I.P.; Irving; R.W.; Manlove; D.F.; Prosser; P.; Smith; B.M. (Stable Marriage Problem Stable Matching Problem)
- Gentleman; Morven and Gordon Sande radix-4 algorithm (Discrete Fourier Transform Discrete Fourier Transform)
- Global Newton Method (n player games Nash Equilibria)
- Goldberg & Rao (Integer Maximum Flow Maximum Flow)
- Goldberg & Rao (Parallel) (Integer Maximum Flow Maximum Flow)
- Goldberg & Tarjan ( Maximum Flow)
- Gomory's cutting method (ILP;MILPs Convex Optimization (Non-linear))
- Goodrich (Reporting all intersection points, line segments Line segment intersection)
- Gosper's algorithm ( Cycle Detection)
- Gotoh (Edit sequence, local alignment Sequence Alignment)
- Graham (2-dimensional Convex Hull)
- Grahne and Räihä (4NF Decomposition for Functional and Multivalued Dependency Sets 4NF Decomposition)
- Graph edit distance computation
- Gray-code based (Tower of Hanoi Tower of Hanoi)
- Greedy Algorithm ( The Set-Covering Problem)
- Greedy Best-First Search (Informed Search Informed Search)
- Greedy SEQAID (De Novo Genome Assembly De Novo Genome Assembly)
- Greiner–Hormann clipping algorithm (Polygon Clipping with Arbitrary Clipping Polygon Polygon Clipping)
- Gremban; Miller; Zagha (Inexact Laplacian Solver SDD Systems Solvers)
- Grenander (1D Maximum Subarray Maximum Subarray Problem)
- Gries, Martin (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem)
- Gries (1D Maximum Subarray Maximum Subarray Problem)
- Grigoryan (n-Queens Completion n-Queens Problem)
- Gronlund, Pettie (3-Clique Exact-Weight k-Clique Problem)
- Gronlund, Pettie (Real 3SUM 3SUM)
- Gröbner bases
- Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Creation)
- Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Deletion)
- Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Insertion)
- Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Search)
- Guibas; Stofli (2-Dimensional Delaunay Triangulation Delaunay Triangulation)
- Gunther Determinants solution (Counting Solutions; Constructing solutions n-Queens Problem)
- Gupta-Sproull algorithm (Line Drawing Line Drawing)
- Gupta; Verdu (Lossy Compression Data Compression)
- Gupta & Sarawagi CRF (Entity Resolution Entity Resolution)
- Gusfield (Longest Palindromic Substring Longest Palindromic Substring)
- Gutina; Gregory; Yeob; Anders; Zverovich; Alexey ( The Traveling-Salesman Problem)
- H.W.Jensen 2001 (Diffuse Reflection Texture Mapping)
- HEALPix mapping Wong (Environment Mapping Texture Mapping)
- HJLS algorithm ( Integer Relation)
- HORMANN K.; GREINER G 1999 (Mesh Parameterization Mesh Parameterization)
- Hadlock (Maximum Cut Maximum Cut)
- Halley's method (Root Computation with continuous second derivative Root Computation)
- Hanoi graph (Tower of Hanoi Tower of Hanoi)
- Hanrahan–Krueger (Specular Reflection Texture Mapping)
- Harel, Tarjan (Linking Roots) (Lowest Common Ancestor with Linking Roots Lowest Common Ancestor)
- Harel, Tarjan (Static Trees) (Lowest Common Ancestor with Static Trees Lowest Common Ancestor)
- Hariharan (Constructing Suffix Trees Constructing Suffix Trees)
- Harris and Stephens algorithm (Corner Detection Feature Detection)
- Harris and Stephens algorithm ( Corner Detection)
- Harrow (Quantum) (Sparse Linear System Linear System)
- Harvey; Hoeven; Lecerf ( Multiplication)
- Harvey; Hoeven ( Multiplication)
- Haselgrove-Leech-Trotter (HLT) algorithm (Coset Enumeration Coset Enumeration)
- Haselgrove; Leech and Trotter (Bounded Subgroup Index Coset Enumeration)
- Hash join ( Joins)
- Hashing (kth Order Statistic kth Order Statistic)
- Hauskrecht; 2000; (POMDPs POMDPs)
- Haveliwala (Link Analysis Link Analysis)
- He; X. D.; Torrance; K. E.; Sillion; 1991 (Diffuse Reflection Texture Mapping)
- Heap's algorithm (All Permutations All Permutations)
- Heap Sort (Comparison Sorting Sorting)
- Heejo Lee; Jong Kim; Sungje Hong; and Sunggu Lee (Approximate MCSP Matrix Chain Multiplication)
- Heidrich; W.; and H.-P. Seidel (Environment Mapping Texture Mapping)
- Helden Oligo-Analysis (Motif Search Motif Search)
- Helden Oligo-Analysis ( Motif Search)
- Held–Karp algorithm (Minimum TSP The Traveling-Salesman Problem)
- Hentenryck et. al. (Arc Consistency? Stable Matching Problem)
- Hertli (Modified PPSZ) (3SAT Boolean Satisfiability)
- Hertli (Modified PPSZ) (4SAT Boolean Satisfiability)
- Hessain Determinant Lindeberg 1994 (Blob Detection Feature Detection)
- Hessain Determinant Lindeberg 1998 (Blob Detection Feature Detection)
- Hessian-Laplace Mikolajczyk and Schmid 2004 (Blob Detection Feature Detection)
- Hierarchical Navigable Small World (HNSW) (k-ANNS Nearest Neighbor Search)
- Hierarchical Navigable Small World (HNSW) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search)
- Hierholzer's algorithm (Constructing Eulerian Trails in a Graph Constructing Eulerian Trails in a Graph)
- Higham (2-D Polynomial Interpolation Polynomial Interpolation)
- Hinrichs; Nievergelt; Schorn (2-dimensional space, l m (or l infty) norm Closest Pair Problem)
- Hirsch (3-Graph Coloring Graph Coloring)
- Hirschberg's algorithm (Edit sequence, constant-size alphabet Sequence Alignment)
- Hirschberg's algorithm (Edit sequence Sequence Alignment)
- Hirschberg (LCS Longest Common Subsequence)
- Historical Origins
- Hoare's Selection Algorithm (QuickSelect) (kth Order Statistic kth Order Statistic)
- Homotopy method (All eigenpairs; Eigenpair closest to mu; Any eigenpair; Any eigenvalue; All eigenvalues Eigenvalues (Iterative Methods))
- Hong’s algorithm (SCCs Strongly Connected Components)
- Hopcroft's algorithm (DFA Minimization DFA Minimization)
- Hopcroft 2-3 Tree ( Self-Balancing Trees Creation)
- Hopcroft 2-3 Tree ( Self-Balancing Trees Deletion)
- Hopcroft 2-3 Tree ( Self-Balancing Trees Insertion)
- Hopcroft 2-3 Tree ( Self-Balancing Trees Search)
- Hopcroft–Karp algorithm (Bipartite Graph MCM Maximum Cardinality Matching)
- Horowitz and Sahni (Subset Sum The Subset-Sum Problem)
- Householder's Method (Root Computation with continuous derivatives (up to d) Root Computation)
- Howard Policy Iteration (PI) (Optimal Policies for MDPs Optimal Policies for MDPs)
- Hsu and Du (Scheme 1) (LCS Longest Common Subsequence)
- Hsu and Du (Scheme 2) (LCS Longest Common Subsequence)
- Hungarian algorithm (Bipartite Maximum-Weight Matching Maximum-Weight Matching)
- Hunt and Szymanski (LCS Longest Common Subsequence)
- Hu–Tucker algorithm (Alphabetic Tree Problem Optimal Binary Search Trees)
- HybridSpades (Sequence-to-Graph Alignment Sequence-to-Graph Alignment)
- Hybrid Algorithm (De Novo Genome Assembly De Novo Genome Assembly)
- HyperLogLog++ ( Cardinality Estimation)
- HyperLogLog algorithm ( Cardinality Estimation)
- IDEA (Block Ciphers Block Ciphers)
- INDEGREE analysis
- ITP Method (General Root Computation Root Computation)
- Illinois Algorithm (General Root Computation Root Computation)
- Image Processing
- Image analogies Hertzmann (Texture Synthesis Texture Synthesis)
- Image quilting Efros-Freeman (Texture Synthesis Texture Synthesis)
- Improvement Rankings
- Incremental Heuristic Search ( Informed Search)
- Incremental convex hull algorithm; Michael Kallay ( Convex Hull)
- Index calculus algorithm (Discrete Logarithm Over Finite Fields, F q Logarithm Calculations)
- Integer linear program Vazirani (Unweighted Set-Covering; Weighted Set-Covering The Set-Covering Problem)
- Integer relation
- Intro Sort (Comparison Sorting Sorting)
- Inverse iteration (Eigenpair closest to mu; Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods))
- Inverse quadratic interpolation (General Root Computation Root Computation)
- Ioannidou; Kyriaki; Mertzios; George B.; Nikolopoulos; Stavros D. (Longest Path on Interval Graphs Longest Path Problem)
- Irving's Algorithm (Stable Roommates Problem Stable Matching Problem)
- Isometric graph partitioning - Leo Grady and Eric L. Schwartz (2006) ( Image Segmentation)
- Iterated conditional modes algorithm ( Image Segmentation)
- Iteration based (Tower of Hanoi Tower of Hanoi)
- Iterative Deepening A* (IDA*) (Informed Search Informed Search)
- Iterative naive (d-Neighborhood of a String d-Neighborhood of a String)
- Ives' algorithm c ( All permutations)
- J.-C. Nebel 1998 ( Ray Tracing)
- J. Chen; L. Liu; and W. Jia. (The Vertex Cover Problem, Degrees Bounded By 3 The Vertex Cover Problem)
- J. J. Koenderink and W. Richards 1988 (Corner Detection Feature Detection)
- Jacobi eigenvalue algorithm (All eigenvalues; Any eigenvalue Eigenvalues (Iterative Methods))
- Jain, Chang (Sequence-to-Graph Alignment Sequence-to-Graph Alignment)
- Jalali; A. Montanari; and T. Weissman (Lossy Compression Data Compression)
- Jalali and T. Weissman (Lossy Compression Data Compression)
- James B Orlin's + KRT (King; Rao; Tarjan)'s algorithm (st-Maximum Flow Maximum Flow)
- Jarvis (2-dimensional Convex Hull)
- Jean-Daniel Boissonnat and Franco P. Preparata. (Reporting all intersection points, generalized segments Line segment intersection)
- Jeh and Widom (Link Analysis Link Analysis)
- Jeuring (Longest Palindromic Substring Longest Palindromic Substring)
- Jiang, Song, Weinstein and Zhang ( Linear Programming)
- Johnson's algorithm (Directed, Weighted (Arbitrary weights) All-Pairs Shortest Paths (APSP))
- Johnson; D. S.; McGeoch; L. A. ( The Traveling-Salesman Problem)
- Johnson (3-Graph Coloring Graph Coloring)
- Johnson (Edmonds-Karp-based) (bipartite (i.e. assignment), general Maximum-weight matching)
- Jump Point Search (JPS) (Informed Search Informed Search)
- K-Clique Hypothesis
- K-d Tree (Nearest Neighbor Search (NNS) Nearest Neighbor Search)
- K. Mikolajczyk; K. and C. Schmid LoG 2004 (Corner Detection Feature Detection)
- KALYAN PERUMALLA and NARSINGH DEO (2-dimensional Maximum subarray problem)
- KARNI Z.; GOTSMAN C.; GORTLER S. J. 2005 (Mesh Parameterization Mesh Parameterization)
- K Riesen (Inexact GED Graph Edit Distance Computation)
- Kadane's Algorithm (1D Maximum Subarray Maximum Subarray Problem)
- Kahn's algorithm (Topological Sorting Topological Sorting)
- Kajiya; J. Anisotropic Reflection Models 1985 (Diffuse Reflection Texture Mapping)
- Kalman Filter (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes))
- Karatsuba Algorithm ( Multiplication)
- Karger, Blum ( Graph Coloring)
- Karger; Klein & Tarjan (Undirected, General MST Minimum Spanning Tree (MST))
- Karmarkar's algorithm ( Linear Programming)
- Karpinski (Approximate OBST Optimal Binary Search Trees)
- Karzanov ( Maximum Flow)
- Kass; Witkin and Terzopoulos ( Image Segmentation)
- Katajainen and M. Koppinen ( Delaunay Triangulation)
- Kathuria, Liu, Sidford ( Maximum Flow)
- Kazuhisa Makino, Takeaki Uno; Section 5 (Enumerating Maximal Cliques, arbitrary graph Clique Problems)
- Kazuhisa Makino, Takeaki Uno; Section 6 (Enumerating Maximal Cliques, arbitrary graph Clique Problems)
- Kelner; Orecchia; Sidford; Zhu (Inexact Laplacian Solver SDD Systems Solvers)
- Key exchange
- Khachiyan Ellipsoid algorithm ( Linear Programming)
- Khuller, Matias (k-dimensional space, Euclidean metric Closest Pair Problem)
- Khuller; Matias ( Closest Pair Problem)
- Khuller; Matias Randomized Sieve ( Closest Pair Problem)
- Khuller; Raghavachari & Young, "Greedy Methods" (Maximum Cut, Approximate Maximum Cut)
- King et al. (KRT) (st-Maximum Flow Maximum Flow)
- Kingsford (Motif Search Motif Search)
- Kingsford ( Motif Search)
- Klawe; Mumey (Alphabetic Tree Problem Optimal Binary Search Trees)
- Klein (section 5) (Planar Bipartite Graph Perfect Matching Maximum Cardinality Matching)
- Kleinberg (Link Analysis Link Analysis)
- Kleitman–Wang Algorithm (Digraph Realization Problem Graph Realization Problems)
- Klinz (Subset Sum The Subset-Sum Problem)
- Kmett (Lowest Common Ancestor with Static Trees Lowest Common Ancestor)
- Knuth's DP algorithm (OBST Optimal Binary Search Trees)
- Knuth-Morris-Pratt (KMP) algorithm (Single String Search String Search)
- Knuth–Bendix algorithm (Coset Enumeration Coset Enumeration)
- Knuth–Bendix algorithm (General Groups (uncompleted?) Coset Enumeration)
- Koiliaris and Xu (Subset Sum The Subset-Sum Problem)
- Koivisto ( Chromatic Number)
- Koivisto ( Chromatic Polynomial)
- Kong and Wilken Algorithm (Global Register Allocation Register Allocation)
- Korada and R. Urbanke; (Lossy Compression Data Compression)
- Kosaraju's algorithm (SCCs Strongly Connected Components)
- Koutis; Miller and Peng (Inexact Laplacian Solver SDD Systems Solvers)
- Kruskal's algorithm (Undirected, General MST Minimum Spanning Tree (MST))
- Kruskal’s algorithm with demand-sorting (Undirected, General MST Minimum Spanning Tree (MST))
- Kth order statistic
- Kuo and Cross (LCS Longest Common Subsequence)
- Kushner non-linear filter (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes))
- Kvasov 2006 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation)
- Kwatra 2003 (Texture Synthesis Texture Synthesis)
- L. Kitchen and A. Rosenfeld (Corner Detection Feature Detection)
- L. Kitchen and A. Rosenfeld (Grey-scale Corner Detection)
- LEE Y.; KIM H. S.; LEE S 2002 (Mesh Parameterization Mesh Parameterization)
- LLL algorithm (Integer Relation Integer Relation)
- LOBPCG algorithm (Eigenpair closest to mu; Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods))
- LOOK (Disk Scheduling Disk Scheduling)
- LU Matrix Decomposition (Matrix Factorization Collaborative Filtering)
- LU decomposition
- LU decomposition (General Linear system of equations)
- L Chang (Inexact GED Graph Edit Distance Computation)
- Laguerre iteration (Any eigenvalue Eigenvalues (Iterative Methods))
- Lamport's bakery algorithm ( Mutual Exclusion)
- Lang simplification ( Line Simplification)
- Langdon ( All permutations)
- Larmore (Approximate OBST Optimal Binary Search Trees)
- Larsen, Williams (Theorem 1.1) ( Online Matrix Vector Multiplication (OMV))
- Larsen, Williams (follows from Theorem 2.1) ( Online Matrix Vector Multiplication (OMV))
- Lawler; E. L. (Minimum TSP The Traveling-Salesman Problem)
- Lawler (3-Graph Coloring Graph Coloring)
- Lawler (4-Graph Coloring Graph Coloring)
- Lawler ( Chromatic Number)
- Lawrence, Reilly (Motif Search Motif Search)
- Lawrence Gibbs Sampling (Motif Search Motif Search)
- Leases (Cary G Gray and David R Cheriton) (Distributed Locking Algorithms Distributed Locking Algorithms)
- Least recently used (Online Page Replacements)
- Lee, Sidford ( Maximum Flow)
- Lee; Peng; Spielman (Inexact Laplacian Solver SDD Systems Solvers)
- Lee and Sidford ( Linear Programming)
- Lehmer's GCD algorithm (Greatest Common Divisor Greatest Common Divisor)
- Lemke-Howson Algorithm (2 player games Nash Equilibria)
- Lemke–Howson algorithm (2-player Nash Equilibria)
- Lenstra elliptic curve factorization (First Category Integer Factoring Integer Factoring)
- Levcopoulos; Lingas; Sack (Approximate OBST Optimal Binary Search Trees)
- Levinson–Durbin recursion (Toeplitz Matrix Linear System)
- Lewis 1978 (Renamable Horn Boolean Satisfiability)
- Liang Cwinnower (Motif Search Motif Search)
- Liang Cwinnower ( Motif Search)
- Liang–Barsky (Rectangular Window Line Clipping)
- Lien (4NF Decomposition for Conflict-Free Dependency Sets 4NF Decomposition)
- Lifelong Planning A* (LPA*) (Informed Search Informed Search)
- Linda G. Shapiro and George C. Stockman (2001) ( Image Segmentation)
- Lindeberg's watershed-based grey-level blob detection algorithm 1991 (Blob Detection Feature Detection)
- Lindeberg (1994) (Corner Detection Feature Detection)
- Lindeberg (1998) (Corner Detection Feature Detection)
- Lindeberg 2005 (Corner Detection Feature Detection)
- Linde–Buzo–Gray algorithm ( Voronoi Diagrams)
- Line Clipping
- Line Intersections
- Line drawing
- Linear Equations
- Linear Scan, Poletto & Sarkar (Global Register Allocation Register Allocation)
- Linear search (Nearest Neighbor Search (NNS) Nearest Neighbor Search)
- Link analysis (PAGERANK and variants)
- Lin–Kernighan (Approximate TSP The Traveling-Salesman Problem)
- Lipton, Markakis and Mehta method (2 player games Nash Equilibria)
- Lipton, Markakis and Mehta method 2 (n player games Nash Equilibria)
- Lipton; Mehta (2-player Nash Equilibria)
- Liu (Decisional BCNF BCNF Decomposition)
- Local scale-invariant Lowe 1999 (Blob Detection Feature Detection)
- Locality-sensitive hashing (k-ANNS Nearest Neighbor Search)
- Locality-sensitive hashing (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search)
- LogLog algorithm ( Cardinality Estimation)
- Logarithm calculations
- Lokshtanov (Subset Sum The Subset-Sum Problem)
- Long Multiplication ( Multiplication)
- Longest common subsequence
- Longest distance first (LDF) page replacement algorithm (Online Page Replacements)
- Longest palindromic substring
- Longest path on interval graphs
- Lossy compression
- Lowe (2004) (Corner Detection Feature Detection)
- Lowest common ancestor
- Lowe’s Algorithm (SCCs Strongly Connected Components)
- Lucifer / DES (Block Ciphers Block Ciphers)
- Lund & Yannakakis ( The Set-Covering Problem)
- LÉVY B.; PETITJEAN S.; RAY N.; MAILLOT J 2002 (Mesh Parameterization Mesh Parameterization)
- M. Chrobak and D. Eppstein (Enumerating Maximal Cliques, arbitrary graph Clique Problems)
- MATSF (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems)
- MD5 (Unkeyed Hash Functions One-Way Hash Functions)
- MDPs for optimal policies
- MKM Algorithm ( Maximum Flow)
- MRRR algorithm (Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods))
- Madry's algorithm (Bipartite Graph MCM Maximum Cardinality Matching)
- Madry ( Maximum Flow)
- Maekawa's algorithm ( Mutual Exclusion)
- Manacher (Longest Palindromic Substring Longest Palindromic Substring)
- Maneva and M. J. Wainwright (Lossy Compression Data Compression)
- Manlove; Malley (Stable Marriage Problem Stable Matching Problem)
- Martinian and M. J. Wainwright (Lossy Compression Data Compression)
- Masek, Paterson (Edit sequence, constant-size alphabet Sequence Alignment)
- Masek, Paterson (Edit sequence Sequence Alignment)
- Masek; Patterson (Edit distance, constant-size alphabet Sequence Alignment)
- Masek; Patterson (Edit distance Sequence Alignment)
- Matrix Factorization for Collaborative Filtering
- Matrix chain multiplication
- Matrix inverse (General Linear system of equations)
- Matsunaga; Yamamoto (Lossy Compression Data Compression)
- Mauro Steigleder (Environment Mapping Texture Mapping)
- Maximally stable extremal regions Matas 2002 (Blob Detection Feature Detection)
- Maximum-weight matching
- Maximum Flow
- Maximum a Posteriori Occupancy Mapping (Occupancy Grid Mapping Occupancy Grid Mapping)
- Maximum cardinality matching
- Maximum cut
- Maximum subarray problem
- Maxwell ( 4NF Decomposition)
- Maybeck; Peter S Extended Kalman Filter (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes))
- McAllester & Singh; 1999; (POMDPs POMDPs)
- McCreight (Constructing Suffix Trees Constructing Suffix Trees)
- McKay ( Graph Isomorphism Problem)
- Melhorn's Approximation algorithm (Approximate OBST Optimal Binary Search Trees)
- Merge Sort (Comparison Sorting Sorting)
- Method of Four Russians (Boolean Matrix Multiplication (Combinatorial) Matrix Product)
- Method of Four Russians ( Matrix Multiplication)
- Micali, Vazirani (general graph Maximum cardinality matching)
- Micali; Vazirani ( Maximum-Weight Matching)
- Micali and Vazirani ( Maximum Cardinality Matching)
- Miller-Tucker-Zemlin (MTZ) formulation (Minimum TSP The Traveling-Salesman Problem)
- Miller; Stout (2-dimensional Convex Hull)
- Miller and Myers (LCS Longest Common Subsequence)
- Min. Spanning Tree
- Min/max sketches streaming algorithm (streaming Cardinality Estimation)
- Mitra (Motif Search Motif Search)
- Mitzenmacher & Upfal (Maximum Cut, Approximate Maximum Cut)
- Mixed Integer Programming (n player games Nash Equilibria)
- Miyake 2006 (Lossy Compression Data Compression)
- Modified Knuth's DP algorithm (OBST Optimal Binary Search Trees)
- Modified van Leeuwen (Linking Roots) (Lowest Common Ancestor with Linking Roots Lowest Common Ancestor)
- Modified van Leeuwen (Static Trees) (Lowest Common Ancestor with Static Trees Lowest Common Ancestor)
- Money Change
- Moore's algorithm (DFA Minimization DFA Minimization)
- Moravec's algorithm 1980 (Corner Detection Feature Detection)
- MotifSampler (Motif Search Motif Search)
- Motwani & Raghavan (Maximum Cut, Approximate Maximum Cut)
- Mucha, Sankowski (general) (General Graph MCM Maximum Cardinality Matching)
- Mucha; Sankowski (planar) (Bipartite Graph MCM Maximum Cardinality Matching)
- Mucha and Sankowski ( Maximum-Weight Matching)
- Mukhopadhyay (LCS Longest Common Subsequence)
- Muller's method (General Root Computation Root Computation)
- Multi-scale MAP estimation - A. Bouman and M. Shapiro (2002) ( Image Segmentation)
- Multilevel queue scheduling (Unweighted Interval Scheduling, Online?? Interval Scheduling)
- Multilevel queue scheduling (Unweighted Interval Scheduling, Online Interval Scheduling)
- Multiple Resolution segmentation - J. Liu and Y. H. Yang (1994) ( Image Segmentation)
- Multistep (SCCs Strongly Connected Components)
- Munro’s algorithm (SCCs Strongly Connected Components)
- Muzychuk (Circulant graphs Graph Isomorphism Problem)
- Myers and Miller (Edit sequence, local alignment Sequence Alignment)
- N-Queens Problem
- N-dimensional Quickhull (d-dimensional Convex Hull Convex Hull)
- NIEVERGELT. J.. AND PREPARATA (Section 2) (Reporting all intersection points / general polygons Line segment intersection)
- NIEVERGELT. J.. AND PREPARATA (Section 3) (Reporting all intersection points, convex polygons Line segment intersection)
- Naimi-Trehel's algorithm ( Mutual Exclusion)
- Naive (All Maximal Non-Branching Paths in a Graph All Maximal Non-Branching Paths in a Graph)
- Naive (Constructing Suffix Trees Constructing Suffix Trees)
- Naive (Longest Palindromic Substring Longest Palindromic Substring)
- Naive (Reporting all intersection points, line segments Line segment intersection)
- Naive ( 4NF Decomposition)
- Naive + 1 queen per row restriction (Counting Solutions; Constructing solutions n-Queens Problem)
- Naive Algorithm (Counting Solutions; Constructing solutions n-Queens Problem)
- Naive Implementation (Exact Laplacian Solver SDD Systems Solvers)
- Naive Implementation ( Integral Equations)
- Naive Implementation (k-dimensional space, l m (or l infty) norm Closest Pair Problem)
- Naive Selection (kth Order Statistic kth Order Statistic)
- Naive Solution (Median String Problem with Unbounded Alphabets Median String Problem)
- Naive algorithm (2-Dimensional Delaunay Triangulation Delaunay Triangulation)
- Naive algorithm (Discrete Fourier Transform Discrete Fourier Transform)
- Naive algorithm (Line Drawing Line Drawing)
- Naive algorithm (Matrix Multiplication Matrix Product)
- Naive algorithm (OBST Optimal Binary Search Trees)
- Naive algorithm (Subset Sum The Subset-Sum Problem)
- Naive algorithm ( Minimum value in each row of an implicitly-defined totally monotone matrix)
- Naive solution (The Frequent Words Problem The Frequent Words Problem)
- Naive solution ( Cardinality Estimation)
- Naive solution ( Frequent Words with Mismatches Problem)
- Naive sorting (Comparison Sorting Sorting)
- Naive sorting (Non-Comparison Sorting Sorting)
- Nakamae; E.; Kaneda; K.; Okamoto; T.; and Nishita 1990 (Diffuse Reflection Texture Mapping)
- Nakatsu et al. (LCS Longest Common Subsequence)
- Nash Equilibria
- Nate Green (Environment Mapping Texture Mapping)
- Nauck (Counting Solutions; Constructing solutions n-Queens Problem)
- Navarro (Sequence-to-Graph Alignment Sequence-to-Graph Alignment)
- Naïve algorithm ( Variance Calculations)
- Naïve string-search algorithm (Single String Search String Search)
- Nearest Neighbour
- Needleman–Wunsch algorithm (Edit sequence, global alignment Sequence Alignment)
- Nesetril, Poljak (k-Clique k-Clique Problem)
- Nested loop join ( Joins)
- Neuhaus, Riesen, Bunke (Inexact GED Graph Edit Distance Computation)
- Newton's method (Root Computation with continuous first derivative Root Computation)
- Newton's method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations)
- Newton–Raphson algorithm ( Maximum Likelihood Parameters)
- Nicholl–Lee–Nicholl (Rectangular Window Line Clipping)
- Niedermeier, Rossmanith (The Vertex Cover Problem The Vertex Cover Problem)
- Nivasch (Cycle Detection Cycle Detection)
- Nivasch ( Cycle Detection)
- Non-parametric sampling Efros and Leung (Texture Synthesis Texture Synthesis)
- Non-priority optimal interval Scheduling
- Non-recursion based (Tower of Hanoi Tower of Hanoi)
- Nordbeck and Rystedt (Grid Method) (Point-in-Polygon Point-in-Polygon)
- Nordbeck and Rystedt (Orientation) (Point-in-Polygon Point-in-Polygon)
- Nordbeck and Rystedt (Sum of area) (Point-in-Polygon Point-in-Polygon)
- Not frequently used (NFU) (Online Page Replacements)
- Not recently used (Online Page Replacements)
- Number Field Sieve (NFS) (Discrete Logarithm Over Finite Fields Logarithm Calculations)
- Numerical Analysis
- O'Neil 1973 (Boolean Matrix Multiplication Matrix Product)
- O(lg N) algorithm (convex polygonal window Line Clipping)
- OBF Algorithm (SCCs Strongly Connected Components)
- Occlusion Culling (Culling Culling)
- Ocone (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes))
- Odd Even Sort Parallel Implementation (Comparison Sorting Sorting)
- Okunev; Johnson (Square Matrix LU Decomposition LU Decomposition)
- Online 2-d Convex Hull, Preparata (2-dimensional Convex Hull, Online Convex Hull)
- Operating Systems
- Opheim simplification ( Line Simplification)
- Optimal Register Allocation (ORA), Goodwin & Wilken Algorithm (Global Register Allocation Register Allocation)
- Ord-Smith ( All permutations)
- Output-Sensitive Quantum BMM (Boolean Matrix Multiplication Matrix Product)
- Outside-In algorithm (Turnpike Problem Turnpike Problem)
- Overlap Layout Consensus (De Novo Genome Assembly De Novo Genome Assembly)
- P.Hanrahan and W.Krueger 1993 (Diffuse Reflection Texture Mapping)
- P. Costantini, B. I. Kvasov, and C. Manni (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation)
- P. Costantini; B. I. Kvasov; and C. Manni 1999 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation)
- PHITS Coheng Chan (Link Analysis Link Analysis)
- PINKALL U.; POLTHIER K 1993 (Mesh Parameterization Mesh Parameterization)
- PMS (Motif Search Motif Search)
- PSLQ algorithm (Integer Relation Integer Relation)
- PSOS algorithm (Integer Relation Integer Relation)
- Page replacements
- Painter's algorithm/Newell's algorithm ( Shown Surface Determination)
- Pan's algorithm (Matrix Multiplication Matrix Product)
- Papadimitriou and M Yannakakis (The Vertex Cover Problem The Vertex Cover Problem)
- Papadimitriou and M Yannakakis 1996 + Buss (The Vertex Cover Problem The Vertex Cover Problem)
- Paquet; Tobin; & Chaib-draa; 2005; (POMDPs POMDPs)
- Parallel Merge Sort - Cole (1) ( Sorting - Comparison)
- Parallel Merge Sort - Cole (2) ( Sorting - Comparison)
- Parameter-expanded expectation maximization (PX-EM) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables)
- Parameter-expanded expectation maximization (PX-EM) algorithm ( Maximum Likelihood Parameters)
- Parsing
- Particle filter Del Moral (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes))
- Path-based depth-first search Gabow (SCCs Strongly Connected Components)
- Path-based strong components algorithm; Dijkstra (SCCs Strongly Connected Components)
- Patrick Posser (Stable Roommates Problem Stable Matching Problem)
- Paturi, Pudlák, Saks, Zane (PPSZ) 2005 (k-SAT Boolean Satisfiability)
- Paul Purdom (Transitive Closure Strongly Connected Components)
- Pearce (SCCs Strongly Connected Components)
- Peng, Vempala (Sparse Linear system of equations)
- Perumalla and Deo (1D Maximum Subarray Maximum Subarray Problem)
- Peterson's algorithm ( Mutual Exclusion)
- Petford and Welsh (3-Graph Coloring Graph Coloring)
- Petro Vlahos Algorithm (Image Compositing Image Compositing)
- Pettie, Ramachandran (Undirected, General MST Minimum Spanning Tree (MST))
- Pettie & Ramachandran (APSP on Dense Undirected Graphs with Arbitrary Weights; APSP on Sparse Undirected Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP))
- Pferschy (Subset Sum The Subset-Sum Problem)
- Phillips & Westbrook (st-Maximum Flow Maximum Flow)
- Phong (Specular Reflection Texture Mapping)
- Pineau; Gordon; & Thrun; 2003; (POMDPs POMDPs)
- Pisinger (Subset Sum The Subset-Sum Problem)
- Pohlig-Hellman (Discrete Logarithm Over Finite Fields Logarithm Calculations)
- Point in Polygon
- Pollard's kangaroo algorithm (Discrete Logarithm Over Finite Fields Logarithm Calculations)
- Pollard's p − 1 algorithm (First Category Integer Factoring Integer Factoring)
- Pollard's rho algorithm (Discrete Logarithm Over Finite Fields Logarithm Calculations)
- Pollard's rho algorithm (First Category Integer Factoring Integer Factoring)
- Polygon clipping
- Polynomial interpolation
- Poupart; 2005; (POMDPs POMDPs)
- Power Iteration (Eigenpair with the Largest Eigenvalue Eigenvalues (Iterative Methods))
- Prakesh Ramanan (Approximate MCOP Matrix Chain Multiplication)
- Pratt (Constructing Suffix Trees Constructing Suffix Trees)
- Preparata and Hong (2-dimensional; 3-dimensional Convex Hull)
- Preparata and Shamos (Intersection sum of angle) (Point-in-Polygon Point-in-Polygon)
- Preparata and Shamos (Wedge) (Point-in-Polygon Point-in-Polygon)
- Press, Teukolsky, Flannery (Square Matrix LU Decomposition LU Decomposition)
- Prim's algorithm + Fibonacci heaps; Fredman & Tarjan (Undirected, General MST Minimum Spanning Tree (MST))
- Prim's algorithm + adjacency matrix searching (Undirected, General MST Minimum Spanning Tree (MST))
- Prim's algorithm + binary heap (Undirected, General MST Minimum Spanning Tree (MST))
- Priority Queue Algorithm (Duplicate Elimination Duplicate Elimination)
- Priority scheduling (Unweighted Interval Scheduling, Online?? Interval Scheduling)
- Priority scheduling (Unweighted Interval Scheduling, Online Interval Scheduling)
- Probabilistic Convolution Tree (Change-Making Problem Change-Making Problem)
- Projected radial search (k-ANNS for a dense 3D map of geometric points Nearest Neighbor Search)
- Projected radial search (k Approximate Nearest Neighbors Search (k-ANNS) for a dense 3D map of geometric points Nearest Neighbor Search)
- Psinger (Subset Sum The Subset-Sum Problem)
- Puterman Modified Policy Iteration (MPI) (Optimal Policies for MDPs Optimal Policies for MDPs)
- QR Matrix Decomposition (Matrix Factorization Collaborative Filtering)
- QR algorithm (All eigenvalues; Any eigenvalue Eigenvalues (Iterative Methods))