Pages with the most revisions
Jump to navigation
Jump to search
Showing below up to 500 results in range #51 to #550.
View (previous 500 | next 500) (20 | 50 | 100 | 250 | 500)
- Reporting all intersection points, generalized segments (7 revisions)
- Subset Sum (7 revisions)
- Reporting all intersection points, convex polygons (7 revisions)
- Cyclic Permutations (7 revisions)
- All Permutations (7 revisions)
- Cryptanalysis of Linear Feedback Shift Registers (7 revisions)
- Alphabetic Tree Problem (7 revisions)
- Maximum-Weight Matching (7 revisions)
- Convex Polygonal Window (7 revisions)
- Matrix Chain Ordering Problem (7 revisions)
- General Graph MCM (7 revisions)
- General Permutations (7 revisions)
- BCNF Decomposition (7 revisions)
- Planar Bipartite Graph Perfect Matching (7 revisions)
- Greatest Common Divisor (7 revisions)
- Gröbner Bases (7 revisions)
- Vandermonde Matrix (7 revisions)
- Chen; I. Kanj; and W. Jia. (The Vertex Cover Problem The Vertex Cover Problem) (7 revisions)
- Line Drawing (7 revisions)
- Toeplitz Matrix (7 revisions)
- CFG Recognition (7 revisions)
- CFG Parsing (7 revisions)
- Inexact GED (7 revisions)
- Informed Search (7 revisions)
- Integer Factoring (7 revisions)
- Bipartite Graph MCM (7 revisions)
- Bipartite Maximum-Weight Matching (7 revisions)
- Integer Maximum Flow (7 revisions)
- Topological Sorting (7 revisions)
- Transitive Closure (7 revisions)
- Undirected, General MST (7 revisions)
- Key Exchange (7 revisions)
- Rectangular Window (7 revisions)
- Eigenpair with the Largest Eigenvalue (6 revisions)
- Eigenpair closest to mu (6 revisions)
- Smith (2-dimensional Maximum subarray problem) (6 revisions)
- 1D Maximum Subarray (6 revisions)
- 2-Dimensional Poisson Problem (6 revisions)
- Factorization of Polynomials Over Finite Fields (6 revisions)
- Duplicate Elimination (6 revisions)
- 2-dimensional space, Euclidean metric (6 revisions)
- Self-Balancing Trees Search (6 revisions)
- Self-Balancing Trees Insertion (6 revisions)
- 3-Dimensional Poisson Problem (6 revisions)
- 3-Graph Coloring (6 revisions)
- Self-Balancing Trees Deletion (6 revisions)
- Self-Balancing Trees Creation (6 revisions)
- 4-Graph Coloring (6 revisions)
- Discrete Logarithm Over Finite Fields (6 revisions)
- Multivalued Dependency Inference Problem (6 revisions)
- Multiple String Search (6 revisions)
- Off-Line Lowest Common Ancestor (6 revisions)
- Determinant of Matrices with Integer Entries (6 revisions)
- Stable Roommates Problem (6 revisions)
- Decisional BCNF (6 revisions)
- Finding Frequent Itemsets (6 revisions)
- De Novo Genome Assembly (6 revisions)
- Rod-Cutting Problem (6 revisions)
- Acyclic DFA Minimization (6 revisions)
- Stratonovich (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (6 revisions)
- All Maximal Non-Branching Paths in a Graph (6 revisions)
- Median String Problem with Unbounded Alphabets (6 revisions)
- Cyclic Nontrivial SCCs DFA Minimization (6 revisions)
- Frequent Words with Mismatches Problem (6 revisions)
- Counting Solutions (6 revisions)
- Coset Enumeration (6 revisions)
- Functional Dependency Inference Problem (6 revisions)
- Reduction from k-Clique to RNA Folding (6 revisions)
- Reduction from k-Clique to CFG Recognition (6 revisions)
- Convex Optimization (Non-linear) (6 revisions)
- Gabow (general Maximum-weight matching) (6 revisions)
- General Linear System (6 revisions)
- Constructing Eulerian Trails in a Graph (6 revisions)
- Lowest Common Ancestor with Static Trees (6 revisions)
- Lowest Common Ancestor (6 revisions)
- Lossy Compression (6 revisions)
- Voronoi Diagrams (6 revisions)
- Global Register Allocation (6 revisions)
- Longest Palindromic Substring (6 revisions)
- Comparison Sorting (6 revisions)
- Longest Common Subsequence (6 revisions)
- The Frequent Words Problem (6 revisions)
- Gronlund, Pettie (Real 3SUM 3SUM) (6 revisions)
- Polygon Clipping with Arbitrary Clipping Polygon (6 revisions)
- Polygon Clipping with Convex Clipping Polygon (6 revisions)
- Polynomial Interpolation (6 revisions)
- Beigel & Eppstein (3-Graph Coloring Graph Coloring) (6 revisions)
- Variance Calculations (6 revisions)
- Positive Definite, Hermitian Matrix (6 revisions)
- Change-Making Problem (6 revisions)
- Cardinality Estimation (6 revisions)
- Vaidya ( Linear Programming) (6 revisions)
- Tower of Hanoi (6 revisions)
- Transitive Reduction Problem of Directed Graphs (6 revisions)
- Turnpike Problem (6 revisions)
- Entity Resolution (5 revisions)
- Solutions to Nonlinear Equations (5 revisions)
- Sorting (5 revisions)
- Distributed Locking Algorithms (5 revisions)
- 4NF Decomposition (5 revisions)
- 4NF Decomposition for Conflict-Free Dependency Sets (5 revisions)
- 4NF Decomposition for Functional and Multivalued Dependency Sets (5 revisions)
- Digraph Realization Problem (5 revisions)
- OV (5 revisions)
- Offline (5 revisions)
- AST to Code Translation (5 revisions)
- Online (5 revisions)
- Filtering Problem (Stochastic Processes) (5 revisions)
- Rick (LCS Longest Common Subsequence) (5 revisions)
- Optimal Policies for MDPs (5 revisions)
- Cyclic Peptide Sequencing Problem (5 revisions)
- Maximum Likelihood Parameters (5 revisions)
- Maximum Likelihood Methods in Unknown Latent Variables (5 revisions)
- Matrix Factorization (5 revisions)
- Constructing Suffix Trees (5 revisions)
- Arithmetic Expression Binary Tree (5 revisions)
- Main Page (5 revisions)
- Longest Path on Interval Graphs (5 revisions)
- Point-in-Polygon (5 revisions)
- Clock Synchronization in Distributed Systems (5 revisions)
- Link Analysis (5 revisions)
- Hyperbolic Spline Interpolation (5 revisions)
- InDegree Analysis (5 revisions)
- Kth Order Statistic (5 revisions)
- 2-dimensional Convex Hull (4 revisions)
- Serang (Subset Sum The Subset-Sum Problem) (4 revisions)
- 3SAT (4 revisions)
- Secret Sharing (4 revisions)
- 3SUM (4 revisions)
- Disjunctive Reachability Queries in MDPs (4 revisions)
- SAT (4 revisions)
- APSP on Sparse Undirected Graphs with Arbitrary Weights (4 revisions)
- Fomin; Gaspers & Saurabh ( (4 revisions)
- D-Neighborhood of a String (4 revisions)
- Maximum TSP (4 revisions)
- Maximum Subarray (4 revisions)
- Weighted Set-Covering (4 revisions)
- Maximum Cut (4 revisions)
- Lowest Common Ancestor with Linking (4 revisions)
- Graph Isomorphism, Bounded Number of Vertices of Each Color (4 revisions)
- Bansal, Williams (Boolean Matrix Multiplication (Combinatorial) Matrix Product) (4 revisions)
- The Vertex Cover Problem (4 revisions)
- Reduction from Maximum Inner Product Search to Stable Pair Checking (4 revisions)
- Reduction from MAX-CNF-SAT to st-Maximum Flow (4 revisions)
- Reduction from MAX-CNF-SAT to All-Pairs Maximum Flow (4 revisions)
- Chan (Boolean Matrix Multiplication (Combinatorial) Matrix Product) (4 revisions)
- Huffman Encoding (4 revisions)
- Unweighted Set-Covering (4 revisions)
- Unweighted Interval Scheduling (4 revisions)
- K Approximate Nearest Neighbors Search (4 revisions)
- Triangle Detection (4 revisions)
- Boolean Matrix Multiplication (4 revisions)
- Negative Triangle Search (3 revisions)
- Exact k-Clique (3 revisions)
- Shortest k-Cycle (3 revisions)
- Edit Distance, constant-size alphabet (3 revisions)
- Eccentricity (3 revisions)
- Smallest Factor (3 revisions)
- Shortest Cycle (3 revisions)
- Dynamic Time Warping (3 revisions)
- Dynamic Dihedral Rotation Queries (3 revisions)
- Sequence-To-Graph Alignment (3 revisions)
- Separator2 (3 revisions)
- Separator1 (3 revisions)
- Dual-Horn SAT (3 revisions)
- Sensitive incremental (3 revisions)
- Sparse Linear System (3 revisions)
- Distance Product (3 revisions)
- Safety in MDPs (3 revisions)
- Disjunctive Safety Queries in MDPs (3 revisions)
- Disjunctive Queries of Safety in Graphs (3 revisions)
- Disjunctive Normal Form SAT (3 revisions)
- Safety in Graphs (3 revisions)
- ST-Reach (3 revisions)
- Directed All-Nodes Reach Centrality (3 revisions)
- Directed All-Nodes Positive Betweenness Centrality (3 revisions)
- Directed (Optimum Branchings), Super Dense MST (3 revisions)
- Directed (Optimum Branchings), General MST (3 revisions)
- Dining Philosophers Problem (3 revisions)
- St-Reach (3 revisions)
- Diameter 3 vs 7 (3 revisions)
- Diameter 2 vs 3 (3 revisions)
- Diameter (3 revisions)
- Static Dihedral Rotation Queries (3 revisions)
- Decremental Diameter (3 revisions)
- Deadlock Avoidance (3 revisions)
- Strips Cover Box (3 revisions)
- Reporting all intersection points, general polygons (3 revisions)
- DAG Realization Problem (3 revisions)
- D-dimensional Convex Hull (3 revisions)
- Subtree Isomorphism (3 revisions)
- Frechet Distance (3 revisions)
- Renamable Horn (3 revisions)
- Counting number of intersection points, line segments (3 revisions)
- Convex Polyhedral Window (3 revisions)
- General Linear Programming (3 revisions)
- General Weights (3 revisions)
- Constructing Solutions (3 revisions)
- Constant sensitivity incremental ST-Reach (3 revisions)
- Constant sensitivity (4/3)-approximate incremental diameter (3 revisions)
- Conjunctive Safety Queries in MDPs (3 revisions)
- Conjunctive Reachability Queries in MDPs (3 revisions)
- Conjunctive Normal Form SAT (3 revisions)
- Geometric Base (3 revisions)
- Graph Isomorphism, General Graphs (3 revisions)
- Texture Synthesis (3 revisions)
- Chromatic Number (3 revisions)
- The Vertex Cover Problem, Degrees Bounded By 3 (3 revisions)
- Hole in Union (3 revisions)
- Horn SAT (3 revisions)
- Independent Set Queries (3 revisions)
- Inexact Laplacian Solver (3 revisions)
- Integer Linear Programming (3 revisions)
- Integer Relation Among Integers (3 revisions)
- Integer Relation Among Reals (3 revisions)
- K-Clique (3 revisions)
- K-Graph Coloring (3 revisions)
- K-OV (3 revisions)
- K-SAT (3 revisions)
- K-dimensional space, $l m$ (or $l \infty$) norm (3 revisions)
- K Nearest Neighbors Search (3 revisions)
- Triangle Collection* (3 revisions)
- Triangle Measure (3 revisions)
- Triangle in Unweighted Graph (3 revisions)
- Triangles Cover Triangle (3 revisions)
- Rectangular Matrix LU Decomposition (3 revisions)
- $(\min, \leq)$ Product (3 revisions)
- Reachability in MDPs (3 revisions)
- Negative Triangle Listing (3 revisions)
- Boolean Matrix Multiplication (Combinatorial) (3 revisions)
- Reach Centrality (3 revisions)
- Negative Triangle Detection (3 revisions)
- (3-Dimensional, i.e. project onto a 2D plane) (3 revisions)
- (5/3)-approximate ap-shortest paths (3 revisions)
- 0-1 Linear Programming (3 revisions)
- 1-in-3SAT (3 revisions)
- 1-sensitive (4/3)-approximate decremental diameter (3 revisions)
- 1-sensitive (4/3)-approximate decremental eccentricity (3 revisions)
- Block Ciphers (3 revisions)
- 1-sensitive decremental diameter (3 revisions)
- Undirected, Dense MST (3 revisions)
- Undirected, Integer Weights MST (3 revisions)
- Undirected, Planar MST (3 revisions)
- Undirected All-Nodes Positive Betweenness Centrality (3 revisions)
- 1-sensitive incremental ss-reach (3 revisions)
- 2-Graph Coloring (3 revisions)
- 2-Player (3 revisions)
- 2-dimensional Convex Hull, Dynamic (3 revisions)
- Undirected All-Nodes Reach Centrality (3 revisions)
- Undirected Wiener Index (3 revisions)
- 2-dimensional Convex Hull, Online (3 revisions)
- Radius (3 revisions)
- Unweighted Maximum Flow (3 revisions)
- RNA Folding (3 revisions)
- 2-sensitive incremental st-reach (3 revisions)
- Largest Common Subtree (3 revisions)
- 2D Maximum Subarray (3 revisions)
- 2SAT (3 revisions)
- 3-OV (3 revisions)
- Bichromatic Hamming Close Pair (3 revisions)
- 3-dimensional Convex Hull (3 revisions)
- Betweenness Centrality (3 revisions)
- 3D Motion Planning (3 revisions)
- 3SAT-5 (3 revisions)
- 3SUM' (3 revisions)
- 3 Points on Line (3 revisions)
- 4SAT (3 revisions)
- Non-integer Maximum Flow (3 revisions)
- Price Query (3 revisions)
- 5-Graph Coloring (3 revisions)
- Nondecreasing Triangle (3 revisions)
- Positive Betweenness Centrality (3 revisions)
- Linear Programming with Reals (3 revisions)
- N-Queens Completion (3 revisions)
- N-Player (3 revisions)
- Not-All-Equal 3-SAT (NAE 3SAT) (3 revisions)
- List:Algorithms (3 revisions)
- Multiple Local Alignment (3 revisions)
- Point on 3 Lines (3 revisions)
- Local Alignment (3 revisions)
- Point Covering (3 revisions)
- Monotone Not-Exactly-1-in-3SAT (3 revisions)
- Planar Motion Planning (3 revisions)
- Monotone Not-All-Equal 3-SAT (Monotone NAE 3SAT) (3 revisions)
- APSP on Dense Directed Unweighted Graphs (3 revisions)
- Visibility Between Segments (3 revisions)
- Visibility From Infinity (3 revisions)
- APSP on Sparse Directed Graphs with Arbitrary Weights (3 revisions)
- Visible Triangle (3 revisions)
- APSP on Sparse Directed Unweighted Graphs (3 revisions)
- Lowest Common Ancestor with Linking Roots (3 revisions)
- Lowest Common Ancestors with Linking and Cutting (3 revisions)
- Monotone 3SAT (3 revisions)
- Monotone 1-in-3SAT (3 revisions)
- Online Matrix-Vector Multiplication (3 revisions)
- XOR-SAT (3 revisions)
- Approximate TSP (3 revisions)
- Approximate Reach Centrality (3 revisions)
- Approximate OBST (3 revisions)
- Partial Match (3 revisions)
- Online Vector-Matrix-Vector Multiplication (3 revisions)
- Approximate Diameter (3 revisions)
- Approximate Betweenness Centrality (3 revisions)
- Matrix Chain Scheduling Problem (3 revisions)
- Matrix Product Verification (3 revisions)
- Minimum Witness Finding (3 revisions)
- Max-Weight Rectangle (3 revisions)
- Minimum Wiener Connector Problem (3 revisions)
- Ap-reach (3 revisions)
- Real 3SUM (3 revisions)
- Max-Weight k-Clique (3 revisions)
- MaxSAT (3 revisions)
- Weighted Depth (3 revisions)
- Weighted Interval Schedule Maximization Problem (ISMP) (3 revisions)
- Maximum Local Edge Connectivity (3 revisions)
- Maximum Square Subarray (3 revisions)
- Minimum Triangle (3 revisions)
- Minimum-Cost Flow (3 revisions)
- Almost Stable Marriage Problem (3 revisions)
- Median (3 revisions)
- Median String Problem with Binary Alphabets (3 revisions)
- Median String Problem with Bounded Alphabets (3 revisions)
- All Pairs Minimum Witness (3 revisions)
- Metricity (3 revisions)
- All-Pairs Maximum Flow (3 revisions)
- All-Nodes Median Parity (3 revisions)
- Optimal Binary Search Tree Problem (3 revisions)
- All-Integers 3SUM (3 revisions)
- All-Equal-SAT (3 revisions)
- Min-Weight k-Clique (3 revisions)
- Furer's algorithm ( Multiplication) (2 revisions)
- $O(n\log n)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling) (2 revisions)
- Simplex Algorithm ( Linear Programming) (2 revisions)
- Shuji Tsukiyama, Mikio Ide, Hiromu Ariyoshi, and Isao Shirakawa (Enumerating Maximal Cliques, arbitrary graph Clique Problems) (2 revisions)
- Euler's factorization method (First Category Integer Factoring Integer Factoring) (2 revisions)
- Nested loop join ( Joins) (2 revisions)
- Newton's method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations) (2 revisions)
- Naïve algorithm ( Variance Calculations) (2 revisions)
- Navarro (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) (2 revisions)
- Expectation conditional maximization (ECM) ( Maximum Likelihood Parameters) (2 revisions)
- Shimbel Algorithm (APSP on Dense Directed Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP)) (2 revisions)
- Extended Split Radix FFT algorithm (Discrete Fourier Transform Discrete Fourier Transform) (2 revisions)
- Nicholl–Lee–Nicholl (Rectangular Window Line Clipping) (2 revisions)
- F. Preparata and M. Shamos (k-dimensional space, l m (or l infty) norm Closest Pair Problem) (2 revisions)
- FCFS (Disk Scheduling Disk Scheduling) (2 revisions)
- Shanks's square forms factorization (SQUFOF) (Second Category Integer Factoring Integer Factoring) (2 revisions)
- Shamos (1D Maximum Subarray Maximum Subarray Problem) (2 revisions)
- Shamos; Hoey (2-dimensional space, Euclidean metric Closest Pair Problem) (2 revisions)
- Shaban; Amirreza; Mehrdad; Farajtabar (Maximum Likelihood Methods in Unknown Latent Variables; multi-view model, discrete observations Maximum Likelihood Methods in Unknown Latent Variables) (2 revisions)
- Naive sorting (Non-Comparison Sorting Sorting) (2 revisions)
- Naive sorting (Comparison Sorting Sorting) (2 revisions)
- Naive solution (The Frequent Words Problem The Frequent Words Problem) (2 revisions)
- Naive algorithm ( Minimum value in each row of an implicitly-defined totally monotone matrix) (2 revisions)
- Naive algorithm (Subset Sum The Subset-Sum Problem) (2 revisions)
- Selection Sort (Comparison Sorting Sorting) (2 revisions)
- Seidel's algorithm (APSP on Dense Undirected Unweighted Graphs; APSP on Sparse Undirected Unweighted Graphs All-Pairs Shortest Paths (APSP)) (2 revisions)
- Second Shortest Simple Path (2 revisions)
- Family:Interval Scheduling (2 revisions)
- Secant method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations) (2 revisions)
- Schönhage–Strassen algorithm ( Multiplication) (2 revisions)
- Schonhage's algorithm (Matrix Multiplication Matrix Product) (2 revisions)
- Schieber; Vishkin (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) (2 revisions)
- Sam Buss (The Vertex Cover Problem The Vertex Cover Problem) (2 revisions)
- Salomon (Swath Method) (Point-in-Polygon Point-in-Polygon) (2 revisions)
- Family:Nearest Neighbor Search (2 revisions)
- Naive algorithm (Line Drawing Line Drawing) (2 revisions)
- Naive Solution (Median String Problem with Unbounded Alphabets Median String Problem) (2 revisions)
- Naive Selection (kth Order Statistic kth Order Statistic) (2 revisions)
- Naive Implementation (k-dimensional space, l m (or l infty) norm Closest Pair Problem) (2 revisions)
- Non-recursion based (Tower of Hanoi Tower of Hanoi) (2 revisions)
- Naive (Reporting all intersection points, line segments Line segment intersection) (2 revisions)
- Naive (Longest Palindromic Substring Longest Palindromic Substring) (2 revisions)
- Naive (All Maximal Non-Branching Paths in a Graph All Maximal Non-Branching Paths in a Graph) (2 revisions)
- Naimi-Trehel's algorithm ( Mutual Exclusion) (2 revisions)
- NIEVERGELT. J.. AND PREPARATA (Section 3) (Reporting all intersection points, convex polygons Line segment intersection) (2 revisions)
- Family:Recovery (2 revisions)
- SSTF (Disk Scheduling Disk Scheduling) (2 revisions)
- Nordbeck and Rystedt (Grid Method) (Point-in-Polygon Point-in-Polygon) (2 revisions)
- Family:Root Computation (2 revisions)
- SPRINGBORN B.; SCHROEDER P.; PINKALL U. 2008 (Mesh Parameterization Mesh Parameterization) (2 revisions)
- SMAWK algorithm ( Minimum value in each row of an implicitly-defined totally monotone matrix) (2 revisions)
- SLAM Algorithms (2 revisions)
- SCAN (Disk Scheduling Disk Scheduling) (2 revisions)
- Munro’s algorithm (SCCs Strongly Connected Components) (2 revisions)
- Farach (Constructing Suffix Trees Constructing Suffix Trees) (2 revisions)
- O(lg N) algorithm (convex polygonal window Line Clipping) (2 revisions)
- FastSlam (SLAM Algorithms SLAM Algorithms) (2 revisions)
- Mucha; Sankowski (planar) (Bipartite Graph MCM Maximum Cardinality Matching) (2 revisions)
- Motwani & Raghavan (Maximum Cut, Approximate Maximum Cut) (2 revisions)
- Fast clipping (Rectangular Window Line Clipping) (2 revisions)
- Faster Brute Force (via x(L:U) = x(L:U-1)+x(U)) (1D Maximum Subarray Maximum Subarray Problem) (2 revisions)
- S-hull (Sinclair) (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (2 revisions)
- Faugère F4 algorithm (Gröbner Bases Gröbner Bases) (2 revisions)
- Faugère F5 algorithm (Gröbner Bases Gröbner Bases) (2 revisions)
- Fellegi & Sunter Model (Entity Resolution Entity Resolution) (2 revisions)
- Fermat's factorization method (First Category Integer Factoring Integer Factoring) (2 revisions)
- Ferreira, Camargo, Song (1D Maximum Subarray Maximum Subarray Problem) (2 revisions)
- Rytter (Constructing Suffix Trees Constructing Suffix Trees) (2 revisions)
- Filter Kruskal algorithm (Undirected, General MST Minimum Spanning Tree (MST)) (2 revisions)
- Miyake 2006 (Lossy Compression Data Compression) (2 revisions)
- Mitzenmacher & Upfal (Maximum Cut, Approximate Maximum Cut) (2 revisions)
- Root Computation (2 revisions)
- Flash Sort (Non-Comparison Sorting Sorting) (2 revisions)
- Fleischer forward-backward (FB) algorithm (SCCs Strongly Connected Components) (2 revisions)
- Fleury's algorithm + Thorup (Constructing Eulerian Trails in a Graph Constructing Eulerian Trails in a Graph) (2 revisions)
- Floyd–Warshall algorithm (APSP All-Pairs Shortest Paths (APSP)) (2 revisions)
- Opheim simplification ( Line Simplification) (2 revisions)
- Reumann–Witkam ( Line Simplification) (2 revisions)
- Ford–Fulkerson algorithm (Bipartite Graph MCM Maximum Cardinality Matching) (2 revisions)
- Fortune's algorithm (Voronoi Diagrams Voronoi Diagrams) (2 revisions)
- Miller; Stout (2-dimensional Convex Hull) (2 revisions)
- Heap Sort (Comparison Sorting Sorting) (2 revisions)
- King et al. (KRT) (st-Maximum Flow Maximum Flow) (2 revisions)
- Khuller; Raghavachari & Young, "Greedy Methods" (Maximum Cut, Approximate Maximum Cut) (2 revisions)
- Khachiyan Ellipsoid algorithm ( Linear Programming) (2 revisions)
- Keyed Hash Functions (2 revisions)
- Recursion based (Tower of Hanoi Tower of Hanoi) (2 revisions)
- Raz & Safra ( The Set-Covering Problem) (2 revisions)
- Kelner; Orecchia; Sidford; Zhu (Inexact Laplacian Solver SDD Systems Solvers) (2 revisions)
- Kazuhisa Makino, Takeaki Uno; Section 5 (Enumerating Maximal Cliques, arbitrary graph Clique Problems) (2 revisions)
- Raymond's algorithm ( Mutual Exclusion) (2 revisions)
- Knuth-Morris-Pratt (KMP) algorithm (Single String Search String Search) (2 revisions)
- Rautiainen and Marschall (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) (2 revisions)
- Rautiainen, Marschall (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) (2 revisions)
- Koiliaris and Xu (Subset Sum The Subset-Sum Problem) (2 revisions)
- Rao-Blackwellized Particle Filtering SLAM (SLAM Algorithms SLAM Algorithms) (2 revisions)
- Katajainen and M. Koppinen ( Delaunay Triangulation) (2 revisions)
- Reduction from 3-OV to k-OV (2 revisions)
- Karger; Klein & Tarjan (Undirected, General MST Minimum Spanning Tree (MST)) (2 revisions)
- Karatsuba Algorithm ( Multiplication) (2 revisions)
- Kahn's algorithm (Topological Sorting Topological Sorting) (2 revisions)
- Randomized HITS (Link Analysis Link Analysis) (2 revisions)
- Kruskal's algorithm (Undirected, General MST Minimum Spanning Tree (MST)) (2 revisions)
- K-d Tree (Nearest Neighbor Search (NNS) Nearest Neighbor Search) (2 revisions)
- Kruskal’s algorithm with demand-sorting (Undirected, General MST Minimum Spanning Tree (MST)) (2 revisions)
- Jeuring (Longest Palindromic Substring Longest Palindromic Substring) (2 revisions)
- Jean-Daniel Boissonnat and Franco P. Preparata. (Reporting all intersection points, generalized segments Line segment intersection) (2 revisions)
- Jarvis (2-dimensional Convex Hull) (2 revisions)
- Jalali; A. Montanari; and T. Weissman (Lossy Compression Data Compression) (2 revisions)
- Jain, Chang (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) (2 revisions)
- Iterative naive (d-Neighborhood of a String d-Neighborhood of a String) (2 revisions)
- Iteration based (Tower of Hanoi Tower of Hanoi) (2 revisions)
- Ramer–Douglas–Peucker algorithm ( Line Simplification) (2 revisions)
- Ioannidou; Kyriaki; Mertzios; George B.; Nikolopoulos; Stavros D. (Longest Path on Interval Graphs Longest Path Problem) (2 revisions)
- Intro Sort (Comparison Sorting Sorting) (2 revisions)
- LEE Y.; KIM H. S.; LEE S 2002 (Mesh Parameterization Mesh Parameterization) (2 revisions)
- Rader–Brenner algorithm (Discrete Fourier Transform Discrete Fourier Transform) (2 revisions)
- LOOK (Disk Scheduling Disk Scheduling) (2 revisions)
- Rabin Karp (The Frequent Words Problem The Frequent Words Problem) (2 revisions)
- Lang simplification ( Line Simplification) (2 revisions)
- R-tree (Nearest Neighbor Search (NNS) Nearest Neighbor Search) (2 revisions)
- Quick Sort (Comparison Sorting Sorting) (2 revisions)
- Lawler (3-Graph Coloring Graph Coloring) (2 revisions)
- Quick Kruskal algorithm (Undirected, General MST Minimum Spanning Tree (MST)) (2 revisions)
- Incremental convex hull algorithm; Michael Kallay ( Convex Hull) (2 revisions)
- Image analogies Hertzmann (Texture Synthesis Texture Synthesis) (2 revisions)
- Image Segmentation (2 revisions)
- Quasi-linear Topological watershed ( Image Segmentation) (2 revisions)
- HybridSpades (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) (2 revisions)
- Lee and Sidford ( Linear Programming) (2 revisions)
- Psinger (Subset Sum The Subset-Sum Problem) (2 revisions)
- Horowitz and Sahni (Subset Sum The Subset-Sum Problem) (2 revisions)
- Probabilistic Convolution Tree (Change-Making Problem Change-Making Problem) (2 revisions)
- Hopcroft–Karp algorithm (Bipartite Graph MCM Maximum Cardinality Matching) (2 revisions)
- Hopcroft 2-3 Tree ( Self-Balancing Trees Search) (2 revisions)
- Hopcroft 2-3 Tree ( Self-Balancing Trees Insertion) (2 revisions)
- Hopcroft 2-3 Tree ( Self-Balancing Trees Deletion) (2 revisions)
- Hopcroft 2-3 Tree ( Self-Balancing Trees Creation) (2 revisions)
- Lenstra elliptic curve factorization (First Category Integer Factoring Integer Factoring) (2 revisions)
- Liang–Barsky (Rectangular Window Line Clipping) (2 revisions)
- Hoare's Selection Algorithm (QuickSelect) (kth Order Statistic kth Order Statistic) (2 revisions)
- Hinrichs; Nievergelt; Schorn (2-dimensional space, l m (or l infty) norm Closest Pair Problem) (2 revisions)
- Prim's algorithm + Fibonacci heaps; Fredman & Tarjan (Undirected, General MST Minimum Spanning Tree (MST)) (2 revisions)
- Press, Teukolsky, Flannery (Square Matrix LU Decomposition LU Decomposition) (2 revisions)
- Preparata and Hong (2-dimensional; 3-dimensional Convex Hull) (2 revisions)
- Linde–Buzo–Gray algorithm ( Voronoi Diagrams) (2 revisions)
- Gabow Ahuja Algorithm (Nonnegative Integer Weights Shortest Path (Directed Graphs)) (2 revisions)
- Longest Common Substring with don't cares (2 revisions)
- Phillips & Westbrook (st-Maximum Flow Maximum Flow) (2 revisions)
- Lossless Compression (2 revisions)
- Pettie & Ramachandran (APSP on Dense Undirected Graphs with Arbitrary Weights; APSP on Sparse Undirected Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP)) (2 revisions)
- Gentleman; Morven and Gordon Sande radix-4 algorithm (Discrete Fourier Transform Discrete Fourier Transform) (2 revisions)
- Petford and Welsh (3-Graph Coloring Graph Coloring) (2 revisions)
- Perumalla and Deo (1D Maximum Subarray Maximum Subarray Problem) (2 revisions)
- LÉVY B.; PETITJEAN S.; RAY N.; MAILLOT J 2002 (Mesh Parameterization Mesh Parameterization) (2 revisions)
- M. Chrobak and D. Eppstein (Enumerating Maximal Cliques, arbitrary graph Clique Problems) (2 revisions)
- Generalized expectation maximization (GEM) algorithm ( Maximum Likelihood Parameters) (2 revisions)
- Manacher (Longest Palindromic Substring Longest Palindromic Substring) (2 revisions)
- Maneva and M. J. Wainwright (Lossy Compression Data Compression) (2 revisions)
- Generalized Büchi Games (2 revisions)
- Martinian and M. J. Wainwright (Lossy Compression Data Compression) (2 revisions)
- Galil & Naamad ( Maximum Flow) (2 revisions)
- Maybeck; Peter S Extended Kalman Filter (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (2 revisions)
- Micali and Vazirani ( Maximum Cardinality Matching) (2 revisions)
- Micali; Vazirani ( Maximum-Weight Matching) (2 revisions)
- Fortune and Hopcroft (k-dimensional space, l m (or l infty) norm Closest Pair Problem) (2 revisions)
- Fourier–Motzkin elimination ( Linear Programming) (2 revisions)
- Mesh Parameterization (2 revisions)
- Merge Sort (Comparison Sorting Sorting) (2 revisions)
- Replacement Paths Problem (2 revisions)