Short pages

Jump to navigation Jump to search

Showing below up to 500 results in range #1 to #500.

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

  1. (hist) ‎Chromatic Polynomial ‎[31 bytes]
  2. (hist) ‎Reduction from OV to k-OV ‎[135 bytes]
  3. (hist) ‎Reduction from 3-OV to k-OV ‎[141 bytes]
  4. (hist) ‎Family:Page Replacements ‎[170 bytes]
  5. (hist) ‎Family:Nash Equilibria ‎[171 bytes]
  6. (hist) ‎Reduction from 3SUM to All-Integers 3SUM ‎[177 bytes]
  7. (hist) ‎Family:CFG Problems ‎[178 bytes]
  8. (hist) ‎Family:Recovery ‎[178 bytes]
  9. (hist) ‎Family:Graph Cycles ‎[182 bytes]
  10. (hist) ‎Family:Link Analysis ‎[183 bytes]
  11. (hist) ‎About Algorithm-Wiki ‎[187 bytes]
  12. (hist) ‎Family:Feature Detection ‎[187 bytes]
  13. (hist) ‎Family:Geometric Separator Problems ‎[188 bytes]
  14. (hist) ‎Family:Integer Factoring ‎[189 bytes]
  15. (hist) ‎Family:Graph Edit Distance Computation ‎[191 bytes]
  16. (hist) ‎Family:BCNF Decomposition ‎[191 bytes]
  17. (hist) ‎Family:Data Compression ‎[193 bytes]
  18. (hist) ‎Family:3SUM ‎[193 bytes]
  19. (hist) ‎Family:Integral Equations ‎[194 bytes]
  20. (hist) ‎Family:Local Alignment ‎[194 bytes]
  21. (hist) ‎Family:String Search ‎[195 bytes]
  22. (hist) ‎Family:Orthogonal Vectors ‎[195 bytes]
  23. (hist) ‎Family:Geometric Incidence Problems ‎[200 bytes]
  24. (hist) ‎Family:Sorting ‎[201 bytes]
  25. (hist) ‎Family:Deadlock Avoidance ‎[203 bytes]
  26. (hist) ‎Family:Minimum Witness ‎[203 bytes]
  27. (hist) ‎Family:One-Way Hash Functions ‎[204 bytes]
  28. (hist) ‎Family:Motion Planning Problems ‎[204 bytes]
  29. (hist) ‎Family:SDD Systems Solvers ‎[205 bytes]
  30. (hist) ‎Family:Wiener Index ‎[207 bytes]
  31. (hist) ‎Family:The Set-Covering Problem ‎[208 bytes]
  32. (hist) ‎Family:Generating Random Permutations ‎[209 bytes]
  33. (hist) ‎Family:Register Allocation ‎[210 bytes]
  34. (hist) ‎Family:Poisson Problem ‎[213 bytes]
  35. (hist) ‎Family:The Traveling-Salesman Problem ‎[214 bytes]
  36. (hist) ‎Family:Integer Relation ‎[215 bytes]
  37. (hist) ‎Family:Graph Realization Problems ‎[216 bytes]
  38. (hist) ‎Family:Texture Mapping ‎[218 bytes]
  39. (hist) ‎Family:Maximum-Weight Matching ‎[219 bytes]
  40. (hist) ‎Family:AST to Code Translation ‎[219 bytes]
  41. (hist) ‎Incremental Heuristic Search ( Informed Search) ‎[220 bytes]
  42. (hist) ‎Family:LU Decomposition ‎[221 bytes]
  43. (hist) ‎(many more...) (2-dimensional Convex Hull, Dynamic Convex Hull) ‎[221 bytes]
  44. (hist) ‎Family:n-Queens Problem ‎[222 bytes]
  45. (hist) ‎Tradu; Mirc ( 4NF Decomposition) ‎[222 bytes]
  46. (hist) ‎Derek's Algorithm ( 4NF Decomposition) ‎[222 bytes]
  47. (hist) ‎Xu; Renio ( 4NF Decomposition) ‎[222 bytes]
  48. (hist) ‎Russell et. al. ( 4NF Decomposition) ‎[222 bytes]
  49. (hist) ‎Maxwell ( 4NF Decomposition) ‎[222 bytes]
  50. (hist) ‎Derek's + Maxwell ( 4NF Decomposition) ‎[222 bytes]
  51. (hist) ‎Naive ( 4NF Decomposition) ‎[222 bytes]
  52. (hist) ‎Trino ( 4NF Decomposition) ‎[222 bytes]
  53. (hist) ‎YAN J. Q.; YANG X.; SHI P. F 2006 (Mesh Parameterization Mesh Parameterization) ‎[222 bytes]
  54. (hist) ‎Stratonovich (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) ‎[222 bytes]
  55. (hist) ‎Cooper and Dasgupta algorithm ( Register Allocation) ‎[222 bytes]
  56. (hist) ‎B. I. Kvasov 2000 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) ‎[222 bytes]
  57. (hist) ‎Naive Implementation ( Integral Equations) ‎[222 bytes]
  58. (hist) ‎Record linking (Entity Resolution Entity Resolution) ‎[223 bytes]
  59. (hist) ‎Family:Line Clipping ‎[225 bytes]
  60. (hist) ‎Sorting based (Merge Sort) + real-time elimination (Duplicate Elimination Duplicate Elimination) ‎[225 bytes]
  61. (hist) ‎Duplicate Elimination Sorted Neighborhood Algorithm (DE-SNA) (Duplicate Elimination Duplicate Elimination) ‎[225 bytes]
  62. (hist) ‎V. I. Paasonen 1968 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) ‎[227 bytes]
  63. (hist) ‎Family:Root Computation ‎[229 bytes]
  64. (hist) ‎YANG Y.; KIM J.; LUO F.; HU S.; GU X. 2008 (Mesh Parameterization Mesh Parameterization) ‎[229 bytes]
  65. (hist) ‎V. I. Paasonen (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) ‎[229 bytes]
  66. (hist) ‎Family:Dihedral Rotation Queries ‎[230 bytes]
  67. (hist) ‎Work-conserving schedulers (Unweighted Interval Scheduling, Online?? Interval Scheduling) ‎[231 bytes]
  68. (hist) ‎Work-conserving schedulers (Unweighted Interval Scheduling, Online Interval Scheduling) ‎[231 bytes]
  69. (hist) ‎Family:Sequence Alignment ‎[232 bytes]
  70. (hist) ‎Nauck (Counting Solutions; Constructing solutions n-Queens Problem) ‎[232 bytes]
  71. (hist) ‎Family:Longest Common Subsequence ‎[233 bytes]
  72. (hist) ‎Family:The Vertex Cover Problem ‎[234 bytes]
  73. (hist) ‎Closed formula ( LU Decomposition) ‎[235 bytes]
  74. (hist) ‎David ( LU Decomposition) ‎[235 bytes]
  75. (hist) ‎Hybrid Algorithm (De Novo Genome Assembly De Novo Genome Assembly) ‎[235 bytes]
  76. (hist) ‎Hadlock (Maximum Cut Maximum Cut) ‎[235 bytes]
  77. (hist) ‎Pratt (Constructing Suffix Trees Constructing Suffix Trees) ‎[235 bytes]
  78. (hist) ‎Closed formula (Square Matrix LU Decomposition LU Decomposition) ‎[238 bytes]
  79. (hist) ‎David (Square Matrix LU Decomposition LU Decomposition) ‎[238 bytes]
  80. (hist) ‎Family:DFA Minimization ‎[242 bytes]
  81. (hist) ‎Coplanar facets merging - M.J. De Haemer and M.J. Zyda 1991 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  82. (hist) ‎Coplanar facets merging - Hinker; P. and Hansen; C. 1993 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  83. (hist) ‎Coplanar facets merging - Kalvin; A. D.; Cutting; C. B.; Haddad; B. and Noz; M. E. 1991 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  84. (hist) ‎Coplanar facets merging - A.D. Kalvin and R.H. Taylor 1996 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  85. (hist) ‎Controlled vertex/edge/face decimation - M.E. Algorri and F. Schmitt 1996 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  86. (hist) ‎Controlled vertex/edge/face decimation - Guéziec 1996 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  87. (hist) ‎Controlled vertex/edge/face decimation - R. Ronfard and J. Rossignac 1996 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  88. (hist) ‎Controlled vertex/edge/face decimation - Hamann 1994 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  89. (hist) ‎Controlled vertex/edge/face decimation - Cohen; J.; Varshney; A 1996 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  90. (hist) ‎Re-tiling - Turk; G 1992 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  91. (hist) ‎Vertex clustering - Rossignac; J. and Borrel; P. 1993 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  92. (hist) ‎Vertex clustering - Low; K. L. and Tan; T. S 1997 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  93. (hist) ‎Vertex clustering - Reddy 1996 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  94. (hist) ‎Vertex clustering - Hoppe; H.; DeRose; T.; 1993 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  95. (hist) ‎Vertex clustering - Rossignac; J. and Borrel; P. 1997 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  96. (hist) ‎Wavelet-based - M.H. Gross; O.G. Staadt and R. Gatti 1996 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  97. (hist) ‎Wavelet-based - D.J. Hebert and H-J. Kim 1995 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  98. (hist) ‎Wavelet-based - Certain; A.; Popovic; J.; 1996 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  99. (hist) ‎Wavelet-based - Eck; M.; DeRose; T.; 1995 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  100. (hist) ‎Simplification via intermediate hierarchical rep-resentation - Andujar 1996 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  101. (hist) ‎Simplification via intermediate hierarchical rep-resentation - He; T.; Hong; L.; Kaufman 1995 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  102. (hist) ‎Simplification via intermediate hierarchical rep-resentation - He; T.; Hong; 1996 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  103. (hist) ‎Hauskrecht; 2000; (POMDPs POMDPs) ‎[242 bytes]
  104. (hist) ‎Pineau; Gordon; & Thrun; 2003; (POMDPs POMDPs) ‎[242 bytes]
  105. (hist) ‎Braziunas & Boutilier; 2004; (POMDPs POMDPs) ‎[242 bytes]
  106. (hist) ‎Poupart; 2005; (POMDPs POMDPs) ‎[242 bytes]
  107. (hist) ‎Smith & Simmons; 2005; (POMDPs POMDPs) ‎[242 bytes]
  108. (hist) ‎Spaan & Vlassis; 2005 (POMDPs POMDPs) ‎[242 bytes]
  109. (hist) ‎Satia & Lave; 1973; (POMDPs POMDPs) ‎[242 bytes]
  110. (hist) ‎Washington; 1997; (POMDPs POMDPs) ‎[242 bytes]
  111. (hist) ‎Barto;Bradtke; & Singhe; 1995; (POMDPs POMDPs) ‎[242 bytes]
  112. (hist) ‎Paquet; Tobin; & Chaib-draa; 2005; (POMDPs POMDPs) ‎[242 bytes]
  113. (hist) ‎McAllester & Singh; 1999; (POMDPs POMDPs) ‎[242 bytes]
  114. (hist) ‎Bertsekas & Castanon; 1999; (POMDPs POMDPs) ‎[242 bytes]
  115. (hist) ‎Shani; Brafman; & Shimony; 2005 (POMDPs POMDPs) ‎[242 bytes]
  116. (hist) ‎Chen Ensembles of classifiers (Entity Resolution Entity Resolution) ‎[242 bytes]
  117. (hist) ‎Family:Geometric Visibility Problems ‎[243 bytes]
  118. (hist) ‎Blinn and Newell (Environment Mapping Texture Mapping) ‎[243 bytes]
  119. (hist) ‎Sphere mapping (Environment Mapping Texture Mapping) ‎[243 bytes]
  120. (hist) ‎Mauro Steigleder (Environment Mapping Texture Mapping) ‎[243 bytes]
  121. (hist) ‎Brute force ( The Set-Covering Problem) ‎[243 bytes]
  122. (hist) ‎Sparse APSP algorithm (Arbitrary edge weights, Sparse graph Graph Diameter) ‎[243 bytes]
  123. (hist) ‎Family:Matrix-Vector Multiplication ‎[245 bytes]
  124. (hist) ‎Schubert's algorithm ( Factorization of Polynomials Over Finite Fields) ‎[245 bytes]
  125. (hist) ‎Dekker's algorithm (2-thread Mutual Exclusion Mutual Exclusion) ‎[246 bytes]
  126. (hist) ‎Family:Dependency Inference Problem ‎[247 bytes]
  127. (hist) ‎Family:Polygon Clipping ‎[249 bytes]
  128. (hist) ‎Bucket Sort (Non-Comparison Sorting Sorting) ‎[249 bytes]
  129. (hist) ‎Tarjan Splay Tree ( Self-Balancing Trees Insertion) ‎[249 bytes]
  130. (hist) ‎Tarjan Splay Tree ( Self-Balancing Trees Deletion) ‎[249 bytes]
  131. (hist) ‎Tarjan Splay Tree ( Self-Balancing Trees Search) ‎[249 bytes]
  132. (hist) ‎Family:Maximum Cardinality Matching ‎[250 bytes]
  133. (hist) ‎Shortest remaining time first (Unweighted Interval Scheduling, Online?? Interval Scheduling) ‎[250 bytes]
  134. (hist) ‎First come, first served (Unweighted Interval Scheduling, Online?? Interval Scheduling) ‎[250 bytes]
  135. (hist) ‎Round-robin scheduling (Unweighted Interval Scheduling, Online?? Interval Scheduling) ‎[250 bytes]
  136. (hist) ‎Shortest remaining time first (Unweighted Interval Scheduling, Online Interval Scheduling) ‎[250 bytes]
  137. (hist) ‎First come, first served (Unweighted Interval Scheduling, Online Interval Scheduling) ‎[250 bytes]
  138. (hist) ‎Round-robin scheduling (Unweighted Interval Scheduling, Online Interval Scheduling) ‎[250 bytes]
  139. (hist) ‎The SUSAN corner detector ( Corner Detection) ‎[252 bytes]
  140. (hist) ‎Dürer rendering algorithm ( Ray Tracing) ‎[252 bytes]
  141. (hist) ‎A. Chalmers; T. Davis; and E. Reinhard 2002 ( Ray Tracing) ‎[252 bytes]
  142. (hist) ‎Lindeberg (1994) (Corner Detection Feature Detection) ‎[252 bytes]
  143. (hist) ‎T. Lindeberg and J. Garding (1997) (Corner Detection Feature Detection) ‎[252 bytes]
  144. (hist) ‎Lindeberg 2005 (Corner Detection Feature Detection) ‎[252 bytes]
  145. (hist) ‎The Wang and Brady corner detection algorithm 1995 (Corner Detection Feature Detection) ‎[252 bytes]
  146. (hist) ‎Tao Luo, Zaifeng Shi and Pumeng Wang (Corner Detection Feature Detection) ‎[252 bytes]
  147. (hist) ‎T. Lindeberg DoG 2012 (Blob Detection Feature Detection) ‎[252 bytes]
  148. (hist) ‎SIFT Algorithm Lowe 2004 (Blob Detection Feature Detection) ‎[252 bytes]
  149. (hist) ‎Hessain Determinant Lindeberg 1994 (Blob Detection Feature Detection) ‎[252 bytes]
  150. (hist) ‎Hessain Determinant Lindeberg 1998 (Blob Detection Feature Detection) ‎[252 bytes]
  151. (hist) ‎SURF Descriptor 2006 (Blob Detection Feature Detection) ‎[252 bytes]
  152. (hist) ‎Hessian-Laplace Mikolajczyk and Schmid 2004 (Blob Detection Feature Detection) ‎[252 bytes]
  153. (hist) ‎Spatio-temporal Geert Willems; Tinne Tuytelaars and Luc van Gool (2008) (Blob Detection Feature Detection) ‎[252 bytes]
  154. (hist) ‎Lindeberg's watershed-based grey-level blob detection algorithm 1991 (Blob Detection Feature Detection) ‎[252 bytes]
  155. (hist) ‎A. Baumberg. 2000 (Blob Detection Feature Detection) ‎[252 bytes]
  156. (hist) ‎Local scale-invariant Lowe 1999 (Blob Detection Feature Detection) ‎[252 bytes]
  157. (hist) ‎T. Tuytelaars and L. Van Gool 2000 (Blob Detection Feature Detection) ‎[252 bytes]
  158. (hist) ‎View frustum culling (Culling Culling) ‎[252 bytes]
  159. (hist) ‎Sector-Based Culling (Culling Culling) ‎[252 bytes]
  160. (hist) ‎Occlusion Culling (Culling Culling) ‎[252 bytes]
  161. (hist) ‎Contribution Culling (Culling Culling) ‎[252 bytes]
  162. (hist) ‎CNN Based Gatys; Leon A 2001 (Texture Synthesis Texture Synthesis) ‎[252 bytes]
  163. (hist) ‎Phong (Specular Reflection Texture Mapping) ‎[252 bytes]
  164. (hist) ‎Blinn–Phong (Specular Reflection Texture Mapping) ‎[252 bytes]
  165. (hist) ‎Cook–Torrance (microfacets) (Specular Reflection Texture Mapping) ‎[252 bytes]
  166. (hist) ‎Linda G. Shapiro and George C. Stockman (2001) ( Image Segmentation) ‎[252 bytes]
  167. (hist) ‎Recursive Region Splitting ( Image Segmentation) ‎[252 bytes]
  168. (hist) ‎R. Nock and F. Nielsen Statistical Region Merging ( Image Segmentation) ‎[252 bytes]
  169. (hist) ‎Kass; Witkin and Terzopoulos ( Image Segmentation) ‎[252 bytes]
  170. (hist) ‎S.L. Horowitz and T. Pavlidis - directed split and merge ( Image Segmentation) ‎[252 bytes]
  171. (hist) ‎David Mumford and Jayant Shah (1989) ( Image Segmentation) ‎[252 bytes]
  172. (hist) ‎Geman and Geman Markov random fields ( Image Segmentation) ‎[252 bytes]
  173. (hist) ‎Iterated conditional modes algorithm ( Image Segmentation) ‎[252 bytes]
  174. (hist) ‎Watershed transformation 1979 ( Image Segmentation) ‎[252 bytes]
  175. (hist) ‎Topological watershed ( Image Segmentation) ‎[252 bytes]
  176. (hist) ‎Florack and Kuijper ( Image Segmentation) ‎[252 bytes]
  177. (hist) ‎Bijaoui and Rué ( Image Segmentation) ‎[252 bytes]
  178. (hist) ‎Multi-scale MAP estimation - A. Bouman and M. Shapiro (2002) ( Image Segmentation) ‎[252 bytes]
  179. (hist) ‎Multiple Resolution segmentation - J. Liu and Y. H. Yang (1994) ( Image Segmentation) ‎[252 bytes]
  180. (hist) ‎Isometric graph partitioning - Leo Grady and Eric L. Schwartz (2006) ( Image Segmentation) ‎[252 bytes]
  181. (hist) ‎Nate Green (Environment Mapping Texture Mapping) ‎[252 bytes]
  182. (hist) ‎Heidrich; W.; and H.-P. Seidel (Environment Mapping Texture Mapping) ‎[252 bytes]
  183. (hist) ‎Emil Praun (Environment Mapping Texture Mapping) ‎[252 bytes]
  184. (hist) ‎HEALPix mapping Wong (Environment Mapping Texture Mapping) ‎[252 bytes]
  185. (hist) ‎Maximum a Posteriori Occupancy Mapping (Occupancy Grid Mapping Occupancy Grid Mapping) ‎[252 bytes]
  186. (hist) ‎AVL Tree ( Self-Balancing Trees Deletion) ‎[252 bytes]
  187. (hist) ‎The SUSAN corner detector (Corner Detection Feature Detection) ‎[252 bytes]
  188. (hist) ‎Zykov (deletion-contraction) ( Chromatic Polynomial) ‎[253 bytes]
  189. (hist) ‎P.Hanrahan and W.Krueger 1993 (Diffuse Reflection Texture Mapping) ‎[254 bytes]
  190. (hist) ‎H.W.Jensen 2001 (Diffuse Reflection Texture Mapping) ‎[254 bytes]
  191. (hist) ‎He; X. D.; Torrance; K. E.; Sillion; 1991 (Diffuse Reflection Texture Mapping) ‎[254 bytes]
  192. (hist) ‎Kajiya; J. Anisotropic Reflection Models 1985 (Diffuse Reflection Texture Mapping) ‎[254 bytes]
  193. (hist) ‎Cabral; B.; Max; N.; and Springmeyer; R 1990 (Diffuse Reflection Texture Mapping) ‎[254 bytes]
  194. (hist) ‎Westin; S. H.; Arvo; J. R.; and Torrance; K. E 1992 (Diffuse Reflection Texture Mapping) ‎[254 bytes]
  195. (hist) ‎Hopcroft 2-3 Tree ( Self-Balancing Trees Deletion) ‎[254 bytes]
  196. (hist) ‎IDEA (Block Ciphers Block Ciphers) ‎[254 bytes]
  197. (hist) ‎Random (Online Page Replacements) ‎[254 bytes]
  198. (hist) ‎Family:Maximum Subarray Problem ‎[255 bytes]
  199. (hist) ‎Dynamic Programming (Rod-Cutting Problem Rod-Cutting Problem) ‎[255 bytes]
  200. (hist) ‎T. Lindeberg DoG 2015 (Blob Detection Feature Detection) ‎[255 bytes]
  201. (hist) ‎Barghout; Lauren Visual Taxometric approach ( Image Segmentation) ‎[255 bytes]
  202. (hist) ‎Dual clustering - Guberman ( Image Segmentation) ‎[255 bytes]
  203. (hist) ‎Chen's lambda-connected segmentation ( Image Segmentation) ‎[255 bytes]
  204. (hist) ‎Quasi-linear Topological watershed ( Image Segmentation) ‎[255 bytes]
  205. (hist) ‎Dense APSP algorithm (Arbitrary edge weights, Dense graph Graph Diameter) ‎[255 bytes]
  206. (hist) ‎C-SCAN (Disk Scheduling Disk Scheduling) ‎[256 bytes]
  207. (hist) ‎C-LOOK (Disk Scheduling Disk Scheduling) ‎[256 bytes]
  208. (hist) ‎APSP algorithm (3-Clique Min-Weight k-Clique Problem) ‎[256 bytes]
  209. (hist) ‎Brute Force (Rod-Cutting Problem Rod-Cutting Problem) ‎[257 bytes]
  210. (hist) ‎Brute Force (Change-Making Problem Change-Making Problem) ‎[258 bytes]
  211. (hist) ‎Nakamae; E.; Kaneda; K.; Okamoto; T.; and Nishita 1990 (Diffuse Reflection Texture Mapping) ‎[258 bytes]
  212. (hist) ‎Brute Force (Matrix Chain Ordering Problem Matrix Chain Multiplication) ‎[259 bytes]
  213. (hist) ‎Hanrahan–Krueger (Specular Reflection Texture Mapping) ‎[259 bytes]
  214. (hist) ‎Ullman (Subgraph Isomorphism Graph Isomorphism Problem) ‎[259 bytes]
  215. (hist) ‎Schöning (3-Graph Coloring Graph Coloring) ‎[260 bytes]
  216. (hist) ‎Radix Sort (Non-Comparison Sorting Sorting) ‎[261 bytes]
  217. (hist) ‎LU decomposition (General Linear system of equations) ‎[261 bytes]
  218. (hist) ‎V. A. Lyul’ka and A. V. Romanenko 1994 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) ‎[261 bytes]
  219. (hist) ‎Textbook Sort-and-Two-Sided-Traversal (Integer 3SUM 3SUM) ‎[261 bytes]
  220. (hist) ‎V. A. Lyul’ka and A. V. Romanenko (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) ‎[261 bytes]
  221. (hist) ‎Naive sorting (Non-Comparison Sorting Sorting) ‎[262 bytes]
  222. (hist) ‎The Trajkovic and Hedley corner detector 1998 (Corner Detection Feature Detection) ‎[262 bytes]
  223. (hist) ‎Maximally stable extremal regions Matas 2002 (Blob Detection Feature Detection) ‎[262 bytes]
  224. (hist) ‎Förstner algorithm 1987 (Corner Detection Feature Detection) ‎[263 bytes]
  225. (hist) ‎Y. Dufournaud; C. Schmid; and R. Horaud 2000 (Blob Detection Feature Detection) ‎[263 bytes]
  226. (hist) ‎Naive sorting (Comparison Sorting Sorting) ‎[264 bytes]
  227. (hist) ‎Selection Sort (Comparison Sorting Sorting) ‎[264 bytes]
  228. (hist) ‎Bubble Sort (Comparison Sorting Sorting) ‎[264 bytes]
  229. (hist) ‎Lund & Yannakakis ( The Set-Covering Problem) ‎[264 bytes]
  230. (hist) ‎Bayer, McCreight B-Tree ( Self-Balancing Trees Search) ‎[264 bytes]
  231. (hist) ‎Brute Force (2-dimensional Convex Hull) ‎[266 bytes]
  232. (hist) ‎Laguerre iteration (Any eigenvalue Eigenvalues (Iterative Methods)) ‎[266 bytes]
  233. (hist) ‎Hashing (kth Order Statistic kth Order Statistic) ‎[267 bytes]
  234. (hist) ‎Ray tracing ( Shown Surface Determination) ‎[267 bytes]
  235. (hist) ‎ZAYER R.; LÉVY B.; SEIDEL H.-P. 2007 (Mesh Parameterization Mesh Parameterization) ‎[267 bytes]
  236. (hist) ‎BFS/DFS for connected components ( ‎[267 bytes]
  237. (hist) ‎Textbook Sort-and-Binary-Search (Integer 3SUM 3SUM) ‎[267 bytes]
  238. (hist) ‎Naive (Reporting all intersection points, line segments Line segment intersection) ‎[268 bytes]
  239. (hist) ‎Ward anisotropic (Specular Reflection Texture Mapping) ‎[268 bytes]
  240. (hist) ‎Mucha and Sankowski ( Maximum-Weight Matching) ‎[268 bytes]
  241. (hist) ‎Conflict-Driven Clause Learning (CDCL) (CNF-SAT Boolean Satisfiability) ‎[268 bytes]
  242. (hist) ‎Naive Implementation (k-dimensional space, l m (or l infty) norm Closest Pair Problem) ‎[269 bytes]
  243. (hist) ‎Tim Sort (Comparison Sorting Sorting) ‎[269 bytes]
  244. (hist) ‎S-buffer/Scanline Rendering ( Shown Surface Determination) ‎[269 bytes]
  245. (hist) ‎Catriel Beeri Ronald Fagin John H. Howard (Multivalued Dependency Inference Problem Dependency Inference Problem) ‎[269 bytes]
  246. (hist) ‎DESBRUN M.; MEYER M.; ALLIEZ P. 2002 (Mesh Parameterization Mesh Parameterization) ‎[269 bytes]
  247. (hist) ‎SHEFFER A.; LÉVY B.; MOGILNITSKY M.; BOGOMYAKOV A. 2005 (Mesh Parameterization Mesh Parameterization) ‎[269 bytes]
  248. (hist) ‎O'Neil 1973 (Boolean Matrix Multiplication Matrix Product) ‎[269 bytes]
  249. (hist) ‎ECK M.; DEROSE T.; DUCHAMP T.; 1995 (Mesh Parameterization Mesh Parameterization) ‎[269 bytes]
  250. (hist) ‎Family:Optimal Binary Search Trees ‎[270 bytes]
  251. (hist) ‎Gaussian-Jordan Elimination (General Linear System; Positive Definite, Hermitian Matrix; Non-Definite, Symmetric Matrix; Toeplitz Matrix; Vandermonde Matrix Linear System) ‎[270 bytes]
  252. (hist) ‎Cholesky (Positive Definite, Hermitian Matrix Linear System) ‎[270 bytes]
  253. (hist) ‎Prim's algorithm + binary heap (Undirected, General MST Minimum Spanning Tree (MST)) ‎[270 bytes]
  254. (hist) ‎Lewis 1978 (Renamable Horn Boolean Satisfiability) ‎[270 bytes]
  255. (hist) ‎CHEN Z. G.; LIU L. G.; ZHANG Z. Y.; WANG G. J. 2007 (Mesh Parameterization Mesh Parameterization) ‎[271 bytes]
  256. (hist) ‎Alberto Sanfeliu and King-Sun Fu ( Graph Edit Distance Computation) ‎[272 bytes]
  257. (hist) ‎Berger & Müller-Hannemann (DAG Realization Problem Graph Realization Problems) ‎[272 bytes]
  258. (hist) ‎Family:Matrix Chain Multiplication ‎[273 bytes]
  259. (hist) ‎SANDER P. V.; SNYDER J.; GORTER S. J.; HOPPE 2001 (Mesh Parameterization Mesh Parameterization) ‎[273 bytes]
  260. (hist) ‎Hirsch (3-Graph Coloring Graph Coloring) ‎[273 bytes]
  261. (hist) ‎FLOATER 1997 (Mesh Parameterization Mesh Parameterization) ‎[274 bytes]
  262. (hist) ‎PINKALL U.; POLTHIER K 1993 (Mesh Parameterization Mesh Parameterization) ‎[274 bytes]
  263. (hist) ‎Family:Linear Programming ‎[275 bytes]
  264. (hist) ‎String-Matching with Finite Automata (Single String Search String Search) ‎[275 bytes]
  265. (hist) ‎Micali; Vazirani ( Maximum-Weight Matching) ‎[276 bytes]
  266. (hist) ‎Fringe (Informed Search Informed Search) ‎[277 bytes]
  267. (hist) ‎SHEFFER A.; DE STURLER E. 2000 (Mesh Parameterization Mesh Parameterization) ‎[277 bytes]
  268. (hist) ‎SPRINGBORN B.; SCHROEDER P.; PINKALL U. 2008 (Mesh Parameterization Mesh Parameterization) ‎[277 bytes]
  269. (hist) ‎Zakai (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) ‎[277 bytes]
  270. (hist) ‎Zwick 2002 (Directed, Unweighted All-Pairs Shortest Paths (APSP)) ‎[277 bytes]
  271. (hist) ‎Naive algorithm (Matrix Multiplication Matrix Product) ‎[278 bytes]
  272. (hist) ‎Family:Nearest Neighbor Search ‎[279 bytes]
  273. (hist) ‎Simplex Algorithm ( Linear Programming) ‎[279 bytes]
  274. (hist) ‎Terlaky's Criss-cross algorithm ( Linear Programming) ‎[279 bytes]
  275. (hist) ‎Borůvka's algorithm (Undirected, General MST Minimum Spanning Tree (MST)) ‎[279 bytes]
  276. (hist) ‎Dinur & Steurer ( The Set-Covering Problem) ‎[279 bytes]
  277. (hist) ‎Alon and Kahale (3-Graph Coloring Graph Coloring) ‎[279 bytes]
  278. (hist) ‎Sorting based (Merge Sort) (Duplicate Elimination Duplicate Elimination) ‎[279 bytes]
  279. (hist) ‎Family:Clique Problems ‎[280 bytes]
  280. (hist) ‎Brute force (4-Graph Coloring Graph Coloring) ‎[280 bytes]
  281. (hist) ‎Raz & Safra ( The Set-Covering Problem) ‎[280 bytes]
  282. (hist) ‎Naive Selection (kth Order Statistic kth Order Statistic) ‎[281 bytes]
  283. (hist) ‎Tao D; Tang X; Li X et al ( Graph Edit Distance Computation) ‎[281 bytes]
  284. (hist) ‎Brute-force search (3-Graph Coloring Graph Coloring) ‎[284 bytes]
  285. (hist) ‎Parallel Merge Sort - Cole (1) ( Sorting - Comparison) ‎[284 bytes]
  286. (hist) ‎Parallel Merge Sort - Cole (2) ( Sorting - Comparison) ‎[284 bytes]
  287. (hist) ‎Grenander (1D Maximum Subarray Maximum Subarray Problem) ‎[285 bytes]
  288. (hist) ‎Hash join ( Joins) ‎[285 bytes]
  289. (hist) ‎Sciore (4NF Decomposition for Conflict-Free Dependency Sets 4NF Decomposition) ‎[285 bytes]
  290. (hist) ‎Chand-Kapur, Gift Wrapping (d-dimensional Convex Hull Convex Hull) ‎[286 bytes]
  291. (hist) ‎Ocone (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) ‎[287 bytes]
  292. (hist) ‎Bcrypt (Unkeyed Hash Functions One-Way Hash Functions) ‎[287 bytes]
  293. (hist) ‎Family:Interval Scheduling ‎[288 bytes]
  294. (hist) ‎Brute force (Lossy Compression Data Compression) ‎[288 bytes]
  295. (hist) ‎( Negative Triangle) ‎[288 bytes]
  296. (hist) ‎Wang Y-K; Fan K-C; Horng J-T ( Graph Edit Distance Computation) ‎[288 bytes]
  297. (hist) ‎Multilevel queue scheduling (Unweighted Interval Scheduling, Online?? Interval Scheduling) ‎[288 bytes]
  298. (hist) ‎Not recently used (Online Page Replacements) ‎[288 bytes]
  299. (hist) ‎First-in, first-out (Online Page Replacements) ‎[288 bytes]
  300. (hist) ‎Second-chance (Online Page Replacements) ‎[288 bytes]
  301. (hist) ‎Multilevel queue scheduling (Unweighted Interval Scheduling, Online Interval Scheduling) ‎[288 bytes]
  302. (hist) ‎Long Multiplication ( Multiplication) ‎[289 bytes]
  303. (hist) ‎Naive algorithm (Subset Sum The Subset-Sum Problem) ‎[289 bytes]
  304. (hist) ‎Shamos (1D Maximum Subarray Maximum Subarray Problem) ‎[290 bytes]
  305. (hist) ‎Linde–Buzo–Gray algorithm ( Voronoi Diagrams) ‎[291 bytes]
  306. (hist) ‎Feige ( The Set-Covering Problem) ‎[292 bytes]
  307. (hist) ‎Tushar Deepak Chandra and Sam Toueg (Distributed Locking Algorithms Distributed Locking Algorithms) ‎[292 bytes]
  308. (hist) ‎Brute force algorithm (Weighted Activity Selection Problem Interval Scheduling) ‎[292 bytes]
  309. (hist) ‎Not frequently used (NFU) (Online Page Replacements) ‎[292 bytes]
  310. (hist) ‎Aging (Online Page Replacements) ‎[292 bytes]
  311. (hist) ‎Treap ( Self-Balancing Trees Insertion) ‎[292 bytes]
  312. (hist) ‎Treap ( Self-Balancing Trees Deletion) ‎[292 bytes]
  313. (hist) ‎Treap ( Self-Balancing Trees Search) ‎[292 bytes]
  314. (hist) ‎Mixed Integer Programming (n player games Nash Equilibria) ‎[292 bytes]
  315. (hist) ‎T. C. Hu ; M. T. Shing (Matrix Chain Ordering Problem Matrix Chain Multiplication) ‎[293 bytes]
  316. (hist) ‎Kvasov 2006 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) ‎[293 bytes]
  317. (hist) ‎Iteration based (Tower of Hanoi Tower of Hanoi) ‎[293 bytes]
  318. (hist) ‎Non-recursion based (Tower of Hanoi Tower of Hanoi) ‎[293 bytes]
  319. (hist) ‎Support enumeration and search (n player games Nash Equilibria) ‎[293 bytes]
  320. (hist) ‎Incremental convex hull algorithm; Michael Kallay ( Convex Hull) ‎[294 bytes]
  321. (hist) ‎Reduction from UOV to Dynamic Time Warping ‎[294 bytes]
  322. (hist) ‎Naïve string-search algorithm (Single String Search String Search) ‎[295 bytes]
  323. (hist) ‎Pettie & Ramachandran (APSP on Dense Undirected Graphs with Arbitrary Weights; APSP on Sparse Undirected Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP)) ‎[295 bytes]
  324. (hist) ‎Seidel's Shelling Algorithm (d-dimensional Convex Hull Convex Hull) ‎[295 bytes]
  325. (hist) ‎Durstenfeld's Algorithm 235 (General Permutations Generating Random Permutations) ‎[295 bytes]
  326. (hist) ‎Babai & Codenotti (Hypergraphs isomorphism Graph Isomorphism Problem) ‎[295 bytes]
  327. (hist) ‎$O(n^3)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling) ‎[295 bytes]
  328. (hist) ‎Family:4NF Decomposition ‎[296 bytes]
  329. (hist) ‎Doolittle Algorithm (Square Matrix LU Decomposition LU Decomposition) ‎[296 bytes]
  330. (hist) ‎Applegate et al. (Approximate TSP The Traveling-Salesman Problem) ‎[296 bytes]
  331. (hist) ‎Robson (3-Graph Coloring Graph Coloring) ‎[296 bytes]
  332. (hist) ‎Kmett (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) ‎[296 bytes]
  333. (hist) ‎Dunning; Gupta & Silberholz (Maximum Cut, Approximate Maximum Cut) ‎[297 bytes]
  334. (hist) ‎Cygan, Gabow, Sankowski (Bounded integer weights Graph Diameter) ‎[298 bytes]
  335. (hist) ‎Gray-code based (Tower of Hanoi Tower of Hanoi) ‎[298 bytes]
  336. (hist) ‎Johnson's algorithm (Directed, Weighted (Arbitrary weights) All-Pairs Shortest Paths (APSP)) ‎[298 bytes]
  337. (hist) ‎Brute force enumeration (k-Clique k-Clique Problem) ‎[298 bytes]
  338. (hist) ‎Harris and Stephens algorithm ( Corner Detection) ‎[299 bytes]
  339. (hist) ‎Whitted's algorithm 1979 ( Ray Tracing) ‎[299 bytes]
  340. (hist) ‎LÉVY B.; PETITJEAN S.; RAY N.; MAILLOT J 2002 (Mesh Parameterization Mesh Parameterization) ‎[299 bytes]
  341. (hist) ‎BEN-CHEN M.; GOTSMAN C.; BUNIN G. 2008 (Mesh Parameterization Mesh Parameterization) ‎[299 bytes]
  342. (hist) ‎Nested loop join ( Joins) ‎[299 bytes]
  343. (hist) ‎Rayleigh quotient iteration (Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods)) ‎[299 bytes]
  344. (hist) ‎SHA-1 (Unkeyed Hash Functions One-Way Hash Functions) ‎[299 bytes]
  345. (hist) ‎Whirlpool ( One-Way Hash Functions) ‎[299 bytes]
  346. (hist) ‎SHA-2 (Unkeyed Hash Functions One-Way Hash Functions) ‎[299 bytes]
  347. (hist) ‎Exhaustive search (k-OV Orthogonal Vectors) ‎[299 bytes]
  348. (hist) ‎Bayer, McCreight B-Tree ( Self-Balancing Trees Insertion) ‎[299 bytes]
  349. (hist) ‎Bayer, McCreight B-Tree ( Self-Balancing Trees Deletion) ‎[299 bytes]
  350. (hist) ‎Harris and Stephens algorithm (Corner Detection Feature Detection) ‎[299 bytes]
  351. (hist) ‎Dynamic Programming (Change-Making Problem Change-Making Problem) ‎[300 bytes]
  352. (hist) ‎Lowe (2004) (Corner Detection Feature Detection) ‎[300 bytes]
  353. (hist) ‎Johnson (3-Graph Coloring Graph Coloring) ‎[300 bytes]
  354. (hist) ‎Sort merge join ( Joins) ‎[300 bytes]
  355. (hist) ‎Reduction from UOV to Longest Common Subsequence ‎[300 bytes]
  356. (hist) ‎Family:Median String Problem ‎[301 bytes]
  357. (hist) ‎Kadane's Algorithm (1D Maximum Subarray Maximum Subarray Problem) ‎[301 bytes]
  358. (hist) ‎Appel's algorithm 1968 ( Ray Tracing) ‎[301 bytes]
  359. (hist) ‎Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Insertion) ‎[301 bytes]
  360. (hist) ‎Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Deletion) ‎[301 bytes]
  361. (hist) ‎Alpha-HMM (Matsuyama, Yasuo) (Maximum Likelihood Methods in Unknown Latent Variables, Hidden Markov Models Maximum Likelihood Methods in Unknown Latent Variables) ‎[302 bytes]
  362. (hist) ‎Naive solution ( Cardinality Estimation) ‎[302 bytes]
  363. (hist) ‎BST Algorithm (Duplicate Elimination Duplicate Elimination) ‎[302 bytes]
  364. (hist) ‎LEE Y.; KIM H. S.; LEE S 2002 (Mesh Parameterization Mesh Parameterization) ‎[302 bytes]
  365. (hist) ‎Image quilting Efros-Freeman (Texture Synthesis Texture Synthesis) ‎[303 bytes]
  366. (hist) ‎Kwatra 2003 (Texture Synthesis Texture Synthesis) ‎[303 bytes]
  367. (hist) ‎Wagner-Fischer algorithm (Edit distance, constant-size alphabet Sequence Alignment) ‎[303 bytes]
  368. (hist) ‎Tango Tree ( Self-Balancing Trees Search) ‎[303 bytes]
  369. (hist) ‎Wagner-Fischer algorithm (Edit distance Sequence Alignment) ‎[303 bytes]
  370. (hist) ‎Faaland (Subset Sum The Subset-Sum Problem) ‎[304 bytes]
  371. (hist) ‎W. Eddy Quickhull (2-dimensional Convex Hull) ‎[304 bytes]
  372. (hist) ‎Brute force (Cyclic Peptide Sequencing Problem Cyclic Peptide Sequencing Problem) ‎[304 bytes]
  373. (hist) ‎Angelsmark, Jonsson ( ‎[304 bytes]
  374. (hist) ‎Fomin; Gaspers & Saurabh ( ‎[304 bytes]
  375. (hist) ‎Bern; Gilbert; Hendrickson (Inexact Laplacian Solver SDD Systems Solvers) ‎[304 bytes]
  376. (hist) ‎TSPLIB (Minimum TSP The Traveling-Salesman Problem) ‎[304 bytes]
  377. (hist) ‎Euclid's algorithm (Greatest Common Divisor Greatest Common Divisor) ‎[304 bytes]
  378. (hist) ‎Clock (Online Page Replacements) ‎[304 bytes]
  379. (hist) ‎Compression/Clustering (Vector Quantization) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search) ‎[305 bytes]
  380. (hist) ‎Alon; Moshkovitz & Safra (Unweighted Set-Covering The Set-Covering Problem) ‎[305 bytes]
  381. (hist) ‎5-point Gauss elimination (3-Dimensional Poisson Problem Poisson Problem) ‎[305 bytes]
  382. (hist) ‎Brute force (backtracking search) (The Vertex Cover Problem The Vertex Cover Problem) ‎[305 bytes]
  383. (hist) ‎5-point Gauss elimination (2-Dimensional Poisson Problem Poisson Problem) ‎[305 bytes]
  384. (hist) ‎Compression/Clustering (Vector Quantization) (k-ANNS Nearest Neighbor Search) ‎[305 bytes]
  385. (hist) ‎Image analogies Hertzmann (Texture Synthesis Texture Synthesis) ‎[306 bytes]
  386. (hist) ‎Koivisto ( Chromatic Number) ‎[306 bytes]
  387. (hist) ‎Koivisto ( Chromatic Polynomial) ‎[306 bytes]
  388. (hist) ‎Lawler; E. L. (Minimum TSP The Traveling-Salesman Problem) ‎[306 bytes]
  389. (hist) ‎HybridSpades (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) ‎[306 bytes]
  390. (hist) ‎RIPEMD-160 (Unkeyed Hash Functions One-Way Hash Functions) ‎[306 bytes]
  391. (hist) ‎Non-parametric sampling Efros and Leung (Texture Synthesis Texture Synthesis) ‎[307 bytes]
  392. (hist) ‎R. Paget ; I.D. Longstaff (Texture Synthesis Texture Synthesis) ‎[307 bytes]
  393. (hist) ‎LU Matrix Decomposition (Matrix Factorization Collaborative Filtering) ‎[307 bytes]
  394. (hist) ‎QR Matrix Decomposition (Matrix Factorization Collaborative Filtering) ‎[307 bytes]
  395. (hist) ‎Cholesky Decomposition (Matrix Factorization Collaborative Filtering) ‎[307 bytes]
  396. (hist) ‎Damiano Brigo; Bernard Hanzon and François LeGland (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) ‎[307 bytes]
  397. (hist) ‎Reduction from Negative Triangle Detection to Maximum Subarray ‎[307 bytes]
  398. (hist) ‎Schmidt & Druffel ( Graph Isomorphism Problem) ‎[307 bytes]
  399. (hist) ‎Global Newton Method (n player games Nash Equilibria) ‎[307 bytes]
  400. (hist) ‎Trial division (First Category Integer Factoring Integer Factoring) ‎[308 bytes]
  401. (hist) ‎Puterman Modified Policy Iteration (MPI) (Optimal Policies for MDPs Optimal Policies for MDPs) ‎[308 bytes]
  402. (hist) ‎(Boolean Matrix Multiplication (Combinatorial) Matrix Product) ‎[308 bytes]
  403. (hist) ‎Multistep (SCCs Strongly Connected Components) ‎[308 bytes]
  404. (hist) ‎Hierholzer's algorithm (Constructing Eulerian Trails in a Graph Constructing Eulerian Trails in a Graph) ‎[308 bytes]
  405. (hist) ‎D* Lite ( Informed Search) ‎[308 bytes]
  406. (hist) ‎Rabin' Algorithm (k-dimensional space, l m (or l infty) norm Closest Pair Problem) ‎[309 bytes]
  407. (hist) ‎Random Split Exponential algorithm (Subset Sum The Subset-Sum Problem) ‎[309 bytes]
  408. (hist) ‎Pettie, Ramachandran (Undirected, General MST Minimum Spanning Tree (MST)) ‎[309 bytes]
  409. (hist) ‎Radix sorting method (General Permutations Generating Random Permutations) ‎[309 bytes]
  410. (hist) ‎Fredman-Tarjan (Edmonds-Karp-based) (bipartite (i.e. assignment), general Maximum-weight matching) ‎[309 bytes]
  411. (hist) ‎Wen (2-dimensional Maximum subarray problem) ‎[309 bytes]
  412. (hist) ‎Wen (1-dimensional Maximum subarray problem) ‎[309 bytes]
  413. (hist) ‎Merge Sort (Comparison Sorting Sorting) ‎[310 bytes]
  414. (hist) ‎Quick Kruskal algorithm (Undirected, General MST Minimum Spanning Tree (MST)) ‎[310 bytes]
  415. (hist) ‎Euler's factorization method (First Category Integer Factoring Integer Factoring) ‎[310 bytes]
  416. (hist) ‎Chen et al ( Maximum Flow) ‎[310 bytes]
  417. (hist) ‎Yao (OBST Optimal Binary Search Trees) ‎[310 bytes]
  418. (hist) ‎Quantum Adiabatic Algorithm (QAA) (CNF-SAT Boolean Satisfiability) ‎[310 bytes]
  419. (hist) ‎Burst Sort (Non-Comparison Sorting Sorting) ‎[311 bytes]
  420. (hist) ‎ZAYER R.; ROESSL C.; SEIDEL H.-P 2005 (Mesh Parameterization Mesh Parameterization) ‎[311 bytes]
  421. (hist) ‎AVL Tree ( Self-Balancing Trees Creation) ‎[311 bytes]
  422. (hist) ‎Hopcroft 2-3 Tree ( Self-Balancing Trees Creation) ‎[311 bytes]
  423. (hist) ‎Tarjan Splay Tree ( Self-Balancing Trees Creation) ‎[311 bytes]
  424. (hist) ‎Naive solution (The Frequent Words Problem The Frequent Words Problem) ‎[311 bytes]
  425. (hist) ‎Baran, Demaine, Patrascu (Integer 3SUM 3SUM) ‎[311 bytes]
  426. (hist) ‎Shell Sort (Shell) (Comparison Sorting Sorting) ‎[311 bytes]
  427. (hist) ‎Affine scaling ( Linear Programming) ‎[312 bytes]
  428. (hist) ‎Lindeberg (1998) (Corner Detection Feature Detection) ‎[312 bytes]
  429. (hist) ‎FAST E. Rosten and T. Drummond 2006 (Corner Detection Feature Detection) ‎[312 bytes]
  430. (hist) ‎Naive (Longest Palindromic Substring Longest Palindromic Substring) ‎[312 bytes]
  431. (hist) ‎Naive + 1 queen per row restriction (Counting Solutions; Constructing solutions n-Queens Problem) ‎[312 bytes]
  432. (hist) ‎Rabin Karp (The Frequent Words Problem The Frequent Words Problem) ‎[312 bytes]
  433. (hist) ‎Gronlund, Pettie (Real 3SUM 3SUM) ‎[312 bytes]
  434. (hist) ‎Reduction to Abboud, Williams, Yu (k-OV Orthogonal Vectors) ‎[312 bytes]
  435. (hist) ‎Shell Sort (Pratt) (Comparison Sorting Sorting) ‎[312 bytes]
  436. (hist) ‎Naive Algorithm (Counting Solutions; Constructing solutions n-Queens Problem) ‎[313 bytes]
  437. (hist) ‎Shell Sort (Frank & Lazarus) (Comparison Sorting Sorting) ‎[313 bytes]
  438. (hist) ‎Family:Convex Hull ‎[314 bytes]
  439. (hist) ‎Okunev; Johnson (Square Matrix LU Decomposition LU Decomposition) ‎[314 bytes]
  440. (hist) ‎Kruskal's algorithm (Undirected, General MST Minimum Spanning Tree (MST)) ‎[314 bytes]
  441. (hist) ‎LOOK (Disk Scheduling Disk Scheduling) ‎[314 bytes]
  442. (hist) ‎Brand et al ( Maximum Flow) ‎[314 bytes]
  443. (hist) ‎Dynamic Programming (Longest Palindromic Substring Longest Palindromic Substring) ‎[314 bytes]
  444. (hist) ‎Abboud, Williams, Yu (OV Orthogonal Vectors) ‎[314 bytes]
  445. (hist) ‎Family:Eigenvalues (Iterative Methods) ‎[315 bytes]
  446. (hist) ‎Time-Bounded A* (TBA*) (Informed Search Informed Search) ‎[315 bytes]
  447. (hist) ‎Output-Sensitive Quantum BMM (Boolean Matrix Multiplication Matrix Product) ‎[315 bytes]
  448. (hist) ‎Spielman (Isomorphism of strongly regular graphs Graph Isomorphism Problem) ‎[315 bytes]
  449. (hist) ‎Chan (Real 3SUM 3SUM) ‎[315 bytes]
  450. (hist) ‎Reduction to Chan, Williams (k-OV Orthogonal Vectors) ‎[315 bytes]
  451. (hist) ‎Gronlund, Pettie (3-Clique Exact-Weight k-Clique Problem) ‎[315 bytes]
  452. (hist) ‎V. A. Lyul’ka and I. E. Mikhailov 2003 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) ‎[316 bytes]
  453. (hist) ‎Gaussian elimination (2-D Polynomial Interpolation Polynomial Interpolation) ‎[316 bytes]
  454. (hist) ‎WalkSAT (CNF-SAT Boolean Satisfiability) ‎[316 bytes]
  455. (hist) ‎V. A. Lyul’ka and I. E. Mikhailov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) ‎[316 bytes]
  456. (hist) ‎5-point FFT (3-Dimensional Poisson Problem Poisson Problem) ‎[317 bytes]
  457. (hist) ‎9-point FFT (3-Dimensional Poisson Problem Poisson Problem) ‎[317 bytes]
  458. (hist) ‎Cheriton-Tarjan (planar) (Undirected, Planar MST Minimum Spanning Tree (MST)) ‎[317 bytes]
  459. (hist) ‎5-point FFT (2-Dimensional Poisson Problem Poisson Problem) ‎[317 bytes]
  460. (hist) ‎9-point FFT (2-Dimensional Poisson Problem Poisson Problem) ‎[317 bytes]
  461. (hist) ‎Bodlaender (Partial k-trees Graph Isomorphism Problem) ‎[317 bytes]
  462. (hist) ‎Hanoi graph (Tower of Hanoi Tower of Hanoi) ‎[317 bytes]
  463. (hist) ‎Paturi, Pudlák, Saks, Zane (PPSZ) 2005 (k-SAT Boolean Satisfiability) ‎[317 bytes]
  464. (hist) ‎Freund (Real 3SUM 3SUM) ‎[317 bytes]
  465. (hist) ‎Chan, Williams (OV Orthogonal Vectors) ‎[317 bytes]
  466. (hist) ‎Lifelong Planning A* (LPA*) (Informed Search Informed Search) ‎[318 bytes]
  467. (hist) ‎Theta* (Informed Search Informed Search) ‎[318 bytes]
  468. (hist) ‎FLOATER 2003 (Mesh Parameterization Mesh Parameterization) ‎[318 bytes]
  469. (hist) ‎Cheriton-Tarjan (dense) (Undirected, Dense MST Minimum Spanning Tree (MST)) ‎[318 bytes]
  470. (hist) ‎Gabow et al, Section 3 (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST)) ‎[318 bytes]
  471. (hist) ‎Naïve algorithm ( Variance Calculations) ‎[318 bytes]
  472. (hist) ‎Scapegoat Tree ( Self-Balancing Trees Insertion) ‎[318 bytes]
  473. (hist) ‎Scapegoat Tree ( Self-Balancing Trees Deletion) ‎[318 bytes]
  474. (hist) ‎Family:Geometric Covering Problems ‎[319 bytes]
  475. (hist) ‎Dynamic Programming Algorithm (S. S. Godbole) (Matrix Chain Ordering Problem Matrix Chain Multiplication) ‎[319 bytes]
  476. (hist) ‎Fringe Saving A* (FSA*) (Informed Search Informed Search) ‎[319 bytes]
  477. (hist) ‎Generalized Adaptive A* (GAA*) (Informed Search Informed Search) ‎[319 bytes]
  478. (hist) ‎Brélaz (DSatur) (3-Graph Coloring Graph Coloring) ‎[319 bytes]
  479. (hist) ‎Prim's algorithm + adjacency matrix searching (Undirected, General MST Minimum Spanning Tree (MST)) ‎[319 bytes]
  480. (hist) ‎Warnock's algorithm ( Shown Surface Determination) ‎[319 bytes]
  481. (hist) ‎Geert Willems; Tinne Tuytelaars and Luc van Gool (2008) (Corner Detection Feature Detection) ‎[319 bytes]
  482. (hist) ‎Larsen, Williams (follows from Theorem 2.1) ( Online Matrix Vector Multiplication (OMV)) ‎[319 bytes]
  483. (hist) ‎Asymptotically fast Toeplitz algorithms (Toeplitz Linear system of equations) ‎[319 bytes]
  484. (hist) ‎Gabow et al, Section 2 (Undirected, General MST Minimum Spanning Tree (MST)) ‎[319 bytes]
  485. (hist) ‎Hertli (Modified PPSZ) (3SAT Boolean Satisfiability) ‎[319 bytes]
  486. (hist) ‎Hertli (Modified PPSZ) (4SAT Boolean Satisfiability) ‎[319 bytes]
  487. (hist) ‎Family:Linear System ‎[320 bytes]
  488. (hist) ‎Kruskal’s algorithm with demand-sorting (Undirected, General MST Minimum Spanning Tree (MST)) ‎[320 bytes]
  489. (hist) ‎De ( Multiplication) ‎[320 bytes]
  490. (hist) ‎LOBPCG algorithm (Eigenpair closest to mu; Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods)) ‎[320 bytes]
  491. (hist) ‎$O(n^2)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling) ‎[320 bytes]
  492. (hist) ‎Tamaki, Tokuyama (exact) (2-dimensional Maximum subarray problem) ‎[320 bytes]
  493. (hist) ‎Spatial GAN-Based; Urs Bergmann, Nikolay Jetchev, Roland Vollgraf (Texture Synthesis Texture Synthesis) ‎[321 bytes]
  494. (hist) ‎Linear search (Nearest Neighbor Search (NNS) Nearest Neighbor Search) ‎[321 bytes]
  495. (hist) ‎Briggs; Henson; McCormick ( SDD Systems Solvers) ‎[321 bytes]
  496. (hist) ‎Sattolo's algorithm (Cyclic Permutations Generating Random Permutations) ‎[321 bytes]
  497. (hist) ‎Petro Vlahos Algorithm (Image Compositing Image Compositing) ‎[322 bytes]
  498. (hist) ‎J. J. Koenderink and W. Richards 1988 (Corner Detection Feature Detection) ‎[322 bytes]
  499. (hist) ‎9-point SOR iteration (3-Dimensional Poisson Problem Poisson Problem) ‎[322 bytes]
  500. (hist) ‎Larsen, Williams (Theorem 1.1) ( Online Matrix Vector Multiplication (OMV)) ‎[322 bytes]

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

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