Oldest 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)
- P.Hanrahan and W.Krueger 1993 (Diffuse Reflection Texture Mapping) (11:40, 15 February 2023)
- H.W.Jensen 2001 (Diffuse Reflection Texture Mapping) (11:40, 15 February 2023)
- He; X. D.; Torrance; K. E.; Sillion; 1991 (Diffuse Reflection Texture Mapping) (11:40, 15 February 2023)
- Kajiya; J. Anisotropic Reflection Models 1985 (Diffuse Reflection Texture Mapping) (11:40, 15 February 2023)
- Nakamae; E.; Kaneda; K.; Okamoto; T.; and Nishita 1990 (Diffuse Reflection Texture Mapping) (11:40, 15 February 2023)
- Cabral; B.; Max; N.; and Springmeyer; R 1990 (Diffuse Reflection Texture Mapping) (11:40, 15 February 2023)
- Westin; S. H.; Arvo; J. R.; and Torrance; K. E 1992 (Diffuse Reflection Texture Mapping) (11:40, 15 February 2023)
- Phong (Specular Reflection Texture Mapping) (11:40, 15 February 2023)
- Blinn–Phong (Specular Reflection Texture Mapping) (11:40, 15 February 2023)
- Cook–Torrance (microfacets) (Specular Reflection Texture Mapping) (11:40, 15 February 2023)
- Linda G. Shapiro and George C. Stockman (2001) ( Image Segmentation) (11:40, 15 February 2023)
- Recursive Region Splitting ( Image Segmentation) (11:40, 15 February 2023)
- R. Nock and F. Nielsen Statistical Region Merging ( Image Segmentation) (11:41, 15 February 2023)
- Kass; Witkin and Terzopoulos ( Image Segmentation) (11:41, 15 February 2023)
- S.L. Horowitz and T. Pavlidis - directed split and merge ( Image Segmentation) (11:41, 15 February 2023)
- David Mumford and Jayant Shah (1989) ( Image Segmentation) (11:41, 15 February 2023)
- Geman and Geman Markov random fields ( Image Segmentation) (11:41, 15 February 2023)
- Iterated conditional modes algorithm ( Image Segmentation) (11:41, 15 February 2023)
- Watershed transformation 1979 ( Image Segmentation) (11:41, 15 February 2023)
- Topological watershed ( Image Segmentation) (11:41, 15 February 2023)
- Florack and Kuijper ( Image Segmentation) (11:41, 15 February 2023)
- Bijaoui and Rué ( Image Segmentation) (11:41, 15 February 2023)
- Multi-scale MAP estimation - A. Bouman and M. Shapiro (2002) ( Image Segmentation) (11:41, 15 February 2023)
- Multiple Resolution segmentation - J. Liu and Y. H. Yang (1994) ( Image Segmentation) (11:41, 15 February 2023)
- Isometric graph partitioning - Leo Grady and Eric L. Schwartz (2006) ( Image Segmentation) (11:41, 15 February 2023)
- Coplanar facets merging - M.J. De Haemer and M.J. Zyda 1991 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Coplanar facets merging - Hinker; P. and Hansen; C. 1993 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Coplanar facets merging - Kalvin; A. D.; Cutting; C. B.; Haddad; B. and Noz; M. E. 1991 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Coplanar facets merging - A.D. Kalvin and R.H. Taylor 1996 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Controlled vertex/edge/face decimation - M.E. Algorri and F. Schmitt 1996 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Controlled vertex/edge/face decimation - Guéziec 1996 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Controlled vertex/edge/face decimation - R. Ronfard and J. Rossignac 1996 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Controlled vertex/edge/face decimation - Hamann 1994 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Controlled vertex/edge/face decimation - Cohen; J.; Varshney; A 1996 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Re-tiling - Turk; G 1992 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Vertex clustering - Rossignac; J. and Borrel; P. 1993 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Vertex clustering - Low; K. L. and Tan; T. S 1997 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Vertex clustering - Reddy 1996 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Vertex clustering - Hoppe; H.; DeRose; T.; 1993 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Vertex clustering - Rossignac; J. and Borrel; P. 1997 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Wavelet-based - M.H. Gross; O.G. Staadt and R. Gatti 1996 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Wavelet-based - D.J. Hebert and H-J. Kim 1995 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Wavelet-based - Certain; A.; Popovic; J.; 1996 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Wavelet-based - Eck; M.; DeRose; T.; 1995 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Simplification via intermediate hierarchical rep-resentation - Andujar 1996 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Simplification via intermediate hierarchical rep-resentation - He; T.; Hong; L.; Kaufman 1995 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Simplification via intermediate hierarchical rep-resentation - He; T.; Hong; 1996 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Hauskrecht; 2000; (POMDPs POMDPs) (11:41, 15 February 2023)
- Pineau; Gordon; & Thrun; 2003; (POMDPs POMDPs) (11:41, 15 February 2023)
- Braziunas & Boutilier; 2004; (POMDPs POMDPs) (11:41, 15 February 2023)
- Poupart; 2005; (POMDPs POMDPs) (11:41, 15 February 2023)
- Smith & Simmons; 2005; (POMDPs POMDPs) (11:42, 15 February 2023)
- Spaan & Vlassis; 2005 (POMDPs POMDPs) (11:42, 15 February 2023)
- Satia & Lave; 1973; (POMDPs POMDPs) (11:42, 15 February 2023)
- Washington; 1997; (POMDPs POMDPs) (11:42, 15 February 2023)
- Barto;Bradtke; & Singhe; 1995; (POMDPs POMDPs) (11:42, 15 February 2023)
- Paquet; Tobin; & Chaib-draa; 2005; (POMDPs POMDPs) (11:42, 15 February 2023)
- McAllester & Singh; 1999; (POMDPs POMDPs) (11:42, 15 February 2023)
- Bertsekas & Castanon; 1999; (POMDPs POMDPs) (11:42, 15 February 2023)
- Shani; Brafman; & Shimony; 2005 (POMDPs POMDPs) (11:42, 15 February 2023)
- Digital Differential Analyzer (DDA) (Rasterization Rasterization) (11:42, 15 February 2023)
- Bresenham Algorithm (Rasterization Rasterization) (11:42, 15 February 2023)
- Blinn and Newell (Environment Mapping Texture Mapping) (11:42, 15 February 2023)
- Nate Green (Environment Mapping Texture Mapping) (11:42, 15 February 2023)
- Sphere mapping (Environment Mapping Texture Mapping) (11:42, 15 February 2023)
- Heidrich; W.; and H.-P. Seidel (Environment Mapping Texture Mapping) (11:42, 15 February 2023)
- Emil Praun (Environment Mapping Texture Mapping) (11:42, 15 February 2023)
- Mauro Steigleder (Environment Mapping Texture Mapping) (11:42, 15 February 2023)
- HEALPix mapping Wong (Environment Mapping Texture Mapping) (11:42, 15 February 2023)
- Maximum a Posteriori Occupancy Mapping (Occupancy Grid Mapping Occupancy Grid Mapping) (11:42, 15 February 2023)
- Odd Even Sort Parallel Implementation (Comparison Sorting Sorting) (11:42, 15 February 2023)
- Spaghetti Sort Parallel Implementation (Non-Comparison Sorting Sorting) (11:42, 15 February 2023)
- Heejo Lee; Jong Kim; Sungje Hong; and Sunggu Lee (Approximate MCSP Matrix Chain Multiplication) (11:42, 15 February 2023)
- Prakesh Ramanan (Approximate MCOP Matrix Chain Multiplication) (11:42, 15 February 2023)
- Czumaj (Matrix Chain Scheduling Problem Matrix Chain Multiplication) (11:42, 15 February 2023)
- Hsu and Du (Scheme 2) (LCS Longest Common Subsequence) (11:42, 15 February 2023)
- Apostolico and Guerra (HS1 Algorithm) (LCS Longest Common Subsequence) (11:42, 15 February 2023)
- Kuo and Cross (LCS Longest Common Subsequence) (11:42, 15 February 2023)
- Hirschberg (LCS Longest Common Subsequence) (11:42, 15 February 2023)
- Hsu and Du (Scheme 1) (LCS Longest Common Subsequence) (11:42, 15 February 2023)
- Apostolico and Guerra (Algorithm 2) (LCS Longest Common Subsequence) (11:42, 15 February 2023)
- 5-point Gauss elimination (3-Dimensional Poisson Problem Poisson Problem) (11:52, 15 February 2023)
- 5-point star Cramer's rule (3-Dimensional Poisson Problem Poisson Problem) (11:52, 15 February 2023)
- 9-point SOR iteration (3-Dimensional Poisson Problem Poisson Problem) (11:52, 15 February 2023)
- 9-point Tensor product (3-Dimensional Poisson Problem Poisson Problem) (11:52, 15 February 2023)
- Naive algorithm (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (11:52, 15 February 2023)
- Flipping algorithm (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (11:52, 15 February 2023)
- Fortune (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (11:52, 15 February 2023)
- Drysdale; Su (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (11:52, 15 February 2023)
- String Graph with Ferragina–Manzini Index (Simpson, Durbin) (De Novo Genome Assembly De Novo Genome Assembly) (11:52, 15 February 2023)
- De Bruijn Graph (Idury, Waterman) (De Novo Genome Assembly De Novo Genome Assembly) (11:52, 15 February 2023)
- Hybrid Algorithm (De Novo Genome Assembly De Novo Genome Assembly) (11:52, 15 February 2023)
- Random Split Exponential algorithm (Subset Sum The Subset-Sum Problem) (11:52, 15 February 2023)
- Schlimmer (Functional Dependency Inference Problem Dependency Inference Problem) (11:53, 15 February 2023)
- Derek's Algorithm ( 4NF Decomposition) (11:53, 15 February 2023)
- Xu; Renio ( 4NF Decomposition) (11:53, 15 February 2023)
- Liu (Decisional BCNF BCNF Decomposition) (11:53, 15 February 2023)
- Tradu; Mirc ( 4NF Decomposition) (11:53, 15 February 2023)
- Räihä; Manilla (Multivalued Dependency Inference Problem Dependency Inference Problem) (11:53, 15 February 2023)
- Russell et. al. ( 4NF Decomposition) (11:53, 15 February 2023)
- Naive ( 4NF Decomposition) (11:53, 15 February 2023)
- Maxwell ( 4NF Decomposition) (11:53, 15 February 2023)
- Derek's + Maxwell ( 4NF Decomposition) (11:53, 15 February 2023)
- Trino ( 4NF Decomposition) (11:53, 15 February 2023)
- Catriel Beeri Ronald Fagin John H. Howard (Multivalued Dependency Inference Problem Dependency Inference Problem) (11:53, 15 February 2023)
- Balasubramanian; Fellows (The Vertex Cover Problem The Vertex Cover Problem) (11:53, 15 February 2023)
- Chandran and F. Grandoni (The Vertex Cover Problem The Vertex Cover Problem) (11:53, 15 February 2023)
- J. Chen; L. Liu; and W. Jia. (The Vertex Cover Problem, Degrees Bounded By 3 The Vertex Cover Problem) (11:53, 15 February 2023)
- Niedermeier, Rossmanith (The Vertex Cover Problem The Vertex Cover Problem) (11:53, 15 February 2023)
- Valiant (CFG Recognition CFG Problems) (11:53, 15 February 2023)
- Earley parser (CFG Parsing CFG Problems) (11:53, 15 February 2023)
- Cocke–Younger–Kasami algorithm (CFG Recognition CFG Problems) (11:53, 15 February 2023)
- Papadimitriou and M Yannakakis (The Vertex Cover Problem The Vertex Cover Problem) (11:53, 15 February 2023)
- Downey (The Vertex Cover Problem The Vertex Cover Problem) (11:53, 15 February 2023)
- The Algorithm of Park; Chen; and Yu (PCY) (Finding Frequent Itemsets Finding Frequent Itemsets) (11:53, 15 February 2023)
- A-Priori algorithm (Finding Frequent Itemsets Finding Frequent Itemsets) (11:53, 15 February 2023)
- The Multistage Algorithm (Finding Frequent Itemsets Finding Frequent Itemsets) (11:53, 15 February 2023)
- Gupta; Verdu (Lossy Compression Data Compression) (11:53, 15 February 2023)
- The Multihash Algorithm (Finding Frequent Itemsets Finding Frequent Itemsets) (11:53, 15 February 2023)
- Discrete Cosine Transform (Lossy Compression Data Compression) (11:53, 15 February 2023)
- Matsunaga; Yamamoto (Lossy Compression Data Compression) (11:53, 15 February 2023)
- Korada and R. Urbanke; (Lossy Compression Data Compression) (11:53, 15 February 2023)
- Jalali and T. Weissman (Lossy Compression Data Compression) (11:53, 15 February 2023)
- Square-free factorization (Square-free Factorization of Polynomials Over Finite Fields) (11:53, 15 February 2023)
- Schubert's algorithm ( Factorization of Polynomials Over Finite Fields) (11:53, 15 February 2023)
- Victor Shoup's algorithm (Equal-degree Factorization of Polynomials Over Finite Fields) (11:53, 15 February 2023)
- Irving's Algorithm (Stable Roommates Problem Stable Matching Problem) (11:53, 15 February 2023)
- Manlove; Malley (Stable Marriage Problem Stable Matching Problem) (11:53, 15 February 2023)
- Gale–Shapley algorithm (Stable Marriage Problem Stable Matching Problem) (11:53, 15 February 2023)
- Hentenryck et. al. (Arc Consistency? Stable Matching Problem) (11:53, 15 February 2023)
- FLOATER 2003 (Mesh Parameterization Mesh Parameterization) (11:53, 15 February 2023)
- KARNI Z.; GOTSMAN C.; GORTLER S. J. 2005 (Mesh Parameterization Mesh Parameterization) (11:53, 15 February 2023)
- HORMANN K.; GREINER G 1999 (Mesh Parameterization Mesh Parameterization) (11:53, 15 February 2023)
- SHEFFER A.; LÉVY B.; MOGILNITSKY M.; BOGOMYAKOV A. 2005 (Mesh Parameterization Mesh Parameterization) (11:53, 15 February 2023)
- SHEFFER A.; DE STURLER E. 2000 (Mesh Parameterization Mesh Parameterization) (11:53, 15 February 2023)
- DESBRUN M.; MEYER M.; ALLIEZ P. 2002 (Mesh Parameterization Mesh Parameterization) (11:53, 15 February 2023)
- SANDER P. V.; SNYDER J.; GORTER S. J.; HOPPE 2001 (Mesh Parameterization Mesh Parameterization) (11:53, 15 February 2023)
- ZAYER R.; LÉVY B.; SEIDEL H.-P. 2007 (Mesh Parameterization Mesh Parameterization) (11:53, 15 February 2023)
- YAN J. Q.; YANG X.; SHI P. F 2006 (Mesh Parameterization Mesh Parameterization) (11:53, 15 February 2023)
- YOSHIZAWA S.; BELYAEV A. G.; SEIDEL H.-P 2004 (Mesh Parameterization Mesh Parameterization) (11:53, 15 February 2023)
- CHEN Z. G.; LIU L. G.; ZHANG Z. Y.; WANG G. J. 2007 (Mesh Parameterization Mesh Parameterization) (11:53, 15 February 2023)
- Expectation-Maximization (EM) algorithm (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) (11:53, 15 February 2023)
- Α-EM Algorithm (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) (11:53, 15 February 2023)
- Expectation conditional maximization either (ECME) (Liu; Chuanhai; Rubin; Donald B) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) (11:53, 15 February 2023)
- Expectation conditional maximization (ECM) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) (11:53, 15 February 2023)
- LU Matrix Decomposition (Matrix Factorization Collaborative Filtering) (11:53, 15 February 2023)
- Cholesky Decomposition (Matrix Factorization Collaborative Filtering) (11:53, 15 February 2023)
- QR Matrix Decomposition (Matrix Factorization Collaborative Filtering) (11:53, 15 February 2023)
- Particle filter Del Moral (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (11:53, 15 February 2023)
- Kalman Filter (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (11:53, 15 February 2023)
- Kushner non-linear filter (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (11:53, 15 February 2023)
- Zakai (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (11:53, 15 February 2023)
- Ocone (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (11:53, 15 February 2023)
- Del Moral; Pierre (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (11:53, 15 February 2023)
- Bellman Value Iteration (VI) (Optimal Policies for MDPs Optimal Policies for MDPs) (11:53, 15 February 2023)
- Howard Policy Iteration (PI) (Optimal Policies for MDPs Optimal Policies for MDPs) (11:53, 15 February 2023)
- Puterman Modified Policy Iteration (MPI) (Optimal Policies for MDPs Optimal Policies for MDPs) (11:53, 15 February 2023)
- Integer linear program Vazirani (Unweighted Set-Covering; Weighted Set-Covering The Set-Covering Problem) (11:53, 15 February 2023)
- Lund & Yannakakis ( The Set-Covering Problem) (11:53, 15 February 2023)
- Feige ( The Set-Covering Problem) (11:53, 15 February 2023)
- Cardoso; Nuno; Abreu; Rui ( The Set-Covering Problem) (11:53, 15 February 2023)
- Brute force ( The Set-Covering Problem) (11:53, 15 February 2023)
- Tompa M ( Motif Search) (11:53, 15 February 2023)
- Van Helden J; Rios AF; Collado-Vides J ( Motif Search) (11:53, 15 February 2023)
- Helden Oligo-Analysis ( Motif Search) (11:53, 15 February 2023)
- Sinha S; Tompa M YMF (Yeast Motif Finder) ( Motif Search) (11:53, 15 February 2023)
- Liang Cwinnower ( Motif Search) (11:53, 15 February 2023)
- Sagot M ( Motif Search) (11:53, 15 February 2023)
- Bailey TL; Elkan C MEME ( Motif Search) (11:53, 15 February 2023)
- Kingsford ( Motif Search) (11:53, 15 February 2023)
- Kleinberg (Link Analysis Link Analysis) (11:53, 15 February 2023)
- The PAGERANK Algorithm (Link Analysis Link Analysis) (11:53, 15 February 2023)
- The (Hyperlink-Induced Topic Search) HITS Algorithm (Link Analysis Link Analysis) (11:53, 15 February 2023)
- The (Stochastic Approach for Link Structure Analysis) SALSA Algorithm (Link Analysis Link Analysis) (11:53, 15 February 2023)
- PHITS Coheng Chan (Link Analysis Link Analysis) (11:53, 15 February 2023)
- Haveliwala (Link Analysis Link Analysis) (11:53, 15 February 2023)
- Jeh and Widom (Link Analysis Link Analysis) (11:53, 15 February 2023)
- Tomlin (Link Analysis Link Analysis) (11:53, 15 February 2023)
- Richardson and Domingos (Link Analysis Link Analysis) (11:53, 15 February 2023)
- Chubby (Mike Burrows) (Distributed Locking Algorithms Distributed Locking Algorithms) (11:53, 15 February 2023)
- Achlioptas (Link Analysis Link Analysis) (11:53, 15 February 2023)
- Tushar Deepak Chandra and Sam Toueg (Distributed Locking Algorithms Distributed Locking Algorithms) (11:53, 15 February 2023)
- Leases (Cary G Gray and David R Cheriton) (Distributed Locking Algorithms Distributed Locking Algorithms) (11:53, 15 February 2023)
- Ray casting algorithm Shimrat; M (Point-in-Polygon Point-in-Polygon) (11:53, 15 February 2023)
- Nordbeck and Rystedt (Sum of area) (Point-in-Polygon Point-in-Polygon) (11:53, 15 February 2023)
- Saalfeld (Sign of offset) (Point-in-Polygon Point-in-Polygon) (11:53, 15 February 2023)
- Preparata and Shamos (Intersection sum of angle) (Point-in-Polygon Point-in-Polygon) (11:53, 15 February 2023)
- Preparata and Shamos (Wedge) (Point-in-Polygon Point-in-Polygon) (11:53, 15 February 2023)
- ASP (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems) (11:53, 15 February 2023)
- Nordbeck and Rystedt (Orientation) (Point-in-Polygon Point-in-Polygon) (11:53, 15 February 2023)
- Clock-sampling mutual network synchronization (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems) (11:53, 15 February 2023)
- MATSF (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems) (11:53, 15 February 2023)
- Output-Sensitive Quantum BMM (Boolean Matrix Multiplication Matrix Product) (11:54, 15 February 2023)
- Cygan, Gabow, Sankowski (Bounded integer weights Graph Diameter) (11:54, 15 February 2023)
- O'Neil 1973 (Boolean Matrix Multiplication Matrix Product) (11:54, 15 February 2023)
- (Boolean Matrix Multiplication (Combinatorial) Matrix Product) (11:54, 15 February 2023)
- Method of Four Russians (Boolean Matrix Multiplication (Combinatorial) Matrix Product) (11:54, 15 February 2023)
- Yu (Boolean Matrix Multiplication (Combinatorial) Matrix Product) (11:54, 15 February 2023)
- Williams ( Online Matrix Vector Multiplication (OMV)) (11:54, 15 February 2023)
- Larsen, Williams (Theorem 1.1) ( Online Matrix Vector Multiplication (OMV)) (11:54, 15 February 2023)
- Larsen, Williams (follows from Theorem 2.1) ( Online Matrix Vector Multiplication (OMV)) (11:54, 15 February 2023)
- Parallel Merge Sort - Cole (2) ( Sorting - Comparison) (11:54, 15 February 2023)
- Parallel Merge Sort - Cole (1) ( Sorting - Comparison) (11:54, 15 February 2023)
- ( Negative Triangle) (11:54, 15 February 2023)
- MKM Algorithm ( Maximum Flow) (11:54, 15 February 2023)
- Gabow ( Maximum Flow) (11:54, 15 February 2023)
- Galil ( Maximum Flow) (11:54, 15 February 2023)
- Shiloach ( Maximum Flow) (11:54, 15 February 2023)
- Madry ( Maximum Flow) (11:54, 15 February 2023)
- Lee, Sidford ( Maximum Flow) (11:54, 15 February 2023)
- Brand et al ( Maximum Flow) (11:54, 15 February 2023)
- Chen et al ( Maximum Flow) (11:54, 15 February 2023)
- Gao, Liu, Peng ( Maximum Flow) (11:54, 15 February 2023)
- Alman, Vassilevska Williams ( Matrix Multiplication) (11:54, 15 February 2023)
- Method of Four Russians ( Matrix Multiplication) (11:54, 15 February 2023)
- Byskov ( 5 - Graph Coloring) (11:54, 15 February 2023)
- Bjorklund, Husfeldt, Theorem 1 ( 5 - Graph Coloring) (11:54, 15 February 2023)
- Bjorklund, Husfeldt, Proposition 2 ( 5 - Graph Coloring) (11:54, 15 February 2023)
- Zamir ( 5 - Graph Coloring) (11:54, 15 February 2023)
- Bjorklund, Husfeldt, Theorem 1 ( 6 - Graph Coloring) (11:54, 15 February 2023)
- Byskov, Theorem 20 ( 6 - Graph Coloring) (11:54, 15 February 2023)
- Byskov, Theorem 14 ( 6 - Graph Coloring) (11:54, 15 February 2023)
- Zamir ( 6 - Graph Coloring) (11:54, 15 February 2023)
- Christofides ( Chromatic Number) (11:54, 15 February 2023)
- Bjorklund, Husfeldt, Proposition 2 ( 6 - Graph Coloring) (11:54, 15 February 2023)
- Byskov ( Chromatic Number) (11:54, 15 February 2023)
- Lawler ( Chromatic Number) (11:54, 15 February 2023)
- Eppstein ( Chromatic Number) (11:54, 15 February 2023)
- Bjorklund, Husfeldt, Theorem 1 ( Chromatic Number) (11:54, 15 February 2023)
- Bjorklund, Husfeldt, Proposition 2 ( Chromatic Number) (11:54, 15 February 2023)
- BFS/DFS for connected components ( (11:54, 15 February 2023)
- Koivisto ( Chromatic Number) (11:54, 15 February 2023)
- Angelsmark, Jonsson ( (11:54, 15 February 2023)
- Zykov (deletion-contraction) ( Chromatic Polynomial) (11:54, 15 February 2023)
- Fürer, Kasiviswanathan ( (11:54, 15 February 2023)
- Bjorklund, Husfeldt, Proposition 3 ( Chromatic Polynomial) (11:54, 15 February 2023)
- LU decomposition (General Linear system of equations) (11:54, 15 February 2023)
- Koivisto ( Chromatic Polynomial) (11:54, 15 February 2023)
- Matrix inverse (General Linear system of equations) (11:54, 15 February 2023)
- Peng, Vempala (Sparse Linear system of equations) (11:54, 15 February 2023)
- Asymptotically fast Toeplitz algorithms (Toeplitz Linear system of equations) (11:54, 15 February 2023)
- CHAZELLE 1986 (Counting number of intersection points / line segments Line segment intersection) (11:54, 15 February 2023)
- Parameter-expanded expectation maximization (PX-EM) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) (11:54, 15 February 2023)
- NIEVERGELT. J.. AND PREPARATA (Section 2) (Reporting all intersection points / general polygons Line segment intersection) (11:54, 15 February 2023)
- Jiang, Song, Weinstein and Zhang ( Linear Programming) (11:54, 15 February 2023)
- Seidel's Shelling Algorithm (d-dimensional Convex Hull Convex Hull) (11:54, 15 February 2023)
- Chand-Kapur, Gift Wrapping (d-dimensional Convex Hull Convex Hull) (11:54, 15 February 2023)
- N-dimensional Quickhull (d-dimensional Convex Hull Convex Hull) (11:54, 15 February 2023)
- Online 2-d Convex Hull, Preparata (2-dimensional Convex Hull, Online Convex Hull) (11:54, 15 February 2023)
- Dynamic 2-d Convex Hull, Overmars and van Leeuwen (2-dimensional Convex Hull, Dynamic Convex Hull) (11:54, 15 February 2023)
- (many more...) (2-dimensional Convex Hull, Dynamic Convex Hull) (11:54, 15 February 2023)
- Multistep (SCCs Strongly Connected Components) (11:54, 15 February 2023)
- Geldenhuys-Valmari (SCCs Strongly Connected Components) (11:54, 15 February 2023)
- Prim's algorithm + binary heap (Undirected, General MST Minimum Spanning Tree (MST)) (11:54, 15 February 2023)
- Cheriton-Tarjan (dense) (Undirected, Dense MST Minimum Spanning Tree (MST)) (11:54, 15 February 2023)
- Fredman & Tarjan (Undirected, General MST Minimum Spanning Tree (MST)) (11:54, 15 February 2023)
- Fredman & Willard (Undirected, Integer Weights MST Minimum Spanning Tree (MST)) (11:54, 15 February 2023)
- Gabow et al, Section 2 (Undirected, General MST Minimum Spanning Tree (MST)) (11:54, 15 February 2023)
- Pettie, Ramachandran (Undirected, General MST Minimum Spanning Tree (MST)) (11:54, 15 February 2023)
- Cheriton-Tarjan (planar) (Undirected, Planar MST Minimum Spanning Tree (MST)) (11:54, 15 February 2023)
- Gabow, Galil, Spencer (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST)) (11:54, 15 February 2023)
- Chu-Liu-Edmonds Algorithm (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST)) (11:54, 15 February 2023)
- Tarjan (directed, general) (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST)) (11:54, 15 February 2023)
- Tarjan (directed, dense) (Directed (Optimum Branchings), Super Dense MST Minimum Spanning Tree (MST)) (11:54, 15 February 2023)
- Gabow et al, Section 3 (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST)) (11:54, 15 February 2023)
- Dial's Algorithm (nonnegative integer weights Shortest Path (Directed graphs)) (11:54, 15 February 2023)
- Khuller, Matias (k-dimensional space, Euclidean metric Closest Pair Problem) (11:54, 15 February 2023)
- Thorup (positive integer weights; assumes constant-time multiplication Shortest Path (Undirected graphs)) (11:54, 15 February 2023)
- Brandes (Unweighted Betweenness Centrality (BC)) (11:54, 15 February 2023)
- Brandes (Weighted Betweenness Centrality (BC)) (11:54, 15 February 2023)
- Reduction from Triangles Cover Triangle to Visible Triangle (11:55, 15 February 2023)
- Reduction from Triangles Cover Triangle to 3D Motion Planning (11:55, 15 February 2023)
- Reduction from GeomBase to Visibility From Infinity (11:55, 15 February 2023)
- Reduction from Visible Triangle to Triangles Cover Triangle (11:55, 15 February 2023)
- Reduction from GeomBase to Planar Motion Planning (11:55, 15 February 2023)
- Reduction from CNF-SAT to Local Alignment (11:55, 15 February 2023)
- Reduction from 3SUM to Local Alignment (11:55, 15 February 2023)
- Reduction from 3SUM' to Static Dihedral Rotation Queries (11:55, 15 February 2023)
- Reduction from Directed, Weighted APSP to Negative Triangle Detection (11:55, 15 February 2023)
- Reduction from CNF-SAT to Longest Common Substring with don't cares (11:55, 15 February 2023)
- Reduction from CNF-SAT to Multiple Local Alignment (11:55, 15 February 2023)
- Reduction from CFG Parsing to BMM (11:55, 15 February 2023)
- Reduction from Negative Triangle Search to Negative Triangle Detection (11:55, 15 February 2023)
- Reduction from BMM to CFG Parsing (11:55, 15 February 2023)
- Reduction from Negative Triangle Detection to Matrix Product Verification (11:55, 15 February 2023)
- Reduction from Negative Triangle Listing to Negative Triangle Detection (11:55, 15 February 2023)
- Reduction from Maximum Subarray to Distance Product (11:55, 15 February 2023)
- Reduction from Minimum Witness Finding to Negative Triangle Detection (11:55, 15 February 2023)
- Reduction from All Pairs Minimum Witness (APMW) to Negative Triangle Detection (11:55, 15 February 2023)
- Reduction from Undirected, Weighted APSP to Directed, Weighted APSP (11:55, 15 February 2023)
- Reduction from Directed, Weighted APSP to Undirected, Weighted APSP (11:55, 15 February 2023)
- Reduction from Metricity to Negative Triangle Detection (11:55, 15 February 2023)
- Reduction from Negative Triangle Detection to Maximum Subarray (11:55, 15 February 2023)
- Reduction from Negative Triangle Detection to Metricity (11:55, 15 February 2023)
- Reduction from Negative Triangle Detection to Shortest Cycle (11:55, 15 February 2023)
- Reduction from Maximum Subarray to Negative Triangle Detection (11:55, 15 February 2023)
- Reduction from Directed, Weighted APSP to Replacement Paths Problem (RPP) (11:55, 15 February 2023)
- Reduction from Directed, Weighted APSP to Second Shortest Simple Path (11:55, 15 February 2023)
- Reduction from Distance Product to Second Shortest Simple Path (11:55, 15 February 2023)
- Reduction from Triangle Detection to Independent Set Queries (11:55, 15 February 2023)
- Reduction from Minimum Triangle to Second Shortest Simple Path (11:55, 15 February 2023)
- Reduction from BMM to Independent Set Queries (11:55, 15 February 2023)
- Reduction from Directed Radius to Directed, Weighted APSP (11:55, 15 February 2023)
- Reduction from $(\min, \leq)$ Product to Triangle in Unweighted Graph (11:55, 15 February 2023)
- Reduction from Nondecreasing Triangle to Triangle in Unweighted Graph (11:55, 15 February 2023)
- Reduction from All-Integers 3SUM to 3SUM (11:55, 15 February 2023)
- Reduction from 3SUM to All-Integers 3SUM (11:55, 15 February 2023)
- Reduction from Negative Triangle to Price Query (11:55, 15 February 2023)
- Reduction from Undirected Radius to Undirected, Weighted APSP (11:55, 15 February 2023)
- Reduction from Betweenness Centrality (BC) to Directed, Weighted APSP (11:55, 15 February 2023)
- Reduction from Betweenness Centrality (BC) to Undirected, Weighted APSP (11:55, 15 February 2023)
- Reduction from Directed Median to Directed, Weighted APSP (11:55, 15 February 2023)
- Reduction from Undirected Median to Undirected, Weighted APSP (11:55, 15 February 2023)
- Reduction from Negative Triangle Detection to Median (11:55, 15 February 2023)
- Reduction from Negative Triangle Detection to Radius (11:55, 15 February 2023)
- Reduction from Negative Triangle Detection to Betweenness Centrality (BC) (11:55, 15 February 2023)
- Reduction from CNF-SAT to Approximate Diameter (11:55, 15 February 2023)
- Reduction from Negative Triangle Detection to All-Nodes Median Parity (11:55, 15 February 2023)
- Reduction from Directed, Weighted APSP to All-Nodes Median Parity (11:55, 15 February 2023)
- Reduction from Undirected, Weighted APSP to All-Nodes Median Parity (11:55, 15 February 2023)
- Reduction from Diameter to Positive Betweenness Centrality (11:55, 15 February 2023)
- Reduction from Diameter to Reach Centrality (11:55, 15 February 2023)
- Reduction from Positive Betweenness Centrality to Diameter (11:55, 15 February 2023)
- Reduction from Undirected, Weighted APSP to Undirected All-Nodes Positive Betweenness Centrality (11:55, 15 February 2023)
- Reduction from Directed, Weighted APSP to Directed All-Nodes Positive Betweenness Centrality (11:55, 15 February 2023)
- Reduction from Directed, Weighted APSP to Directed All-Nodes Reach Centrality (11:55, 15 February 2023)
- Reduction from Undirected, Weighted APSP to Undirected All-Nodes Reach Centrality (11:55, 15 February 2023)
- Reduction from Reach Centrality to Positive Betweenness Centrality (11:55, 15 February 2023)
- Reduction from Negative Triangle Detection to All-Nodes Positive Betweenness Centrality (11:55, 15 February 2023)
- Reduction from Diameter to Approximate Betweenness Centrality (11:55, 15 February 2023)
- Reduction from Approximate Betweenness Centrality to Diameter (11:55, 15 February 2023)
- Reduction from Betweenness Centrality (BC) to Diameter (11:55, 15 February 2023)
- Reduction from CNF-SAT to Approximate Betweenness Centrality (11:55, 15 February 2023)
- Reduction from CNF-SAT to Positive Betweenness Centrality (11:55, 15 February 2023)
- Reduction from Min-Weight k-Clique to Minimum Weight k-Cycle (11:55, 15 February 2023)
- Reduction from CNF-SAT to SC2 (11:55, 15 February 2023)
- Reduction from Min-Weight k-Cycle to Undirected Wiener Index (11:55, 15 February 2023)
- Reduction from CNF-SAT to Dynamic Connected Subgraph (11:55, 15 February 2023)
- Reduction from CNF-SAT to (11:55, 15 February 2023)
- Reduction from CNF-SAT to Dynamic MaxSCC (11:55, 15 February 2023)
- Reduction from CNF-SAT to Dynamic ST-Reach (11:55, 15 February 2023)
- Reduction from CNF-SAT to Dynamic 4/3-Diameter (11:55, 15 February 2023)
- Reduction from Triangle Detection to Dynamic Bipartite Maximum-Weight Matching (11:55, 15 February 2023)
- Reduction from Triangle Detection to Dynamic st-Reach (11:55, 15 February 2023)
- Reduction from Triangle Detection to Strong Connectivity (dynamic) (11:55, 15 February 2023)
- Reduction from Directed, Weighted APSP to Dynamic Bipartite Maximum-Weight Matching (11:55, 15 February 2023)
- Reduction from Directed, Weighted APSP to Dynamic $st$-Shortest Path (11:55, 15 February 2023)
- Reduction from MAX-CNF-SAT to Maximum Local Edge Connectivity (11:55, 15 February 2023)
- Main Page (11:57, 15 February 2023)
- Nakatsu et al. (LCS Longest Common Subsequence) (12:14, 15 February 2023)
- Wu et al. (LCS Longest Common Subsequence) (12:14, 15 February 2023)
- Robson (3-Graph Coloring Graph Coloring) (12:14, 15 February 2023)
- Miller and Myers (LCS Longest Common Subsequence) (12:14, 15 February 2023)
- Ahuja et al. ( Maximum Flow) (12:14, 15 February 2023)
- Schöning (3-Graph Coloring Graph Coloring) (12:14, 15 February 2023)
- Johnson (3-Graph Coloring Graph Coloring) (12:14, 15 February 2023)
- Hirsch (3-Graph Coloring Graph Coloring) (12:14, 15 February 2023)
- Special number field sieve (First Category Integer Factoring Integer Factoring) (12:14, 15 February 2023)
- Alon and Kahale (3-Graph Coloring Graph Coloring) (12:14, 15 February 2023)
- General number field sieve (Second Category Integer Factoring Integer Factoring) (12:14, 15 February 2023)
- Two-way String-Matching Algorithm (Single String Search String Search) (12:14, 15 February 2023)
- Shor's algorithm Quantum Implementation (Second Category Integer Factoring Integer Factoring) (12:14, 15 February 2023)
- Quick-Skip Searching (Single String Search String Search) (12:14, 15 February 2023)
- String-Matching with Finite Automata (Single String Search String Search) (12:14, 15 February 2023)
- Fast Hybrid Algorithm (Single String Search String Search) (12:14, 15 February 2023)
- Backward Non-Deterministic DAWG Matching (BNDM) (Single String Search String Search) (12:14, 15 February 2023)
- Aho–Corasick (AC) Algorithm (Multiple String Search String Search) (12:14, 15 February 2023)
- Commentz-Walter Algorithm (Multiple String Search String Search) (12:14, 15 February 2023)
- Raita Algorithm (Single String Search String Search) (12:14, 15 February 2023)
- Boyer-Moore-Horspool (BMH) (Single String Search String Search) (12:14, 15 February 2023)
- BOM (Backward Oracle Matching) (Single String Search String Search) (12:14, 15 February 2023)
- Gapped BLAST (Edit Sequence, constant-size alphabet Sequence Alignment) (12:14, 15 February 2023)
- Basic Local Alignment Search Tool (BLAST) (Edit Sequence, constant-size alphabet Sequence Alignment) (12:14, 15 February 2023)
- Apostolico–Giancarlo Algorithm (Single String Search String Search) (12:14, 15 February 2023)
- Madry's algorithm (Bipartite Graph MCM Maximum Cardinality Matching) (12:14, 15 February 2023)
- Mucha, Sankowski (general) (General Graph MCM Maximum Cardinality Matching) (12:14, 15 February 2023)
- Klein (section 5) (Planar Bipartite Graph Perfect Matching Maximum Cardinality Matching) (12:14, 15 February 2023)
- Diffie–Hellman key exchange (Key Exchange Key Exchange) (12:14, 15 February 2023)
- Dekker's algorithm (2-thread Mutual Exclusion Mutual Exclusion) (12:14, 15 February 2023)
- Elliptic-curve Diffie-Hellman (ECDH) (Key Exchange Key Exchange) (12:14, 15 February 2023)
- Vaidya (Inexact Laplacian Solver SDD Systems Solvers) (12:15, 15 February 2023)
- Peterson's algorithm ( Mutual Exclusion) (12:15, 15 February 2023)
- Boman; Hendrickson (Inexact Laplacian Solver SDD Systems Solvers) (12:15, 15 February 2023)
- Lee; Peng; Spielman (Inexact Laplacian Solver SDD Systems Solvers) (12:15, 15 February 2023)
- Naive Implementation (Exact Laplacian Solver SDD Systems Solvers) (12:15, 15 February 2023)
- Brent's algorithm ( Cycle Detection) (12:15, 15 February 2023)
- Floyd's tortoise and hare algorithm ( Cycle Detection) (12:15, 15 February 2023)
- Fisher–Yates/Knuth shuffle (General Permutations Generating Random Permutations) (12:15, 15 February 2023)
- Durstenfeld's Algorithm 235 (General Permutations Generating Random Permutations) (12:15, 15 February 2023)
- Gosper's algorithm ( Cycle Detection) (12:15, 15 February 2023)
- Sattolo's algorithm (Cyclic Permutations Generating Random Permutations) (12:15, 15 February 2023)
- Gomory's cutting method (ILP;MILPs Convex Optimization (Non-linear)) (12:15, 15 February 2023)
- Wolfe; Lemaréchal; Kiwiel (General, Constrained optimization Convex Optimization (Non-linear)) (12:15, 15 February 2023)
- Subgradient method (General, Constrained optimization Convex Optimization (Non-linear)) (12:15, 15 February 2023)
- Buchberger's algorithm (Gröbner Bases Gröbner Bases) (12:15, 15 February 2023)
- Dual subgradients and the drift-plus-penalty method (Stochastic optimization Convex Optimization (Non-linear)) (12:15, 15 February 2023)
- Hu–Tucker algorithm (Alphabetic Tree Problem Optimal Binary Search Trees) (12:15, 15 February 2023)
- Knuth's DP algorithm (OBST Optimal Binary Search Trees) (12:15, 15 February 2023)
- Garsia–Wachs algorithm (Alphabetic Tree Problem Optimal Binary Search Trees) (12:15, 15 February 2023)
- Modified Knuth's DP algorithm (OBST Optimal Binary Search Trees) (12:15, 15 February 2023)
- Naive algorithm (OBST Optimal Binary Search Trees) (12:15, 15 February 2023)
- Levcopoulos; Lingas; Sack (Approximate OBST Optimal Binary Search Trees) (12:15, 15 February 2023)
- Yao (OBST Optimal Binary Search Trees) (12:15, 15 February 2023)
- De Prisco (Approximate OBST Optimal Binary Search Trees) (12:15, 15 February 2023)
- Lemke–Howson algorithm (2-player Nash Equilibria) (12:15, 15 February 2023)
- Hungarian algorithm (Bipartite Maximum-Weight Matching Maximum-Weight Matching) (12:15, 15 February 2023)
- Lipton; Mehta (2-player Nash Equilibria) (12:15, 15 February 2023)
- Mucha and Sankowski ( Maximum-Weight Matching) (12:15, 15 February 2023)
- Edmonds (Maximum-Weight Matching Maximum-Weight Matching) (12:15, 15 February 2023)
- Fleury's algorithm + Tarjan (Constructing Eulerian Trails in a Graph Constructing Eulerian Trails in a Graph) (12:15, 15 February 2023)
- Hierholzer's algorithm (Constructing Eulerian Trails in a Graph Constructing Eulerian Trails in a Graph) (12:15, 15 February 2023)
- Naive algorithm (Discrete Fourier Transform Discrete Fourier Transform) (12:15, 15 February 2023)
- Radix sorting method (General Permutations Generating Random Permutations) (12:15, 15 February 2023)
- Gao’s additive FFT (Discrete Fourier Transform Discrete Fourier Transform) (12:15, 15 February 2023)
- Inverse iteration (Eigenpair closest to mu; Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods)) (12:15, 15 February 2023)
- LOBPCG algorithm (Eigenpair closest to mu; Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods)) (12:15, 15 February 2023)
- Rayleigh quotient iteration (Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods)) (12:15, 15 February 2023)
- Bisection method (Any eigenvalue Eigenvalues (Iterative Methods)) (12:15, 15 February 2023)
- Jacobi eigenvalue algorithm (All eigenvalues; Any eigenvalue Eigenvalues (Iterative Methods)) (12:15, 15 February 2023)
- QR algorithm (All eigenvalues; Any eigenvalue Eigenvalues (Iterative Methods)) (12:15, 15 February 2023)
- Laguerre iteration (Any eigenvalue Eigenvalues (Iterative Methods)) (12:15, 15 February 2023)
- Homotopy method (All eigenpairs; Eigenpair closest to mu; Any eigenpair; Any eigenvalue; All eigenvalues Eigenvalues (Iterative Methods)) (12:15, 15 February 2023)
- Folded spectrum method (Eigenpair closest to mu; Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods)) (12:15, 15 February 2023)
- MRRR algorithm (Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods)) (12:15, 15 February 2023)
- False position method (General Root Computation Root Computation) (12:15, 15 February 2023)
- Bisection method (General Root Computation Root Computation) (12:15, 15 February 2023)
- Newton's method (Root Computation with continuous first derivative Root Computation) (12:15, 15 February 2023)
- Halley's method (Root Computation with continuous second derivative Root Computation) (12:15, 15 February 2023)
- Ridder's method (General Root Computation Root Computation) (12:15, 15 February 2023)
- Secant method (General Root Computation Root Computation) (12:15, 15 February 2023)
- Muller's method (General Root Computation Root Computation) (12:15, 15 February 2023)
- Todd–Coxeter algorithm (Bounded Subgroup Index Coset Enumeration) (12:15, 15 February 2023)
- Knuth–Bendix algorithm (General Groups (uncompleted?) Coset Enumeration) (12:15, 15 February 2023)
- Haselgrove; Leech and Trotter (Bounded Subgroup Index Coset Enumeration) (12:15, 15 February 2023)
- Expectation–maximization (EM) algorithm ( Maximum Likelihood Parameters) (12:15, 15 February 2023)
- Newton–Raphson algorithm ( Maximum Likelihood Parameters) (12:15, 15 February 2023)
- Parameter-expanded expectation maximization (PX-EM) algorithm ( Maximum Likelihood Parameters) (12:15, 15 February 2023)
- Naive solution ( Cardinality Estimation) (12:15, 15 February 2023)
- Α-EM algorithm ( Maximum Likelihood Parameters) (12:15, 15 February 2023)
- HyperLogLog++ ( Cardinality Estimation) (12:15, 15 February 2023)
- HyperLogLog algorithm ( Cardinality Estimation) (12:15, 15 February 2023)
- LogLog algorithm ( Cardinality Estimation) (12:15, 15 February 2023)
- Flajolet–Martin algorithm ( Cardinality Estimation) (12:15, 15 February 2023)
- Min/max sketches streaming algorithm (streaming Cardinality Estimation) (12:15, 15 February 2023)
- Cooper and Dasgupta algorithm ( Register Allocation) (12:15, 15 February 2023)
- Chow's Algorithm (Global Register Allocation Register Allocation) (12:15, 15 February 2023)
- Linear Scan, Poletto & Sarkar (Global Register Allocation Register Allocation) (12:15, 15 February 2023)
- Bottom-m sketches streaming algorithm (streaming Cardinality Estimation) (12:15, 15 February 2023)
- Chaitin's Algorithm (Global Register Allocation Register Allocation) (12:15, 15 February 2023)
- Kong and Wilken Algorithm (Global Register Allocation Register Allocation) (12:15, 15 February 2023)
- Hopcroft's algorithm (DFA Minimization DFA Minimization) (12:15, 15 February 2023)
- Moore's algorithm (DFA Minimization DFA Minimization) (12:15, 15 February 2023)
- Almeida & Zeitoun (Cyclic Nontrivial SCCs DFA Minimization DFA Minimization) (12:15, 15 February 2023)
- Revuz's algorithm (Acyclic DFA Minimization DFA Minimization) (12:15, 15 February 2023)
- Brzozowski's algorithm (DFA Minimization DFA Minimization) (12:15, 15 February 2023)
- Berkman; Vishkin (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) (12:15, 15 February 2023)
- Stephen Alstrup, Cyril Gavoille, Haim Kaplan & Theis Rauhe (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) (12:15, 15 February 2023)
- X Chen (Exact GED Graph Edit Distance Computation) (12:15, 15 February 2023)
- L Chang (Inexact GED Graph Edit Distance Computation) (12:15, 15 February 2023)
- Y Bai (Inexact GED Graph Edit Distance Computation) (12:15, 15 February 2023)
- Tao D; Tang X; Li X et al ( Graph Edit Distance Computation) (12:15, 15 February 2023)
- Alberto Sanfeliu and King-Sun Fu ( Graph Edit Distance Computation) (12:15, 15 February 2023)
- K Riesen (Inexact GED Graph Edit Distance Computation) (12:15, 15 February 2023)
- Neuhaus, Riesen, Bunke (Inexact GED Graph Edit Distance Computation) (12:15, 15 February 2023)
- Finch (Inexact GED Graph Edit Distance Computation) (12:15, 15 February 2023)
- Segundo; Artieda; Strash Parallel (Enumerating Maximal Cliques, arbitrary graph Clique Problems) (12:15, 15 February 2023)
- Held–Karp algorithm (Minimum TSP The Traveling-Salesman Problem) (12:15, 15 February 2023)
- Lawler; E. L. (Minimum TSP The Traveling-Salesman Problem) (12:15, 15 February 2023)
- Christofides algorithm (Approximate TSP The Traveling-Salesman Problem) (12:15, 15 February 2023)
- 5-point star Cramer's rule (2-Dimensional Poisson Problem Poisson Problem) (12:15, 15 February 2023)
- 5-point Gauss elimination (2-Dimensional Poisson Problem Poisson Problem) (12:15, 15 February 2023)
- 9-point Tensor product (2-Dimensional Poisson Problem Poisson Problem) (12:15, 15 February 2023)
- 9-point SOR iteration (2-Dimensional Poisson Problem Poisson Problem) (12:15, 15 February 2023)
- Gaussian Elimination (Exact Laplacian Solver SDD Systems Solvers) (12:16, 15 February 2023)
- Patrick Posser (Stable Roommates Problem Stable Matching Problem) (12:16, 15 February 2023)
- Gent; I.P.; Irving; R.W.; Manlove; D.F.; Prosser; P.; Smith; B.M. (Stable Marriage Problem Stable Matching Problem) (12:16, 15 February 2023)
- Unsworth; C.; Prosser; P (Stable Marriage Problem Stable Matching Problem) (12:16, 15 February 2023)
- S. S. TSENG and R. C. T. LEE (Stable Marriage Problem Stable Matching Problem) (12:16, 15 February 2023)
- Naive (Constructing Suffix Trees Constructing Suffix Trees) (12:16, 15 February 2023)
- Weiner's algorithm (Constructing Suffix Trees Constructing Suffix Trees) (12:16, 15 February 2023)
- Ukkonen (Constructing Suffix Trees Constructing Suffix Trees) (12:16, 15 February 2023)
- Ukkonen and D. Wood (Constructing Suffix Trees Constructing Suffix Trees) (12:16, 15 February 2023)
- Pratt (Constructing Suffix Trees Constructing Suffix Trees) (12:16, 15 February 2023)
- Süleyman Cenk Sahinalp ; Uzi Vishkin (Constructing Suffix Trees Constructing Suffix Trees) (12:16, 15 February 2023)
- Hariharan (Constructing Suffix Trees Constructing Suffix Trees) (12:16, 15 February 2023)
- McCreight (Constructing Suffix Trees Constructing Suffix Trees) (12:16, 15 February 2023)
- EM Based Winkler (Entity Resolution Entity Resolution) (12:16, 15 February 2023)
- Ananthakrishna (Entity Resolution Entity Resolution) (12:16, 15 February 2023)
- Ravikumar & Cohen Generative Models (Entity Resolution Entity Resolution) (12:16, 15 February 2023)
- Record linking (Entity Resolution Entity Resolution) (12:16, 15 February 2023)
- Dynamic Programming (Longest Palindromic Substring Longest Palindromic Substring) (12:16, 15 February 2023)
- Demand-Driven Register Allocation (Global Register Allocation Register Allocation) (12:16, 15 February 2023)
- Sethi–Ullman Algorithm (Arithmetic Expression Binary Tree AST to Code Translation) (12:16, 15 February 2023)
- Babai and Luks (Graph Isomorphism, General Graphs Graph Isomorphism Problem) (12:16, 15 February 2023)
- McKay ( Graph Isomorphism Problem) (12:16, 15 February 2023)
- Spielman (Isomorphism of strongly regular graphs Graph Isomorphism Problem) (12:16, 15 February 2023)
- Babai ( Graph Isomorphism Problem) (12:16, 15 February 2023)
- Schmidt & Druffel ( Graph Isomorphism Problem) (12:16, 15 February 2023)
- Ullman (Subgraph Isomorphism Graph Isomorphism Problem) (12:16, 15 February 2023)
- Babai & Codenotti (Hypergraphs isomorphism Graph Isomorphism Problem) (12:16, 15 February 2023)