Pages with the fewest revisions
Jump to navigation
Jump to search
Showing below up to 500 results in range #501 to #1,000.
View (previous 500 | next 500) (20 | 50 | 100 | 250 | 500)
- Outside-In algorithm (Turnpike Problem Turnpike Problem) (1 revision)
- Output-Sensitive Quantum BMM (Boolean Matrix Multiplication Matrix Product) (1 revision)
- Orthogonal Vectors Hypothesis (OVH) (1 revision)
- Ord-Smith ( All permutations) (1 revision)
- Operating Systems (1 revision)
- Online Matrix Vector Multiplication Hypothesis (OMV Hypothesis) (1 revision)
- Online 2-d Convex Hull, Preparata (2-dimensional Convex Hull, Online Convex Hull) (1 revision)
- Okunev; Johnson (Square Matrix LU Decomposition LU Decomposition) (1 revision)
- Odd Even Sort Parallel Implementation (Comparison Sorting Sorting) (1 revision)
- Ocone (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (1 revision)
- Occupancy Grid Mapping (1 revision)
- Occlusion Culling (Culling Culling) (1 revision)
- OBF Algorithm (SCCs Strongly Connected Components) (1 revision)
- O'Neil 1973 (Boolean Matrix Multiplication Matrix Product) (1 revision)
- Numerical Analysis (1 revision)
- Number Field Sieve (NFS) (Discrete Logarithm Over Finite Fields Logarithm Calculations) (1 revision)
- Not recently used (Online Page Replacements) (1 revision)
- Not frequently used (NFU) (Online Page Replacements) (1 revision)
- Nordbeck and Rystedt (Sum of area) (Point-in-Polygon Point-in-Polygon) (1 revision)
- Nordbeck and Rystedt (Orientation) (Point-in-Polygon Point-in-Polygon) (1 revision)
- Nondeterministic Strong Exponential Time Hypothesis (NSETH) (1 revision)
- Non-priority optimal interval Scheduling (1 revision)
- Non-parametric sampling Efros and Leung (Texture Synthesis Texture Synthesis) (1 revision)
- No-Steal/Force (1 revision)
- No-Steal, Force (1 revision)
- Nivasch ( Cycle Detection) (1 revision)
- Nivasch (Cycle Detection Cycle Detection) (1 revision)
- Niedermeier, Rossmanith (The Vertex Cover Problem The Vertex Cover Problem) (1 revision)
- Newton–Raphson algorithm ( Maximum Likelihood Parameters) (1 revision)
- Newton's method (Root Computation with continuous first derivative Root Computation) (1 revision)
- Neuhaus, Riesen, Bunke (Inexact GED Graph Edit Distance Computation) (1 revision)
- Nested Loop Join (1 revision)
- Nesetril, Poljak (k-Clique k-Clique Problem) (1 revision)
- Needleman–Wunsch algorithm (Edit sequence, global alignment Sequence Alignment) (1 revision)
- Needleman–Wunsch algorithm (1 revision)
- Nearest Neighbour (1 revision)
- Naïve string-search algorithm (Single String Search String Search) (1 revision)
- Nauck (Counting Solutions; Constructing solutions n-Queens Problem) (1 revision)
- Nate Green (Environment Mapping Texture Mapping) (1 revision)
- Nash Equilibria (1 revision)
- Nakatsu et al. (LCS Longest Common Subsequence) (1 revision)
- Nakamae; E.; Kaneda; K.; Okamoto; T.; and Nishita 1990 (Diffuse Reflection Texture Mapping) (1 revision)
- Naive solution ( Frequent Words with Mismatches Problem) (1 revision)
- Naive solution ( Cardinality Estimation) (1 revision)
- Naive algorithm (OBST Optimal Binary Search Trees) (1 revision)
- Naive algorithm (Matrix Multiplication Matrix Product) (1 revision)
- Naive algorithm (Discrete Fourier Transform Discrete Fourier Transform) (1 revision)
- Naive algorithm (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (1 revision)
- Naive Implementation ( Integral Equations) (1 revision)
- Naive Implementation (Exact Laplacian Solver SDD Systems Solvers) (1 revision)
- Naive Algorithm (Counting Solutions; Constructing solutions n-Queens Problem) (1 revision)
- Naive + 1 queen per row restriction (Counting Solutions; Constructing solutions n-Queens Problem) (1 revision)
- Naive ( 4NF Decomposition) (1 revision)
- Naive (Constructing Suffix Trees Constructing Suffix Trees) (1 revision)
- NIEVERGELT. J.. AND PREPARATA (Section 2) (Reporting all intersection points / general polygons Line segment intersection) (1 revision)
- N-dimensional Quickhull (d-dimensional Convex Hull Convex Hull) (1 revision)
- N-Queens Problem (1 revision)
- Myers and Miller (Edit sequence, local alignment Sequence Alignment) (1 revision)
- Muzychuk (Circulant graphs Graph Isomorphism Problem) (1 revision)
- Multistep (SCCs Strongly Connected Components) (1 revision)
- Multiple Resolution segmentation - J. Liu and Y. H. Yang (1994) ( Image Segmentation) (1 revision)
- Multilevel queue scheduling (Unweighted Interval Scheduling, Online Interval Scheduling) (1 revision)
- Multilevel queue scheduling (Unweighted Interval Scheduling, Online?? Interval Scheduling) (1 revision)
- Multi-scale MAP estimation - A. Bouman and M. Shapiro (2002) ( Image Segmentation) (1 revision)
- Muller's method (General Root Computation Root Computation) (1 revision)
- Mukhopadhyay (LCS Longest Common Subsequence) (1 revision)
- Mucha and Sankowski ( Maximum-Weight Matching) (1 revision)
- Mucha, Sankowski (general) (General Graph MCM Maximum Cardinality Matching) (1 revision)
- MotifSampler (Motif Search Motif Search) (1 revision)
- More Believable Exponential Time Hypothesis (MBETH) (1 revision)
- Moravec's algorithm 1980 (Corner Detection Feature Detection) (1 revision)
- Moore's algorithm (DFA Minimization DFA Minimization) (1 revision)
- Money Change (1 revision)
- Modified van Leeuwen (Static Trees) (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) (1 revision)
- Modified van Leeuwen (Linking Roots) (Lowest Common Ancestor with Linking Roots Lowest Common Ancestor) (1 revision)
- Modified Knuth's DP algorithm (OBST Optimal Binary Search Trees) (1 revision)
- Mixed Integer Programming (n player games Nash Equilibria) (1 revision)
- Mitra (Motif Search Motif Search) (1 revision)
- Min/max sketches streaming algorithm (streaming Cardinality Estimation) (1 revision)
- Min. Spanning Tree (1 revision)
- Min-Weight k-Clique Hypothesis (1 revision)
- Miller and Myers (LCS Longest Common Subsequence) (1 revision)
- Miller-Tucker-Zemlin (MTZ) formulation (Minimum TSP The Traveling-Salesman Problem) (1 revision)
- Micali, Vazirani (general graph Maximum cardinality matching) (1 revision)
- Method of Four Russians ( Matrix Multiplication) (1 revision)
- Method of Four Russians (Boolean Matrix Multiplication (Combinatorial) Matrix Product) (1 revision)
- Mesh Simplification (1 revision)
- Melhorn's Approximation algorithm (Approximate OBST Optimal Binary Search Trees) (1 revision)
- McKay ( Graph Isomorphism Problem) (1 revision)
- McCreight (Constructing Suffix Trees Constructing Suffix Trees) (1 revision)
- McAllester & Singh; 1999; (POMDPs POMDPs) (1 revision)
- Maxwell ( 4NF Decomposition) (1 revision)
- Maximum subarray problem (1 revision)
- Maximum cut (1 revision)
- Maximum cardinality matching (1 revision)
- Maximum a Posteriori Occupancy Mapping (Occupancy Grid Mapping Occupancy Grid Mapping) (1 revision)
- Maximum Inner Product Search (1 revision)
- Maximum Flow (1 revision)
- Maximum-weight matching (1 revision)
- Maximally stable extremal regions Matas 2002 (Blob Detection Feature Detection) (1 revision)
- Mauro Steigleder (Environment Mapping Texture Mapping) (1 revision)
- Matsunaga; Yamamoto (Lossy Compression Data Compression) (1 revision)
- Matrix inverse (General Linear system of equations) (1 revision)
- Matrix chain multiplication (1 revision)
- Matrix Factorization for Collaborative Filtering (1 revision)
- Masek; Patterson (Edit distance Sequence Alignment) (1 revision)
- Masek; Patterson (Edit distance, constant-size alphabet Sequence Alignment) (1 revision)
- Masek, Paterson (Edit sequence Sequence Alignment) (1 revision)
- Masek, Paterson (Edit sequence, constant-size alphabet Sequence Alignment) (1 revision)
- Manlove; Malley (Stable Marriage Problem Stable Matching Problem) (1 revision)
- Maekawa's algorithm ( Mutual Exclusion) (1 revision)
- Madry ( Maximum Flow) (1 revision)
- Madry's algorithm (Bipartite Graph MCM Maximum Cardinality Matching) (1 revision)
- MRRR algorithm (Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods)) (1 revision)
- MKM Algorithm ( Maximum Flow) (1 revision)
- MDPs for optimal policies (1 revision)
- MD5 (Unkeyed Hash Functions One-Way Hash Functions) (1 revision)
- MATSF (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems) (1 revision)
- Lund & Yannakakis ( The Set-Covering Problem) (1 revision)
- Lucifer / DES (Block Ciphers Block Ciphers) (1 revision)
- Lowe’s Algorithm (SCCs Strongly Connected Components) (1 revision)
- Lowest common ancestor (1 revision)
- Lowe (2004) (Corner Detection Feature Detection) (1 revision)
- Lossy compression (1 revision)
- Longest path on interval graphs (1 revision)
- Longest palindromic substring (1 revision)
- Longest distance first (LDF) page replacement algorithm (Online Page Replacements) (1 revision)
- Longest common subsequence (1 revision)
- Lokshtanov (Subset Sum The Subset-Sum Problem) (1 revision)
- Logarithm calculations (1 revision)
- LogLog algorithm ( Cardinality Estimation) (1 revision)
- LogLog Algorithm (1 revision)
- Locality-sensitive hashing (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search) (1 revision)
- Locality-sensitive hashing (k-ANNS Nearest Neighbor Search) (1 revision)
- Local scale-invariant Lowe 1999 (Blob Detection Feature Detection) (1 revision)
- Liu (Decisional BCNF BCNF Decomposition) (1 revision)
- List:Problem Families (1 revision)
- List:Hypotheses (1 revision)
- List:Domains (1 revision)
- Lipton; Mehta (2-player Nash Equilibria) (1 revision)
- Lipton, Markakis and Mehta method 2 (n player games Nash Equilibria) (1 revision)
- Lipton, Markakis and Mehta method (2 player games Nash Equilibria) (1 revision)
- Lin–Kernighan (Approximate TSP The Traveling-Salesman Problem) (1 revision)
- Link analysis (PAGERANK and variants) (1 revision)
- Linear Scan, Poletto & Sarkar (Global Register Allocation Register Allocation) (1 revision)
- Linear Equations (1 revision)
- Line drawing (1 revision)
- Line Intersections (1 revision)
- Line Clipping (1 revision)
- Linde–Buzo–Gray Algorithm (1 revision)
- Lindeberg 2005 (Corner Detection Feature Detection) (1 revision)
- Lindeberg (1998) (Corner Detection Feature Detection) (1 revision)
- Lindeberg (1994) (Corner Detection Feature Detection) (1 revision)
- Lindeberg's watershed-based grey-level blob detection algorithm 1991 (Blob Detection Feature Detection) (1 revision)
- Linda G. Shapiro and George C. Stockman (2001) ( Image Segmentation) (1 revision)
- Lifelong Planning A* (LPA*) (Informed Search Informed Search) (1 revision)
- Lien (4NF Decomposition for Conflict-Free Dependency Sets 4NF Decomposition) (1 revision)
- Liang Cwinnower ( Motif Search) (1 revision)
- Liang Cwinnower (Motif Search Motif Search) (1 revision)
- Lewis 1978 (Renamable Horn Boolean Satisfiability) (1 revision)
- Levinson–Durbin recursion (Toeplitz Matrix Linear System) (1 revision)
- Levcopoulos; Lingas; Sack (Approximate OBST Optimal Binary Search Trees) (1 revision)
- Lemke–Howson algorithm (2-player Nash Equilibria) (1 revision)
- Lemke–Howson algorithm (1 revision)
- Lemke–Howson Algorithm (1 revision)
- Lemke-Howson Algorithm (2 player games Nash Equilibria) (1 revision)
- Lehmer's GCD algorithm (Greatest Common Divisor Greatest Common Divisor) (1 revision)
- Lee; Peng; Spielman (Inexact Laplacian Solver SDD Systems Solvers) (1 revision)
- Lee, Sidford ( Maximum Flow) (1 revision)
- Least recently used (Online Page Replacements) (1 revision)
- Leases (Cary G Gray and David R Cheriton) (Distributed Locking Algorithms Distributed Locking Algorithms) (1 revision)
- Lawrence Gibbs Sampling (Motif Search Motif Search) (1 revision)
- Lawrence, Reilly (Motif Search Motif Search) (1 revision)
- Lawler ( Chromatic Number) (1 revision)
- Lawler (4-Graph Coloring Graph Coloring) (1 revision)
- Lawler; E. L. (Minimum TSP The Traveling-Salesman Problem) (1 revision)
- Lawler's Graph Coloring Algorithm (1 revision)
- Larsen, Williams (follows from Theorem 2.1) ( Online Matrix Vector Multiplication (OMV)) (1 revision)
- Larsen, Williams (Theorem 1.1) ( Online Matrix Vector Multiplication (OMV)) (1 revision)
- Larmore (Approximate OBST Optimal Binary Search Trees) (1 revision)
- Langdon ( All permutations) (1 revision)
- Lamport's bakery algorithm ( Mutual Exclusion) (1 revision)
- Laguerre iteration (Any eigenvalue Eigenvalues (Iterative Methods)) (1 revision)
- L Chang (Inexact GED Graph Edit Distance Computation) (1 revision)
- LU decomposition (General Linear system of equations) (1 revision)
- LU decomposition (1 revision)
- LU Matrix Decomposition (Matrix Factorization Collaborative Filtering) (1 revision)
- LOBPCG algorithm (Eigenpair closest to mu; Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods)) (1 revision)
- LLL algorithm (Integer Relation Integer Relation) (1 revision)
- L. Kitchen and A. Rosenfeld (Grey-scale Corner Detection) (1 revision)
- L. Kitchen and A. Rosenfeld (Corner Detection Feature Detection) (1 revision)
- Kwatra 2003 (Texture Synthesis Texture Synthesis) (1 revision)
- Kvasov 2006 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) (1 revision)
- Kushner non-linear filter (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (1 revision)
- Kuo and Cross (LCS Longest Common Subsequence) (1 revision)
- Kth order statistic (1 revision)
- Kruskal's Algorithm (1 revision)
- Korada and R. Urbanke; (Lossy Compression Data Compression) (1 revision)
- Kong and Wilken Algorithm (Global Register Allocation Register Allocation) (1 revision)
- Koivisto ( Chromatic Polynomial) (1 revision)
- Koivisto ( Chromatic Number) (1 revision)
- Knuth–Bendix algorithm (General Groups (uncompleted?) Coset Enumeration) (1 revision)
- Knuth–Bendix algorithm (Coset Enumeration Coset Enumeration) (1 revision)
- Knuth-Morris-Pratt Algorithm (1 revision)
- Knuth's DP algorithm (OBST Optimal Binary Search Trees) (1 revision)
- Knuth's DP Algorithm (1 revision)
- Kmett (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) (1 revision)
- Klinz (Subset Sum The Subset-Sum Problem) (1 revision)
- Kleitman–Wang Algorithm (Digraph Realization Problem Graph Realization Problems) (1 revision)
- Kleinberg (Link Analysis Link Analysis) (1 revision)
- Klein (section 5) (Planar Bipartite Graph Perfect Matching Maximum Cardinality Matching) (1 revision)
- Klawe; Mumey (Alphabetic Tree Problem Optimal Binary Search Trees) (1 revision)
- Kingsford ( Motif Search) (1 revision)
- Kingsford (Motif Search Motif Search) (1 revision)
- Khuller; Matias Randomized Sieve ( Closest Pair Problem) (1 revision)
- Khuller; Matias ( Closest Pair Problem) (1 revision)
- Khuller, Matias (k-dimensional space, Euclidean metric Closest Pair Problem) (1 revision)
- Khachiyan Ellipsoid Algorithm (1 revision)
- Key exchange (1 revision)
- Kazuhisa Makino, Takeaki Uno; Section 6 (Enumerating Maximal Cliques, arbitrary graph Clique Problems) (1 revision)
- Kass; Witkin and Terzopoulos ( Image Segmentation) (1 revision)
- Karzanov ( Maximum Flow) (1 revision)
- Karpinski (Approximate OBST Optimal Binary Search Trees) (1 revision)
- Karmarkar's algorithm ( Linear Programming) (1 revision)
- Karger, Blum ( Graph Coloring) (1 revision)
- Karatsuba Algorithm (1 revision)
- Kalman Filter (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (1 revision)
- Kajiya; J. Anisotropic Reflection Models 1985 (Diffuse Reflection Texture Mapping) (1 revision)
- Kahn's Algorithm (1 revision)
- Kadane's Algorithm (1D Maximum Subarray Maximum Subarray Problem) (1 revision)
- K Riesen (Inexact GED Graph Edit Distance Computation) (1 revision)
- KARNI Z.; GOTSMAN C.; GORTLER S. J. 2005 (Mesh Parameterization Mesh Parameterization) (1 revision)
- KALYAN PERUMALLA and NARSINGH DEO (2-dimensional Maximum subarray problem) (1 revision)
- K. Mikolajczyk; K. and C. Schmid LoG 2004 (Corner Detection Feature Detection) (1 revision)
- K-d Tree (1 revision)
- K-OV Hypothesis (1 revision)
- K-Clique Hypothesis (1 revision)
- K-ANNS for a dense 3D map of geometric points (1 revision)
- Jump Point Search (JPS) (Informed Search Informed Search) (1 revision)
- Johnson (Edmonds-Karp-based) (bipartite (i.e. assignment), general Maximum-weight matching) (1 revision)
- Johnson (3-Graph Coloring Graph Coloring) (1 revision)
- Johnson; D. S.; McGeoch; L. A. ( The Traveling-Salesman Problem) (1 revision)
- Johnson's algorithm (Directed, Weighted (Arbitrary weights) All-Pairs Shortest Paths (APSP)) (1 revision)
- Jiang, Song, Weinstein and Zhang ( Linear Programming) (1 revision)
- Jeh and Widom (Link Analysis Link Analysis) (1 revision)
- Jarvis Scan (1 revision)
- James B Orlin's + KRT (King; Rao; Tarjan)'s algorithm (st-Maximum Flow Maximum Flow) (1 revision)
- Jalali and T. Weissman (Lossy Compression Data Compression) (1 revision)
- Jacobi eigenvalue algorithm (All eigenvalues; Any eigenvalue Eigenvalues (Iterative Methods)) (1 revision)
- J. J. Koenderink and W. Richards 1988 (Corner Detection Feature Detection) (1 revision)
- J. Chen; L. Liu; and W. Jia. (The Vertex Cover Problem, Degrees Bounded By 3 The Vertex Cover Problem) (1 revision)
- J.-C. Nebel 1998 ( Ray Tracing) (1 revision)
- Ives' algorithm c ( All permutations) (1 revision)
- Iterative Deepening A* (IDA*) (Informed Search Informed Search) (1 revision)
- Iterated conditional modes algorithm ( Image Segmentation) (1 revision)
- Isometric graph partitioning - Leo Grady and Eric L. Schwartz (2006) ( Image Segmentation) (1 revision)
- Irving's Algorithm (Stable Roommates Problem Stable Matching Problem) (1 revision)
- Inverse quadratic interpolation (General Root Computation Root Computation) (1 revision)
- Inverse iteration (Eigenpair closest to mu; Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods)) (1 revision)
- Integer relation (1 revision)
- Integer linear program Vazirani (Unweighted Set-Covering; Weighted Set-Covering The Set-Covering Problem) (1 revision)
- Index calculus algorithm (Discrete Logarithm Over Finite Fields, F q Logarithm Calculations) (1 revision)
- Incremental Heuristic Search ( Informed Search) (1 revision)
- Improvement Rankings (1 revision)
- Image quilting Efros-Freeman (Texture Synthesis Texture Synthesis) (1 revision)
- Image Processing (1 revision)
- Image Compositing (1 revision)
- Illinois Algorithm (General Root Computation Root Computation) (1 revision)
- ITP Method (General Root Computation Root Computation) (1 revision)
- INDEGREE analysis (1 revision)
- IDEA (Block Ciphers Block Ciphers) (1 revision)
- HyperLogLog algorithm ( Cardinality Estimation) (1 revision)
- HyperLogLog++ ( Cardinality Estimation) (1 revision)
- Hybrid Algorithm (De Novo Genome Assembly De Novo Genome Assembly) (1 revision)
- Hu–Tucker algorithm (Alphabetic Tree Problem Optimal Binary Search Trees) (1 revision)
- Hunt and Szymanski (LCS Longest Common Subsequence) (1 revision)
- Hungarian algorithm (Bipartite Maximum-Weight Matching Maximum-Weight Matching) (1 revision)
- Hungarian Algorithm (1 revision)
- Hsu and Du (Scheme 2) (LCS Longest Common Subsequence) (1 revision)
- Hsu and Du (Scheme 1) (LCS Longest Common Subsequence) (1 revision)
- Howard Policy Iteration (PI) (Optimal Policies for MDPs Optimal Policies for MDPs) (1 revision)
- Householder's Method (Root Computation with continuous derivatives (up to d) Root Computation) (1 revision)
- Hopcroft–Karp algorithm (1 revision)
- Hopcroft's algorithm (DFA Minimization DFA Minimization) (1 revision)
- Hopcroft's DFA Algorithm (1 revision)
- Hong’s algorithm (SCCs Strongly Connected Components) (1 revision)
- Homotopy method (All eigenpairs; Eigenpair closest to mu; Any eigenpair; Any eigenvalue; All eigenvalues Eigenvalues (Iterative Methods)) (1 revision)
- Hoare's Selection Algorithm (1 revision)
- Hitting Set Hypothesis (HS Hypothesis) (1 revision)
- Historical Origins (1 revision)
- Hirschberg (LCS Longest Common Subsequence) (1 revision)
- Hirschberg's algorithm (Edit sequence Sequence Alignment) (1 revision)
- Hirschberg's algorithm (Edit sequence, constant-size alphabet Sequence Alignment) (1 revision)
- Hirsch (3-Graph Coloring Graph Coloring) (1 revision)
- Higham (2-D Polynomial Interpolation Polynomial Interpolation) (1 revision)
- Hierholzer's algorithm (Constructing Eulerian Trails in a Graph Constructing Eulerian Trails in a Graph) (1 revision)
- Hierholzer's Algorithm (1 revision)
- Hierarchical Navigable Small World (HNSW) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search) (1 revision)
- Hierarchical Navigable Small World (HNSW) (k-ANNS Nearest Neighbor Search) (1 revision)
- Hessian-Laplace Mikolajczyk and Schmid 2004 (Blob Detection Feature Detection) (1 revision)
- Hessain Determinant Lindeberg 1998 (Blob Detection Feature Detection) (1 revision)
- Hessain Determinant Lindeberg 1994 (Blob Detection Feature Detection) (1 revision)
- Hertli (Modified PPSZ) (4SAT Boolean Satisfiability) (1 revision)
- Hertli (Modified PPSZ) (3SAT Boolean Satisfiability) (1 revision)
- Hentenryck et. al. (Arc Consistency? Stable Matching Problem) (1 revision)
- Held–Karp algorithm (Minimum TSP The Traveling-Salesman Problem) (1 revision)
- Held–Karp Algorithm (1 revision)
- Helden Oligo-Analysis ( Motif Search) (1 revision)
- Helden Oligo-Analysis (Motif Search Motif Search) (1 revision)
- Heidrich; W.; and H.-P. Seidel (Environment Mapping Texture Mapping) (1 revision)
- Heejo Lee; Jong Kim; Sungje Hong; and Sunggu Lee (Approximate MCSP Matrix Chain Multiplication) (1 revision)
- He; X. D.; Torrance; K. E.; Sillion; 1991 (Diffuse Reflection Texture Mapping) (1 revision)
- Haveliwala (Link Analysis Link Analysis) (1 revision)
- Hauskrecht; 2000; (POMDPs POMDPs) (1 revision)
- Hashing (kth Order Statistic kth Order Statistic) (1 revision)
- Haselgrove; Leech and Trotter (Bounded Subgroup Index Coset Enumeration) (1 revision)
- Haselgrove-Leech-Trotter (HLT) algorithm (Coset Enumeration Coset Enumeration) (1 revision)
- Harris and Stephens algorithm ( Corner Detection) (1 revision)
- Harris and Stephens algorithm (Corner Detection Feature Detection) (1 revision)
- Hariharan (Constructing Suffix Trees Constructing Suffix Trees) (1 revision)
- Harel, Tarjan (Static Trees) (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) (1 revision)
- Harel, Tarjan (Linking Roots) (Lowest Common Ancestor with Linking Roots Lowest Common Ancestor) (1 revision)
- Hanoi graph (Tower of Hanoi Tower of Hanoi) (1 revision)
- Halley's method (Root Computation with continuous second derivative Root Computation) (1 revision)
- HORMANN K.; GREINER G 1999 (Mesh Parameterization Mesh Parameterization) (1 revision)
- HEALPix mapping Wong (Environment Mapping Texture Mapping) (1 revision)
- H.W.Jensen 2001 (Diffuse Reflection Texture Mapping) (1 revision)
- Gutina; Gregory; Yeob; Anders; Zverovich; Alexey ( The Traveling-Salesman Problem) (1 revision)
- Gupta; Verdu (Lossy Compression Data Compression) (1 revision)
- Gunther Determinants solution (Counting Solutions; Constructing solutions n-Queens Problem) (1 revision)
- Gröbner bases (1 revision)
- Gronlund, Pettie (3-Clique Exact-Weight k-Clique Problem) (1 revision)
- Grigoryan (n-Queens Completion n-Queens Problem) (1 revision)
- Gries (1D Maximum Subarray Maximum Subarray Problem) (1 revision)
- Gries, Martin (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem) (1 revision)
- Grenander (1D Maximum Subarray Maximum Subarray Problem) (1 revision)
- Boolean Matrix Multiplication Hypothesis (BMM Hypothesis) (1 revision)
- Family:Geometric Separator Problems (1 revision)
- Approximate Hard-Margin SVM (1 revision)
- Family:Geometric Incidence Problems (1 revision)
- Family:Geometric Covering Problems (1 revision)
- Family:Generating Random Permutations (1 revision)
- Family:Feature Detection (1 revision)
- Family:Eigenvalues (Iterative Methods) (1 revision)
- Family:Dihedral Rotation Queries (1 revision)
- Family:Dependency Inference Problem (1 revision)
- Family:Deadlock Avoidance (1 revision)
- Family:Data Compression (1 revision)
- Family:DFA Minimization (1 revision)
- Family:Convex Hull (1 revision)
- Family:Closest Pair Problem (1 revision)
- Family:Clique Problems (1 revision)
- Family:CFG Problems (1 revision)
- Family:Boolean Satisfiability (1 revision)
- Family:BCNF Decomposition (1 revision)
- Arbitrator solution (Dining Philosophers Problem Deadlock Avoidance) (1 revision)
- Asymptotically fast Toeplitz algorithms (Toeplitz Linear system of equations) (1 revision)
- Family:All-Pairs Shortest Paths (APSP) (1 revision)
- Family:AST to Code Translation (1 revision)
- Family:4NF Decomposition (1 revision)
- Family:3SUM (1 revision)
- B.I. Kvasov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) (1 revision)
- B. I. Kvasov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) (1 revision)
- False position method (General Root Computation Root Computation) (1 revision)
- Fagin (4NF Decomposition for Functional and Multivalued Dependency Sets 4NF Decomposition) (1 revision)
- B. I. Kvasov 2000 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) (1 revision)
- BFS/DFS for connected components ( (1 revision)
- Factorization of polynomials over finite fields (1 revision)
- BLAKE2 (Optional Key? One-Way Hash Functions) (1 revision)
- Faaland (Subset Sum The Subset-Sum Problem) (1 revision)
- FOGSAA (Edit sequence, global alignment Sequence Alignment) (1 revision)
- BOM (Backward Oracle Matching) (Single String Search String Search) (1 revision)
- BOYS algorithm (Entity Resolution Entity Resolution) (1 revision)
- FLOATER 2003 (Mesh Parameterization Mesh Parameterization) (1 revision)
- FLOATER 1997 (Mesh Parameterization Mesh Parameterization) (1 revision)
- FAST E. Rosten and T. Drummond 2006 (Corner Detection Feature Detection) (1 revision)
- FASTA (Edit sequence, local alignment Sequence Alignment) (1 revision)
- Babai & Codenotti (Hypergraphs isomorphism Graph Isomorphism Problem) (1 revision)
- Exponential Time Hypothesis (ETH) (1 revision)
- Babai ( Graph Isomorphism Problem) (1 revision)
- Expectation–maximization (EM) algorithm ( Maximum Likelihood Parameters) (1 revision)
- Babai 1980 (Graph Isomorphism, Bounded Vertex Valences Graph Isomorphism Problem) (1 revision)
- Expectation conditional maximization either (ECME) (Liu; Chuanhai; Rubin; Donald B) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) (1 revision)
- Babai 1980 (Graph Isomporhism, Trivalent Graphs Graph Isomorphism Problem) (1 revision)
- Expectation conditional maximization (ECM) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) (1 revision)
- Expectation-Maximization (EM) algorithm (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) (1 revision)
- Babai and Luks (Graph Isomorphism, General Graphs Graph Isomorphism Problem) (1 revision)
- Baby-step Giant-step (Discrete Logarithm Over Finite Fields Logarithm Calculations) (1 revision)
- Exhaustive search (k-OV Orthogonal Vectors) (1 revision)
- Backward Non-Deterministic DAWG Matching (BNDM) (Single String Search String Search) (1 revision)
- Exhaustive search (The Vertex Cover Problem The Vertex Cover Problem) (1 revision)
- Exhaustive search (Minimum Wiener Connector problem Wiener Index) (1 revision)
- Exact k-Clique Hypothesis (1 revision)
- Bailey TL; Elkan C MEME (Motif Search Motif Search) (1 revision)
- Bailey TL; Elkan C MEME ( Motif Search) (1 revision)
- Balasubramanian; Fellows (The Vertex Cover Problem The Vertex Cover Problem) (1 revision)
- Banker's Algorithm (Deadlock Avoidance Deadlock avoidance) (1 revision)
- Bareiss Algorithm (Toeplitz Matrix Linear System) (1 revision)
- Euclid's algorithm (Greatest Common Divisor Greatest Common Divisor) (1 revision)
- Barto;Bradtke; & Singhe; 1995; (POMDPs POMDPs) (1 revision)
- Basic Local Alignment Search Tool (BLAST) (Edit Sequence, constant-size alphabet Sequence Alignment) (1 revision)
- Epstein (Subset Sum The Subset-Sum Problem) (1 revision)
- Eppstein ( Chromatic Number) (1 revision)
- Eppstein (Subset Sum The Subset-Sum Problem) (1 revision)
- Environment Mapping (1 revision)
- Bayer, McCreight B-Tree ( Self-Balancing Trees Deletion) (1 revision)
- Enumerating Maximal Cliques (1 revision)
- Entity resolution (1 revision)
- Bayer, McCreight B-Tree ( Self-Balancing Trees Insertion) (1 revision)
- Bayer, McCreight B-Tree ( Self-Balancing Trees Search) (1 revision)
- Bcrypt (Unkeyed Hash Functions One-Way Hash Functions) (1 revision)
- Emil Praun (Environment Mapping Texture Mapping) (1 revision)
- Bead Sort (Non-Comparison Sorting Sorting) (1 revision)
- Elliptic-curve Diffie-Hellman (ECDH) (Key Exchange Key Exchange) (1 revision)
- Elliptic-curve Diffie-Hellman (ECDH) (1 revision)
- Bellman-Ford Algorithm (1 revision)
- Bellman Value Iteration (VI) (Optimal Policies for MDPs Optimal Policies for MDPs) (1 revision)
- Edmonds (Maximum-Weight Matching Maximum-Weight Matching) (1 revision)
- Edmonds-Karp Algorithm (1 revision)
- Edmonds-Karp (bipartite (i.e. assignment), general Maximum-weight matching) (1 revision)
- Bentley-Ottmann Algorithm (1 revision)
- Bentley (2-dimensional Maximum subarray problem) (1 revision)
- Berger & Müller-Hannemann (DAG Realization Problem Graph Realization Problems) (1 revision)
- Berkman; Vishkin (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) (1 revision)
- Earley parser (CFG Parsing CFG Problems) (1 revision)
- EM Based Winkler (Entity Resolution Entity Resolution) (1 revision)
- Bertsekas & Castanon; 1999; (POMDPs POMDPs) (1 revision)
- ECK M.; DEROSE T.; DUCHAMP T.; 1995 (Mesh Parameterization Mesh Parameterization) (1 revision)
- Dürer rendering algorithm ( Ray Tracing) (1 revision)
- Bidirectional A* Algorithm (Informed Search Informed Search) (1 revision)
- Dynamic Programming (Rod-Cutting Problem Rod-Cutting Problem) (1 revision)
- Dynamic Programming (Longest Palindromic Substring Longest Palindromic Substring) (1 revision)
- Dynamic Programming (Change-Making Problem Change-Making Problem) (1 revision)
- Bijaoui and Rué ( Image Segmentation) (1 revision)
- Dynamic 2-d Convex Hull, Overmars and van Leeuwen (2-dimensional Convex Hull, Dynamic Convex Hull) (1 revision)
- Dyer (2-dimensional array representation Closest Pair Problem) (1 revision)
- Binary GCD algorithm (Greatest Common Divisor Greatest Common Divisor) (1 revision)
- Binary representation search with matrix multiplication (Unweighted Graph Diameter) (1 revision)
- Binary space partitioning (BSP) ( Shown Surface Determination) (1 revision)
- Bini's algorithm (Matrix Multiplication Matrix Product) (1 revision)
- BioInformatics (1 revision)
- Bird (1D Maximum Subarray Maximum Subarray Problem) (1 revision)
- Bisection method (Any eigenvalue Eigenvalues (Iterative Methods)) (1 revision)
- Durstenfeld's Algorithm 235 (General Permutations Generating Random Permutations) (1 revision)
- Bisection method (General Root Computation Root Computation) (1 revision)
- Bitap algorithm (Single String Search String Search) (1 revision)
- Dual subgradients and the drift-plus-penalty method (Stochastic optimization Convex Optimization (Non-linear)) (1 revision)
- Bjorck-Pereyra (Vandermonde Matrix Linear System) (1 revision)
- Bjorck (2-D Polynomial Interpolation Polynomial Interpolation) (1 revision)
- Bjorklund, Husfeldt, Proposition 2 ( 5 - Graph Coloring) (1 revision)
- Bjorklund, Husfeldt, Proposition 2 ( 6 - Graph Coloring) (1 revision)
- Bjorklund, Husfeldt, Proposition 2 ( Chromatic Number) (1 revision)
- Bjorklund, Husfeldt, Proposition 3 ( Chromatic Polynomial) (1 revision)
- Drysdale; Su (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (1 revision)
- Downey (The Vertex Cover Problem The Vertex Cover Problem) (1 revision)
- Downey, Fellows (The Vertex Cover Problem The Vertex Cover Problem) (1 revision)
- Doolittle Algorithm (Square Matrix LU Decomposition LU Decomposition) (1 revision)
- Bjorklund, Husfeldt, Theorem 1 ( 5 - Graph Coloring) (1 revision)
- Bjorklund, Husfeldt, Theorem 1 ( 6 - Graph Coloring) (1 revision)
- Bjorklund, Husfeldt, Theorem 1 ( Chromatic Number) (1 revision)
- Doolittle Algorithm (1 revision)
- Domain:Statistics (1 revision)
- Blakley's scheme ( Secret Sharing) (1 revision)
- Domain:Robotics (1 revision)
- Blinn and Newell (Environment Mapping Texture Mapping) (1 revision)
- Blinn–Phong (Specular Reflection Texture Mapping) (1 revision)
- Block A* (Informed Search Informed Search) (1 revision)
- Domain:Image Processing (1 revision)
- Blossom Algorithm (general graph Maximum cardinality matching) (1 revision)
- Domain:Databases (1 revision)
- Domain:Cryptography (1 revision)
- Domain:Bioinformatics (1 revision)
- Dixon's algorithm (Second Category Integer Factoring Integer Factoring) (1 revision)
- Blowfish (Block Ciphers Block Ciphers) (1 revision)
- Divide and Conquer ( Minimum value in each row of an implicitly-defined totally monotone matrix) (1 revision)
- Blum, Shelton, Koller (Graphical games, Multi-agent influence diagrams Nash Equilibria) (1 revision)
- Bodlaender (Partial k-trees Graph Isomorphism Problem) (1 revision)
- Boman; Hendrickson (Inexact Laplacian Solver SDD Systems Solvers) (1 revision)
- Cygan, Gabow, Sankowski (Bounded integer weights Graph Diameter) (1 revision)
- Christofides algorithm (Approximate TSP The Traveling-Salesman Problem) (1 revision)
- Christofides ( Chromatic Number) (1 revision)
- Chow's Algorithm (Global Register Allocation Register Allocation) (1 revision)
- Cholesky Decomposition (Matrix Factorization Collaborative Filtering) (1 revision)
- Counting Sort (Non-Comparison Sorting Sorting) (1 revision)
- Cholesky (Positive Definite, Hermitian Matrix Linear System) (1 revision)
- Couvreur (SCCs Strongly Connected Components) (1 revision)
- Crout and LUP algorithms (Square Matrix LU Decomposition LU Decomposition) (1 revision)
- Chin (Approximate MCOP Matrix Chain Multiplication) (1 revision)
- Cryptography (1 revision)
- Cube Sort Parallel Implementation (Comparison Sorting Sorting) (1 revision)
- Cherkassky ( Maximum Flow) (1 revision)
- Culling (1 revision)
- Cheriton-Tarjan (planar) (Undirected, Planar MST Minimum Spanning Tree (MST)) (1 revision)
- Cheriton-Tarjan (dense) (Undirected, Dense MST Minimum Spanning Tree (MST)) (1 revision)
- Chen et al ( Maximum Flow) (1 revision)
- Cyclopeptide sequencing (1 revision)
- Chan's algorithm (2-dimensional; 3-dimensional Convex Hull) (1 revision)
- DE NOVO GENOME ASSEMBLY (1 revision)
- Chaitin's Algorithm (Global Register Allocation Register Allocation) (1 revision)
- Census (Motif Search Motif Search) (1 revision)