All pages
Jump to navigation
Jump to search
Previous page (Family:Distributed Locking Algorithms) | Next page (Miller; Stout (2-dimensional Convex Hull))
- 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 DFA Algorithm
- 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
- Hopcroft–Karp algorithm (Bipartite Graph MCM Maximum Cardinality Matching)
- Horn SAT
- 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)
- Huffman Encoding
- Huffman Tree Problem
- Hungarian Algorithm
- 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)
- Hyperbolic Spline Interpolation
- IDEA (Block Ciphers Block Ciphers)
- ILP
- INDEGREE analysis
- ITP Method (General Root Computation Root Computation)
- Illinois Algorithm (General Root Computation Root Computation)
- Illumination Mapping
- Image Compositing
- Image Processing
- Image Segmentation
- Image analogies Hertzmann (Texture Synthesis Texture Synthesis)
- Image quilting Efros-Freeman (Texture Synthesis Texture Synthesis)
- Improvement Rankings
- InDegree Analysis
- Incremental Heuristic Search ( Informed Search)
- Incremental convex hull algorithm; Michael Kallay ( Convex Hull)
- Independent Set Queries
- Index calculus algorithm (Discrete Logarithm Over Finite Fields, F q Logarithm Calculations)
- Inexact GED
- Inexact Laplacian Solver
- Informed Search
- Instance Identification
- Integer Factoring
- Integer Linear Programming
- Integer Maximum Flow
- Integer Relation Among Integers
- Integer Relation Among Reals
- 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)
- Jarvis Scan
- 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)
- Joins
- Jump Point Search (JPS) (Informed Search Informed Search)
- K-ANNS
- K-ANNS for a dense 3D map of geometric points
- K-Clique
- K-Clique Hypothesis
- K-Graph Coloring
- K-NNS
- K-OV
- K-OV Hypothesis
- K-SAT
- K-d Tree
- K-d Tree (Nearest Neighbor Search (NNS) Nearest Neighbor Search)
- K-dimensional space, $l m$ (or $l \infty$) norm
- 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 Approximate Nearest Neighbors Search
- K Nearest Neighbors Search
- K Riesen (Inexact GED Graph Edit Distance Computation)
- Kadane's Algorithm (1D Maximum Subarray Maximum Subarray Problem)
- Kahn's Algorithm
- 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
- 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
- Key exchange
- Keyed Hash Functions
- Khachiyan Ellipsoid Algorithm
- 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
- Knuth's DP algorithm (OBST Optimal Binary Search Trees)
- Knuth-Morris-Pratt (KMP) algorithm (Single String Search String Search)
- Knuth-Morris-Pratt Algorithm
- 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
- 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
- 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)
- LCS
- LCST
- 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)
- Largest Common Subtree
- 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's Graph Coloring Algorithm
- 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
- Lemke–Howson algorithm
- 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
- Linde–Buzo–Gray algorithm ( Voronoi Diagrams)
- Line Clipping
- Line Drawing
- Line Intersections
- Line Simplification
- Line drawing
- Linear Equations
- Linear Programming with Reals
- Linear Scan, Poletto & Sarkar (Global Register Allocation Register Allocation)
- Linear search (Nearest Neighbor Search (NNS) Nearest Neighbor Search)
- Link Analysis
- 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)
- List:Algorithms
- List:Domains
- List:Hypotheses
- List:Problem Families
- Liu (Decisional BCNF BCNF Decomposition)
- Local Alignment
- Local Register Allocation
- 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
- LogLog algorithm ( Cardinality Estimation)
- Logarithm calculations
- Lokshtanov (Subset Sum The Subset-Sum Problem)
- Long Multiplication ( Multiplication)
- Longest Common Subsequence
- Longest Common Substring with don't cares
- Longest Palindromic Substring
- Longest Path on Interval Graphs
- Longest common subsequence
- Longest distance first (LDF) page replacement algorithm (Online Page Replacements)
- Longest palindromic substring
- Longest path on interval graphs
- Loop Detection
- Lossless Compression
- Lossy Compression
- Lossy compression
- Lowe (2004) (Corner Detection Feature Detection)
- Lowest Common Ancestor
- Lowest Common Ancestor with Linking
- Lowest Common Ancestor with Linking Roots
- Lowest Common Ancestor with Static Trees
- Lowest Common Ancestors with Linking and Cutting
- 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)
- MAX-CNF-SAT
- MCF
- MCOP
- MCSP
- MD5 (Unkeyed Hash Functions One-Way Hash Functions)
- MDPs for optimal policies
- MIPS
- 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)
- Main Page
- Main Page/index.php
- 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 Chain Ordering Problem
- Matrix Chain Scheduling Problem
- Matrix Factorization
- Matrix Factorization for Collaborative Filtering
- Matrix Multiplication
- Matrix Product Verification
- Matrix chain multiplication
- Matrix inverse (General Linear system of equations)
- Matsunaga; Yamamoto (Lossy Compression Data Compression)
- Mauro Steigleder (Environment Mapping Texture Mapping)
- Max-Weight Rectangle
- Max-Weight k-Clique
- MaxSAT
- MaxSCC
- Max Cut
- Maximally stable extremal regions Matas 2002 (Blob Detection Feature Detection)
- Maximum-Weight Matching
- Maximum-weight matching
- Maximum Cut
- Maximum Flow
- Maximum Inner Product Search
- Maximum Likelihood Methods in Unknown Latent Variables
- Maximum Likelihood Parameters
- Maximum Local Edge Connectivity
- Maximum Square Subarray
- Maximum Strongly Connected Component
- Maximum Subarray
- Maximum Subsequence
- Maximum TSP
- 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)
- Median
- Median String Problem with Binary Alphabets
- Median String Problem with Bounded Alphabets
- Median String Problem with Unbounded Alphabets
- Melhorn's Approximation algorithm (Approximate OBST Optimal Binary Search Trees)
- Merge Sort (Comparison Sorting Sorting)
- Mesh Parameterization
- Mesh Simplification
- Method of Four Russians (Boolean Matrix Multiplication (Combinatorial) Matrix Product)
- Method of Four Russians ( Matrix Multiplication)
- Metricity
- 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)