Pages with the most 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)
- Hash join ( Joins) (2 revisions)
- Harvey; Hoeven ( Multiplication) (2 revisions)
- Harrow (Quantum) (Sparse Linear System Linear System) (2 revisions)
- Hanrahan–Krueger (Specular Reflection Texture Mapping) (2 revisions)
- Hadlock (Maximum Cut Maximum Cut) (2 revisions)
- HJLS algorithm ( Integer Relation) (2 revisions)
- Gusfield (Longest Palindromic Substring Longest Palindromic Substring) (2 revisions)
- Gupta & Sarawagi CRF (Entity Resolution Entity Resolution) (2 revisions)
- Reduction from OV to Disjunctive Queries of Reachability in MDPs (2 revisions)
- Gupta-Sproull algorithm (Line Drawing Line Drawing) (2 revisions)
- Guibas; Stofli (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (2 revisions)
- Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Search) (2 revisions)
- Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Insertion) (2 revisions)
- Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Deletion) (2 revisions)
- Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Creation) (2 revisions)
- Reduction from OV to Edit Distance (2 revisions)
- Reduction from OV to k-OV (2 revisions)
- Greiner–Hormann clipping algorithm (Polygon Clipping with Arbitrary Clipping Polygon Polygon Clipping) (2 revisions)
- Greedy Algorithm ( The Set-Covering Problem) (2 revisions)
- Gray-code based (Tower of Hanoi Tower of Hanoi) (2 revisions)
- Graph Isomorphism, Trivalent Graphs (2 revisions)
- Graph Isomorphism, Bounded Vertex Valences (2 revisions)
- Graham (2-dimensional Convex Hull) (2 revisions)
- Goodrich (Reporting all intersection points, line segments Line segment intersection) (2 revisions)
- Goldberg & Tarjan ( Maximum Flow) (2 revisions)
- Gentleman; Morven and Gordon Sande radix-4 algorithm (Discrete Fourier Transform Discrete Fourier Transform) (2 revisions)
- Generalized expectation maximization (GEM) algorithm ( Maximum Likelihood Parameters) (2 revisions)
- Generalized Büchi Games (2 revisions)
- Galil & Naamad ( Maximum Flow) (2 revisions)
- Gabow Ahuja Algorithm (Nonnegative Integer Weights Shortest Path (Directed Graphs)) (2 revisions)
- Gabow; Tarjan (General Graph MCM Maximum Cardinality Matching) (2 revisions)
- Gabow's algorithm (Nonnegative Weights Shortest Path (Directed Graphs)) (2 revisions)
- GLR parser (CFG Parsing CFG Problems) (2 revisions)
- Förstner algorithm 1987 (Corner Detection Feature Detection) (2 revisions)
- Furer's algorithm ( Multiplication) (2 revisions)
- Function Field Sieve (FFS) (Discrete Logarithm Over Finite Fields Logarithm Calculations) (2 revisions)
- Regula Falsi method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations) (2 revisions)
- Replacement Paths Problem (2 revisions)
- Fourier–Motzkin elimination ( Linear Programming) (2 revisions)
- Fortune and Hopcroft (k-dimensional space, l m (or l infty) norm Closest Pair Problem) (2 revisions)
- Fortune's algorithm (Voronoi Diagrams Voronoi Diagrams) (2 revisions)
- Ford–Fulkerson algorithm (Bipartite Graph MCM Maximum Cardinality Matching) (2 revisions)
- Reumann–Witkam ( Line Simplification) (2 revisions)
- Floyd–Warshall algorithm (APSP All-Pairs Shortest Paths (APSP)) (2 revisions)
- Fleury's algorithm + Thorup (Constructing Eulerian Trails in a Graph Constructing Eulerian Trails in a Graph) (2 revisions)
- Fleischer forward-backward (FB) algorithm (SCCs Strongly Connected Components) (2 revisions)
- Flash Sort (Non-Comparison Sorting Sorting) (2 revisions)
- Root Computation (2 revisions)
- Filter Kruskal algorithm (Undirected, General MST Minimum Spanning Tree (MST)) (2 revisions)
- Rytter (Constructing Suffix Trees Constructing Suffix Trees) (2 revisions)
- Ferreira, Camargo, Song (1D Maximum Subarray Maximum Subarray Problem) (2 revisions)
- Fermat's factorization method (First Category Integer Factoring Integer Factoring) (2 revisions)
- Fellegi & Sunter Model (Entity Resolution Entity Resolution) (2 revisions)
- Faugère F5 algorithm (Gröbner Bases Gröbner Bases) (2 revisions)
- Faugère F4 algorithm (Gröbner Bases Gröbner Bases) (2 revisions)
- S-hull (Sinclair) (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (2 revisions)
- Faster Brute Force (via x(L:U) = x(L:U-1)+x(U)) (1D Maximum Subarray Maximum Subarray Problem) (2 revisions)
- Fast clipping (Rectangular Window Line Clipping) (2 revisions)
- FastSlam (SLAM Algorithms SLAM Algorithms) (2 revisions)
- Farach (Constructing Suffix Trees Constructing Suffix Trees) (2 revisions)
- SCAN (Disk Scheduling Disk Scheduling) (2 revisions)
- SLAM Algorithms (2 revisions)
- SMAWK algorithm ( Minimum value in each row of an implicitly-defined totally monotone matrix) (2 revisions)
- SPRINGBORN B.; SCHROEDER P.; PINKALL U. 2008 (Mesh Parameterization Mesh Parameterization) (2 revisions)
- Family:Root Computation (2 revisions)
- SSTF (Disk Scheduling Disk Scheduling) (2 revisions)
- Family:Recovery (2 revisions)
- Family:Nearest Neighbor Search (2 revisions)
- Salomon (Swath Method) (Point-in-Polygon Point-in-Polygon) (2 revisions)
- Sam Buss (The Vertex Cover Problem The Vertex Cover Problem) (2 revisions)
- Schieber; Vishkin (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) (2 revisions)
- Schonhage's algorithm (Matrix Multiplication Matrix Product) (2 revisions)
- Schönhage–Strassen algorithm ( Multiplication) (2 revisions)
- Secant method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations) (2 revisions)
- Family:Interval Scheduling (2 revisions)
- Second Shortest Simple Path (2 revisions)
- Seidel's algorithm (APSP on Dense Undirected Unweighted Graphs; APSP on Sparse Undirected Unweighted Graphs All-Pairs Shortest Paths (APSP)) (2 revisions)
- Selection Sort (Comparison Sorting Sorting) (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)
- Shamos; Hoey (2-dimensional space, Euclidean metric Closest Pair Problem) (2 revisions)
- Shamos (1D Maximum Subarray Maximum Subarray Problem) (2 revisions)
- Shanks's square forms factorization (SQUFOF) (Second Category Integer Factoring Integer Factoring) (2 revisions)
- FCFS (Disk Scheduling Disk Scheduling) (2 revisions)
- F. Preparata and M. Shamos (k-dimensional space, l m (or l infty) norm Closest Pair Problem) (2 revisions)
- Extended Split Radix FFT algorithm (Discrete Fourier Transform Discrete Fourier Transform) (2 revisions)
- Shimbel Algorithm (APSP on Dense Directed Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP)) (2 revisions)
- Expectation conditional maximization (ECM) ( Maximum Likelihood Parameters) (2 revisions)
- Euler's factorization method (First Category Integer Factoring Integer Factoring) (2 revisions)
- Shuji Tsukiyama, Mikio Ide, Hiromu Ariyoshi, and Isao Shirakawa (Enumerating Maximal Cliques, arbitrary graph Clique Problems) (2 revisions)
- Simplex Algorithm ( Linear Programming) (2 revisions)
- Brute-force search (3-Graph Coloring Graph Coloring) (2 revisions)
- Bron–Kerbosch algorithm (Enumerating Maximal Cliques, arbitrary graph Clique Problems) (2 revisions)
- Brute Force (1D Maximum Subarray Maximum Subarray Problem) (2 revisions)
- Ellipsoid method (General, Constrained optimization Convex Optimization (Non-linear)) (2 revisions)
- Sleator & Tarjan ( Maximum Flow) (2 revisions)
- Edmonds & Karp ( Maximum Flow) (2 revisions)
- Trial division (First Category Integer Factoring Integer Factoring) (2 revisions)
- Zhao-Saalfeld ( Line Simplification) (2 revisions)
- 1-sensitive (3/2)-approximate ss-shortest paths (2 revisions)
- Bringman (Subset Sum The Subset-Sum Problem) (2 revisions)
- EM with Quasi-Newton Methods (Jamshidian; Mortaza; Jennrich; Robert I.) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) (2 revisions)
- 1-sensitive decremental st-shortest paths (2 revisions)
- EKF SLAM (SLAM Algorithms SLAM Algorithms) (2 revisions)
- Tree sort (Comparison Sorting Sorting) (2 revisions)
- Brute Force (Matrix Chain Ordering Problem Matrix Chain Multiplication) (2 revisions)
- 2-dimensional array representation (2 revisions)
- Dynamic Programming Algorithm (S. S. Godbole) (Matrix Chain Ordering Problem Matrix Chain Multiplication) (2 revisions)
- 2-dimensional space, $l m$ (or $l \infty$) norm (2 revisions)
- Sort merge join ( Joins) (2 revisions)
- Briggs; Henson; McCormick ( SDD Systems Solvers) (2 revisions)
- 2-sensitive (7/5)-approximate st-shortest paths (2 revisions)
- 2-sensitive decremental st-shortest paths (2 revisions)
- 2 Strong Components (dynamic) (2 revisions)
- Bresenham's line algorithm (Line Drawing Line Drawing) (2 revisions)
- 3 - Graph Coloring (2 revisions)
- 4NF decomposition (2 revisions)
- 4 - Graph Coloring (2 revisions)
- Dwyer (higher dimensions) (General Delaunay Triangulation (d-dimensions) Delaunay Triangulation) (2 revisions)
- Dwyer (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (2 revisions)
- 5-point ADI iteration (2-Dimensional Poisson Problem Poisson Problem) (2 revisions)
- 5-point ADI iteration (3-Dimensional Poisson Problem Poisson Problem) (2 revisions)
- 5-point FFT (2-Dimensional Poisson Problem Poisson Problem) (2 revisions)
- Duplicate Elimination Sorted Neighborhood Algorithm (DE-SNA) (Duplicate Elimination Duplicate Elimination) (2 revisions)
- 5-point FFT (3-Dimensional Poisson Problem Poisson Problem) (2 revisions)
- Dunning; Gupta & Silberholz (Maximum Cut, Approximate Maximum Cut) (2 revisions)
- Sorting based (Merge Sort) (Duplicate Elimination Duplicate Elimination) (2 revisions)
- Dual clustering - Guberman ( Image Segmentation) (2 revisions)
- Sorting based (Merge Sort) + real-time elimination (Duplicate Elimination Duplicate Elimination) (2 revisions)
- 5-point Gauss Seidel iteration (2-Dimensional Poisson Problem Poisson Problem) (2 revisions)
- 5-point Gauss Seidel iteration (3-Dimensional Poisson Problem Poisson Problem) (2 revisions)
- Brute force (Cyclic Peptide Sequencing Problem Cyclic Peptide Sequencing Problem) (2 revisions)
- 5-point SOR iteration (2-Dimensional Poisson Problem Poisson Problem) (2 revisions)
- 5-point SOR iteration (3-Dimensional Poisson Problem Poisson Problem) (2 revisions)
- 5-point cyclic reduction (2-Dimensional Poisson Problem Poisson Problem) (2 revisions)
- 5-point cyclic reduction (3-Dimensional Poisson Problem Poisson Problem) (2 revisions)
- Domain:Operating Systems (2 revisions)
- ZAYER R.; ROESSL C.; SEIDEL H.-P 2005 (Mesh Parameterization Mesh Parameterization) (2 revisions)
- Branch and bound (Cyclic Peptide Sequencing Problem Cyclic Peptide Sequencing Problem) (2 revisions)
- Brute force (Lossy Compression Data Compression) (2 revisions)
- 9-point ADI iteration (2-Dimensional Poisson Problem Poisson Problem) (2 revisions)
- Domain:Numerical Analysis (2 revisions)
- 9-point ADI iteration (3-Dimensional Poisson Problem Poisson Problem) (2 revisions)
- 9-point ADI iteration + smooth guess (2-Dimensional Poisson Problem Poisson Problem) (2 revisions)
- Bowyer–Watson algorithm (Voronoi Diagrams Voronoi Diagrams) (2 revisions)
- Specular Reflection (2 revisions)
- 9-point ADI iteration + smooth guess (3-Dimensional Poisson Problem Poisson Problem) (2 revisions)
- 9-point FFT (2-Dimensional Poisson Problem Poisson Problem) (2 revisions)
- 9-point FFT (3-Dimensional Poisson Problem Poisson Problem) (2 revisions)
- Bowyer–Watson algorithm (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (2 revisions)
- Domain:Combinatorics (2 revisions)
- Yavne Split Radix FFT algorithm (Discrete Fourier Transform Discrete Fourier Transform) (2 revisions)
- Brute force (backtracking search) (The Vertex Cover Problem The Vertex Cover Problem) (2 revisions)
- Borůvka's algorithm (Undirected, General MST Minimum Spanning Tree (MST)) (2 revisions)
- Spielman, Teng (Inexact Laplacian Solver SDD Systems Solvers) (2 revisions)
- Brute force algorithm (Functional Dependency Inference Problem Dependency Inference Problem) (2 revisions)
- A* Algorithm (2 revisions)
- Boolean d-Attribute Stable Matching (2 revisions)
- Yao's algorithm (Undirected, General MST Minimum Spanning Tree (MST)) (2 revisions)
- Two-pass algorithm ( Variance Calculations) (2 revisions)
- A* Informed Search (2 revisions)
- Divide-and-conquer (All eigenvalues; Any eigenvalue Eigenvalues (Iterative Methods)) (2 revisions)
- Distinct-degree factorization (Distinct-degree Factorization of Polynomials Over Finite Fields) (2 revisions)
- Boman; Chen; Hendrickson; Toledo (Inexact Laplacian Solver SDD Systems Solvers) (2 revisions)
- Disjunctive coBüchi Objectives (2 revisions)
- Spreadsort (Non-Comparison Sorting Sorting) (2 revisions)
- Boissonnat; Snoeyink (Reporting all intersection points, generalized segments Line segment intersection) (2 revisions)
- ADI Iteration (2 revisions)
- Dinur & Steurer ( The Set-Covering Problem) (2 revisions)
- Dinitz (with dynamic trees) ( Maximum Flow) (2 revisions)
- Srba (SLAM Algorithms SLAM Algorithms) (2 revisions)
- Dijkstra's algorithm with list (Whiting & Hillier 1960) (Nonnegative Weights Shortest Path (Directed Graphs)) (2 revisions)
- Dijkstra's algorithm with binary heap (Johnson 1977) (Nonnegative Weights Shortest Path (Directed Graphs)) (2 revisions)
- YANG Y.; KIM J.; LUO F.; HU S.; GU X. 2008 (Mesh Parameterization Mesh Parameterization) (2 revisions)
- Dijkstra's algorithm with Fibonacci heap (Johnson 1981; Karlsson & Poblete 1983) (Nonnegative Integer Weights Shortest Path (Directed Graphs)) (2 revisions)
- Y. Dufournaud; C. Schmid; and R. Horaud 2000 (Blob Detection Feature Detection) (2 revisions)
- AVL Tree ( Self-Balancing Trees Creation) (2 revisions)
- Xiaolin Wu's line algorithm (Line Drawing Line Drawing) (2 revisions)
- Bruun's FFT algorithm (Discrete Fourier Transform Discrete Fourier Transform) (2 revisions)
- Dijkstra's algorithm with Fibonacci heap (Fredman & Tarjan 1984; Fredman & Tarjan 1987) (Nonnegative Weights Shortest Path (Directed Graphs)) (2 revisions)
- Digital Differential Analyzer (Line Drawing Line Drawing) (2 revisions)
- Brélaz (DSatur) (3-Graph Coloring Graph Coloring) (2 revisions)
- UKF (SLAM Algorithms SLAM Algorithms) (2 revisions)
- St-Shortest Path (2 revisions)
- About Algorithm-Wiki (2 revisions)
- Stable Matching Verification (2 revisions)
- Stable Pair Checking (2 revisions)
- Blum (General Graph MCM Maximum Cardinality Matching) (2 revisions)
- Steal, No-Force (2 revisions)
- Bubble Sort (Comparison Sorting Sorting) (2 revisions)
- Williams (APSP on Dense Directed Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP)) (2 revisions)
- Williams' p + 1 algorithm (First Category Integer Factoring Integer Factoring) (2 revisions)
- Dekel; Nassimi & Sahni Parallel Implementation (Topological Sorting Topological Sorting) (2 revisions)
- Steinhaus–Johnson–Trotter algorithm (All Permutations All Permutations) (2 revisions)
- Sthele, Zimmermann (Greatest Common Divisor Greatest Common Divisor) (2 revisions)
- Ahuja & Orlin ( Maximum Flow) (2 revisions)
- Wheel factorization (First Category Integer Factoring Integer Factoring) (2 revisions)
- Akkoyunlu; E. A. (Enumerating Maximal Cliques, arbitrary graph Clique Problems) (2 revisions)
- Algorithm Families (2 revisions)
- Toom-3 ( Multiplication) (2 revisions)
- Tompkins–Paige algorithm (All Permutations All Permutations) (2 revisions)
- Unbalanced OV (2 revisions)
- Blob Detection (2 revisions)
- De Berg; Cheong (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (2 revisions)
- De ( Multiplication) (2 revisions)
- All Eigenpairs (2 revisions)
- String Graph (Myers) (De Novo Genome Assembly De Novo Genome Assembly) (2 revisions)
- All Eigenvalues (2 revisions)
- C-LOOK (Disk Scheduling Disk Scheduling) (2 revisions)
- C-SCAN (Disk Scheduling Disk Scheduling) (2 revisions)
- Tomita; Tanaka & Takahashi (Enumerating Maximal Cliques, arbitrary graph Clique Problems) (2 revisions)
- David Eppstein, Maarten Löffler, Darren Strash (Enumerating Maximal Cliques, arbitrary graph Clique Problems) (2 revisions)
- Welford's Online algorithm ( Variance Calculations) (2 revisions)
- Blelloch; Koutis; Miller; Tangwongsan (Inexact Laplacian Solver SDD Systems Solvers) (2 revisions)
- Unkeyed Hash Functions (2 revisions)
- Dantzig ( Maximum Flow) (2 revisions)
- Strong Connectivity (dynamic) (2 revisions)
- Damiano Brigo; Bernard Hanzon and François LeGland (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (2 revisions)
- Daitch; Spielman (Inexact Laplacian Solver SDD Systems Solvers) (2 revisions)
- Cyrus–Beck (Convex Polygonal Window; Convex Polyhedral window Line Clipping) (2 revisions)
- Sun; M. Shao; J. Chen; K. Wong; and X. Wu (Lossy Compression Data Compression) (2 revisions)
- Sutherland–Hodgman algorithm (Polygon Clipping with Convex Clipping Polygon Polygon Clipping) (2 revisions)
- Alon (st-Maximum Flow Maximum Flow) (2 revisions)
- Weiler–Atherton clipping algorithm (Polygon Clipping with Arbitrary Clipping Polygon Polygon Clipping) (2 revisions)
- Alpha-HMM (Matsuyama, Yasuo) (Maximum Likelihood Methods in Unknown Latent Variables, Hidden Markov Models Maximum Likelihood Methods in Unknown Latent Variables) (2 revisions)
- Weighted incremental algorithm ( Variance Calculations) (2 revisions)
- Amir et al. (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) (2 revisions)
- Unweighted Interval Scheduling, Online (2 revisions)
- Bitonic Merge Sort Parallel Implementation (Comparison Sorting Sorting) (2 revisions)
- Bisection method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations) (2 revisions)
- T. C. Hu ; M. T. Shing (Matrix Chain Ordering Problem Matrix Chain Multiplication) (2 revisions)
- Corner Detection (2 revisions)
- V-ALIGN (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) (2 revisions)
- T. Lindeberg DoG 2015 (Blob Detection Feature Detection) (2 revisions)
- Any Eigenpair (2 revisions)
- TSPLIB (Minimum TSP The Traveling-Salesman Problem) (2 revisions)
- Cooley–Tukey algorithm (Discrete Fourier Transform Discrete Fourier Transform) (2 revisions)
- Any Eigenvalue (2 revisions)
- Cantor–Zassenhaus algorithm (Equal-degree Factorization of Polynomials Over Finite Fields) (2 revisions)
- Thorup (reverse-delete) (Undirected, General MST Minimum Spanning Tree (MST)) (2 revisions)
- Ward anisotropic (Specular Reflection Texture Mapping) (2 revisions)
- Thorup (APSP on Dense Undirected Graphs with Positive Integer Weights; APSP on Sparse Undirected Graphs with Positive Integer Weights All-Pairs Shortest Paths (APSP)) (2 revisions)
- Approximate MCOP (2 revisions)
- Approximate MCSP (2 revisions)
- Wang Y-K; Fan K-C; Horng J-T ( Graph Edit Distance Computation) (2 revisions)
- Wang-Zhu-Cantor additive FFT (Discrete Fourier Transform Discrete Fourier Transform) (2 revisions)
- Ausiello et al. (Maximum Cut, Approximate Maximum Cut) (2 revisions)
- Thorup's Sorting Algorithm (Comparison Sorting Sorting) (2 revisions)
- Chan's algorithm Parallel Implementation ( Variance Calculations) (2 revisions)
- Tarjan's DFS based algorithm (Topological Sorting Topological Sorting) (2 revisions)
- Chan-Singhal-Liu ( Mutual Exclusion) (2 revisions)
- Bern; Gilbert; Hendrickson (Inexact Laplacian Solver SDD Systems Solvers) (2 revisions)
- Tarjan's off-line lowest common ancestors algorithm (Off-Line Lowest Common Ancestor Lowest Common Ancestor) (2 revisions)
- Chan (APSP on Dense Directed Graphs with Arbitrary Weights; APSP on Dense Undirected Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP)) (2 revisions)
- Connected Subgraph (2 revisions)
- Wagner and Fischer (LCS Longest Common Subsequence) (2 revisions)
- Chan (Geometrically Weighted) (APSP on Geometrically Weighted Graphs All-Pairs Shortest Paths (APSP)) (2 revisions)
- BEN-CHEN M.; GOTSMAN C.; BUNIN G. 2008 (Mesh Parameterization Mesh Parameterization) (2 revisions)
- Tarjan Splay Tree ( Self-Balancing Trees Creation) (2 revisions)
- Berlekamp–Massey algorithm (Cryptanalysis of Linear Feedback Shift Registers Cryptanalysis of Linear Feedback Shift Registers) (2 revisions)
- Compressed Extended KF (SLAM Algorithms SLAM Algorithms) (2 revisions)
- Berlekamp's algorithm (Distinct-degree; Equal-degree Factorization of Polynomials Over Finite Fields) (2 revisions)
- BST Algorithm (Duplicate Elimination Duplicate Elimination) (2 revisions)
- Cohen–Sutherland (Rectangular Window Line Clipping) (2 revisions)
- Cohen; Lee and Song ( Linear Programming) (2 revisions)
- Terlaky's Criss-cross algorithm ( Linear Programming) (2 revisions)
- Babai (Graph Isomorphism, Bounded Number of Vertices of Each Color Graph Isomorphism Problem) (2 revisions)
- Bergland; Glenn radix-8 algorithm (Discrete Fourier Transform Discrete Fourier Transform) (2 revisions)
- Von zur Gathen-Gerhard additive FFT (Discrete Fourier Transform Discrete Fourier Transform) (2 revisions)
- Ciliberti; Mézard (Lossy Compression Data Compression) (2 revisions)
- Visvalingam–Whyatt ( Line Simplification) (2 revisions)
- Bader & Cong Parallel Implementation (Undirected, General MST Minimum Spanning Tree (MST)) (2 revisions)
- Balaban. (Reporting all intersection points, generalized segments Line segment intersection) (2 revisions)
- The INDEGREE Algorithm (InDegree Analysis Link Analysis) (2 revisions)
- Bentley–Ottmann algorithm (Reporting all intersection points, line segments Line segment intersection) (2 revisions)
- Bentley (k-dimensional space, l m (or l infty) norm Closest Pair Problem) (2 revisions)
- Bareiss algorithm (Determinant of Matrices with Integer Entries Determinant of Matrices with Integer Entries) (2 revisions)
- Bareiss algorithm with fast multiplication (Determinant of Matrices with Integer Entries Determinant of Matrices with Integer Entries) (2 revisions)
- Chandran and Hochbaum (Bipartite Graph MCM Maximum Cardinality Matching) (2 revisions)
- Barghout; Lauren Visual Taxometric approach ( Image Segmentation) (2 revisions)
- Chin and Poon (LCS Longest Common Subsequence) (2 revisions)
- Chiba and Nishizeki (Enumerating Maximal Cliques, arbitrary graph Clique Problems) (2 revisions)
- Cheriyan et al. (st-Maximum Flow Maximum Flow) (2 revisions)
- Cheriyan & Hagerup (st-Maximum Flow Maximum Flow) (2 revisions)
- Barvinok (Geometric Maximum TSP The Traveling-Salesman Problem) (2 revisions)
- Cheriton-Tarjan Algorithm (Undirected, General MST Minimum Spanning Tree (MST)) (2 revisions)
- Bentley; Shamos (k-dimensional space, l m (or l infty) norm Closest Pair Problem) (2 revisions)
- Bayer, McCreight B-Tree ( Self-Balancing Trees Creation) (2 revisions)
- Vatti clipping algorithm (Polygon Clipping with Arbitrary Clipping Polygon Polygon Clipping) (2 revisions)
- Chazelle's algorithm (Undirected, General MST Minimum Spanning Tree (MST)) (2 revisions)
- Bellare Active Learning (Entity Resolution Entity Resolution) (2 revisions)
- Belloch (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (2 revisions)
- Bellman dynamic programming algorithm (Subset Sum The Subset-Sum Problem) (2 revisions)
- Chen Ensembles of classifiers (Entity Resolution Entity Resolution) (2 revisions)
- Chen's lambda-connected segmentation ( Image Segmentation) (2 revisions)
- Bellman–Ford algorithm (Dantzig 1960) (Nonnegative Weights Shortest Path (Directed Graphs)) (2 revisions)
- Bellman–Ford algorithm (Ford 1956) (general weights Shortest Path (Directed Graphs)) (2 revisions)
- Chazelle & Edelsbrunner (Reporting all intersection points, line segments Line segment intersection) (2 revisions)
- Bellman–Ford algorithm (Shimbel 1955; Bellman 1958; Moore 1959) (general weights Shortest Path (Directed Graphs)) (2 revisions)
- Particle filter Del Moral (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (1 revision)
- Reduction from 3SUM to 3SUM' (1 revision)
- Reduction from 3SUM' to Static Dihedral Rotation Queries (1 revision)
- Reduction from 3SUM' to GeomBase (1 revision)
- Reduction from 3SUM' to 3SUM (1 revision)
- Reduction from 3-OV to Diameter 3 vs 7 (1 revision)
- Reduction from $(\min, \leq)$ Product to Triangle in Unweighted Graph (1 revision)
- Trino ( 4NF Decomposition) (1 revision)
- Recursive Region Splitting ( Image Segmentation) (1 revision)
- Trujillo and Olague 2008 (Corner Detection Feature Detection) (1 revision)
- Tuned Boyer-Moore algorithm (Single String Search String Search) (1 revision)
- Turnpike problem (1 revision)
- Tushar Deepak Chandra and Sam Toueg (Distributed Locking Algorithms Distributed Locking Algorithms) (1 revision)
- Recovery (1 revision)
- Record linking (Entity Resolution Entity Resolution) (1 revision)
- Two-pass Algorithm (1 revision)
- Two-way String-Matching Algorithm (Single String Search String Search) (1 revision)
- Re-tiling - Turk; G 1992 (Mesh Simplification Mesh Simplification) (1 revision)
- Rayleigh quotient iteration (Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods)) (1 revision)
- Ray tracing ( Shown Surface Determination) (1 revision)
- Ray casting algorithm Shimrat; M (Point-in-Polygon Point-in-Polygon) (1 revision)
- Ray Tracing (1 revision)
- Ravikumar & Cohen Generative Models (Entity Resolution Entity Resolution) (1 revision)
- Ukkonen (Constructing Suffix Trees Constructing Suffix Trees) (1 revision)
- Ukkonen and D. Wood (Constructing Suffix Trees Constructing Suffix Trees) (1 revision)
- Rational sieve (Second Category Integer Factoring Integer Factoring) (1 revision)
- Rasterization (1 revision)
- Ullman (Subgraph Isomorphism Graph Isomorphism Problem) (1 revision)
- Randomized LU Decomposition (Rectangular Matrix LU Decomposition LU Decomposition) (1 revision)
- Random Split Exponential algorithm (Subset Sum The Subset-Sum Problem) (1 revision)
- Unbalanced Orthogonal Vectors Hypothesis (UOVH) (1 revision)
- Random (Online Page Replacements) (1 revision)
- Unsworth; C.; Prosser; P (Stable Marriage Problem Stable Matching Problem) (1 revision)
- Ramer–Douglas–Peucker Algorithm (1 revision)
- Raita Algorithm (Single String Search String Search) (1 revision)
- Radix sorting method (General Permutations Generating Random Permutations) (1 revision)
- Radix Sort (Non-Comparison Sorting Sorting) (1 revision)
- Radix Sort (1 revision)
- Rabin–Scott powerset construction ( NFA to DFA conversion) (1 revision)
- Rabin–Scott Powerset Construction (1 revision)
- V. A. Lyul’ka and A. V. Romanenko (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) (1 revision)
- Rabin-Karp (RK) algorithm (Single String Search String Search) (1 revision)
- Rabin' Algorithm (k-dimensional space, l m (or l infty) norm Closest Pair Problem) (1 revision)
- V. A. Lyul’ka and A. V. Romanenko 1994 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) (1 revision)
- V. A. Lyul’ka and I. E. Mikhailov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) (1 revision)
- RIPEMD-160 (Unkeyed Hash Functions One-Way Hash Functions) (1 revision)
- V. A. Lyul’ka and I. E. Mikhailov 2003 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) (1 revision)
- RC5 (Block Ciphers Block Ciphers) (1 revision)
- R. Paget ; I.D. Longstaff (Texture Synthesis Texture Synthesis) (1 revision)
- R. Nock and F. Nielsen Statistical Region Merging ( Image Segmentation) (1 revision)
- V. I. Paasonen (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) (1 revision)
- V. I. Paasonen 1968 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) (1 revision)
- Vaidya's Algorithm (1 revision)
- Vaidya (Inexact Laplacian Solver SDD Systems Solvers) (1 revision)
- Quick-Skip Searching (Single String Search String Search) (1 revision)
- Quantum Adiabatic Algorithm (QAA) (CNF-SAT Boolean Satisfiability) (1 revision)
- Quadratic sieve (Second Category Integer Factoring Integer Factoring) (1 revision)
- Quadratic Sieve (1 revision)
- QR algorithm (All eigenvalues; Any eigenvalue Eigenvalues (Iterative Methods)) (1 revision)
- QR Matrix Decomposition (Matrix Factorization Collaborative Filtering) (1 revision)
- Puterman Modified Policy Iteration (MPI) (Optimal Policies for MDPs Optimal Policies for MDPs) (1 revision)
- Projected radial search (k Approximate Nearest Neighbors Search (k-ANNS) for a dense 3D map of geometric points Nearest Neighbor Search) (1 revision)
- Projected radial search (k-ANNS for a dense 3D map of geometric points Nearest Neighbor Search) (1 revision)
- Valentin Polishchuk, and Jukka Suomela (Almost Stable Marriage Problem Stable Matching Problem) (1 revision)
- Priority scheduling (Unweighted Interval Scheduling, Online Interval Scheduling) (1 revision)
- Priority scheduling (Unweighted Interval Scheduling, Online?? Interval Scheduling) (1 revision)
- Priority Queue Algorithm (Duplicate Elimination Duplicate Elimination) (1 revision)
- Prim's algorithm + binary heap (Undirected, General MST Minimum Spanning Tree (MST)) (1 revision)
- Prim's algorithm + adjacency matrix searching (Undirected, General MST Minimum Spanning Tree (MST)) (1 revision)
- Valiant (CFG Recognition CFG Problems) (1 revision)
- Van Helden J; Rios AF; Collado-Vides J (Motif Search Motif Search) (1 revision)
- Preparata and Shamos (Wedge) (Point-in-Polygon Point-in-Polygon) (1 revision)
- Preparata and Shamos (Intersection sum of angle) (Point-in-Polygon Point-in-Polygon) (1 revision)
- Pratt (Constructing Suffix Trees Constructing Suffix Trees) (1 revision)
- Prakesh Ramanan (Approximate MCOP Matrix Chain Multiplication) (1 revision)
- Van Helden J; Rios AF; Collado-Vides J ( Motif Search) (1 revision)
- Power Iteration (Eigenpair with the Largest Eigenvalue Eigenvalues (Iterative Methods)) (1 revision)
- Weiner's algorithm (Constructing Suffix Trees Constructing Suffix Trees) (1 revision)
- Nested Loop Join (1 revision)
- Α-EM algorithm ( Maximum Likelihood Parameters) (1 revision)
- Α-EM Algorithm (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) (1 revision)
- Zykov (deletion-contraction) ( Chromatic Polynomial) (1 revision)
- Zwick 2002 (Directed, Unweighted All-Pairs Shortest Paths (APSP)) (1 revision)
- Neuhaus, Riesen, Bunke (Inexact GED Graph Edit Distance Computation) (1 revision)
- Newton's method (Root Computation with continuous first derivative Root Computation) (1 revision)
- Zamir ( 6 - Graph Coloring) (1 revision)
- Newton–Raphson algorithm ( Maximum Likelihood Parameters) (1 revision)
- Niedermeier, Rossmanith (The Vertex Cover Problem The Vertex Cover Problem) (1 revision)
- Nivasch (Cycle Detection Cycle Detection) (1 revision)
- Nivasch ( Cycle Detection) (1 revision)
- No-Steal, Force (1 revision)
- No-Steal/Force (1 revision)
- Zamir ( 5 - Graph Coloring) (1 revision)
- Non-parametric sampling Efros and Leung (Texture Synthesis Texture Synthesis) (1 revision)
- Non-priority optimal interval Scheduling (1 revision)
- Nondeterministic Strong Exponential Time Hypothesis (NSETH) (1 revision)
- Zaks' prefix reversal algorithm ( All permutations) (1 revision)
- Zakai (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (1 revision)
- ZAYER R.; LÉVY B.; SEIDEL H.-P. 2007 (Mesh Parameterization Mesh Parameterization) (1 revision)
- Nordbeck and Rystedt (Orientation) (Point-in-Polygon Point-in-Polygon) (1 revision)
- Nordbeck and Rystedt (Sum of area) (Point-in-Polygon Point-in-Polygon) (1 revision)
- Not frequently used (NFU) (Online Page Replacements) (1 revision)
- Not recently used (Online Page Replacements) (1 revision)
- Z-buffering ( Shown Surface Determination) (1 revision)
- Yu (Boolean Matrix Multiplication (Combinatorial) Matrix Product) (1 revision)
- Number Field Sieve (NFS) (Discrete Logarithm Over Finite Fields Logarithm Calculations) (1 revision)
- Numerical Analysis (1 revision)
- O'Neil 1973 (Boolean Matrix Multiplication Matrix Product) (1 revision)
- Yao (OBST Optimal Binary Search Trees) (1 revision)
- OBF Algorithm (SCCs Strongly Connected Components) (1 revision)
- Occlusion Culling (Culling Culling) (1 revision)
- Occupancy Grid Mapping (1 revision)
- Y Bai (Inexact GED Graph Edit Distance Computation) (1 revision)
- Ocone (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (1 revision)
- Odd Even Sort Parallel Implementation (Comparison Sorting Sorting) (1 revision)
- YOSHIZAWA S.; BELYAEV A. G.; SEIDEL H.-P 2004 (Mesh Parameterization Mesh Parameterization) (1 revision)
- YAN J. Q.; YANG X.; SHI P. F 2006 (Mesh Parameterization Mesh Parameterization) (1 revision)
- Xu; Renio ( 4NF Decomposition) (1 revision)
- Okunev; Johnson (Square Matrix LU Decomposition LU Decomposition) (1 revision)
- Online 2-d Convex Hull, Preparata (2-dimensional Convex Hull, Online Convex Hull) (1 revision)
- X Chen (Exact GED Graph Edit Distance Computation) (1 revision)
- Online Matrix Vector Multiplication Hypothesis (OMV Hypothesis) (1 revision)
- Wu et al. (LCS Longest Common Subsequence) (1 revision)
- Wu and Manber, Fuzzy String Matching ( String Search) (1 revision)
- Work-conserving schedulers (Unweighted Interval Scheduling, Online Interval Scheduling) (1 revision)
- Work-conserving schedulers (Unweighted Interval Scheduling, Online?? Interval Scheduling) (1 revision)
- Wolfe; Lemaréchal; Kiwiel (General, Constrained optimization Convex Optimization (Non-linear)) (1 revision)
- Williams ( Online Matrix Vector Multiplication (OMV)) (1 revision)
- Operating Systems (1 revision)
- Whitted's algorithm 1979 ( Ray Tracing) (1 revision)
- Whirlpool ( One-Way Hash Functions) (1 revision)
- Wheel Factorization (1 revision)
- Ord-Smith ( All permutations) (1 revision)
- Westin; S. H.; Arvo; J. R.; and Torrance; K. E 1992 (Diffuse Reflection Texture Mapping) (1 revision)
- Orthogonal Vectors Hypothesis (OVH) (1 revision)
- Output-Sensitive Quantum BMM (Boolean Matrix Multiplication Matrix Product) (1 revision)
- Outside-In algorithm (Turnpike Problem Turnpike Problem) (1 revision)
- Overlap Layout Consensus (De Novo Genome Assembly De Novo Genome Assembly) (1 revision)
- Wen (2-dimensional Maximum subarray problem) (1 revision)
- Wen (1-dimensional Maximum subarray problem) (1 revision)
- Wells ( All permutations) (1 revision)
- P.Hanrahan and W.Krueger 1993 (Diffuse Reflection Texture Mapping) (1 revision)
- P. Costantini, B. I. Kvasov, and C. Manni (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) (1 revision)
- P. Costantini; B. I. Kvasov; and C. Manni 1999 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) (1 revision)
- Paul Purdom (Transitive Closure Strongly Connected Components) (1 revision)
- Polynomial interpolation (1 revision)
- Vassilevska Williams (Matrix Multiplication Matrix Product) (1 revision)
- Vatti Clipping Algorithm (1 revision)
- Polygon clipping (1 revision)
- Vertex clustering - Hoppe; H.; DeRose; T.; 1993 (Mesh Simplification Mesh Simplification) (1 revision)
- Vertex clustering - Low; K. L. and Tan; T. S 1997 (Mesh Simplification Mesh Simplification) (1 revision)
- Pollard's rho algorithm (Discrete Logarithm Over Finite Fields Logarithm Calculations) (1 revision)
- Vertex clustering - Reddy 1996 (Mesh Simplification Mesh Simplification) (1 revision)
- Pollard's kangaroo algorithm (Discrete Logarithm Over Finite Fields Logarithm Calculations) (1 revision)
- Vertex clustering - Rossignac; J. and Borrel; P. 1993 (Mesh Simplification Mesh Simplification) (1 revision)
- Point in Polygon (1 revision)
- Pohlig-Hellman (Discrete Logarithm Over Finite Fields Logarithm Calculations) (1 revision)
- Vertex clustering - Rossignac; J. and Borrel; P. 1997 (Mesh Simplification Mesh Simplification) (1 revision)
- Victor Shoup's algorithm (Equal-degree Factorization of Polynomials Over Finite Fields) (1 revision)
- Pisinger (Subset Sum The Subset-Sum Problem) (1 revision)
- View frustum culling (Culling Culling) (1 revision)
- Volterra Equations (1 revision)
- Pineau; Gordon; & Thrun; 2003; (POMDPs POMDPs) (1 revision)
- Phong (Specular Reflection Texture Mapping) (1 revision)
- Pferschy (Subset Sum The Subset-Sum Problem) (1 revision)
- Vornoi Diagrams (1 revision)
- W. Eddy Quickhull (2-dimensional Convex Hull) (1 revision)
- Pettie, Ramachandran (Undirected, General MST Minimum Spanning Tree (MST)) (1 revision)
- Wagner-Fischer Algorithm (1 revision)
- Wagner-Fischer algorithm (Edit distance, constant-size alphabet Sequence Alignment) (1 revision)
- Wagner-Fischer algorithm (Edit distance Sequence Alignment) (1 revision)
- Wagner-Fischer algorithm (Edit sequence, constant-size alphabet Sequence Alignment) (1 revision)
- Petro Vlahos Algorithm (Image Compositing Image Compositing) (1 revision)
- Peterson's algorithm ( Mutual Exclusion) (1 revision)
- Wagner-Fischer algorithm (Edit sequence Sequence Alignment) (1 revision)
- WalkSAT (CNF-SAT Boolean Satisfiability) (1 revision)
- Peng, Vempala (Sparse Linear system of equations) (1 revision)
- Pearce (SCCs Strongly Connected Components) (1 revision)
- Paquet; Tobin; & Chaib-draa; 2005; (POMDPs POMDPs) (1 revision)
- PHITS Coheng Chan (Link Analysis Link Analysis) (1 revision)
- PINKALL U.; POLTHIER K 1993 (Mesh Parameterization Mesh Parameterization) (1 revision)
- PMS (Motif Search Motif Search) (1 revision)
- POMDPs (1 revision)
- PSLQ algorithm (Integer Relation Integer Relation) (1 revision)
- Weighted Activity selection problem (1 revision)
- Weak Parametrized Inapproximability Hypothesis (WPIH) (1 revision)
- PSOS algorithm (Integer Relation Integer Relation) (1 revision)
- Page replacements (1 revision)
- Painter's algorithm/Newell's algorithm ( Shown Surface Determination) (1 revision)
- Pan's algorithm (Matrix Multiplication Matrix Product) (1 revision)
- Wavelet-based - M.H. Gross; O.G. Staadt and R. Gatti 1996 (Mesh Simplification Mesh Simplification) (1 revision)
- Wavelet-based - Eck; M.; DeRose; T.; 1995 (Mesh Simplification Mesh Simplification) (1 revision)
- Wavelet-based - D.J. Hebert and H-J. Kim 1995 (Mesh Simplification Mesh Simplification) (1 revision)
- Papadimitriou and M Yannakakis (The Vertex Cover Problem The Vertex Cover Problem) (1 revision)
- Papadimitriou and M Yannakakis 1996 + Buss (The Vertex Cover Problem The Vertex Cover Problem) (1 revision)
- Path-based depth-first search Gabow (SCCs Strongly Connected Components) (1 revision)
- Parametrized Inapproximability Hypothesis (PIH) (1 revision)
- Parsing (1 revision)
- Reduction from CNF-SAT to Frechet Distance (1 revision)
- Patrick Posser (Stable Roommates Problem Stable Matching Problem) (1 revision)
- Paturi, Pudlák, Saks, Zane (PPSZ) 2005 (k-SAT Boolean Satisfiability) (1 revision)
- Parameter-expanded expectation maximization (PX-EM) algorithm ( Maximum Likelihood Parameters) (1 revision)