Long pages
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)
- (hist) N-Queens Completion [782 bytes]
- (hist) Monotone Not-All-Equal 3-SAT (Monotone NAE 3SAT) [780 bytes]
- (hist) Longest common subsequence [778 bytes]
- (hist) Monotone 3SAT [772 bytes]
- (hist) Reduction from Triangle Detection to Dynamic Bipartite Maximum-Weight Matching [767 bytes]
- (hist) Reduction from Positive Betweenness Centrality to Diameter [766 bytes]
- (hist) Root Computation with continuous first derivative [764 bytes]
- (hist) Maximum-weight matching [759 bytes]
- (hist) Reduction from Triangle Detection to Strong Connectivity (dynamic) [755 bytes]
- (hist) Disjunctive Normal Form SAT [755 bytes]
- (hist) Deadlock Avoidance [748 bytes]
- (hist) Connected Subgraph [744 bytes]
- (hist) Reduction from Negative Triangle Detection to All-Nodes Positive Betweenness Centrality [739 bytes]
- (hist) Reduction from Reach Centrality to Diameter [737 bytes]
- (hist) 3SAT-5 [736 bytes]
- (hist) Reduction from CNF-SAT to Positive Betweenness Centrality [732 bytes]
- (hist) 2SAT [732 bytes]
- (hist) NFA to DFA conversion [726 bytes]
- (hist) 2-Player [723 bytes]
- (hist) Reduction from CNF-SAT to Approximate Betweenness Centrality [720 bytes]
- (hist) The frequent words problem [714 bytes]
- (hist) Chromatic Number [709 bytes]
- (hist) Cohen; Lee and Song ( Linear Programming) [706 bytes]
- (hist) Strong Triangle Conjecture [705 bytes]
- (hist) Turnpike Problem [705 bytes]
- (hist) Reduction from Reach Centrality to Positive Betweenness Centrality [704 bytes]
- (hist) Reduction from Bichromatic Hamming Close Pair to Approximate Hard-Margin SVM [701 bytes]
- (hist) Strongly Connected Components [701 bytes]
- (hist) Reduction from CNF-SAT to Dynamic Connected Subgraph [699 bytes]
- (hist) Reduction from Diameter to Positive Betweenness Centrality [696 bytes]
- (hist) String Search [696 bytes]
- (hist) XOR-SAT [695 bytes]
- (hist) Reduction from Triangle Detection to Disjunctive coBüchi Objectives [692 bytes]
- (hist) Fredholm Equations [691 bytes]
- (hist) Online Matrix-Vector Multiplication [690 bytes]
- (hist) 5-Graph Coloring [689 bytes]
- (hist) Reduction from CNF-SAT to Approximate Reach Centrality [688 bytes]
- (hist) Constant sensitivity incremental ST-Reach [688 bytes]
- (hist) Reduction from CNF-SAT to Dynamic MaxSCC [687 bytes]
- (hist) Reduction from Diameter to Reach Centrality [681 bytes]
- (hist) Reduction from OV to Generalized Büchi Games [678 bytes]
- (hist) Optimal Binary Search Tree Problem [678 bytes]
- (hist) Reduction from CNF-SAT to [677 bytes]
- (hist) Reduction from Directed, Weighted APSP to Dynamic Bipartite Maximum-Weight Matching [676 bytes]
- (hist) Reduction from CNF-SAT to Dynamic 4/3-Diameter [676 bytes]
- (hist) Reduction from CNF-SAT to SC2 [676 bytes]
- (hist) Median String Problem with Bounded Alphabets [675 bytes]
- (hist) Median String Problem with Binary Alphabets [674 bytes]
- (hist) Reduction from CNF-SAT to Dynamic ST-Reach [672 bytes]
- (hist) Volterra Equations [670 bytes]
- (hist) ST-Reach [669 bytes]
- (hist) Convex Polyhedral Window [669 bytes]
- (hist) Reduction from Triangle Collection* to dynamic 4/3-Diameter [666 bytes]
- (hist) St-Reach [663 bytes]
- (hist) Reduction from Directed, Weighted APSP to Dynamic $st$-Shortest Path [661 bytes]
- (hist) Reduction from Negative Triangle Detection to All-Nodes Median Parity [656 bytes]
- (hist) Fomin; Gaspers & Saurabh (4-Graph Coloring Graph Coloring) [654 bytes]
- (hist) Reduction from Triangle Detection to Disjunctive Queries of Reachability in MDPs [653 bytes]
- (hist) Dekel; Nassimi & Sahni Parallel Implementation (Topological Sorting Topological Sorting) [652 bytes]
- (hist) Stable Marriage Problem/Stable Roommates Problem [652 bytes]
- (hist) Reduction from Triangle Detection to Disjunctive Reachability Queries in MDPs [650 bytes]
- (hist) Factorization of polynomials over finite fields [650 bytes]
- (hist) Reduction from Negative Triangle Detection to Radius [643 bytes]
- (hist) Dixon's algorithm (Second Category Integer Factoring Integer Factoring) [643 bytes]
- (hist) Reduction from Triangle Detection to Disjunctive Queries of Safety in Graphs [642 bytes]
- (hist) Huffman Encoding [642 bytes]
- (hist) Reduction from Maximum Inner Product Search to Stable Pair Checking [641 bytes]
- (hist) Reduction from Negative Triangle Detection to Median [639 bytes]
- (hist) Reduction from Min-Weight k-Clique to Minimum Weight k-Cycle [635 bytes]
- (hist) Strong Exponential Time Hypothesis (SETH) [629 bytes]
- (hist) Minimum Wiener Connector Problem [629 bytes]
- (hist) Discovering multivalued dependencies [628 bytes]
- (hist) Reduction from Negative Triangle Detection to Betweenness Centrality (BC) [626 bytes]
- (hist) Reduction from 3SUM to Local Alignment [625 bytes]
- (hist) All permutations [624 bytes]
- (hist) Reduction from Max-Weight k-Clique to Maximum Subarray [623 bytes]
- (hist) Reduction from Max-Weight K-Clique to Weighted Depth [619 bytes]
- (hist) Reduction from CNF-SAT to constant sensitivity (4/3)-approximate incremental diameter [619 bytes]
- (hist) Template Page [619 bytes]
- (hist) Longest path on interval graphs [618 bytes]
- (hist) Reduction from Max-Weight k-Clique to Max-Weight Rectangle [616 bytes]
- (hist) Reduction from Undirected, Weighted APSP to Undirected All-Nodes Positive Betweenness Centrality [616 bytes]
- (hist) Longest palindromic substring [614 bytes]
- (hist) Reduction from Directed, Weighted APSP to Directed All-Nodes Positive Betweenness Centrality [612 bytes]
- (hist) Transitive Reduction problem [612 bytes]
- (hist) Dependency inference problem [612 bytes]
- (hist) Enumerating Maximal Cliques [610 bytes]
- (hist) Digraph realization problem [610 bytes]
- (hist) Reduction from CNF-SAT to Multiple Local Alignment [607 bytes]
- (hist) MDPs for optimal policies [606 bytes]
- (hist) Constructing suffix trees [606 bytes]
- (hist) Maximum subarray problem [604 bytes]
- (hist) Reduction from MAX-CNF-SAT to All-Pairs Maximum Flow [602 bytes]
- (hist) DE NOVO GENOME ASSEMBLY [602 bytes]
- (hist) Cyclopeptide sequencing [602 bytes]
- (hist) Reduction from Undirected, Weighted APSP to Undirected All-Nodes Reach Centrality [601 bytes]
- (hist) The subset-sum problem [600 bytes]
- (hist) Lowest common ancestor [600 bytes]
- (hist) Delaunay triangulation [600 bytes]
- (hist) Edit Distance, constant-size alphabet [599 bytes]
- (hist) Reduction from Directed, Weighted APSP to Directed All-Nodes Reach Centrality [597 bytes]
- (hist) Reduction from Max-Weight K-Clique to Maximum Square Subarray [596 bytes]
- (hist) Any Eigenpair [596 bytes]
- (hist) Reduction from k-Clique to CFG Recognition [594 bytes]
- (hist) Orthogonal Vectors Hypothesis (OVH) [594 bytes]
- (hist) Rod-cutting problem [594 bytes]
- (hist) Register Allocation [594 bytes]
- (hist) Reduction from Maximum Inner Product Search to Boolean d-Attribute Stable Matching [591 bytes]
- (hist) Lossless Compression [591 bytes]
- (hist) Reduction from OV to Disjunctive Queries of Safety in Graphs [590 bytes]
- (hist) Reduction from k-Clique to RNA Folding [590 bytes]
- (hist) Reduction from CNF-SAT to sensitive incremental ST-Reach [590 bytes]
- (hist) Unbalanced Orthogonal Vectors Hypothesis (UOVH) [590 bytes]
- (hist) Lossy compression [590 bytes]
- (hist) Entity resolution [590 bytes]
- (hist) 4NF decomposition [590 bytes]
- (hist) Reduction from Betweenness Centrality (BC) to Diameter [588 bytes]
- (hist) Min-Weight k-Clique Hypothesis [588 bytes]
- (hist) Polygon clipping [588 bytes]
- (hist) Integer relation [588 bytes]
- (hist) Reduction from Undirected, Weighted APSP to All-Nodes Median Parity [587 bytes]
- (hist) Reduction from CNF-SAT to sensitive incremental [586 bytes]
- (hist) Vornoi Diagrams [586 bytes]
- (hist) Reduction from Maximum Inner Product Search to Stable Matching Verification [585 bytes]
- (hist) Reduction from Directed, Weighted APSP to All-Nodes Median Parity [585 bytes]
- (hist) Edmonds-Karp (bipartite (i.e. assignment), general Maximum-weight matching) [581 bytes]
- (hist) Line drawing [580 bytes]
- (hist) Exponential Time Hypothesis (ETH) [579 bytes]
- (hist) Reduction from Negative Triangle Listing to Negative Triangle Detection [578 bytes]
- (hist) 2-Graph Coloring [578 bytes]
- (hist) Maximum cut [578 bytes]
- (hist) Family:Boolean Satisfiability [577 bytes]
- (hist) Reduction from CNF-SAT to Local Alignment [576 bytes]
- (hist) HJLS algorithm ( Integer Relation) [574 bytes]
- (hist) Reduction from Weighted, Undirected APSP to 2D Maximum Subarray [572 bytes]
- (hist) Translating abstract syntax trees [572 bytes]
- (hist) Parsing [570 bytes]
- (hist) Reduction from Negative Triangle Detection to 2D Maximum Subarray [569 bytes]
- (hist) More Believable Exponential Time Hypothesis (MBETH) [567 bytes]
- (hist) Weighted Interval Schedule Maximization Problem (ISMP) [567 bytes]
- (hist) Reduction from CNF-SAT to Longest Common Substring with don't cares [566 bytes]
- (hist) Reduction from OV to Disjunctive Reachability Queries in MDPs [563 bytes]
- (hist) Reduction from OV to Disjunctive Queries of Reachability in MDPs [563 bytes]
- (hist) Reduction from OV to Largest Common Subtree [563 bytes]
- (hist) Reduction from Replacement Paths Problem (RPP) to 1-sensitive decremental st-shortest paths [560 bytes]
- (hist) Family:Vertex Centrality [560 bytes]
- (hist) Reduction from OV to Subtree Isomorphism [557 bytes]
- (hist) Maximum Strongly Connected Component [557 bytes]
- (hist) Spielman, Teng (Inexact Laplacian Solver SDD Systems Solvers) [556 bytes]
- (hist) Reduction from Approximate Betweenness Centrality to Diameter [556 bytes]
- (hist) Reduction from Diameter to Approximate Betweenness Centrality [556 bytes]
- (hist) Reduction from BMM to 1-sensitive (4/3)-approximate decremental diameter [555 bytes]
- (hist) Reduction from Directed, Weighted APSP to 2-sensitive decremental st-shortest paths [554 bytes]
- (hist) Steal/No-Force [554 bytes]
- (hist) Reduction from BMM to 1-sensitive (3/2)-approximate ss-shortest paths [552 bytes]
- (hist) Reduction from BMM to 2-sensitive (7/5)-approximate st-shortest paths [552 bytes]
- (hist) Reduction from CNF-SAT to dynamic st-Maximum Flow [551 bytes]
- (hist) Pohlig-Hellman (Discrete Logarithm Over Finite Fields Logarithm Calculations) [551 bytes]
- (hist) Reduction from OuMv to Bipartite Graph MCM [550 bytes]
- (hist) Mucha; Sankowski (planar) (Bipartite Graph MCM Maximum Cardinality Matching) [550 bytes]
- (hist) Reduction from OuMV to dynamic st-Maximum Flow [548 bytes]
- (hist) Reduction from BMM to 1-sensitive decremental st-shortest paths [547 bytes]
- (hist) Reduction from Directed, Weighted APSP to 1-sensitive decremental diameter [545 bytes]
- (hist) Reduction from k-SAT to Subset Sum [544 bytes]
- (hist) Pollard's p − 1 algorithm (First Category Integer Factoring Integer Factoring) [543 bytes]
- (hist) Online Matrix Vector Multiplication Hypothesis (OMV Hypothesis) [541 bytes]
- (hist) Brent-Dekker Method (General Root Computation Root Computation) [539 bytes]
- (hist) Longest distance first (LDF) page replacement algorithm (Online Page Replacements) [539 bytes]
- (hist) Image Compositing [538 bytes]
- (hist) Gusfield (Longest Palindromic Substring Longest Palindromic Substring) [537 bytes]
- (hist) Reduction from OV to Edit Distance [536 bytes]
- (hist) Furer's algorithm ( Multiplication) [533 bytes]
- (hist) Klein (section 5) (Planar Bipartite Graph Perfect Matching Maximum Cardinality Matching) [532 bytes]
- (hist) Family:Shortest Path (Directed Graphs) [532 bytes]
- (hist) Finch (Inexact GED Graph Edit Distance Computation) [531 bytes]
- (hist) Rijndael / AES (Block Ciphers Block Ciphers) [529 bytes]
- (hist) Z-buffering ( Shown Surface Determination) [529 bytes]
- (hist) Reduction from Triangle Detection to Independent Set Queries [528 bytes]
- (hist) Randomized LU Decomposition (Rectangular Matrix LU Decomposition LU Decomposition) [528 bytes]
- (hist) Convex Optimization (Non-linear) [528 bytes]
- (hist) Reduction from BMM to 1-sensitive (4/3)-approximate decremental eccentricity [527 bytes]
- (hist) Brzozowski's algorithm (DFA Minimization DFA Minimization) [526 bytes]
- (hist) Earley parser (CFG Parsing CFG Problems) [526 bytes]
- (hist) Reduction from OV to Bichromatic Hamming Close Pair [525 bytes]
- (hist) Overlap Layout Consensus (De Novo Genome Assembly De Novo Genome Assembly) [525 bytes]
- (hist) Reduction from Matrix Product to Negative Triangle Detection [524 bytes]
- (hist) Cantor–Zassenhaus algorithm (Equal-degree Factorization of Polynomials Over Finite Fields) [523 bytes]
- (hist) Dinitz (with dynamic trees) ( Maximum Flow) [523 bytes]
- (hist) Czumaj (Approximate MCOP Matrix Chain Multiplication) [523 bytes]
- (hist) Exact k-Clique Hypothesis [521 bytes]
- (hist) Α-EM Algorithm (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) [518 bytes]
- (hist) Victor Shoup's algorithm (Equal-degree Factorization of Polynomials Over Finite Fields) [517 bytes]
- (hist) All Pairs Shortest Paths Hypothesis (APSP Hypothesis) [517 bytes]
- (hist) Ausiello et al. (Maximum Cut, Approximate Maximum Cut) [516 bytes]
- (hist) Clock-sampling mutual network synchronization (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems) [515 bytes]
- (hist) Reduction from Betweenness Centrality (BC) to Undirected, Weighted APSP [514 bytes]
- (hist) Chandran and F. Grandoni (The Vertex Cover Problem The Vertex Cover Problem) [514 bytes]
- (hist) Dynamic Dihedral Rotation Queries [514 bytes]
- (hist) Lee; Peng; Spielman (Inexact Laplacian Solver SDD Systems Solvers) [513 bytes]
- (hist) Reduction from BMM to Independent Set Queries [513 bytes]
- (hist) Press, Teukolsky, Flannery (Square Matrix LU Decomposition LU Decomposition) [513 bytes]
- (hist) K Approximate Nearest Neighbors Search [513 bytes]
- (hist) Smallest Factor [513 bytes]
- (hist) Reduction from Betweenness Centrality (BC) to Directed, Weighted APSP [512 bytes]
- (hist) Tarjan's off-line lowest common ancestors algorithm (Off-Line Lowest Common Ancestor Lowest Common Ancestor) [510 bytes]
- (hist) Family:Model-Checking Problem [510 bytes]
- (hist) All Eigenpairs [509 bytes]
- (hist) Reduction from BMM to (5/3)-approximate ap-shortest paths [508 bytes]
- (hist) Bareiss algorithm (Determinant of Matrices with Integer Entries Determinant of Matrices with Integer Entries) [507 bytes]
- (hist) Reduction from OV to Diameter 2 vs 3 [506 bytes]
- (hist) Constructing Solutions [506 bytes]
- (hist) Reduction from BMM to 1-sensitive incremental ss-reach [505 bytes]
- (hist) Reduction from BMM to 2-sensitive incremental st-reach [505 bytes]
- (hist) Reduction from Undirected Median to Undirected, Weighted APSP [504 bytes]
- (hist) Reduction from Undirected Radius to Undirected, Weighted APSP [504 bytes]
- (hist) Chazelle's algorithm (Undirected, General MST Minimum Spanning Tree (MST)) [504 bytes]
- (hist) Reduction from MAX-CNF-SAT to st-Maximum Flow [503 bytes]
- (hist) Reduction from Negative Triangle to Price Query [503 bytes]
- (hist) Reduction from Distance Product to Second Shortest Simple Path [503 bytes]
- (hist) De Prisco (Approximate OBST Optimal Binary Search Trees) [502 bytes]
- (hist) Belloch (2-Dimensional Delaunay Triangulation Delaunay Triangulation) [502 bytes]
- (hist) Chandra (Approximate MCOP Matrix Chain Multiplication) [502 bytes]
- (hist) Todd–Coxeter algorithm (Coset Enumeration Coset Enumeration) [501 bytes]
- (hist) Todd–Coxeter algorithm (Bounded Subgroup Index Coset Enumeration) [501 bytes]
- (hist) Family:Graph Metrics [501 bytes]
- (hist) Faugère F4 algorithm (Gröbner Bases Gröbner Bases) [500 bytes]
- (hist) Reduction from Directed Median to Directed, Weighted APSP [500 bytes]
- (hist) Reduction from Directed Radius to Directed, Weighted APSP [500 bytes]
- (hist) Rautiainen, Marschall (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) [499 bytes]
- (hist) Reduction from Maximum Subarray to Distance Product [499 bytes]
- (hist) Blossom Algorithm (general graph Maximum cardinality matching) [498 bytes]
- (hist) Daitch; Spielman (Inexact Laplacian Solver SDD Systems Solvers) [498 bytes]
- (hist) AST to Code Translation [498 bytes]
- (hist) Householder's Method (Root Computation with continuous derivatives (up to d) Root Computation) [497 bytes]
- (hist) Reduction from Directed, Weighted APSP to Second Shortest Simple Path [497 bytes]
- (hist) Jalali and T. Weissman (Lossy Compression Data Compression) [497 bytes]
- (hist) Spaghetti Sort Parallel Implementation (Non-Comparison Sorting Sorting) [496 bytes]
- (hist) Reduction from CNF-SAT to Frechet Distance [495 bytes]
- (hist) Reduction from Metricity to Negative Triangle Detection [495 bytes]
- (hist) Reduction from Directed, Weighted APSP to Replacement Paths Problem (RPP) [494 bytes]
- (hist) Reduction from Negative Triangle Detection to Metricity [494 bytes]
- (hist) Reduction from CNF-SAT to Approximate Diameter [493 bytes]
- (hist) No-Steal, Force [492 bytes]
- (hist) Digital Differential Analyzer (DDA) (Rasterization Rasterization) [492 bytes]
- (hist) Williams (APSP on Dense Directed Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP)) [492 bytes]
- (hist) Reduction from 3SUM' to Static Dihedral Rotation Queries [491 bytes]
- (hist) Nondeterministic Strong Exponential Time Hypothesis (NSETH) [491 bytes]
- (hist) K Nearest Neighbors Search [491 bytes]
- (hist) Inverse quadratic interpolation (General Root Computation Root Computation) [490 bytes]
- (hist) Harel, Tarjan (Linking Roots) (Lowest Common Ancestor with Linking Roots Lowest Common Ancestor) [487 bytes]
- (hist) Generalized expectation maximization (GEM) algorithm ( Maximum Likelihood Parameters) [485 bytes]
- (hist) Khuller; Raghavachari & Young, "Greedy Methods" (Maximum Cut, Approximate Maximum Cut) [484 bytes]
- (hist) Miyake 2006 (Lossy Compression Data Compression) [483 bytes]
- (hist) Halley's method (Root Computation with continuous second derivative Root Computation) [482 bytes]
- (hist) Faugère F5 algorithm (Gröbner Bases Gröbner Bases) [482 bytes]
- (hist) Harvey; Hoeven ( Multiplication) [482 bytes]
- (hist) Reduction from BMM to ap-reach [481 bytes]
- (hist) Shamir's scheme ( Secret Sharing) [481 bytes]
- (hist) Pollard's kangaroo algorithm (Discrete Logarithm Over Finite Fields Logarithm Calculations) [481 bytes]
- (hist) EM with Quasi-Newton Methods (Jamshidian; Mortaza; Jennrich; Robert I.) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) [481 bytes]
- (hist) Shi 2009 (NAE 3SAT Boolean Satisfiability) [480 bytes]
- (hist) Reduction from MAX-CNF-SAT to Maximum Local Edge Connectivity [480 bytes]
- (hist) K-Clique Hypothesis [480 bytes]
- (hist) Chow's Algorithm (Global Register Allocation Register Allocation) [479 bytes]
- (hist) Muller's method (General Root Computation Root Computation) [479 bytes]
- (hist) Newton's method (Root Computation with continuous first derivative Root Computation) [479 bytes]
- (hist) Reduction from Minimum Triangle to Second Shortest Simple Path [479 bytes]
- (hist) Iterative naive (d-Neighborhood of a String d-Neighborhood of a String) [479 bytes]
- (hist) Any Eigenvalue [479 bytes]
- (hist) Optimal Register Allocation (ORA), Goodwin & Wilken Algorithm (Global Register Allocation Register Allocation) [478 bytes]
- (hist) Ridder's method (General Root Computation Root Computation) [478 bytes]
- (hist) Greedy SEQAID (De Novo Genome Assembly De Novo Genome Assembly) [478 bytes]
- (hist) Opheim simplification ( Line Simplification) [477 bytes]
- (hist) Expectation conditional maximization (ECM) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) [476 bytes]
- (hist) Locality-sensitive hashing (k-ANNS Nearest Neighbor Search) [474 bytes]
- (hist) Locality-sensitive hashing (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search) [474 bytes]
- (hist) Shuji Tsukiyama, Mikio Ide, Hiromu Ariyoshi, and Isao Shirakawa (Enumerating Maximal Cliques, arbitrary graph Clique Problems) [473 bytes]
- (hist) Segundo; Artieda; Strash Parallel (Enumerating Maximal Cliques, arbitrary graph Clique Problems) [473 bytes]
- (hist) Naive Implementation (Exact Laplacian Solver SDD Systems Solvers) [473 bytes]
- (hist) Peng, Vempala (Sparse Linear system of equations) [473 bytes]
- (hist) Rytter (Constructing Suffix Trees Constructing Suffix Trees) [472 bytes]
- (hist) Maneva and M. J. Wainwright (Lossy Compression Data Compression) [472 bytes]
- (hist) Exact k-Clique [472 bytes]
- (hist) Linear Scan, Poletto & Sarkar (Global Register Allocation Register Allocation) [471 bytes]
- (hist) Anderson–Björck algorithm (General Root Computation Root Computation) [470 bytes]
- (hist) Illinois Algorithm (General Root Computation Root Computation) [470 bytes]
- (hist) ARIES (Steal, No-Force Recovery) [470 bytes]
- (hist) No-Steal/Force [470 bytes]
- (hist) Reduction from 3-OV to Diameter 3 vs 7 [469 bytes]
- (hist) All Eigenvalues [468 bytes]
- (hist) Downey, Fellows (The Vertex Cover Problem The Vertex Cover Problem) [467 bytes]
- (hist) Bader & Cong Parallel Implementation (Undirected, General MST Minimum Spanning Tree (MST)) [467 bytes]
- (hist) Reduction from BMM to CFG Parsing [467 bytes]
- (hist) Reduction from CFG Parsing to BMM [467 bytes]
- (hist) 3SUM Hypothesis (3-SUM Hypothesis) [467 bytes]
- (hist) Reduction from CNF-SAT to k-OV [466 bytes]
- (hist) Blakley's scheme ( Secret Sharing) [466 bytes]
- (hist) O(lg N) algorithm (convex polygonal window Line Clipping) [466 bytes]
- (hist) RC5 (Block Ciphers Block Ciphers) [465 bytes]
- (hist) Tomlin (Link Analysis Link Analysis) [465 bytes]
- (hist) Petford and Welsh (3-Graph Coloring Graph Coloring) [465 bytes]
- (hist) Sutherland–Hodgman algorithm (Polygon Clipping with Convex Clipping Polygon Polygon Clipping) [464 bytes]
- (hist) Hungarian algorithm (Bipartite Maximum-Weight Matching Maximum-Weight Matching) [464 bytes]
- (hist) Szymanski's algorithm ( Mutual Exclusion) [464 bytes]
- (hist) SHA-3 (Unkeyed Hash Functions One-Way Hash Functions) [463 bytes]
- (hist) 5-point star Cramer's rule (2-Dimensional Poisson Problem Poisson Problem) [463 bytes]
- (hist) Reduction from Negative Triangle Detection to Shortest Cycle [463 bytes]
- (hist) 5-point star Cramer's rule (3-Dimensional Poisson Problem Poisson Problem) [463 bytes]
- (hist) Miller; Stout (2-dimensional Convex Hull) [463 bytes]
- (hist) Knuth–Bendix algorithm (Coset Enumeration Coset Enumeration) [462 bytes]
- (hist) Knuth–Bendix algorithm (General Groups (uncompleted?) Coset Enumeration) [462 bytes]
- (hist) Reduction from Triangles Cover Triangle to 3D Motion Planning [462 bytes]
- (hist) Jiang, Song, Weinstein and Zhang ( Linear Programming) [462 bytes]
- (hist) PHITS Coheng Chan (Link Analysis Link Analysis) [461 bytes]
- (hist) Fortune ( Delaunay Triangulation) [460 bytes]
- (hist) Reduction from Triangles Cover Triangle to Triangle Measure [460 bytes]
- (hist) Reduction from Strips Cover Box to Triangles Cover Triangle [460 bytes]
- (hist) Weighted incremental algorithm ( Variance Calculations) [460 bytes]
- (hist) Reduction from Triangles Cover Triangle to Visible Triangle [460 bytes]
- (hist) Reduction from Visible Triangle to Triangles Cover Triangle [460 bytes]
- (hist) Bresenham Algorithm (Rasterization Rasterization) [460 bytes]
- (hist) Gupta-Sproull algorithm (Line Drawing Line Drawing) [459 bytes]
- (hist) Suzuki-Kasami's algorithm ( Mutual Exclusion) [459 bytes]
- (hist) Christofides algorithm (Approximate TSP The Traveling-Salesman Problem) [458 bytes]
- (hist) Melhorn's Approximation algorithm (Approximate OBST Optimal Binary Search Trees) [458 bytes]
- (hist) Reduction from Hole in Union to Triangles Cover Triangle [457 bytes]
- (hist) Reduction from Triangles Cover Triangle to Hole in Union [457 bytes]
- (hist) Fortune ( Delaunay triangulation) [457 bytes]
- (hist) Naive solution ( Frequent Words with Mismatches Problem) [456 bytes]
- (hist) Ford–Fulkerson algorithm (Bipartite Graph MCM Maximum Cardinality Matching) [456 bytes]
- (hist) Reduction from GeomBase to Visibility Between Segments [455 bytes]
- (hist) Chvatal greedy heuristic (Weighted Set-Covering The Set-Covering Problem) [455 bytes]
- (hist) Gremban; Miller; Zagha (Inexact Laplacian Solver SDD Systems Solvers) [454 bytes]
- (hist) YOSHIZAWA S.; BELYAEV A. G.; SEIDEL H.-P 2004 (Mesh Parameterization Mesh Parameterization) [454 bytes]
- (hist) Papadimitriou and M Yannakakis 1996 + Buss (The Vertex Cover Problem The Vertex Cover Problem) [453 bytes]
- (hist) Jean-Daniel Boissonnat and Franco P. Preparata. (Reporting all intersection points, generalized segments Line segment intersection) [453 bytes]
- (hist) Reduction from Point on 3 Lines to 3 Points on Line [452 bytes]
- (hist) Reduction from 3 Points on Line to Point on 3 Lines [452 bytes]
- (hist) Ruchansky (Minimum Wiener Connector problem Wiener Index) [452 bytes]
- (hist) Boman; Chen; Hendrickson; Toledo (Inexact Laplacian Solver SDD Systems Solvers) [452 bytes]
- (hist) Elliptic-curve Diffie-Hellman (ECDH) (Key Exchange Key Exchange) [452 bytes]
- (hist) Reduction from GeomBase to Visibility From Infinity [452 bytes]
- (hist) Parameter-expanded expectation maximization (PX-EM) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) [452 bytes]
- (hist) Power Iteration (Eigenpair with the Largest Eigenvalue Eigenvalues (Iterative Methods)) [452 bytes]
- (hist) Parametrized Inapproximability Hypothesis (PIH) [452 bytes]
- (hist) Reduction from Strips Cover Box to Point Covering [450 bytes]
- (hist) Fellegi & Sunter Model (Entity Resolution Entity Resolution) [450 bytes]
- (hist) Newton–Raphson algorithm ( Maximum Likelihood Parameters) [450 bytes]
- (hist) Reduction from Min-Weight k-Cycle to Undirected Wiener Index [450 bytes]
- (hist) Reduction from Directed, Weighted APSP to Undirected, Weighted APSP [450 bytes]
- (hist) Reduction from Undirected, Weighted APSP to Directed, Weighted APSP [450 bytes]
- (hist) Reduction from GeomBase to Planar Motion Planning [450 bytes]
- (hist) K-OV Hypothesis [450 bytes]
- (hist) Gupta; Verdu (Lossy Compression Data Compression) [449 bytes]
- (hist) Rosenkrantz; D. J.; Stearns; R. E.; Lewis; P. M. (Approximate TSP The Traveling-Salesman Problem) [449 bytes]
- (hist) Haveliwala (Link Analysis Link Analysis) [448 bytes]
- (hist) Jalali; A. Montanari; and T. Weissman (Lossy Compression Data Compression) [448 bytes]
- (hist) Srba (SLAM Algorithms SLAM Algorithms) [448 bytes]
- (hist) Cheriyan et al. (st-Maximum Flow Maximum Flow) [448 bytes]
- (hist) Shaban; Amirreza; Mehrdad; Farajtabar (Maximum Likelihood Methods in Unknown Latent Variables; multi-view model, discrete observations Maximum Likelihood Methods in Unknown Latent Variables) [447 bytes]
- (hist) Ciliberti; Mézard (Lossy Compression Data Compression) [447 bytes]
- (hist) Papadimitriou and M Yannakakis (The Vertex Cover Problem The Vertex Cover Problem) [447 bytes]
- (hist) Sam Buss (The Vertex Cover Problem The Vertex Cover Problem) [447 bytes]
- (hist) Goodrich (Reporting all intersection points, line segments Line segment intersection) [447 bytes]
- (hist) Khuller; Matias ( Closest Pair Problem) [444 bytes]
- (hist) Reduction from GeomBase to Strips Cover Box [444 bytes]
- (hist) Banker's Algorithm (Deadlock Avoidance Deadlock avoidance) [444 bytes]
- (hist) Koutis; Miller and Peng (Inexact Laplacian Solver SDD Systems Solvers) [444 bytes]
- (hist) Raymond's algorithm ( Mutual Exclusion) [444 bytes]
- (hist) Madry's algorithm (Bipartite Graph MCM Maximum Cardinality Matching) [443 bytes]
- (hist) Naive (All Maximal Non-Branching Paths in a Graph All Maximal Non-Branching Paths in a Graph) [443 bytes]
- (hist) Family:Line segment intersection [443 bytes]
- (hist) Stege, Fellows (The Vertex Cover Problem The Vertex Cover Problem) [442 bytes]
- (hist) Bresenham's line algorithm (Line Drawing Line Drawing) [442 bytes]
- (hist) Naimi-Trehel's algorithm ( Mutual Exclusion) [442 bytes]
- (hist) CHAZELLE (Reporting all intersection points, line segments Line segment intersection) [442 bytes]
- (hist) Hitting Set Hypothesis (HS Hypothesis) [442 bytes]
- (hist) B. I. Kvasov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) [441 bytes]
- (hist) Kazuhisa Makino, Takeaki Uno; Section 5 (Enumerating Maximal Cliques, arbitrary graph Clique Problems) [441 bytes]
- (hist) Kushner non-linear filter (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) [441 bytes]
- (hist) Tarjan's strongly connected components algorithm (SCCs Strongly Connected Components) [441 bytes]
- (hist) Reduction from 3SUM to 3 Points on Line [440 bytes]
- (hist) Nesetril, Poljak (k-Clique k-Clique Problem) [440 bytes]
- (hist) Α-EM algorithm ( Maximum Likelihood Parameters) [440 bytes]
- (hist) Apostolico–Giancarlo Algorithm (Single String Search String Search) [440 bytes]
- (hist) Schönhage–Strassen algorithm ( Multiplication) [439 bytes]
- (hist) Reduction from GeomBase to Separator2 [438 bytes]
- (hist) Reduction from GeomBase to Separator1 [438 bytes]
- (hist) Folded spectrum method (Eigenpair closest to mu; Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods)) [438 bytes]
- (hist) MATSF (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems) [438 bytes]
- (hist) Valiant (CFG Recognition CFG Problems) [438 bytes]
- (hist) ITP Method (General Root Computation Root Computation) [437 bytes]
- (hist) ASP (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems) [437 bytes]
- (hist) Schonhage's algorithm (Matrix Multiplication Matrix Product) [437 bytes]
- (hist) List:Domains [437 bytes]
- (hist) Blum (General Graph MCM Maximum Cardinality Matching) [436 bytes]
- (hist) Del Moral; Pierre (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) [436 bytes]
- (hist) Cheriyan & Hagerup (st-Maximum Flow Maximum Flow) [436 bytes]
- (hist) Parameter-expanded expectation maximization (PX-EM) algorithm ( Maximum Likelihood Parameters) [434 bytes]
- (hist) Secant method (General Root Computation Root Computation) [434 bytes]
- (hist) Blelloch; Koutis; Miller; Tangwongsan (Inexact Laplacian Solver SDD Systems Solvers) [434 bytes]
- (hist) Commentz-Walter Algorithm (Multiple String Search String Search) [434 bytes]
- (hist) FastSlam (SLAM Algorithms SLAM Algorithms) [434 bytes]
- (hist) Reduction from 3SUM' to GeomBase [433 bytes]
- (hist) Reduction from GeomBase to 3SUM' [433 bytes]
- (hist) Alt, Blum, Mehlhorn, Paul (bipartite graph Maximum cardinality matching) [433 bytes]
- (hist) Wu and Manber, Fuzzy String Matching ( String Search) [433 bytes]
- (hist) Gries, Martin (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem) [433 bytes]
- (hist) Bitonic Merge Sort Parallel Implementation (Comparison Sorting Sorting) [433 bytes]
- (hist) Chin (Approximate MCOP Matrix Chain Multiplication) [433 bytes]
- (hist) Toom-3 ( Multiplication) [433 bytes]
- (hist) Karpinski (Approximate OBST Optimal Binary Search Trees) [433 bytes]
- (hist) Manacher (Longest Palindromic Substring Longest Palindromic Substring) [432 bytes]
- (hist) M. Chrobak and D. Eppstein (Enumerating Maximal Cliques, arbitrary graph Clique Problems) [432 bytes]
- (hist) Chaitin's Algorithm (Global Register Allocation Register Allocation) [432 bytes]
- (hist) Gabow; Tarjan (General Graph MCM Maximum Cardinality Matching) [432 bytes]
- (hist) Khuller, Matias (k-dimensional space, Euclidean metric Closest Pair Problem) [432 bytes]
- (hist) The (Stochastic Approach for Link Structure Analysis) SALSA Algorithm (Link Analysis Link Analysis) [432 bytes]
- (hist) Dyer (2-dimensional array representation Closest Pair Problem) [432 bytes]
- (hist) Weak Parametrized Inapproximability Hypothesis (WPIH) [432 bytes]
- (hist) Helden Oligo-Analysis (Motif Search Motif Search) [431 bytes]
- (hist) PSLQ algorithm (Integer Relation Integer Relation) [431 bytes]
- (hist) Gomory's cutting method (ILP;MILPs Convex Optimization (Non-linear)) [431 bytes]
- (hist) Kelner; Orecchia; Sidford; Zhu (Inexact Laplacian Solver SDD Systems Solvers) [431 bytes]
- (hist) Helden Oligo-Analysis ( Motif Search) [431 bytes]
- (hist) Trial Multiplication (Discrete Logarithm Over Finite Fields Logarithm Calculations) [430 bytes]
- (hist) De Berg; Cheong (2-Dimensional Delaunay Triangulation Delaunay Triangulation) [430 bytes]
- (hist) Maekawa's algorithm ( Mutual Exclusion) [430 bytes]
- (hist) Alon (st-Maximum Flow Maximum Flow) [430 bytes]
- (hist) Reduction from 3SUM' to 3SUM [429 bytes]
- (hist) Reduction from 3SUM to 3SUM' [429 bytes]
- (hist) Brute force algorithm (Functional Dependency Inference Problem Dependency Inference Problem) [429 bytes]
- (hist) Quadratic sieve (Second Category Integer Factoring Integer Factoring) [429 bytes]
- (hist) Gupta & Sarawagi CRF (Entity Resolution Entity Resolution) [428 bytes]
- (hist) Räihä; Manilla (Multivalued Dependency Inference Problem Dependency Inference Problem) [428 bytes]
- (hist) Expectation conditional maximization (ECM) ( Maximum Likelihood Parameters) [427 bytes]
- (hist) Bowyer–Watson algorithm (2-Dimensional Delaunay Triangulation Delaunay Triangulation) [427 bytes]
- (hist) Chan (APSP on Dense Directed Graphs with Arbitrary Weights; APSP on Dense Undirected Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP)) [427 bytes]
- (hist) Boyer-Moore (BM) algorithm (Single String Search String Search) [427 bytes]
- (hist) MD5 (Unkeyed Hash Functions One-Way Hash Functions) [426 bytes]
- (hist) Ananthakrishna (Entity Resolution Entity Resolution) [426 bytes]
- (hist) MRRR algorithm (Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods)) [426 bytes]
- (hist) Heejo Lee; Jong Kim; Sungje Hong; and Sunggu Lee (Approximate MCSP Matrix Chain Multiplication) [426 bytes]
- (hist) Miller-Tucker-Zemlin (MTZ) formulation (Minimum TSP The Traveling-Salesman Problem) [426 bytes]
- (hist) Rabin-Karp (RK) algorithm (Single String Search String Search) [426 bytes]
- (hist) Kleitman–Wang Algorithm (Digraph Realization Problem Graph Realization Problems) [425 bytes]
- (hist) False position method (General Root Computation Root Computation) [425 bytes]
- (hist) Bisection method (General Root Computation Root Computation) [425 bytes]
- (hist) Path-based depth-first search Gabow (SCCs Strongly Connected Components) [425 bytes]
- (hist) Harel, Tarjan (Static Trees) (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) [424 bytes]
- (hist) Expectation–maximization (EM) algorithm ( Maximum Likelihood Parameters) [424 bytes]
- (hist) Bisection method (Any eigenvalue Eigenvalues (Iterative Methods)) [424 bytes]
- (hist) Expectation conditional maximization either (ECME) (Liu; Chuanhai; Rubin; Donald B) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) [424 bytes]
- (hist) Expectation-Maximization (EM) algorithm (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) [424 bytes]
- (hist) Rational sieve (Second Category Integer Factoring Integer Factoring) [424 bytes]
- (hist) Filter Kruskal algorithm (Undirected, General MST Minimum Spanning Tree (MST)) [424 bytes]
- (hist) Counting Sort (Non-Comparison Sorting Sorting) [424 bytes]
- (hist) Xiaolin Wu's line algorithm (Line Drawing Line Drawing) [423 bytes]
- (hist) CH Algorithm (SCCs Strongly Connected Components) [423 bytes]
- (hist) Karatsuba Algorithm ( Multiplication) [423 bytes]
- (hist) Zaks' prefix reversal algorithm ( All permutations) [422 bytes]
- (hist) Newton's method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations) [422 bytes]
- (hist) Chan-Singhal-Liu ( Mutual Exclusion) [422 bytes]
- (hist) Hopcroft–Karp algorithm (Bipartite Graph MCM Maximum Cardinality Matching) [422 bytes]
- (hist) Reduction from Directed, Weighted APSP to Negative Triangle Detection [421 bytes]
- (hist) Compressed Extended KF (SLAM Algorithms SLAM Algorithms) [421 bytes]
- (hist) Ramer–Douglas–Peucker algorithm ( Line Simplification) [421 bytes]
- (hist) Welford's Online algorithm ( Variance Calculations) [420 bytes]
- (hist) Steinhaus–Johnson–Trotter algorithm (All Permutations All Permutations) [420 bytes]
- (hist) Distinct-degree factorization (Distinct-degree Factorization of Polynomials Over Finite Fields) [420 bytes]
- (hist) Hierarchical Navigable Small World (HNSW) (k-ANNS Nearest Neighbor Search) [419 bytes]
- (hist) Special number field sieve (First Category Integer Factoring Integer Factoring) [419 bytes]
- (hist) J. Chen; L. Liu; and W. Jia. (The Vertex Cover Problem, Degrees Bounded By 3 The Vertex Cover Problem) [419 bytes]
- (hist) Phillips & Westbrook (st-Maximum Flow Maximum Flow) [419 bytes]
- (hist) Hierarchical Navigable Small World (HNSW) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search) [419 bytes]
- (hist) Kingsford (Motif Search Motif Search) [418 bytes]
- (hist) Projected radial search (k-ANNS for a dense 3D map of geometric points Nearest Neighbor Search) [418 bytes]
- (hist) Edmonds (Maximum-Weight Matching Maximum-Weight Matching) [418 bytes]
- (hist) Kingsford ( Motif Search) [418 bytes]
- (hist) Projected radial search (k Approximate Nearest Neighbors Search (k-ANNS) for a dense 3D map of geometric points Nearest Neighbor Search) [418 bytes]
- (hist) Y Bai (Inexact GED Graph Edit Distance Computation) [417 bytes]
- (hist) HyperLogLog algorithm ( Cardinality Estimation) [417 bytes]
- (hist) Lawler ( Chromatic Number) [417 bytes]
- (hist) EKF SLAM (SLAM Algorithms SLAM Algorithms) [417 bytes]
- (hist) Steffensen's method (General Root Computation Root Computation) [416 bytes]
- (hist) Blowfish (Block Ciphers Block Ciphers) [416 bytes]
- (hist) PSOS algorithm (Integer Relation Integer Relation) [416 bytes]
- (hist) SMAWK algorithm ( Minimum value in each row of an implicitly-defined totally monotone matrix) [416 bytes]
- (hist) Chandran and Hochbaum (Bipartite Graph MCM Maximum Cardinality Matching) [416 bytes]
- (hist) Süleyman Cenk Sahinalp ; Uzi Vishkin (Constructing Suffix Trees Constructing Suffix Trees) [415 bytes]
- (hist) Niedermeier, Rossmanith (The Vertex Cover Problem The Vertex Cover Problem) [415 bytes]
- (hist) Barvinok (Geometric Maximum TSP The Traveling-Salesman Problem) [415 bytes]
- (hist) Index calculus algorithm (Discrete Logarithm Over Finite Fields, F q Logarithm Calculations) [414 bytes]
- (hist) Sun; M. Shao; J. Chen; K. Wong; and X. Wu (Lossy Compression Data Compression) [414 bytes]
- (hist) Downey (The Vertex Cover Problem The Vertex Cover Problem) [414 bytes]
- (hist) Bini's algorithm (Matrix Multiplication Matrix Product) [414 bytes]
- (hist) B.I. Kvasov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) [413 bytes]
- (hist) Schieber; Vishkin (Parallel) (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) [413 bytes]
- (hist) Bareiss algorithm with fast multiplication (Determinant of Matrices with Integer Entries Determinant of Matrices with Integer Entries) [413 bytes]
- (hist) Fortune's algorithm (Voronoi Diagrams Voronoi Diagrams) [413 bytes]