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)

  1. P.Hanrahan and W.Krueger 1993 (Diffuse Reflection Texture Mapping)‏‎ (11:40, 15 February 2023)
  2. H.W.Jensen 2001 (Diffuse Reflection Texture Mapping)‏‎ (11:40, 15 February 2023)
  3. He; X. D.; Torrance; K. E.; Sillion; 1991 (Diffuse Reflection Texture Mapping)‏‎ (11:40, 15 February 2023)
  4. Kajiya; J. Anisotropic Reflection Models 1985 (Diffuse Reflection Texture Mapping)‏‎ (11:40, 15 February 2023)
  5. Nakamae; E.; Kaneda; K.; Okamoto; T.; and Nishita 1990 (Diffuse Reflection Texture Mapping)‏‎ (11:40, 15 February 2023)
  6. Cabral; B.; Max; N.; and Springmeyer; R 1990 (Diffuse Reflection Texture Mapping)‏‎ (11:40, 15 February 2023)
  7. Westin; S. H.; Arvo; J. R.; and Torrance; K. E 1992 (Diffuse Reflection Texture Mapping)‏‎ (11:40, 15 February 2023)
  8. Phong (Specular Reflection Texture Mapping)‏‎ (11:40, 15 February 2023)
  9. Blinn–Phong (Specular Reflection Texture Mapping)‏‎ (11:40, 15 February 2023)
  10. Cook–Torrance (microfacets) (Specular Reflection Texture Mapping)‏‎ (11:40, 15 February 2023)
  11. Linda G. Shapiro and George C. Stockman (2001) ( Image Segmentation)‏‎ (11:40, 15 February 2023)
  12. Recursive Region Splitting ( Image Segmentation)‏‎ (11:40, 15 February 2023)
  13. R. Nock and F. Nielsen Statistical Region Merging ( Image Segmentation)‏‎ (11:41, 15 February 2023)
  14. Kass; Witkin and Terzopoulos ( Image Segmentation)‏‎ (11:41, 15 February 2023)
  15. S.L. Horowitz and T. Pavlidis - directed split and merge ( Image Segmentation)‏‎ (11:41, 15 February 2023)
  16. David Mumford and Jayant Shah (1989) ( Image Segmentation)‏‎ (11:41, 15 February 2023)
  17. Geman and Geman Markov random fields ( Image Segmentation)‏‎ (11:41, 15 February 2023)
  18. Iterated conditional modes algorithm ( Image Segmentation)‏‎ (11:41, 15 February 2023)
  19. Watershed transformation 1979 ( Image Segmentation)‏‎ (11:41, 15 February 2023)
  20. Topological watershed ( Image Segmentation)‏‎ (11:41, 15 February 2023)
  21. Florack and Kuijper ( Image Segmentation)‏‎ (11:41, 15 February 2023)
  22. Bijaoui and Rué ( Image Segmentation)‏‎ (11:41, 15 February 2023)
  23. Multi-scale MAP estimation - A. Bouman and M. Shapiro (2002) ( Image Segmentation)‏‎ (11:41, 15 February 2023)
  24. Multiple Resolution segmentation - J. Liu and Y. H. Yang (1994) ( Image Segmentation)‏‎ (11:41, 15 February 2023)
  25. Isometric graph partitioning - Leo Grady and Eric L. Schwartz (2006) ( Image Segmentation)‏‎ (11:41, 15 February 2023)
  26. Coplanar facets merging - M.J. De Haemer and M.J. Zyda 1991 (Mesh Simplification Mesh Simplification)‏‎ (11:41, 15 February 2023)
  27. Coplanar facets merging - Hinker; P. and Hansen; C. 1993 (Mesh Simplification Mesh Simplification)‏‎ (11:41, 15 February 2023)
  28. 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)
  29. Coplanar facets merging - A.D. Kalvin and R.H. Taylor 1996 (Mesh Simplification Mesh Simplification)‏‎ (11:41, 15 February 2023)
  30. Controlled vertex/edge/face decimation - M.E. Algorri and F. Schmitt 1996 (Mesh Simplification Mesh Simplification)‏‎ (11:41, 15 February 2023)
  31. Controlled vertex/edge/face decimation - Guéziec 1996 (Mesh Simplification Mesh Simplification)‏‎ (11:41, 15 February 2023)
  32. Controlled vertex/edge/face decimation - R. Ronfard and J. Rossignac 1996 (Mesh Simplification Mesh Simplification)‏‎ (11:41, 15 February 2023)
  33. Controlled vertex/edge/face decimation - Hamann 1994 (Mesh Simplification Mesh Simplification)‏‎ (11:41, 15 February 2023)
  34. Controlled vertex/edge/face decimation - Cohen; J.; Varshney; A 1996 (Mesh Simplification Mesh Simplification)‏‎ (11:41, 15 February 2023)
  35. Re-tiling - Turk; G 1992 (Mesh Simplification Mesh Simplification)‏‎ (11:41, 15 February 2023)
  36. Vertex clustering - Rossignac; J. and Borrel; P. 1993 (Mesh Simplification Mesh Simplification)‏‎ (11:41, 15 February 2023)
  37. Vertex clustering - Low; K. L. and Tan; T. S 1997 (Mesh Simplification Mesh Simplification)‏‎ (11:41, 15 February 2023)
  38. Vertex clustering - Reddy 1996 (Mesh Simplification Mesh Simplification)‏‎ (11:41, 15 February 2023)
  39. Vertex clustering - Hoppe; H.; DeRose; T.; 1993 (Mesh Simplification Mesh Simplification)‏‎ (11:41, 15 February 2023)
  40. Vertex clustering - Rossignac; J. and Borrel; P. 1997 (Mesh Simplification Mesh Simplification)‏‎ (11:41, 15 February 2023)
  41. Wavelet-based - M.H. Gross; O.G. Staadt and R. Gatti 1996 (Mesh Simplification Mesh Simplification)‏‎ (11:41, 15 February 2023)
  42. Wavelet-based - D.J. Hebert and H-J. Kim 1995 (Mesh Simplification Mesh Simplification)‏‎ (11:41, 15 February 2023)
  43. Wavelet-based - Certain; A.; Popovic; J.; 1996 (Mesh Simplification Mesh Simplification)‏‎ (11:41, 15 February 2023)
  44. Wavelet-based - Eck; M.; DeRose; T.; 1995 (Mesh Simplification Mesh Simplification)‏‎ (11:41, 15 February 2023)
  45. Simplification via intermediate hierarchical rep-resentation - Andujar 1996 (Mesh Simplification Mesh Simplification)‏‎ (11:41, 15 February 2023)
  46. Simplification via intermediate hierarchical rep-resentation - He; T.; Hong; L.; Kaufman 1995 (Mesh Simplification Mesh Simplification)‏‎ (11:41, 15 February 2023)
  47. Simplification via intermediate hierarchical rep-resentation - He; T.; Hong; 1996 (Mesh Simplification Mesh Simplification)‏‎ (11:41, 15 February 2023)
  48. Hauskrecht; 2000; (POMDPs POMDPs)‏‎ (11:41, 15 February 2023)
  49. Pineau; Gordon; & Thrun; 2003; (POMDPs POMDPs)‏‎ (11:41, 15 February 2023)
  50. Braziunas & Boutilier; 2004; (POMDPs POMDPs)‏‎ (11:41, 15 February 2023)
  51. Poupart; 2005; (POMDPs POMDPs)‏‎ (11:41, 15 February 2023)
  52. Smith & Simmons; 2005; (POMDPs POMDPs)‏‎ (11:42, 15 February 2023)
  53. Spaan & Vlassis; 2005 (POMDPs POMDPs)‏‎ (11:42, 15 February 2023)
  54. Satia & Lave; 1973; (POMDPs POMDPs)‏‎ (11:42, 15 February 2023)
  55. Washington; 1997; (POMDPs POMDPs)‏‎ (11:42, 15 February 2023)
  56. Barto;Bradtke; & Singhe; 1995; (POMDPs POMDPs)‏‎ (11:42, 15 February 2023)
  57. Paquet; Tobin; & Chaib-draa; 2005; (POMDPs POMDPs)‏‎ (11:42, 15 February 2023)
  58. McAllester & Singh; 1999; (POMDPs POMDPs)‏‎ (11:42, 15 February 2023)
  59. Bertsekas & Castanon; 1999; (POMDPs POMDPs)‏‎ (11:42, 15 February 2023)
  60. Shani; Brafman; & Shimony; 2005 (POMDPs POMDPs)‏‎ (11:42, 15 February 2023)
  61. Digital Differential Analyzer (DDA) (Rasterization Rasterization)‏‎ (11:42, 15 February 2023)
  62. Bresenham Algorithm (Rasterization Rasterization)‏‎ (11:42, 15 February 2023)
  63. Blinn and Newell (Environment Mapping Texture Mapping)‏‎ (11:42, 15 February 2023)
  64. Nate Green (Environment Mapping Texture Mapping)‏‎ (11:42, 15 February 2023)
  65. Sphere mapping (Environment Mapping Texture Mapping)‏‎ (11:42, 15 February 2023)
  66. Heidrich; W.; and H.-P. Seidel (Environment Mapping Texture Mapping)‏‎ (11:42, 15 February 2023)
  67. Emil Praun (Environment Mapping Texture Mapping)‏‎ (11:42, 15 February 2023)
  68. Mauro Steigleder (Environment Mapping Texture Mapping)‏‎ (11:42, 15 February 2023)
  69. HEALPix mapping Wong (Environment Mapping Texture Mapping)‏‎ (11:42, 15 February 2023)
  70. Maximum a Posteriori Occupancy Mapping (Occupancy Grid Mapping Occupancy Grid Mapping)‏‎ (11:42, 15 February 2023)
  71. Odd Even Sort Parallel Implementation (Comparison Sorting Sorting)‏‎ (11:42, 15 February 2023)
  72. Spaghetti Sort Parallel Implementation (Non-Comparison Sorting Sorting)‏‎ (11:42, 15 February 2023)
  73. Heejo Lee; Jong Kim; Sungje Hong; and Sunggu Lee (Approximate MCSP Matrix Chain Multiplication)‏‎ (11:42, 15 February 2023)
  74. Prakesh Ramanan (Approximate MCOP Matrix Chain Multiplication)‏‎ (11:42, 15 February 2023)
  75. Czumaj (Matrix Chain Scheduling Problem Matrix Chain Multiplication)‏‎ (11:42, 15 February 2023)
  76. Hsu and Du (Scheme 2) (LCS Longest Common Subsequence)‏‎ (11:42, 15 February 2023)
  77. Apostolico and Guerra (HS1 Algorithm) (LCS Longest Common Subsequence)‏‎ (11:42, 15 February 2023)
  78. Kuo and Cross (LCS Longest Common Subsequence)‏‎ (11:42, 15 February 2023)
  79. Hirschberg (LCS Longest Common Subsequence)‏‎ (11:42, 15 February 2023)
  80. Hsu and Du (Scheme 1) (LCS Longest Common Subsequence)‏‎ (11:42, 15 February 2023)
  81. Apostolico and Guerra (Algorithm 2) (LCS Longest Common Subsequence)‏‎ (11:42, 15 February 2023)
  82. 5-point Gauss elimination (3-Dimensional Poisson Problem Poisson Problem)‏‎ (11:52, 15 February 2023)
  83. 5-point star Cramer's rule (3-Dimensional Poisson Problem Poisson Problem)‏‎ (11:52, 15 February 2023)
  84. 9-point SOR iteration (3-Dimensional Poisson Problem Poisson Problem)‏‎ (11:52, 15 February 2023)
  85. 9-point Tensor product (3-Dimensional Poisson Problem Poisson Problem)‏‎ (11:52, 15 February 2023)
  86. Naive algorithm (2-Dimensional Delaunay Triangulation Delaunay Triangulation)‏‎ (11:52, 15 February 2023)
  87. Flipping algorithm (2-Dimensional Delaunay Triangulation Delaunay Triangulation)‏‎ (11:52, 15 February 2023)
  88. Fortune (2-Dimensional Delaunay Triangulation Delaunay Triangulation)‏‎ (11:52, 15 February 2023)
  89. Drysdale; Su (2-Dimensional Delaunay Triangulation Delaunay Triangulation)‏‎ (11:52, 15 February 2023)
  90. String Graph with Ferragina–Manzini Index (Simpson, Durbin) (De Novo Genome Assembly De Novo Genome Assembly)‏‎ (11:52, 15 February 2023)
  91. De Bruijn Graph (Idury, Waterman) (De Novo Genome Assembly De Novo Genome Assembly)‏‎ (11:52, 15 February 2023)
  92. Hybrid Algorithm (De Novo Genome Assembly De Novo Genome Assembly)‏‎ (11:52, 15 February 2023)
  93. Random Split Exponential algorithm (Subset Sum The Subset-Sum Problem)‏‎ (11:52, 15 February 2023)
  94. Schlimmer (Functional Dependency Inference Problem Dependency Inference Problem)‏‎ (11:53, 15 February 2023)
  95. Derek's Algorithm ( 4NF Decomposition)‏‎ (11:53, 15 February 2023)
  96. Xu; Renio ( 4NF Decomposition)‏‎ (11:53, 15 February 2023)
  97. Liu (Decisional BCNF BCNF Decomposition)‏‎ (11:53, 15 February 2023)
  98. Tradu; Mirc ( 4NF Decomposition)‏‎ (11:53, 15 February 2023)
  99. Räihä; Manilla (Multivalued Dependency Inference Problem Dependency Inference Problem)‏‎ (11:53, 15 February 2023)
  100. Russell et. al. ( 4NF Decomposition)‏‎ (11:53, 15 February 2023)
  101. Naive ( 4NF Decomposition)‏‎ (11:53, 15 February 2023)
  102. Maxwell ( 4NF Decomposition)‏‎ (11:53, 15 February 2023)
  103. Derek's + Maxwell ( 4NF Decomposition)‏‎ (11:53, 15 February 2023)
  104. Trino ( 4NF Decomposition)‏‎ (11:53, 15 February 2023)
  105. Catriel Beeri Ronald Fagin John H. Howard (Multivalued Dependency Inference Problem Dependency Inference Problem)‏‎ (11:53, 15 February 2023)
  106. Balasubramanian; Fellows (The Vertex Cover Problem The Vertex Cover Problem)‏‎ (11:53, 15 February 2023)
  107. Chandran and F. Grandoni (The Vertex Cover Problem The Vertex Cover Problem)‏‎ (11:53, 15 February 2023)
  108. J. Chen; L. Liu; and W. Jia. (The Vertex Cover Problem, Degrees Bounded By 3 The Vertex Cover Problem)‏‎ (11:53, 15 February 2023)
  109. Niedermeier, Rossmanith (The Vertex Cover Problem The Vertex Cover Problem)‏‎ (11:53, 15 February 2023)
  110. Valiant (CFG Recognition CFG Problems)‏‎ (11:53, 15 February 2023)
  111. Earley parser (CFG Parsing CFG Problems)‏‎ (11:53, 15 February 2023)
  112. Cocke–Younger–Kasami algorithm (CFG Recognition CFG Problems)‏‎ (11:53, 15 February 2023)
  113. Papadimitriou and M Yannakakis (The Vertex Cover Problem The Vertex Cover Problem)‏‎ (11:53, 15 February 2023)
  114. Downey (The Vertex Cover Problem The Vertex Cover Problem)‏‎ (11:53, 15 February 2023)
  115. The Algorithm of Park; Chen; and Yu (PCY) (Finding Frequent Itemsets Finding Frequent Itemsets)‏‎ (11:53, 15 February 2023)
  116. A-Priori algorithm (Finding Frequent Itemsets Finding Frequent Itemsets)‏‎ (11:53, 15 February 2023)
  117. The Multistage Algorithm (Finding Frequent Itemsets Finding Frequent Itemsets)‏‎ (11:53, 15 February 2023)
  118. Gupta; Verdu (Lossy Compression Data Compression)‏‎ (11:53, 15 February 2023)
  119. The Multihash Algorithm (Finding Frequent Itemsets Finding Frequent Itemsets)‏‎ (11:53, 15 February 2023)
  120. Discrete Cosine Transform (Lossy Compression Data Compression)‏‎ (11:53, 15 February 2023)
  121. Matsunaga; Yamamoto (Lossy Compression Data Compression)‏‎ (11:53, 15 February 2023)
  122. Korada and R. Urbanke; (Lossy Compression Data Compression)‏‎ (11:53, 15 February 2023)
  123. Jalali and T. Weissman (Lossy Compression Data Compression)‏‎ (11:53, 15 February 2023)
  124. Square-free factorization (Square-free Factorization of Polynomials Over Finite Fields)‏‎ (11:53, 15 February 2023)
  125. Schubert's algorithm ( Factorization of Polynomials Over Finite Fields)‏‎ (11:53, 15 February 2023)
  126. Victor Shoup's algorithm (Equal-degree Factorization of Polynomials Over Finite Fields)‏‎ (11:53, 15 February 2023)
  127. Irving's Algorithm (Stable Roommates Problem Stable Matching Problem)‏‎ (11:53, 15 February 2023)
  128. Manlove; Malley (Stable Marriage Problem Stable Matching Problem)‏‎ (11:53, 15 February 2023)
  129. Gale–Shapley algorithm (Stable Marriage Problem Stable Matching Problem)‏‎ (11:53, 15 February 2023)
  130. Hentenryck et. al. (Arc Consistency? Stable Matching Problem)‏‎ (11:53, 15 February 2023)
  131. FLOATER 2003 (Mesh Parameterization Mesh Parameterization)‏‎ (11:53, 15 February 2023)
  132. KARNI Z.; GOTSMAN C.; GORTLER S. J. 2005 (Mesh Parameterization Mesh Parameterization)‏‎ (11:53, 15 February 2023)
  133. HORMANN K.; GREINER G 1999 (Mesh Parameterization Mesh Parameterization)‏‎ (11:53, 15 February 2023)
  134. SHEFFER A.; LÉVY B.; MOGILNITSKY M.; BOGOMYAKOV A. 2005 (Mesh Parameterization Mesh Parameterization)‏‎ (11:53, 15 February 2023)
  135. SHEFFER A.; DE STURLER E. 2000 (Mesh Parameterization Mesh Parameterization)‏‎ (11:53, 15 February 2023)
  136. DESBRUN M.; MEYER M.; ALLIEZ P. 2002 (Mesh Parameterization Mesh Parameterization)‏‎ (11:53, 15 February 2023)
  137. SANDER P. V.; SNYDER J.; GORTER S. J.; HOPPE 2001 (Mesh Parameterization Mesh Parameterization)‏‎ (11:53, 15 February 2023)
  138. ZAYER R.; LÉVY B.; SEIDEL H.-P. 2007 (Mesh Parameterization Mesh Parameterization)‏‎ (11:53, 15 February 2023)
  139. YAN J. Q.; YANG X.; SHI P. F 2006 (Mesh Parameterization Mesh Parameterization)‏‎ (11:53, 15 February 2023)
  140. YOSHIZAWA S.; BELYAEV A. G.; SEIDEL H.-P 2004 (Mesh Parameterization Mesh Parameterization)‏‎ (11:53, 15 February 2023)
  141. CHEN Z. G.; LIU L. G.; ZHANG Z. Y.; WANG G. J. 2007 (Mesh Parameterization Mesh Parameterization)‏‎ (11:53, 15 February 2023)
  142. Expectation-Maximization (EM) algorithm (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables)‏‎ (11:53, 15 February 2023)
  143. Α-EM Algorithm (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables)‏‎ (11:53, 15 February 2023)
  144. 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)
  145. Expectation conditional maximization (ECM) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables)‏‎ (11:53, 15 February 2023)
  146. LU Matrix Decomposition (Matrix Factorization Collaborative Filtering)‏‎ (11:53, 15 February 2023)
  147. Cholesky Decomposition (Matrix Factorization Collaborative Filtering)‏‎ (11:53, 15 February 2023)
  148. QR Matrix Decomposition (Matrix Factorization Collaborative Filtering)‏‎ (11:53, 15 February 2023)
  149. Particle filter Del Moral (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes))‏‎ (11:53, 15 February 2023)
  150. Kalman Filter (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes))‏‎ (11:53, 15 February 2023)
  151. Kushner non-linear filter (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes))‏‎ (11:53, 15 February 2023)
  152. Zakai (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes))‏‎ (11:53, 15 February 2023)
  153. Ocone (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes))‏‎ (11:53, 15 February 2023)
  154. Del Moral; Pierre (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes))‏‎ (11:53, 15 February 2023)
  155. Bellman Value Iteration (VI) (Optimal Policies for MDPs Optimal Policies for MDPs)‏‎ (11:53, 15 February 2023)
  156. Howard Policy Iteration (PI) (Optimal Policies for MDPs Optimal Policies for MDPs)‏‎ (11:53, 15 February 2023)
  157. Puterman Modified Policy Iteration (MPI) (Optimal Policies for MDPs Optimal Policies for MDPs)‏‎ (11:53, 15 February 2023)
  158. Integer linear program Vazirani (Unweighted Set-Covering; Weighted Set-Covering The Set-Covering Problem)‏‎ (11:53, 15 February 2023)
  159. Lund & Yannakakis ( The Set-Covering Problem)‏‎ (11:53, 15 February 2023)
  160. Feige ( The Set-Covering Problem)‏‎ (11:53, 15 February 2023)
  161. Cardoso; Nuno; Abreu; Rui ( The Set-Covering Problem)‏‎ (11:53, 15 February 2023)
  162. Brute force ( The Set-Covering Problem)‏‎ (11:53, 15 February 2023)
  163. Tompa M ( Motif Search)‏‎ (11:53, 15 February 2023)
  164. Van Helden J; Rios AF; Collado-Vides J ( Motif Search)‏‎ (11:53, 15 February 2023)
  165. Helden Oligo-Analysis ( Motif Search)‏‎ (11:53, 15 February 2023)
  166. Sinha S; Tompa M YMF (Yeast Motif Finder) ( Motif Search)‏‎ (11:53, 15 February 2023)
  167. Liang Cwinnower ( Motif Search)‏‎ (11:53, 15 February 2023)
  168. Sagot M ( Motif Search)‏‎ (11:53, 15 February 2023)
  169. Bailey TL; Elkan C MEME ( Motif Search)‏‎ (11:53, 15 February 2023)
  170. Kingsford ( Motif Search)‏‎ (11:53, 15 February 2023)
  171. Kleinberg (Link Analysis Link Analysis)‏‎ (11:53, 15 February 2023)
  172. The PAGERANK Algorithm (Link Analysis Link Analysis)‏‎ (11:53, 15 February 2023)
  173. The (Hyperlink-Induced Topic Search) HITS Algorithm (Link Analysis Link Analysis)‏‎ (11:53, 15 February 2023)
  174. The (Stochastic Approach for Link Structure Analysis) SALSA Algorithm (Link Analysis Link Analysis)‏‎ (11:53, 15 February 2023)
  175. PHITS Coheng Chan (Link Analysis Link Analysis)‏‎ (11:53, 15 February 2023)
  176. Haveliwala (Link Analysis Link Analysis)‏‎ (11:53, 15 February 2023)
  177. Jeh and Widom (Link Analysis Link Analysis)‏‎ (11:53, 15 February 2023)
  178. Tomlin (Link Analysis Link Analysis)‏‎ (11:53, 15 February 2023)
  179. Richardson and Domingos (Link Analysis Link Analysis)‏‎ (11:53, 15 February 2023)
  180. Chubby (Mike Burrows) (Distributed Locking Algorithms Distributed Locking Algorithms)‏‎ (11:53, 15 February 2023)
  181. Achlioptas (Link Analysis Link Analysis)‏‎ (11:53, 15 February 2023)
  182. Tushar Deepak Chandra and Sam Toueg (Distributed Locking Algorithms Distributed Locking Algorithms)‏‎ (11:53, 15 February 2023)
  183. Leases (Cary G Gray and David R Cheriton) (Distributed Locking Algorithms Distributed Locking Algorithms)‏‎ (11:53, 15 February 2023)
  184. Ray casting algorithm Shimrat; M (Point-in-Polygon Point-in-Polygon)‏‎ (11:53, 15 February 2023)
  185. Nordbeck and Rystedt (Sum of area) (Point-in-Polygon Point-in-Polygon)‏‎ (11:53, 15 February 2023)
  186. Saalfeld (Sign of offset) (Point-in-Polygon Point-in-Polygon)‏‎ (11:53, 15 February 2023)
  187. Preparata and Shamos (Intersection sum of angle) (Point-in-Polygon Point-in-Polygon)‏‎ (11:53, 15 February 2023)
  188. Preparata and Shamos (Wedge) (Point-in-Polygon Point-in-Polygon)‏‎ (11:53, 15 February 2023)
  189. ASP (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems)‏‎ (11:53, 15 February 2023)
  190. Nordbeck and Rystedt (Orientation) (Point-in-Polygon Point-in-Polygon)‏‎ (11:53, 15 February 2023)
  191. Clock-sampling mutual network synchronization (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems)‏‎ (11:53, 15 February 2023)
  192. MATSF (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems)‏‎ (11:53, 15 February 2023)
  193. Output-Sensitive Quantum BMM (Boolean Matrix Multiplication Matrix Product)‏‎ (11:54, 15 February 2023)
  194. Cygan, Gabow, Sankowski (Bounded integer weights Graph Diameter)‏‎ (11:54, 15 February 2023)
  195. O'Neil 1973 (Boolean Matrix Multiplication Matrix Product)‏‎ (11:54, 15 February 2023)
  196. (Boolean Matrix Multiplication (Combinatorial) Matrix Product)‏‎ (11:54, 15 February 2023)
  197. Method of Four Russians (Boolean Matrix Multiplication (Combinatorial) Matrix Product)‏‎ (11:54, 15 February 2023)
  198. Yu (Boolean Matrix Multiplication (Combinatorial) Matrix Product)‏‎ (11:54, 15 February 2023)
  199. Williams ( Online Matrix Vector Multiplication (OMV))‏‎ (11:54, 15 February 2023)
  200. Larsen, Williams (Theorem 1.1) ( Online Matrix Vector Multiplication (OMV))‏‎ (11:54, 15 February 2023)
  201. Larsen, Williams (follows from Theorem 2.1) ( Online Matrix Vector Multiplication (OMV))‏‎ (11:54, 15 February 2023)
  202. Parallel Merge Sort - Cole (2) ( Sorting - Comparison)‏‎ (11:54, 15 February 2023)
  203. Parallel Merge Sort - Cole (1) ( Sorting - Comparison)‏‎ (11:54, 15 February 2023)
  204. ( Negative Triangle)‏‎ (11:54, 15 February 2023)
  205. MKM Algorithm ( Maximum Flow)‏‎ (11:54, 15 February 2023)
  206. Gabow ( Maximum Flow)‏‎ (11:54, 15 February 2023)
  207. Galil ( Maximum Flow)‏‎ (11:54, 15 February 2023)
  208. Shiloach ( Maximum Flow)‏‎ (11:54, 15 February 2023)
  209. Madry ( Maximum Flow)‏‎ (11:54, 15 February 2023)
  210. Lee, Sidford ( Maximum Flow)‏‎ (11:54, 15 February 2023)
  211. Brand et al ( Maximum Flow)‏‎ (11:54, 15 February 2023)
  212. Chen et al ( Maximum Flow)‏‎ (11:54, 15 February 2023)
  213. Gao, Liu, Peng ( Maximum Flow)‏‎ (11:54, 15 February 2023)
  214. Alman, Vassilevska Williams ( Matrix Multiplication)‏‎ (11:54, 15 February 2023)
  215. Method of Four Russians ( Matrix Multiplication)‏‎ (11:54, 15 February 2023)
  216. Byskov ( 5 - Graph Coloring)‏‎ (11:54, 15 February 2023)
  217. Bjorklund, Husfeldt, Theorem 1 ( 5 - Graph Coloring)‏‎ (11:54, 15 February 2023)
  218. Bjorklund, Husfeldt, Proposition 2 ( 5 - Graph Coloring)‏‎ (11:54, 15 February 2023)
  219. Zamir ( 5 - Graph Coloring)‏‎ (11:54, 15 February 2023)
  220. Bjorklund, Husfeldt, Theorem 1 ( 6 - Graph Coloring)‏‎ (11:54, 15 February 2023)
  221. Byskov, Theorem 20 ( 6 - Graph Coloring)‏‎ (11:54, 15 February 2023)
  222. Byskov, Theorem 14 ( 6 - Graph Coloring)‏‎ (11:54, 15 February 2023)
  223. Zamir ( 6 - Graph Coloring)‏‎ (11:54, 15 February 2023)
  224. Christofides ( Chromatic Number)‏‎ (11:54, 15 February 2023)
  225. Bjorklund, Husfeldt, Proposition 2 ( 6 - Graph Coloring)‏‎ (11:54, 15 February 2023)
  226. Byskov ( Chromatic Number)‏‎ (11:54, 15 February 2023)
  227. Lawler ( Chromatic Number)‏‎ (11:54, 15 February 2023)
  228. Eppstein ( Chromatic Number)‏‎ (11:54, 15 February 2023)
  229. Bjorklund, Husfeldt, Theorem 1 ( Chromatic Number)‏‎ (11:54, 15 February 2023)
  230. Bjorklund, Husfeldt, Proposition 2 ( Chromatic Number)‏‎ (11:54, 15 February 2023)
  231. BFS/DFS for connected components (‏‎ (11:54, 15 February 2023)
  232. Koivisto ( Chromatic Number)‏‎ (11:54, 15 February 2023)
  233. Angelsmark, Jonsson (‏‎ (11:54, 15 February 2023)
  234. Zykov (deletion-contraction) ( Chromatic Polynomial)‏‎ (11:54, 15 February 2023)
  235. Fürer, Kasiviswanathan (‏‎ (11:54, 15 February 2023)
  236. Bjorklund, Husfeldt, Proposition 3 ( Chromatic Polynomial)‏‎ (11:54, 15 February 2023)
  237. LU decomposition (General Linear system of equations)‏‎ (11:54, 15 February 2023)
  238. Koivisto ( Chromatic Polynomial)‏‎ (11:54, 15 February 2023)
  239. Matrix inverse (General Linear system of equations)‏‎ (11:54, 15 February 2023)
  240. Peng, Vempala (Sparse Linear system of equations)‏‎ (11:54, 15 February 2023)
  241. Asymptotically fast Toeplitz algorithms (Toeplitz Linear system of equations)‏‎ (11:54, 15 February 2023)
  242. CHAZELLE 1986 (Counting number of intersection points / line segments Line segment intersection)‏‎ (11:54, 15 February 2023)
  243. 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)
  244. NIEVERGELT. J.. AND PREPARATA (Section 2) (Reporting all intersection points / general polygons Line segment intersection)‏‎ (11:54, 15 February 2023)
  245. Jiang, Song, Weinstein and Zhang ( Linear Programming)‏‎ (11:54, 15 February 2023)
  246. Seidel's Shelling Algorithm (d-dimensional Convex Hull Convex Hull)‏‎ (11:54, 15 February 2023)
  247. Chand-Kapur, Gift Wrapping (d-dimensional Convex Hull Convex Hull)‏‎ (11:54, 15 February 2023)
  248. N-dimensional Quickhull (d-dimensional Convex Hull Convex Hull)‏‎ (11:54, 15 February 2023)
  249. Online 2-d Convex Hull, Preparata (2-dimensional Convex Hull, Online Convex Hull)‏‎ (11:54, 15 February 2023)
  250. Dynamic 2-d Convex Hull, Overmars and van Leeuwen (2-dimensional Convex Hull, Dynamic Convex Hull)‏‎ (11:54, 15 February 2023)
  251. (many more...) (2-dimensional Convex Hull, Dynamic Convex Hull)‏‎ (11:54, 15 February 2023)
  252. Multistep (SCCs Strongly Connected Components)‏‎ (11:54, 15 February 2023)
  253. Geldenhuys-Valmari (SCCs Strongly Connected Components)‏‎ (11:54, 15 February 2023)
  254. Prim's algorithm + binary heap (Undirected, General MST Minimum Spanning Tree (MST))‏‎ (11:54, 15 February 2023)
  255. Cheriton-Tarjan (dense) (Undirected, Dense MST Minimum Spanning Tree (MST))‏‎ (11:54, 15 February 2023)
  256. Fredman & Tarjan (Undirected, General MST Minimum Spanning Tree (MST))‏‎ (11:54, 15 February 2023)
  257. Fredman & Willard (Undirected, Integer Weights MST Minimum Spanning Tree (MST))‏‎ (11:54, 15 February 2023)
  258. Gabow et al, Section 2 (Undirected, General MST Minimum Spanning Tree (MST))‏‎ (11:54, 15 February 2023)
  259. Pettie, Ramachandran (Undirected, General MST Minimum Spanning Tree (MST))‏‎ (11:54, 15 February 2023)
  260. Cheriton-Tarjan (planar) (Undirected, Planar MST Minimum Spanning Tree (MST))‏‎ (11:54, 15 February 2023)
  261. Gabow, Galil, Spencer (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST))‏‎ (11:54, 15 February 2023)
  262. Chu-Liu-Edmonds Algorithm (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST))‏‎ (11:54, 15 February 2023)
  263. Tarjan (directed, general) (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST))‏‎ (11:54, 15 February 2023)
  264. Tarjan (directed, dense) (Directed (Optimum Branchings), Super Dense MST Minimum Spanning Tree (MST))‏‎ (11:54, 15 February 2023)
  265. Gabow et al, Section 3 (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST))‏‎ (11:54, 15 February 2023)
  266. Dial's Algorithm (nonnegative integer weights Shortest Path (Directed graphs))‏‎ (11:54, 15 February 2023)
  267. Khuller, Matias (k-dimensional space, Euclidean metric Closest Pair Problem)‏‎ (11:54, 15 February 2023)
  268. Thorup (positive integer weights; assumes constant-time multiplication Shortest Path (Undirected graphs))‏‎ (11:54, 15 February 2023)
  269. Brandes (Unweighted Betweenness Centrality (BC))‏‎ (11:54, 15 February 2023)
  270. Brandes (Weighted Betweenness Centrality (BC))‏‎ (11:54, 15 February 2023)
  271. Reduction from Triangles Cover Triangle to Visible Triangle‏‎ (11:55, 15 February 2023)
  272. Reduction from Triangles Cover Triangle to 3D Motion Planning‏‎ (11:55, 15 February 2023)
  273. Reduction from GeomBase to Visibility From Infinity‏‎ (11:55, 15 February 2023)
  274. Reduction from Visible Triangle to Triangles Cover Triangle‏‎ (11:55, 15 February 2023)
  275. Reduction from GeomBase to Planar Motion Planning‏‎ (11:55, 15 February 2023)
  276. Reduction from CNF-SAT to Local Alignment‏‎ (11:55, 15 February 2023)
  277. Reduction from 3SUM to Local Alignment‏‎ (11:55, 15 February 2023)
  278. Reduction from 3SUM' to Static Dihedral Rotation Queries‏‎ (11:55, 15 February 2023)
  279. Reduction from Directed, Weighted APSP to Negative Triangle Detection‏‎ (11:55, 15 February 2023)
  280. Reduction from CNF-SAT to Longest Common Substring with don't cares‏‎ (11:55, 15 February 2023)
  281. Reduction from CNF-SAT to Multiple Local Alignment‏‎ (11:55, 15 February 2023)
  282. Reduction from CFG Parsing to BMM‏‎ (11:55, 15 February 2023)
  283. Reduction from Negative Triangle Search to Negative Triangle Detection‏‎ (11:55, 15 February 2023)
  284. Reduction from BMM to CFG Parsing‏‎ (11:55, 15 February 2023)
  285. Reduction from Negative Triangle Detection to Matrix Product Verification‏‎ (11:55, 15 February 2023)
  286. Reduction from Negative Triangle Listing to Negative Triangle Detection‏‎ (11:55, 15 February 2023)
  287. Reduction from Maximum Subarray to Distance Product‏‎ (11:55, 15 February 2023)
  288. Reduction from Minimum Witness Finding to Negative Triangle Detection‏‎ (11:55, 15 February 2023)
  289. Reduction from All Pairs Minimum Witness (APMW) to Negative Triangle Detection‏‎ (11:55, 15 February 2023)
  290. Reduction from Undirected, Weighted APSP to Directed, Weighted APSP‏‎ (11:55, 15 February 2023)
  291. Reduction from Directed, Weighted APSP to Undirected, Weighted APSP‏‎ (11:55, 15 February 2023)
  292. Reduction from Metricity to Negative Triangle Detection‏‎ (11:55, 15 February 2023)
  293. Reduction from Negative Triangle Detection to Maximum Subarray‏‎ (11:55, 15 February 2023)
  294. Reduction from Negative Triangle Detection to Metricity‏‎ (11:55, 15 February 2023)
  295. Reduction from Negative Triangle Detection to Shortest Cycle‏‎ (11:55, 15 February 2023)
  296. Reduction from Maximum Subarray to Negative Triangle Detection‏‎ (11:55, 15 February 2023)
  297. Reduction from Directed, Weighted APSP to Replacement Paths Problem (RPP)‏‎ (11:55, 15 February 2023)
  298. Reduction from Directed, Weighted APSP to Second Shortest Simple Path‏‎ (11:55, 15 February 2023)
  299. Reduction from Distance Product to Second Shortest Simple Path‏‎ (11:55, 15 February 2023)
  300. Reduction from Triangle Detection to Independent Set Queries‏‎ (11:55, 15 February 2023)
  301. Reduction from Minimum Triangle to Second Shortest Simple Path‏‎ (11:55, 15 February 2023)
  302. Reduction from BMM to Independent Set Queries‏‎ (11:55, 15 February 2023)
  303. Reduction from Directed Radius to Directed, Weighted APSP‏‎ (11:55, 15 February 2023)
  304. Reduction from $(\min, \leq)$ Product to Triangle in Unweighted Graph‏‎ (11:55, 15 February 2023)
  305. Reduction from Nondecreasing Triangle to Triangle in Unweighted Graph‏‎ (11:55, 15 February 2023)
  306. Reduction from All-Integers 3SUM to 3SUM‏‎ (11:55, 15 February 2023)
  307. Reduction from 3SUM to All-Integers 3SUM‏‎ (11:55, 15 February 2023)
  308. Reduction from Negative Triangle to Price Query‏‎ (11:55, 15 February 2023)
  309. Reduction from Undirected Radius to Undirected, Weighted APSP‏‎ (11:55, 15 February 2023)
  310. Reduction from Betweenness Centrality (BC) to Directed, Weighted APSP‏‎ (11:55, 15 February 2023)
  311. Reduction from Betweenness Centrality (BC) to Undirected, Weighted APSP‏‎ (11:55, 15 February 2023)
  312. Reduction from Directed Median to Directed, Weighted APSP‏‎ (11:55, 15 February 2023)
  313. Reduction from Undirected Median to Undirected, Weighted APSP‏‎ (11:55, 15 February 2023)
  314. Reduction from Negative Triangle Detection to Median‏‎ (11:55, 15 February 2023)
  315. Reduction from Negative Triangle Detection to Radius‏‎ (11:55, 15 February 2023)
  316. Reduction from Negative Triangle Detection to Betweenness Centrality (BC)‏‎ (11:55, 15 February 2023)
  317. Reduction from CNF-SAT to Approximate Diameter‏‎ (11:55, 15 February 2023)
  318. Reduction from Negative Triangle Detection to All-Nodes Median Parity‏‎ (11:55, 15 February 2023)
  319. Reduction from Directed, Weighted APSP to All-Nodes Median Parity‏‎ (11:55, 15 February 2023)
  320. Reduction from Undirected, Weighted APSP to All-Nodes Median Parity‏‎ (11:55, 15 February 2023)
  321. Reduction from Diameter to Positive Betweenness Centrality‏‎ (11:55, 15 February 2023)
  322. Reduction from Diameter to Reach Centrality‏‎ (11:55, 15 February 2023)
  323. Reduction from Positive Betweenness Centrality to Diameter‏‎ (11:55, 15 February 2023)
  324. Reduction from Undirected, Weighted APSP to Undirected All-Nodes Positive Betweenness Centrality‏‎ (11:55, 15 February 2023)
  325. Reduction from Directed, Weighted APSP to Directed All-Nodes Positive Betweenness Centrality‏‎ (11:55, 15 February 2023)
  326. Reduction from Directed, Weighted APSP to Directed All-Nodes Reach Centrality‏‎ (11:55, 15 February 2023)
  327. Reduction from Undirected, Weighted APSP to Undirected All-Nodes Reach Centrality‏‎ (11:55, 15 February 2023)
  328. Reduction from Reach Centrality to Positive Betweenness Centrality‏‎ (11:55, 15 February 2023)
  329. Reduction from Negative Triangle Detection to All-Nodes Positive Betweenness Centrality‏‎ (11:55, 15 February 2023)
  330. Reduction from Diameter to Approximate Betweenness Centrality‏‎ (11:55, 15 February 2023)
  331. Reduction from Approximate Betweenness Centrality to Diameter‏‎ (11:55, 15 February 2023)
  332. Reduction from Betweenness Centrality (BC) to Diameter‏‎ (11:55, 15 February 2023)
  333. Reduction from CNF-SAT to Approximate Betweenness Centrality‏‎ (11:55, 15 February 2023)
  334. Reduction from CNF-SAT to Positive Betweenness Centrality‏‎ (11:55, 15 February 2023)
  335. Reduction from Min-Weight k-Clique to Minimum Weight k-Cycle‏‎ (11:55, 15 February 2023)
  336. Reduction from CNF-SAT to SC2‏‎ (11:55, 15 February 2023)
  337. Reduction from Min-Weight k-Cycle to Undirected Wiener Index‏‎ (11:55, 15 February 2023)
  338. Reduction from CNF-SAT to Dynamic Connected Subgraph‏‎ (11:55, 15 February 2023)
  339. Reduction from CNF-SAT to‏‎ (11:55, 15 February 2023)
  340. Reduction from CNF-SAT to Dynamic MaxSCC‏‎ (11:55, 15 February 2023)
  341. Reduction from CNF-SAT to Dynamic ST-Reach‏‎ (11:55, 15 February 2023)
  342. Reduction from CNF-SAT to Dynamic 4/3-Diameter‏‎ (11:55, 15 February 2023)
  343. Reduction from Triangle Detection to Dynamic Bipartite Maximum-Weight Matching‏‎ (11:55, 15 February 2023)
  344. Reduction from Triangle Detection to Dynamic st-Reach‏‎ (11:55, 15 February 2023)
  345. Reduction from Triangle Detection to Strong Connectivity (dynamic)‏‎ (11:55, 15 February 2023)
  346. Reduction from Directed, Weighted APSP to Dynamic Bipartite Maximum-Weight Matching‏‎ (11:55, 15 February 2023)
  347. Reduction from Directed, Weighted APSP to Dynamic $st$-Shortest Path‏‎ (11:55, 15 February 2023)
  348. Reduction from MAX-CNF-SAT to Maximum Local Edge Connectivity‏‎ (11:55, 15 February 2023)
  349. Main Page‏‎ (11:57, 15 February 2023)
  350. Nakatsu et al. (LCS Longest Common Subsequence)‏‎ (12:14, 15 February 2023)
  351. Wu et al. (LCS Longest Common Subsequence)‏‎ (12:14, 15 February 2023)
  352. Robson (3-Graph Coloring Graph Coloring)‏‎ (12:14, 15 February 2023)
  353. Miller and Myers (LCS Longest Common Subsequence)‏‎ (12:14, 15 February 2023)
  354. Ahuja et al. ( Maximum Flow)‏‎ (12:14, 15 February 2023)
  355. Schöning (3-Graph Coloring Graph Coloring)‏‎ (12:14, 15 February 2023)
  356. Johnson (3-Graph Coloring Graph Coloring)‏‎ (12:14, 15 February 2023)
  357. Hirsch (3-Graph Coloring Graph Coloring)‏‎ (12:14, 15 February 2023)
  358. Special number field sieve (First Category Integer Factoring Integer Factoring)‏‎ (12:14, 15 February 2023)
  359. Alon and Kahale (3-Graph Coloring Graph Coloring)‏‎ (12:14, 15 February 2023)
  360. General number field sieve (Second Category Integer Factoring Integer Factoring)‏‎ (12:14, 15 February 2023)
  361. Two-way String-Matching Algorithm (Single String Search String Search)‏‎ (12:14, 15 February 2023)
  362. Shor's algorithm Quantum Implementation (Second Category Integer Factoring Integer Factoring)‏‎ (12:14, 15 February 2023)
  363. Quick-Skip Searching (Single String Search String Search)‏‎ (12:14, 15 February 2023)
  364. String-Matching with Finite Automata (Single String Search String Search)‏‎ (12:14, 15 February 2023)
  365. Fast Hybrid Algorithm (Single String Search String Search)‏‎ (12:14, 15 February 2023)
  366. Backward Non-Deterministic DAWG Matching (BNDM) (Single String Search String Search)‏‎ (12:14, 15 February 2023)
  367. Aho–Corasick (AC) Algorithm (Multiple String Search String Search)‏‎ (12:14, 15 February 2023)
  368. Commentz-Walter Algorithm (Multiple String Search String Search)‏‎ (12:14, 15 February 2023)
  369. Raita Algorithm (Single String Search String Search)‏‎ (12:14, 15 February 2023)
  370. Boyer-Moore-Horspool (BMH) (Single String Search String Search)‏‎ (12:14, 15 February 2023)
  371. BOM (Backward Oracle Matching) (Single String Search String Search)‏‎ (12:14, 15 February 2023)
  372. Gapped BLAST (Edit Sequence, constant-size alphabet Sequence Alignment)‏‎ (12:14, 15 February 2023)
  373. Basic Local Alignment Search Tool (BLAST) (Edit Sequence, constant-size alphabet Sequence Alignment)‏‎ (12:14, 15 February 2023)
  374. Apostolico–Giancarlo Algorithm (Single String Search String Search)‏‎ (12:14, 15 February 2023)
  375. Madry's algorithm (Bipartite Graph MCM Maximum Cardinality Matching)‏‎ (12:14, 15 February 2023)
  376. Mucha, Sankowski (general) (General Graph MCM Maximum Cardinality Matching)‏‎ (12:14, 15 February 2023)
  377. Klein (section 5) (Planar Bipartite Graph Perfect Matching Maximum Cardinality Matching)‏‎ (12:14, 15 February 2023)
  378. Diffie–Hellman key exchange (Key Exchange Key Exchange)‏‎ (12:14, 15 February 2023)
  379. Dekker's algorithm (2-thread Mutual Exclusion Mutual Exclusion)‏‎ (12:14, 15 February 2023)
  380. Elliptic-curve Diffie-Hellman (ECDH) (Key Exchange Key Exchange)‏‎ (12:14, 15 February 2023)
  381. Vaidya (Inexact Laplacian Solver SDD Systems Solvers)‏‎ (12:15, 15 February 2023)
  382. Peterson's algorithm ( Mutual Exclusion)‏‎ (12:15, 15 February 2023)
  383. Boman; Hendrickson (Inexact Laplacian Solver SDD Systems Solvers)‏‎ (12:15, 15 February 2023)
  384. Lee; Peng; Spielman (Inexact Laplacian Solver SDD Systems Solvers)‏‎ (12:15, 15 February 2023)
  385. Naive Implementation (Exact Laplacian Solver SDD Systems Solvers)‏‎ (12:15, 15 February 2023)
  386. Brent's algorithm ( Cycle Detection)‏‎ (12:15, 15 February 2023)
  387. Floyd's tortoise and hare algorithm ( Cycle Detection)‏‎ (12:15, 15 February 2023)
  388. Fisher–Yates/Knuth shuffle (General Permutations Generating Random Permutations)‏‎ (12:15, 15 February 2023)
  389. Durstenfeld's Algorithm 235 (General Permutations Generating Random Permutations)‏‎ (12:15, 15 February 2023)
  390. Gosper's algorithm ( Cycle Detection)‏‎ (12:15, 15 February 2023)
  391. Sattolo's algorithm (Cyclic Permutations Generating Random Permutations)‏‎ (12:15, 15 February 2023)
  392. Gomory's cutting method (ILP;MILPs Convex Optimization (Non-linear))‏‎ (12:15, 15 February 2023)
  393. Wolfe; Lemaréchal; Kiwiel (General, Constrained optimization Convex Optimization (Non-linear))‏‎ (12:15, 15 February 2023)
  394. Subgradient method (General, Constrained optimization Convex Optimization (Non-linear))‏‎ (12:15, 15 February 2023)
  395. Buchberger's algorithm (Gröbner Bases Gröbner Bases)‏‎ (12:15, 15 February 2023)
  396. Dual subgradients and the drift-plus-penalty method (Stochastic optimization Convex Optimization (Non-linear))‏‎ (12:15, 15 February 2023)
  397. Hu–Tucker algorithm (Alphabetic Tree Problem Optimal Binary Search Trees)‏‎ (12:15, 15 February 2023)
  398. Knuth's DP algorithm (OBST Optimal Binary Search Trees)‏‎ (12:15, 15 February 2023)
  399. Garsia–Wachs algorithm (Alphabetic Tree Problem Optimal Binary Search Trees)‏‎ (12:15, 15 February 2023)
  400. Modified Knuth's DP algorithm (OBST Optimal Binary Search Trees)‏‎ (12:15, 15 February 2023)
  401. Naive algorithm (OBST Optimal Binary Search Trees)‏‎ (12:15, 15 February 2023)
  402. Levcopoulos; Lingas; Sack (Approximate OBST Optimal Binary Search Trees)‏‎ (12:15, 15 February 2023)
  403. Yao (OBST Optimal Binary Search Trees)‏‎ (12:15, 15 February 2023)
  404. De Prisco (Approximate OBST Optimal Binary Search Trees)‏‎ (12:15, 15 February 2023)
  405. Lemke–Howson algorithm (2-player Nash Equilibria)‏‎ (12:15, 15 February 2023)
  406. Hungarian algorithm (Bipartite Maximum-Weight Matching Maximum-Weight Matching)‏‎ (12:15, 15 February 2023)
  407. Lipton; Mehta (2-player Nash Equilibria)‏‎ (12:15, 15 February 2023)
  408. Mucha and Sankowski ( Maximum-Weight Matching)‏‎ (12:15, 15 February 2023)
  409. Edmonds (Maximum-Weight Matching Maximum-Weight Matching)‏‎ (12:15, 15 February 2023)
  410. Fleury's algorithm + Tarjan (Constructing Eulerian Trails in a Graph Constructing Eulerian Trails in a Graph)‏‎ (12:15, 15 February 2023)
  411. Hierholzer's algorithm (Constructing Eulerian Trails in a Graph Constructing Eulerian Trails in a Graph)‏‎ (12:15, 15 February 2023)
  412. Naive algorithm (Discrete Fourier Transform Discrete Fourier Transform)‏‎ (12:15, 15 February 2023)
  413. Radix sorting method (General Permutations Generating Random Permutations)‏‎ (12:15, 15 February 2023)
  414. Gao’s additive FFT (Discrete Fourier Transform Discrete Fourier Transform)‏‎ (12:15, 15 February 2023)
  415. Inverse iteration (Eigenpair closest to mu; Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods))‏‎ (12:15, 15 February 2023)
  416. LOBPCG algorithm (Eigenpair closest to mu; Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods))‏‎ (12:15, 15 February 2023)
  417. Rayleigh quotient iteration (Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods))‏‎ (12:15, 15 February 2023)
  418. Bisection method (Any eigenvalue Eigenvalues (Iterative Methods))‏‎ (12:15, 15 February 2023)
  419. Jacobi eigenvalue algorithm (All eigenvalues; Any eigenvalue Eigenvalues (Iterative Methods))‏‎ (12:15, 15 February 2023)
  420. QR algorithm (All eigenvalues; Any eigenvalue Eigenvalues (Iterative Methods))‏‎ (12:15, 15 February 2023)
  421. Laguerre iteration (Any eigenvalue Eigenvalues (Iterative Methods))‏‎ (12:15, 15 February 2023)
  422. Homotopy method (All eigenpairs; Eigenpair closest to mu; Any eigenpair; Any eigenvalue; All eigenvalues Eigenvalues (Iterative Methods))‏‎ (12:15, 15 February 2023)
  423. Folded spectrum method (Eigenpair closest to mu; Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods))‏‎ (12:15, 15 February 2023)
  424. MRRR algorithm (Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods))‏‎ (12:15, 15 February 2023)
  425. False position method (General Root Computation Root Computation)‏‎ (12:15, 15 February 2023)
  426. Bisection method (General Root Computation Root Computation)‏‎ (12:15, 15 February 2023)
  427. Newton's method (Root Computation with continuous first derivative Root Computation)‏‎ (12:15, 15 February 2023)
  428. Halley's method (Root Computation with continuous second derivative Root Computation)‏‎ (12:15, 15 February 2023)
  429. Ridder's method (General Root Computation Root Computation)‏‎ (12:15, 15 February 2023)
  430. Secant method (General Root Computation Root Computation)‏‎ (12:15, 15 February 2023)
  431. Muller's method (General Root Computation Root Computation)‏‎ (12:15, 15 February 2023)
  432. Todd–Coxeter algorithm (Bounded Subgroup Index Coset Enumeration)‏‎ (12:15, 15 February 2023)
  433. Knuth–Bendix algorithm (General Groups (uncompleted?) Coset Enumeration)‏‎ (12:15, 15 February 2023)
  434. Haselgrove; Leech and Trotter (Bounded Subgroup Index Coset Enumeration)‏‎ (12:15, 15 February 2023)
  435. Expectation–maximization (EM) algorithm ( Maximum Likelihood Parameters)‏‎ (12:15, 15 February 2023)
  436. Newton–Raphson algorithm ( Maximum Likelihood Parameters)‏‎ (12:15, 15 February 2023)
  437. Parameter-expanded expectation maximization (PX-EM) algorithm ( Maximum Likelihood Parameters)‏‎ (12:15, 15 February 2023)
  438. Naive solution ( Cardinality Estimation)‏‎ (12:15, 15 February 2023)
  439. Α-EM algorithm ( Maximum Likelihood Parameters)‏‎ (12:15, 15 February 2023)
  440. HyperLogLog++ ( Cardinality Estimation)‏‎ (12:15, 15 February 2023)
  441. HyperLogLog algorithm ( Cardinality Estimation)‏‎ (12:15, 15 February 2023)
  442. LogLog algorithm ( Cardinality Estimation)‏‎ (12:15, 15 February 2023)
  443. Flajolet–Martin algorithm ( Cardinality Estimation)‏‎ (12:15, 15 February 2023)
  444. Min/max sketches streaming algorithm (streaming Cardinality Estimation)‏‎ (12:15, 15 February 2023)
  445. Cooper and Dasgupta algorithm ( Register Allocation)‏‎ (12:15, 15 February 2023)
  446. Chow's Algorithm (Global Register Allocation Register Allocation)‏‎ (12:15, 15 February 2023)
  447. Linear Scan, Poletto & Sarkar (Global Register Allocation Register Allocation)‏‎ (12:15, 15 February 2023)
  448. Bottom-m sketches streaming algorithm (streaming Cardinality Estimation)‏‎ (12:15, 15 February 2023)
  449. Chaitin's Algorithm (Global Register Allocation Register Allocation)‏‎ (12:15, 15 February 2023)
  450. Kong and Wilken Algorithm (Global Register Allocation Register Allocation)‏‎ (12:15, 15 February 2023)
  451. Hopcroft's algorithm (DFA Minimization DFA Minimization)‏‎ (12:15, 15 February 2023)
  452. Moore's algorithm (DFA Minimization DFA Minimization)‏‎ (12:15, 15 February 2023)
  453. Almeida & Zeitoun (Cyclic Nontrivial SCCs DFA Minimization DFA Minimization)‏‎ (12:15, 15 February 2023)
  454. Revuz's algorithm (Acyclic DFA Minimization DFA Minimization)‏‎ (12:15, 15 February 2023)
  455. Brzozowski's algorithm (DFA Minimization DFA Minimization)‏‎ (12:15, 15 February 2023)
  456. Berkman; Vishkin (Lowest Common Ancestor with Static Trees Lowest Common Ancestor)‏‎ (12:15, 15 February 2023)
  457. Stephen Alstrup, Cyril Gavoille, Haim Kaplan & Theis Rauhe (Lowest Common Ancestor with Static Trees Lowest Common Ancestor)‏‎ (12:15, 15 February 2023)
  458. X Chen (Exact GED Graph Edit Distance Computation)‏‎ (12:15, 15 February 2023)
  459. L Chang (Inexact GED Graph Edit Distance Computation)‏‎ (12:15, 15 February 2023)
  460. Y Bai (Inexact GED Graph Edit Distance Computation)‏‎ (12:15, 15 February 2023)
  461. Tao D; Tang X; Li X et al ( Graph Edit Distance Computation)‏‎ (12:15, 15 February 2023)
  462. Alberto Sanfeliu and King-Sun Fu ( Graph Edit Distance Computation)‏‎ (12:15, 15 February 2023)
  463. K Riesen (Inexact GED Graph Edit Distance Computation)‏‎ (12:15, 15 February 2023)
  464. Neuhaus, Riesen, Bunke (Inexact GED Graph Edit Distance Computation)‏‎ (12:15, 15 February 2023)
  465. Finch (Inexact GED Graph Edit Distance Computation)‏‎ (12:15, 15 February 2023)
  466. Segundo; Artieda; Strash Parallel (Enumerating Maximal Cliques, arbitrary graph Clique Problems)‏‎ (12:15, 15 February 2023)
  467. Held–Karp algorithm (Minimum TSP The Traveling-Salesman Problem)‏‎ (12:15, 15 February 2023)
  468. Lawler; E. L. (Minimum TSP The Traveling-Salesman Problem)‏‎ (12:15, 15 February 2023)
  469. Christofides algorithm (Approximate TSP The Traveling-Salesman Problem)‏‎ (12:15, 15 February 2023)
  470. 5-point star Cramer's rule (2-Dimensional Poisson Problem Poisson Problem)‏‎ (12:15, 15 February 2023)
  471. 5-point Gauss elimination (2-Dimensional Poisson Problem Poisson Problem)‏‎ (12:15, 15 February 2023)
  472. 9-point Tensor product (2-Dimensional Poisson Problem Poisson Problem)‏‎ (12:15, 15 February 2023)
  473. 9-point SOR iteration (2-Dimensional Poisson Problem Poisson Problem)‏‎ (12:15, 15 February 2023)
  474. Gaussian Elimination (Exact Laplacian Solver SDD Systems Solvers)‏‎ (12:16, 15 February 2023)
  475. Patrick Posser (Stable Roommates Problem Stable Matching Problem)‏‎ (12:16, 15 February 2023)
  476. 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)
  477. Unsworth; C.; Prosser; P (Stable Marriage Problem Stable Matching Problem)‏‎ (12:16, 15 February 2023)
  478. S. S. TSENG and R. C. T. LEE (Stable Marriage Problem Stable Matching Problem)‏‎ (12:16, 15 February 2023)
  479. Naive (Constructing Suffix Trees Constructing Suffix Trees)‏‎ (12:16, 15 February 2023)
  480. Weiner's algorithm (Constructing Suffix Trees Constructing Suffix Trees)‏‎ (12:16, 15 February 2023)
  481. Ukkonen (Constructing Suffix Trees Constructing Suffix Trees)‏‎ (12:16, 15 February 2023)
  482. Ukkonen and D. Wood (Constructing Suffix Trees Constructing Suffix Trees)‏‎ (12:16, 15 February 2023)
  483. Pratt (Constructing Suffix Trees Constructing Suffix Trees)‏‎ (12:16, 15 February 2023)
  484. Süleyman Cenk Sahinalp ; Uzi Vishkin (Constructing Suffix Trees Constructing Suffix Trees)‏‎ (12:16, 15 February 2023)
  485. Hariharan (Constructing Suffix Trees Constructing Suffix Trees)‏‎ (12:16, 15 February 2023)
  486. McCreight (Constructing Suffix Trees Constructing Suffix Trees)‏‎ (12:16, 15 February 2023)
  487. EM Based Winkler (Entity Resolution Entity Resolution)‏‎ (12:16, 15 February 2023)
  488. Ananthakrishna (Entity Resolution Entity Resolution)‏‎ (12:16, 15 February 2023)
  489. Ravikumar & Cohen Generative Models (Entity Resolution Entity Resolution)‏‎ (12:16, 15 February 2023)
  490. Record linking (Entity Resolution Entity Resolution)‏‎ (12:16, 15 February 2023)
  491. Dynamic Programming (Longest Palindromic Substring Longest Palindromic Substring)‏‎ (12:16, 15 February 2023)
  492. Demand-Driven Register Allocation (Global Register Allocation Register Allocation)‏‎ (12:16, 15 February 2023)
  493. Sethi–Ullman Algorithm (Arithmetic Expression Binary Tree AST to Code Translation)‏‎ (12:16, 15 February 2023)
  494. Babai and Luks (Graph Isomorphism, General Graphs Graph Isomorphism Problem)‏‎ (12:16, 15 February 2023)
  495. McKay ( Graph Isomorphism Problem)‏‎ (12:16, 15 February 2023)
  496. Spielman (Isomorphism of strongly regular graphs Graph Isomorphism Problem)‏‎ (12:16, 15 February 2023)
  497. Babai ( Graph Isomorphism Problem)‏‎ (12:16, 15 February 2023)
  498. Schmidt & Druffel ( Graph Isomorphism Problem)‏‎ (12:16, 15 February 2023)
  499. Ullman (Subgraph Isomorphism Graph Isomorphism Problem)‏‎ (12:16, 15 February 2023)
  500. Babai & Codenotti (Hypergraphs isomorphism Graph Isomorphism Problem)‏‎ (12:16, 15 February 2023)

View (previous 500 | next 500) (20 | 50 | 100 | 250 | 500)

Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Special:AncientPages"