Short 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. (hist) ‎9-point SOR iteration (2-Dimensional Poisson Problem Poisson Problem) ‎[322 bytes]
  2. (hist) ‎Modified van Leeuwen (Static Trees) (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) ‎[322 bytes]
  3. (hist) ‎Modified van Leeuwen (Linking Roots) (Lowest Common Ancestor with Linking Roots Lowest Common Ancestor) ‎[322 bytes]
  4. (hist) ‎KALYAN PERUMALLA and NARSINGH DEO (2-dimensional Maximum subarray problem) ‎[322 bytes]
  5. (hist) ‎Scapegoat Tree ( Self-Balancing Trees Search) ‎[322 bytes]
  6. (hist) ‎Lee and Sidford ( Linear Programming) ‎[323 bytes]
  7. (hist) ‎Couvreur (SCCs Strongly Connected Components) ‎[323 bytes]
  8. (hist) ‎Prim's algorithm + Fibonacci heaps; Fredman & Tarjan (Undirected, General MST Minimum Spanning Tree (MST)) ‎[323 bytes]
  9. (hist) ‎Fredman & Willard (Undirected, Integer Weights MST Minimum Spanning Tree (MST)) ‎[323 bytes]
  10. (hist) ‎Bayer, McCreight B-Tree ( Self-Balancing Trees Creation) ‎[323 bytes]
  11. (hist) ‎$O(n\log n)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling) ‎[323 bytes]
  12. (hist) ‎Galil, Micali, Gabow (general Maximum-weight matching) ‎[323 bytes]
  13. (hist) ‎KARNI Z.; GOTSMAN C.; GORTLER S. J. 2005 (Mesh Parameterization Mesh Parameterization) ‎[324 bytes]
  14. (hist) ‎Dual subgradients and the drift-plus-penalty method (Stochastic optimization Convex Optimization (Non-linear)) ‎[324 bytes]
  15. (hist) ‎Jarvis (2-dimensional Convex Hull) ‎[325 bytes]
  16. (hist) ‎L. Kitchen and A. Rosenfeld (Grey-scale Corner Detection) ‎[325 bytes]
  17. (hist) ‎Harvey; Hoeven; Lecerf ( Multiplication) ‎[325 bytes]
  18. (hist) ‎Covanov and Thomé ( Multiplication) ‎[325 bytes]
  19. (hist) ‎Kleinberg (Link Analysis Link Analysis) ‎[325 bytes]
  20. (hist) ‎Byskov ( 5 - Graph Coloring) ‎[325 bytes]
  21. (hist) ‎Byskov, Theorem 14 ( 6 - Graph Coloring) ‎[325 bytes]
  22. (hist) ‎Least recently used (Online Page Replacements) ‎[325 bytes]
  23. (hist) ‎L. Kitchen and A. Rosenfeld (Corner Detection Feature Detection) ‎[325 bytes]
  24. (hist) ‎François Le Gall (Matrix Multiplication Matrix Product) ‎[326 bytes]
  25. (hist) ‎Brute Force (1D Maximum Subarray Maximum Subarray Problem) ‎[326 bytes]
  26. (hist) ‎Bitap algorithm (Single String Search String Search) ‎[326 bytes]
  27. (hist) ‎Shamos; Hoey (2-dimensional space, Euclidean metric Closest Pair Problem) ‎[326 bytes]
  28. (hist) ‎Chu-Liu-Edmonds Algorithm (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST)) ‎[326 bytes]
  29. (hist) ‎Ahuja et al. ( Maximum Flow) ‎[326 bytes]
  30. (hist) ‎Smith (2-dimensional Maximum subarray problem) ‎[326 bytes]
  31. (hist) ‎Hoare's Selection Algorithm (QuickSelect) (kth Order Statistic kth Order Statistic) ‎[327 bytes]
  32. (hist) ‎Aasen's method (Non-Definite, Symmetric Matrix Linear System) ‎[327 bytes]
  33. (hist) ‎Shell Sort; (Pratt) (Comparison Sorting Sorting) ‎[327 bytes]
  34. (hist) ‎Liu (Decisional BCNF BCNF Decomposition) ‎[327 bytes]
  35. (hist) ‎SCAN (Disk Scheduling Disk Scheduling) ‎[327 bytes]
  36. (hist) ‎Gabow ( Maximum Flow) ‎[327 bytes]
  37. (hist) ‎Quick-Skip Searching (Single String Search String Search) ‎[327 bytes]
  38. (hist) ‎Bellare Active Learning (Entity Resolution Entity Resolution) ‎[327 bytes]
  39. (hist) ‎GSAT (CNF-SAT Boolean Satisfiability) ‎[327 bytes]
  40. (hist) ‎Iterative Deepening A* (IDA*) (Informed Search Informed Search) ‎[328 bytes]
  41. (hist) ‎Square-free factorization (Square-free Factorization of Polynomials Over Finite Fields) ‎[328 bytes]
  42. (hist) ‎Williams ( Online Matrix Vector Multiplication (OMV)) ‎[328 bytes]
  43. (hist) ‎Gao, Liu, Peng ( Maximum Flow) ‎[328 bytes]
  44. (hist) ‎Thorup (positive integer weights; assumes constant-time multiplication Shortest Path (Undirected graphs)) ‎[328 bytes]
  45. (hist) ‎Wu et al. (LCS Longest Common Subsequence) ‎[328 bytes]
  46. (hist) ‎Fourier–Motzkin elimination ( Linear Programming) ‎[329 bytes]
  47. (hist) ‎Shell Sort; (Shell) (Comparison Sorting Sorting) ‎[329 bytes]
  48. (hist) ‎Sleator & Tarjan ( Maximum Flow) ‎[329 bytes]
  49. (hist) ‎Bellman–Ford algorithm (Dantzig 1960) (Nonnegative Weights Shortest Path (Directed Graphs)) ‎[329 bytes]
  50. (hist) ‎Greedy Best-First Search (Informed Search Informed Search) ‎[329 bytes]
  51. (hist) ‎5-point SOR iteration (3-Dimensional Poisson Problem Poisson Problem) ‎[329 bytes]
  52. (hist) ‎5-point SOR iteration (2-Dimensional Poisson Problem Poisson Problem) ‎[329 bytes]
  53. (hist) ‎Hirschberg's algorithm (Edit sequence Sequence Alignment) ‎[329 bytes]
  54. (hist) ‎Outside-In algorithm (Turnpike Problem Turnpike Problem) ‎[330 bytes]
  55. (hist) ‎Shell Sort; (Frank & Lazarus) (Comparison Sorting Sorting) ‎[331 bytes]
  56. (hist) ‎Andrew's algorithm (2-dimensional Convex Hull) ‎[331 bytes]
  57. (hist) ‎Kalman Filter (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) ‎[331 bytes]
  58. (hist) ‎Nordbeck and Rystedt (Orientation) (Point-in-Polygon Point-in-Polygon) ‎[331 bytes]
  59. (hist) ‎Hu–Tucker algorithm (Alphabetic Tree Problem Optimal Binary Search Trees) ‎[331 bytes]
  60. (hist) ‎Priority Queue Algorithm (Duplicate Elimination Duplicate Elimination) ‎[331 bytes]
  61. (hist) ‎Focused D* ( Informed Search) ‎[331 bytes]
  62. (hist) ‎Brute force (2-dimensional Maximum subarray problem) ‎[331 bytes]
  63. (hist) ‎Simplified Memory-Bounded A* (SMA*) (Informed Search Informed Search) ‎[332 bytes]
  64. (hist) ‎Boman; Hendrickson (Inexact Laplacian Solver SDD Systems Solvers) ‎[332 bytes]
  65. (hist) ‎Kahn's algorithm (Topological Sorting Topological Sorting) ‎[332 bytes]
  66. (hist) ‎Gabow, Galil, Spencer (general Maximum-weight matching) ‎[332 bytes]
  67. (hist) ‎Reduction from Partial Match to OV ‎[332 bytes]
  68. (hist) ‎Reduction from OV to Partial Match ‎[332 bytes]
  69. (hist) ‎Visvalingam–Whyatt ( Line Simplification) ‎[333 bytes]
  70. (hist) ‎MKM Algorithm ( Maximum Flow) ‎[333 bytes]
  71. (hist) ‎Berkman; Vishkin (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) ‎[333 bytes]
  72. (hist) ‎Ravikumar & Cohen Generative Models (Entity Resolution Entity Resolution) ‎[333 bytes]
  73. (hist) ‎Aho, Garey & Ullman (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem) ‎[333 bytes]
  74. (hist) ‎Bird (1D Maximum Subarray Maximum Subarray Problem) ‎[334 bytes]
  75. (hist) ‎Wagner-Fischer algorithm (Edit sequence, constant-size alphabet Sequence Alignment) ‎[334 bytes]
  76. (hist) ‎Wagner-Fischer algorithm (Edit sequence Sequence Alignment) ‎[334 bytes]
  77. (hist) ‎N-Player ‎[335 bytes]
  78. (hist) ‎FASTA (Edit sequence, local alignment Sequence Alignment) ‎[335 bytes]
  79. (hist) ‎Hong’s algorithm (SCCs Strongly Connected Components) ‎[335 bytes]
  80. (hist) ‎FCFS (Disk Scheduling Disk Scheduling) ‎[335 bytes]
  81. (hist) ‎Fürer, Kasiviswanathan ( ‎[335 bytes]
  82. (hist) ‎Number Field Sieve (NFS) (Discrete Logarithm Over Finite Fields Logarithm Calculations) ‎[335 bytes]
  83. (hist) ‎Lemke-Howson Algorithm (2 player games Nash Equilibria) ‎[335 bytes]
  84. (hist) ‎Pferschy (Subset Sum The Subset-Sum Problem) ‎[336 bytes]
  85. (hist) ‎Wagner and Fischer (LCS Longest Common Subsequence) ‎[336 bytes]
  86. (hist) ‎The ultimate planar convex hull algorithm (2-dimensional Convex Hull) ‎[336 bytes]
  87. (hist) ‎Moravec's algorithm 1980 (Corner Detection Feature Detection) ‎[336 bytes]
  88. (hist) ‎A-Priori algorithm (Finding Frequent Itemsets Finding Frequent Itemsets) ‎[336 bytes]
  89. (hist) ‎Brent's algorithm ( Cycle Detection) ‎[336 bytes]
  90. (hist) ‎Two-pass algorithm ( Variance Calculations) ‎[336 bytes]
  91. (hist) ‎Karger; Klein & Tarjan (Undirected, General MST Minimum Spanning Tree (MST)) ‎[337 bytes]
  92. (hist) ‎Dial's Algorithm (nonnegative integer weights Shortest Path (Directed graphs)) ‎[337 bytes]
  93. (hist) ‎K Riesen (Inexact GED Graph Edit Distance Computation) ‎[337 bytes]
  94. (hist) ‎Binary representation search with matrix multiplication (Unweighted Graph Diameter) ‎[337 bytes]
  95. (hist) ‎Davis-Putnam-Logemann-Loveland Algorithm (DPLL) (CNF-SAT Boolean Satisfiability) ‎[337 bytes]
  96. (hist) ‎Exhaustive search (Minimum Wiener Connector problem Wiener Index) ‎[337 bytes]
  97. (hist) ‎Nordbeck and Rystedt (Grid Method) (Point-in-Polygon Point-in-Polygon) ‎[338 bytes]
  98. (hist) ‎Nordbeck and Rystedt (Sum of area) (Point-in-Polygon Point-in-Polygon) ‎[338 bytes]
  99. (hist) ‎Floyd's tortoise and hare algorithm ( Cycle Detection) ‎[338 bytes]
  100. (hist) ‎Min/max sketches streaming algorithm (streaming Cardinality Estimation) ‎[338 bytes]
  101. (hist) ‎McKay ( Graph Isomorphism Problem) ‎[338 bytes]
  102. (hist) ‎Baby-step Giant-step (Discrete Logarithm Over Finite Fields Logarithm Calculations) ‎[338 bytes]
  103. (hist) ‎Binary GCD algorithm (Greatest Common Divisor Greatest Common Divisor) ‎[338 bytes]
  104. (hist) ‎Family:Maximum Flow ‎[339 bytes]
  105. (hist) ‎Family:Closest Pair Problem ‎[339 bytes]
  106. (hist) ‎Klawe; Mumey (Alphabetic Tree Problem Optimal Binary Search Trees) ‎[339 bytes]
  107. (hist) ‎Romani's algorithm (Matrix Multiplication Matrix Product) ‎[339 bytes]
  108. (hist) ‎Lowe’s Algorithm (SCCs Strongly Connected Components) ‎[339 bytes]
  109. (hist) ‎Discrete Cosine Transform (Lossy Compression Data Compression) ‎[339 bytes]
  110. (hist) ‎Bottom-m sketches streaming algorithm (streaming Cardinality Estimation) ‎[339 bytes]
  111. (hist) ‎Naive (Constructing Suffix Trees Constructing Suffix Trees) ‎[339 bytes]
  112. (hist) ‎Galil & Naamad ( Maximum Flow) ‎[340 bytes]
  113. (hist) ‎Munro’s algorithm (SCCs Strongly Connected Components) ‎[340 bytes]
  114. (hist) ‎Painter's algorithm/Newell's algorithm ( Shown Surface Determination) ‎[340 bytes]
  115. (hist) ‎5-point Gauss Seidel iteration (3-Dimensional Poisson Problem Poisson Problem) ‎[340 bytes]
  116. (hist) ‎9-point ADI iteration (3-Dimensional Poisson Problem Poisson Problem) ‎[340 bytes]
  117. (hist) ‎9-point ADI iteration + smooth guess (3-Dimensional Poisson Problem Poisson Problem) ‎[340 bytes]
  118. (hist) ‎5-point cyclic reduction (3-Dimensional Poisson Problem Poisson Problem) ‎[340 bytes]
  119. (hist) ‎Online 2-d Convex Hull, Preparata (2-dimensional Convex Hull, Online Convex Hull) ‎[340 bytes]
  120. (hist) ‎Bergland; Glenn radix-8 algorithm (Discrete Fourier Transform Discrete Fourier Transform) ‎[340 bytes]
  121. (hist) ‎5-point Gauss Seidel iteration (2-Dimensional Poisson Problem Poisson Problem) ‎[340 bytes]
  122. (hist) ‎9-point ADI iteration (2-Dimensional Poisson Problem Poisson Problem) ‎[340 bytes]
  123. (hist) ‎9-point ADI iteration + smooth guess (2-Dimensional Poisson Problem Poisson Problem) ‎[340 bytes]
  124. (hist) ‎5-point cyclic reduction (2-Dimensional Poisson Problem Poisson Problem) ‎[340 bytes]
  125. (hist) ‎Lipton, Markakis and Mehta method (2 player games Nash Equilibria) ‎[340 bytes]
  126. (hist) ‎Karger, Blum ( Graph Coloring) ‎[341 bytes]
  127. (hist) ‎Flipping algorithm (2-Dimensional Delaunay Triangulation Delaunay Triangulation) ‎[341 bytes]
  128. (hist) ‎Zamir ( 6 - Graph Coloring) ‎[341 bytes]
  129. (hist) ‎Muzychuk (Circulant graphs Graph Isomorphism Problem) ‎[341 bytes]
  130. (hist) ‎Johnson (Edmonds-Karp-based) (bipartite (i.e. assignment), general Maximum-weight matching) ‎[341 bytes]
  131. (hist) ‎Gabow (general Maximum-weight matching) ‎[341 bytes]
  132. (hist) ‎Family:Matrix Product ‎[342 bytes]
  133. (hist) ‎Fortune (2-Dimensional Delaunay Triangulation Delaunay Triangulation) ‎[342 bytes]
  134. (hist) ‎Maybeck; Peter S Extended Kalman Filter (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) ‎[342 bytes]
  135. (hist) ‎Chubby (Mike Burrows) (Distributed Locking Algorithms Distributed Locking Algorithms) ‎[342 bytes]
  136. (hist) ‎Zamir ( 5 - Graph Coloring) ‎[342 bytes]
  137. (hist) ‎Babai ( Graph Isomorphism Problem) ‎[342 bytes]
  138. (hist) ‎Function Field Sieve (FFS) (Discrete Logarithm Over Finite Fields Logarithm Calculations) ‎[342 bytes]
  139. (hist) ‎Johnson; D. S.; McGeoch; L. A. ( The Traveling-Salesman Problem) ‎[343 bytes]
  140. (hist) ‎K. Mikolajczyk; K. and C. Schmid LoG 2004 (Corner Detection Feature Detection) ‎[343 bytes]
  141. (hist) ‎Katajainen and M. Koppinen ( Delaunay Triangulation) ‎[343 bytes]
  142. (hist) ‎Saalfeld (Sign of offset) (Point-in-Polygon Point-in-Polygon) ‎[343 bytes]
  143. (hist) ‎Gabow, Galil, Spencer (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST)) ‎[343 bytes]
  144. (hist) ‎Naive algorithm (Line Drawing Line Drawing) ‎[343 bytes]
  145. (hist) ‎Digital Differential Analyzer (Line Drawing Line Drawing) ‎[343 bytes]
  146. (hist) ‎Exhaustive search (The Vertex Cover Problem The Vertex Cover Problem) ‎[343 bytes]
  147. (hist) ‎Shell Sort (Sedgewick) (Comparison Sorting Sorting) ‎[343 bytes]
  148. (hist) ‎Vassilevska Williams (Matrix Multiplication Matrix Product) ‎[344 bytes]
  149. (hist) ‎Nicholl–Lee–Nicholl (Rectangular Window Line Clipping) ‎[344 bytes]
  150. (hist) ‎D* (Informed Search Informed Search) ‎[344 bytes]
  151. (hist) ‎5-point ADI iteration (3-Dimensional Poisson Problem Poisson Problem) ‎[344 bytes]
  152. (hist) ‎Goldberg & Rao (Parallel) (Integer Maximum Flow Maximum Flow) ‎[344 bytes]
  153. (hist) ‎5-point ADI iteration (2-Dimensional Poisson Problem Poisson Problem) ‎[344 bytes]
  154. (hist) ‎Jump Point Search (JPS) (Informed Search Informed Search) ‎[345 bytes]
  155. (hist) ‎Graham (2-dimensional Convex Hull) ‎[345 bytes]
  156. (hist) ‎Gabow's algorithm (Nonnegative Weights Shortest Path (Directed Graphs)) ‎[345 bytes]
  157. (hist) ‎Integer linear program Vazirani (Unweighted Set-Covering; Weighted Set-Covering The Set-Covering Problem) ‎[345 bytes]
  158. (hist) ‎Lokshtanov (Subset Sum The Subset-Sum Problem) ‎[346 bytes]
  159. (hist) ‎Liang–Barsky (Rectangular Window Line Clipping) ‎[346 bytes]
  160. (hist) ‎Naive algorithm (2-Dimensional Delaunay Triangulation Delaunay Triangulation) ‎[346 bytes]
  161. (hist) ‎SSTF (Disk Scheduling Disk Scheduling) ‎[346 bytes]
  162. (hist) ‎The (Hyperlink-Induced Topic Search) HITS Algorithm (Link Analysis Link Analysis) ‎[346 bytes]
  163. (hist) ‎Vaidya ( Linear Programming) ‎[346 bytes]
  164. (hist) ‎Von zur Gathen-Gerhard additive FFT (Discrete Fourier Transform Discrete Fourier Transform) ‎[346 bytes]
  165. (hist) ‎Path-based strong components algorithm; Dijkstra (SCCs Strongly Connected Components) ‎[347 bytes]
  166. (hist) ‎FOGSAA (Edit sequence, global alignment Sequence Alignment) ‎[347 bytes]
  167. (hist) ‎Korada and R. Urbanke; (Lossy Compression Data Compression) ‎[347 bytes]
  168. (hist) ‎Backward Non-Deterministic DAWG Matching (BNDM) (Single String Search String Search) ‎[347 bytes]
  169. (hist) ‎Heap's algorithm (All Permutations All Permutations) ‎[347 bytes]
  170. (hist) ‎Lemke–Howson algorithm (2-player Nash Equilibria) ‎[347 bytes]
  171. (hist) ‎Naive algorithm (Discrete Fourier Transform Discrete Fourier Transform) ‎[347 bytes]
  172. (hist) ‎Bentley–Ottmann algorithm (Reporting all intersection points, line segments Line segment intersection) ‎[348 bytes]
  173. (hist) ‎Balaban. (Reporting all intersection points, generalized segments Line segment intersection) ‎[348 bytes]
  174. (hist) ‎J.-C. Nebel 1998 ( Ray Tracing) ‎[348 bytes]
  175. (hist) ‎Particle filter Del Moral (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) ‎[348 bytes]
  176. (hist) ‎Bellman Value Iteration (VI) (Optimal Policies for MDPs Optimal Policies for MDPs) ‎[348 bytes]
  177. (hist) ‎Rautiainen and Marschall (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) ‎[348 bytes]
  178. (hist) ‎Reumann–Witkam ( Line Simplification) ‎[349 bytes]
  179. (hist) ‎Cube Sort Parallel Implementation (Comparison Sorting Sorting) ‎[349 bytes]
  180. (hist) ‎Randomized HITS (Link Analysis Link Analysis) ‎[349 bytes]
  181. (hist) ‎Preparata and Shamos (Wedge) (Point-in-Polygon Point-in-Polygon) ‎[349 bytes]
  182. (hist) ‎Babai and Luks (Graph Isomorphism, General Graphs Graph Isomorphism Problem) ‎[349 bytes]
  183. (hist) ‎Calvetti, Reichel (2-D Polynomial Interpolation Polynomial Interpolation) ‎[349 bytes]
  184. (hist) ‎Serang (Subset Sum The Subset-Sum Problem) ‎[350 bytes]
  185. (hist) ‎Chazelle & Edelsbrunner (Reporting all intersection points, line segments Line segment intersection) ‎[350 bytes]
  186. (hist) ‎Chan's algorithm (2-dimensional; 3-dimensional Convex Hull) ‎[350 bytes]
  187. (hist) ‎Yao's algorithm (Undirected, General MST Minimum Spanning Tree (MST)) ‎[350 bytes]
  188. (hist) ‎Cocke–Younger–Kasami algorithm (CFG Recognition CFG Problems) ‎[350 bytes]
  189. (hist) ‎Yavne Split Radix FFT algorithm (Discrete Fourier Transform Discrete Fourier Transform) ‎[350 bytes]
  190. (hist) ‎Takaoka (2-dimensional Maximum subarray problem) ‎[350 bytes]
  191. (hist) ‎Treap ( Self-Balancing Trees Creation) ‎[350 bytes]
  192. (hist) ‎Fagin (4NF Decomposition for Functional and Multivalued Dependency Sets 4NF Decomposition) ‎[350 bytes]
  193. (hist) ‎Family:Stable Matching Problem ‎[351 bytes]
  194. (hist) ‎Karzanov ( Maximum Flow) ‎[351 bytes]
  195. (hist) ‎Coppersmith–Winograd algorithm (Matrix Multiplication Matrix Product) ‎[351 bytes]
  196. (hist) ‎Bellman dynamic programming algorithm (Subset Sum The Subset-Sum Problem) ‎[351 bytes]
  197. (hist) ‎Williams' p + 1 algorithm (First Category Integer Factoring Integer Factoring) ‎[351 bytes]
  198. (hist) ‎Fermat's factorization method (First Category Integer Factoring Integer Factoring) ‎[351 bytes]
  199. (hist) ‎Ferreira, Camargo, Song (1D Maximum Subarray Maximum Subarray Problem) ‎[351 bytes]
  200. (hist) ‎Trujillo and Olague 2008 (Corner Detection Feature Detection) ‎[351 bytes]
  201. (hist) ‎Extended Split Radix FFT algorithm (Discrete Fourier Transform Discrete Fourier Transform) ‎[351 bytes]
  202. (hist) ‎Horowitz and Sahni (Subset Sum The Subset-Sum Problem) ‎[352 bytes]
  203. (hist) ‎Preparata and Shamos (Intersection sum of angle) (Point-in-Polygon Point-in-Polygon) ‎[352 bytes]
  204. (hist) ‎Chan (Boolean Matrix Multiplication (Combinatorial) Matrix Product) ‎[352 bytes]
  205. (hist) ‎Kathuria, Liu, Sidford ( Maximum Flow) ‎[352 bytes]
  206. (hist) ‎Rader–Brenner algorithm (Discrete Fourier Transform Discrete Fourier Transform) ‎[352 bytes]
  207. (hist) ‎Ukkonen and D. Wood (Constructing Suffix Trees Constructing Suffix Trees) ‎[352 bytes]
  208. (hist) ‎Lehmer's GCD algorithm (Greatest Common Divisor Greatest Common Divisor) ‎[352 bytes]
  209. (hist) ‎Flash Sort (Non-Comparison Sorting Sorting) ‎[353 bytes]
  210. (hist) ‎N-dimensional Quickhull (d-dimensional Convex Hull Convex Hull) ‎[353 bytes]
  211. (hist) ‎Tarjan's DFS based algorithm (Topological Sorting Topological Sorting) ‎[353 bytes]
  212. (hist) ‎Anytime Dynamic A* (ADA*) ( Informed Search) ‎[353 bytes]
  213. (hist) ‎Babai 1980 (Graph Isomporhism, Trivalent Graphs Graph Isomorphism Problem) ‎[353 bytes]
  214. (hist) ‎AVL Tree ( Self-Balancing Trees Search) ‎[353 bytes]
  215. (hist) ‎Chan (Geometrically Weighted) (APSP on Geometrically Weighted Graphs All-Pairs Shortest Paths (APSP)) ‎[354 bytes]
  216. (hist) ‎Block A* (Informed Search Informed Search) ‎[354 bytes]
  217. (hist) ‎Prakesh Ramanan (Approximate MCOP Matrix Chain Multiplication) ‎[354 bytes]
  218. (hist) ‎Aho, Hopcroft, and Ullman (Linking) (Lowest Common Ancestor with Linking Lowest Common Ancestor) ‎[354 bytes]
  219. (hist) ‎Heap Sort (Comparison Sorting Sorting) ‎[355 bytes]
  220. (hist) ‎Crout and LUP algorithms (Square Matrix LU Decomposition LU Decomposition) ‎[355 bytes]
  221. (hist) ‎Matsunaga; Yamamoto (Lossy Compression Data Compression) ‎[355 bytes]
  222. (hist) ‎Bansal, Williams (Boolean Matrix Multiplication (Combinatorial) Matrix Product) ‎[355 bytes]
  223. (hist) ‎Jacobi eigenvalue algorithm (All eigenvalues; Any eigenvalue Eigenvalues (Iterative Methods)) ‎[355 bytes]
  224. (hist) ‎Hopcroft 2-3 Tree ( Self-Balancing Trees Search) ‎[355 bytes]
  225. (hist) ‎Family:Strongly Connected Components ‎[356 bytes]
  226. (hist) ‎Gabow Ahuja Algorithm (Nonnegative Integer Weights Shortest Path (Directed Graphs)) ‎[356 bytes]
  227. (hist) ‎Arbitrator solution (Dining Philosophers Problem Deadlock Avoidance) ‎[356 bytes]
  228. (hist) ‎Berlekamp–Massey algorithm (Cryptanalysis of Linear Feedback Shift Registers Cryptanalysis of Linear Feedback Shift Registers) ‎[356 bytes]
  229. (hist) ‎Howard Policy Iteration (PI) (Optimal Policies for MDPs Optimal Policies for MDPs) ‎[356 bytes]
  230. (hist) ‎Mitzenmacher & Upfal (Maximum Cut, Approximate Maximum Cut) ‎[356 bytes]
  231. (hist) ‎Babai 1980 (Graph Isomorphism, Bounded Vertex Valences Graph Isomorphism Problem) ‎[356 bytes]
  232. (hist) ‎Anytime Repairing A* (ARA*) (Informed Search Informed Search) ‎[357 bytes]
  233. (hist) ‎Floyd–Warshall algorithm (APSP All-Pairs Shortest Paths (APSP)) ‎[357 bytes]
  234. (hist) ‎Hirschberg (LCS Longest Common Subsequence) ‎[357 bytes]
  235. (hist) ‎Greedy Algorithm ( The Set-Covering Problem) ‎[357 bytes]
  236. (hist) ‎Tamaki, Tokuyama (approximate) (2-dimensional Maximum subarray problem) ‎[357 bytes]
  237. (hist) ‎Lipton, Markakis and Mehta method 2 (n player games Nash Equilibria) ‎[357 bytes]
  238. (hist) ‎Valentin Polishchuk, and Jukka Suomela (Almost Stable Marriage Problem Stable Matching Problem) ‎[358 bytes]
  239. (hist) ‎Lawrence, Reilly (Motif Search Motif Search) ‎[358 bytes]
  240. (hist) ‎Needleman–Wunsch algorithm (Edit sequence, global alignment Sequence Alignment) ‎[358 bytes]
  241. (hist) ‎Salomon (Swath Method) (Point-in-Polygon Point-in-Polygon) ‎[358 bytes]
  242. (hist) ‎Jain, Chang (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) ‎[358 bytes]
  243. (hist) ‎Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Creation) ‎[358 bytes]
  244. (hist) ‎Ord-Smith ( All permutations) ‎[358 bytes]
  245. (hist) ‎Renault’s Algorithm (SCCs Strongly Connected Components) ‎[359 bytes]
  246. (hist) ‎Dynamic 2-d Convex Hull, Overmars and van Leeuwen (2-dimensional Convex Hull, Dynamic Convex Hull) ‎[359 bytes]
  247. (hist) ‎Gentleman; Morven and Gordon Sande radix-4 algorithm (Discrete Fourier Transform Discrete Fourier Transform) ‎[359 bytes]
  248. (hist) ‎AVL Tree ( Self-Balancing Trees Insertion) ‎[359 bytes]
  249. (hist) ‎Family:Vertex Reachability ‎[360 bytes]
  250. (hist) ‎Tarjan (directed, general) (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST)) ‎[360 bytes]
  251. (hist) ‎Tarjan (directed, dense) (Directed (Optimum Branchings), Super Dense MST Minimum Spanning Tree (MST)) ‎[360 bytes]
  252. (hist) ‎Tompkins–Paige algorithm (All Permutations All Permutations) ‎[360 bytes]
  253. (hist) ‎Inverse iteration (Eigenpair closest to mu; Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods)) ‎[360 bytes]
  254. (hist) ‎Lucifer / DES (Block Ciphers Block Ciphers) ‎[360 bytes]
  255. (hist) ‎Grahne and Räihä (4NF Decomposition for Functional and Multivalued Dependency Sets 4NF Decomposition) ‎[360 bytes]
  256. (hist) ‎Shell Sort; (Sedgewick) (Comparison Sorting Sorting) ‎[361 bytes]
  257. (hist) ‎Leases (Cary G Gray and David R Cheriton) (Distributed Locking Algorithms Distributed Locking Algorithms) ‎[361 bytes]
  258. (hist) ‎QR algorithm (All eigenvalues; Any eigenvalue Eigenvalues (Iterative Methods)) ‎[361 bytes]
  259. (hist) ‎Farach (Constructing Suffix Trees Constructing Suffix Trees) ‎[361 bytes]
  260. (hist) ‎Hopcroft 2-3 Tree ( Self-Balancing Trees Insertion) ‎[361 bytes]
  261. (hist) ‎Ford & Fulkerson ( Maximum Flow) ‎[362 bytes]
  262. (hist) ‎Smith–Waterman algorithm (Edit sequence, local alignment Sequence Alignment) ‎[362 bytes]
  263. (hist) ‎Wheel factorization (First Category Integer Factoring Integer Factoring) ‎[362 bytes]
  264. (hist) ‎Resource hierarchy solution (Dining Philosophers Problem Deadlock Avoidance) ‎[362 bytes]
  265. (hist) ‎Manlove; Malley (Stable Marriage Problem Stable Matching Problem) ‎[362 bytes]
  266. (hist) ‎Lee, Sidford ( Maximum Flow) ‎[362 bytes]
  267. (hist) ‎Eppstein ( Chromatic Number) ‎[362 bytes]
  268. (hist) ‎Modified Knuth's DP algorithm (OBST Optimal Binary Search Trees) ‎[362 bytes]
  269. (hist) ‎Knuth's DP algorithm (OBST Optimal Binary Search Trees) ‎[362 bytes]
  270. (hist) ‎Greiner–Hormann clipping algorithm (Polygon Clipping with Arbitrary Clipping Polygon Polygon Clipping) ‎[362 bytes]
  271. (hist) ‎Vatti clipping algorithm (Polygon Clipping with Arbitrary Clipping Polygon Polygon Clipping) ‎[362 bytes]
  272. (hist) ‎Stephen Alstrup, Cyril Gavoille, Haim Kaplan & Theis Rauhe (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) ‎[362 bytes]
  273. (hist) ‎X Chen (Exact GED Graph Edit Distance Computation) ‎[362 bytes]
  274. (hist) ‎Sorted Neighborhood Algorithm (SNA) (Duplicate Elimination Duplicate Elimination) ‎[362 bytes]
  275. (hist) ‎Rivin, Zabih (Counting Solutions n-Queens Problem) ‎[362 bytes]
  276. (hist) ‎A* Algorithm (Informed Search Informed Search) ‎[363 bytes]
  277. (hist) ‎Altschul and Erickson (Edit sequence, local alignment Sequence Alignment) ‎[363 bytes]
  278. (hist) ‎David Sankoff (Edit sequence, global alignment Sequence Alignment) ‎[363 bytes]
  279. (hist) ‎Pollard's rho algorithm (First Category Integer Factoring Integer Factoring) ‎[363 bytes]
  280. (hist) ‎Yu (Boolean Matrix Multiplication (Combinatorial) Matrix Product) ‎[363 bytes]
  281. (hist) ‎Alman, Vassilevska Williams ( Matrix Multiplication) ‎[363 bytes]
  282. (hist) ‎Neuhaus, Riesen, Bunke (Inexact GED Graph Edit Distance Computation) ‎[363 bytes]
  283. (hist) ‎Sleator and Tarjan (Linking and Cutting) (Lowest Common Ancestor with Linking and Cutting Lowest Common Ancestor) ‎[363 bytes]
  284. (hist) ‎Sleator and Tarjan (Linking) (Lowest Common Ancestor with Linking Lowest Common Ancestor) ‎[363 bytes]
  285. (hist) ‎Tango Tree ( Self-Balancing Trees Creation) ‎[363 bytes]
  286. (hist) ‎OBF Algorithm (SCCs Strongly Connected Components) ‎[364 bytes]
  287. (hist) ‎Cheriton-Tarjan Algorithm (Undirected, General MST Minimum Spanning Tree (MST)) ‎[364 bytes]
  288. (hist) ‎Dijkstra's algorithm with binary heap (Johnson 1977) (Nonnegative Weights Shortest Path (Directed Graphs)) ‎[364 bytes]
  289. (hist) ‎Binary space partitioning (BSP) ( Shown Surface Determination) ‎[364 bytes]
  290. (hist) ‎Liang Cwinnower ( Motif Search) ‎[364 bytes]
  291. (hist) ‎Madry ( Maximum Flow) ‎[364 bytes]
  292. (hist) ‎Two-way String-Matching Algorithm (Single String Search String Search) ‎[364 bytes]
  293. (hist) ‎Babai (Graph Isomorphism, Bounded Number of Vertices of Each Color Graph Isomorphism Problem) ‎[364 bytes]
  294. (hist) ‎Aho, Hopcroft, and Ullman (Static Trees) (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) ‎[364 bytes]
  295. (hist) ‎Liang Cwinnower (Motif Search Motif Search) ‎[364 bytes]
  296. (hist) ‎Quick Sort (Comparison Sorting Sorting) ‎[365 bytes]
  297. (hist) ‎Paul Purdom (Transitive Closure Strongly Connected Components) ‎[365 bytes]
  298. (hist) ‎Field D* (Informed Search Informed Search) ‎[365 bytes]
  299. (hist) ‎Galil ( Maximum Flow) ‎[365 bytes]
  300. (hist) ‎Mucha, Sankowski (general) (General Graph MCM Maximum Cardinality Matching) ‎[365 bytes]
  301. (hist) ‎Cherkassky ( Maximum Flow) ‎[366 bytes]
  302. (hist) ‎James B Orlin's + KRT (King; Rao; Tarjan)'s algorithm (st-Maximum Flow Maximum Flow) ‎[366 bytes]
  303. (hist) ‎The Multihash Algorithm (Finding Frequent Itemsets Finding Frequent Itemsets) ‎[366 bytes]
  304. (hist) ‎The Multistage Algorithm (Finding Frequent Itemsets Finding Frequent Itemsets) ‎[366 bytes]
  305. (hist) ‎Cardoso; Nuno; Abreu; Rui ( The Set-Covering Problem) ‎[366 bytes]
  306. (hist) ‎The INDEGREE Algorithm (InDegree Analysis Link Analysis) ‎[366 bytes]
  307. (hist) ‎Vaidya (Inexact Laplacian Solver SDD Systems Solvers) ‎[366 bytes]
  308. (hist) ‎Roth AlignACE (Motif Search Motif Search) ‎[367 bytes]
  309. (hist) ‎Kosaraju's algorithm (SCCs Strongly Connected Components) ‎[367 bytes]
  310. (hist) ‎Sinha S; Tompa M YMF (Yeast Motif Finder) ( Motif Search) ‎[367 bytes]
  311. (hist) ‎Sagot M ( Motif Search) ‎[367 bytes]
  312. (hist) ‎Priority scheduling (Unweighted Interval Scheduling, Online?? Interval Scheduling) ‎[367 bytes]
  313. (hist) ‎Wells ( All permutations) ‎[367 bytes]
  314. (hist) ‎Priority scheduling (Unweighted Interval Scheduling, Online Interval Scheduling) ‎[367 bytes]
  315. (hist) ‎Sinha S; Tompa M YMF (Yeast Motif Finder) (Motif Search Motif Search) ‎[367 bytes]
  316. (hist) ‎MotifSampler (Motif Search Motif Search) ‎[368 bytes]
  317. (hist) ‎Edmonds & Karp ( Maximum Flow) ‎[368 bytes]
  318. (hist) ‎Fast clipping (Rectangular Window Line Clipping) ‎[368 bytes]
  319. (hist) ‎Rabin–Scott powerset construction ( NFA to DFA conversion) ‎[368 bytes]
  320. (hist) ‎Koiliaris and Xu (Subset Sum The Subset-Sum Problem) ‎[368 bytes]
  321. (hist) ‎Shimbel Algorithm (APSP on Dense Directed Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP)) ‎[368 bytes]
  322. (hist) ‎Probabilistic Convolution Tree (Change-Making Problem Change-Making Problem) ‎[368 bytes]
  323. (hist) ‎Schlimmer (Functional Dependency Inference Problem Dependency Inference Problem) ‎[368 bytes]
  324. (hist) ‎Lipton; Mehta (2-player Nash Equilibria) ‎[368 bytes]
  325. (hist) ‎Kong and Wilken Algorithm (Global Register Allocation Register Allocation) ‎[368 bytes]
  326. (hist) ‎David Eppstein, Maarten Löffler, Darren Strash (Enumerating Maximal Cliques, arbitrary graph Clique Problems) ‎[368 bytes]
  327. (hist) ‎Held–Karp algorithm (Minimum TSP The Traveling-Salesman Problem) ‎[368 bytes]
  328. (hist) ‎Sethi–Ullman Algorithm (Arithmetic Expression Binary Tree AST to Code Translation) ‎[368 bytes]
  329. (hist) ‎Pisinger (Subset Sum The Subset-Sum Problem) ‎[369 bytes]
  330. (hist) ‎Strassen's algorithm (Matrix Multiplication Matrix Product) ‎[369 bytes]
  331. (hist) ‎Psinger (Subset Sum The Subset-Sum Problem) ‎[369 bytes]
  332. (hist) ‎Chen; I. Kanj; and W. Jia. (The Vertex Cover Problem The Vertex Cover Problem) ‎[369 bytes]
  333. (hist) ‎Gapped BLAST (Edit Sequence, constant-size alphabet Sequence Alignment) ‎[369 bytes]
  334. (hist) ‎Basic Local Alignment Search Tool (BLAST) (Edit Sequence, constant-size alphabet Sequence Alignment) ‎[369 bytes]
  335. (hist) ‎V-ALIGN (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) ‎[369 bytes]
  336. (hist) ‎Pan's algorithm (Matrix Multiplication Matrix Product) ‎[370 bytes]
  337. (hist) ‎Cyrus–Beck (Convex Polygonal Window; Convex Polyhedral window Line Clipping) ‎[370 bytes]
  338. (hist) ‎HORMANN K.; GREINER G 1999 (Mesh Parameterization Mesh Parameterization) ‎[370 bytes]
  339. (hist) ‎Patrick Posser (Stable Roommates Problem Stable Matching Problem) ‎[370 bytes]
  340. (hist) ‎Bisection method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations) ‎[370 bytes]
  341. (hist) ‎Regula Falsi method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations) ‎[370 bytes]
  342. (hist) ‎The theoretically optimal page replacement algorithm (Offline Page Replacements) ‎[370 bytes]
  343. (hist) ‎Fischer, Heun (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) ‎[370 bytes]
  344. (hist) ‎Sagot M (Motif Search Motif Search) ‎[370 bytes]
  345. (hist) ‎Klinz (Subset Sum The Subset-Sum Problem) ‎[371 bytes]
  346. (hist) ‎Zhao-Saalfeld ( Line Simplification) ‎[371 bytes]
  347. (hist) ‎Bellman–Ford algorithm (Ford 1956) (general weights Shortest Path (Directed Graphs)) ‎[371 bytes]
  348. (hist) ‎Bellman–Ford algorithm (Shimbel 1955; Bellman 1958; Moore 1959) (general weights Shortest Path (Directed Graphs)) ‎[371 bytes]
  349. (hist) ‎Reduction from Negative Triangle Detection to Matrix Product Verification ‎[371 bytes]
  350. (hist) ‎Garsia–Wachs algorithm (Alphabetic Tree Problem Optimal Binary Search Trees) ‎[371 bytes]
  351. (hist) ‎Moore's algorithm (DFA Minimization DFA Minimization) ‎[371 bytes]
  352. (hist) ‎Stege, Fellows + Interleaving method (Niedermeier, Rossmanith) (The Vertex Cover Problem The Vertex Cover Problem) ‎[371 bytes]
  353. (hist) ‎Mitra (Motif Search Motif Search) ‎[372 bytes]
  354. (hist) ‎Apostolico and Guerra (HS1 Algorithm) (LCS Longest Common Subsequence) ‎[372 bytes]
  355. (hist) ‎Schieber; Vishkin (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) ‎[372 bytes]
  356. (hist) ‎Gent; I.P.; Irving; R.W.; Manlove; D.F.; Prosser; P.; Smith; B.M. (Stable Marriage Problem Stable Matching Problem) ‎[372 bytes]
  357. (hist) ‎Tree-structured vector quantization Wei-Levoy (Texture Synthesis Texture Synthesis) ‎[373 bytes]
  358. (hist) ‎Bjorck-Pereyra (Vandermonde Matrix Linear System) ‎[373 bytes]
  359. (hist) ‎K-d Tree (Nearest Neighbor Search (NNS) Nearest Neighbor Search) ‎[373 bytes]
  360. (hist) ‎Faster Brute Force (via x(L:U) = x(L:U-1)+x(U)) (1D Maximum Subarray Maximum Subarray Problem) ‎[373 bytes]
  361. (hist) ‎Gaussian Elimination (Exact Laplacian Solver SDD Systems Solvers) ‎[373 bytes]
  362. (hist) ‎Grigoryan (n-Queens Completion n-Queens Problem) ‎[374 bytes]
  363. (hist) ‎Bentley (k-dimensional space, l m (or l infty) norm Closest Pair Problem) ‎[374 bytes]
  364. (hist) ‎Bentley; Shamos (k-dimensional space, l m (or l infty) norm Closest Pair Problem) ‎[374 bytes]
  365. (hist) ‎Apostolico and Guerra (Algorithm 2) (LCS Longest Common Subsequence) ‎[374 bytes]
  366. (hist) ‎Drysdale; Su (2-Dimensional Delaunay Triangulation Delaunay Triangulation) ‎[374 bytes]
  367. (hist) ‎Gale–Shapley algorithm (Stable Marriage Problem Stable Matching Problem) ‎[374 bytes]
  368. (hist) ‎Shor's algorithm Quantum Implementation (Second Category Integer Factoring Integer Factoring) ‎[374 bytes]
  369. (hist) ‎Hopcroft's algorithm (DFA Minimization DFA Minimization) ‎[374 bytes]
  370. (hist) ‎Tomita; Tanaka & Takahashi (Enumerating Maximal Cliques, arbitrary graph Clique Problems) ‎[374 bytes]
  371. (hist) ‎BLAKE2 (Optional Key? One-Way Hash Functions) ‎[374 bytes]
  372. (hist) ‎Bentley (2-dimensional Maximum subarray problem) ‎[374 bytes]
  373. (hist) ‎Thorup (reverse-delete) (Undirected, General MST Minimum Spanning Tree (MST)) ‎[375 bytes]
  374. (hist) ‎Achlioptas (Link Analysis Link Analysis) ‎[375 bytes]
  375. (hist) ‎Bjorklund, Husfeldt, Proposition 2 ( 5 - Graph Coloring) ‎[375 bytes]
  376. (hist) ‎Bjorklund, Husfeldt, Proposition 2 ( 6 - Graph Coloring) ‎[375 bytes]
  377. (hist) ‎Bjorklund, Husfeldt, Proposition 2 ( Chromatic Number) ‎[375 bytes]
  378. (hist) ‎Brandes (Unweighted Betweenness Centrality (BC)) ‎[375 bytes]
  379. (hist) ‎Nakatsu et al. (LCS Longest Common Subsequence) ‎[375 bytes]
  380. (hist) ‎Bruun's FFT algorithm (Discrete Fourier Transform Discrete Fourier Transform) ‎[375 bytes]
  381. (hist) ‎Lawler (4-Graph Coloring Graph Coloring) ‎[376 bytes]
  382. (hist) ‎Harrow (Quantum) (Sparse Linear System Linear System) ‎[376 bytes]
  383. (hist) ‎Pearce (SCCs Strongly Connected Components) ‎[376 bytes]
  384. (hist) ‎Dwyer (higher dimensions) (General Delaunay Triangulation (d-dimensions) Delaunay Triangulation) ‎[376 bytes]
  385. (hist) ‎Subgradient method (General, Constrained optimization Convex Optimization (Non-linear)) ‎[376 bytes]
  386. (hist) ‎Weiner's algorithm (Constructing Suffix Trees Constructing Suffix Trees) ‎[376 bytes]
  387. (hist) ‎McCreight (Constructing Suffix Trees Constructing Suffix Trees) ‎[376 bytes]
  388. (hist) ‎EM Based Winkler (Entity Resolution Entity Resolution) ‎[376 bytes]
  389. (hist) ‎Scapegoat Tree ( Self-Balancing Trees Creation) ‎[376 bytes]
  390. (hist) ‎Gotoh (Edit sequence, local alignment Sequence Alignment) ‎[377 bytes]
  391. (hist) ‎Dantzig-Fulkerson-Johnson (DFJ) formulation (Minimum TSP The Traveling-Salesman Problem) ‎[377 bytes]
  392. (hist) ‎Gries (1D Maximum Subarray Maximum Subarray Problem) ‎[377 bytes]
  393. (hist) ‎Irving's Algorithm (Stable Roommates Problem Stable Matching Problem) ‎[377 bytes]
  394. (hist) ‎S. S. TSENG and R. C. T. LEE (Stable Marriage Problem Stable Matching Problem) ‎[377 bytes]
  395. (hist) ‎Jeuring (Longest Palindromic Substring Longest Palindromic Substring) ‎[377 bytes]
  396. (hist) ‎Boolean Matrix Multiplication Hypothesis (BMM Hypothesis) ‎[378 bytes]
  397. (hist) ‎Hirschberg's algorithm (Edit sequence, constant-size alphabet Sequence Alignment) ‎[378 bytes]
  398. (hist) ‎Fleischer forward-backward (FB) algorithm (SCCs Strongly Connected Components) ‎[378 bytes]
  399. (hist) ‎Shanks's square forms factorization (SQUFOF) (Second Category Integer Factoring Integer Factoring) ‎[378 bytes]
  400. (hist) ‎The Algorithm of Park; Chen; and Yu (PCY) (Finding Frequent Itemsets Finding Frequent Itemsets) ‎[378 bytes]
  401. (hist) ‎Van Helden J; Rios AF; Collado-Vides J ( Motif Search) ‎[378 bytes]
  402. (hist) ‎Peterson's algorithm ( Mutual Exclusion) ‎[378 bytes]
  403. (hist) ‎Naive algorithm ( Minimum value in each row of an implicitly-defined totally monotone matrix) ‎[378 bytes]
  404. (hist) ‎Gao’s additive FFT (Discrete Fourier Transform Discrete Fourier Transform) ‎[378 bytes]
  405. (hist) ‎Recursion based (Tower of Hanoi Tower of Hanoi) ‎[378 bytes]
  406. (hist) ‎Van Helden J; Rios AF; Collado-Vides J (Motif Search Motif Search) ‎[378 bytes]
  407. (hist) ‎Conjugate Gradient (Approximation? with positive definite matrix Linear System) ‎[379 bytes]
  408. (hist) ‎F. Preparata and M. Shamos (k-dimensional space, l m (or l infty) norm Closest Pair Problem) ‎[379 bytes]
  409. (hist) ‎Hinrichs; Nievergelt; Schorn (2-dimensional space, l m (or l infty) norm Closest Pair Problem) ‎[379 bytes]
  410. (hist) ‎Dijkstra's algorithm with list (Whiting & Hillier 1960) (Nonnegative Weights Shortest Path (Directed Graphs)) ‎[379 bytes]
  411. (hist) ‎Seidel's algorithm (APSP on Dense Undirected Unweighted Graphs; APSP on Sparse Undirected Unweighted Graphs All-Pairs Shortest Paths (APSP)) ‎[379 bytes]
  412. (hist) ‎Rick (LCS Longest Common Subsequence) ‎[379 bytes]
  413. (hist) ‎Christofides ( Chromatic Number) ‎[379 bytes]
  414. (hist) ‎Bron–Kerbosch algorithm (Enumerating Maximal Cliques, arbitrary graph Clique Problems) ‎[379 bytes]
  415. (hist) ‎Higham (2-D Polynomial Interpolation Polynomial Interpolation) ‎[379 bytes]
  416. (hist) ‎Family:Minimum Spanning Tree (MST) ‎[380 bytes]
  417. (hist) ‎Epstein (Subset Sum The Subset-Sum Problem) ‎[380 bytes]
  418. (hist) ‎Lin–Kernighan (Approximate TSP The Traveling-Salesman Problem) ‎[380 bytes]
  419. (hist) ‎Ray casting algorithm Shimrat; M (Point-in-Polygon Point-in-Polygon) ‎[380 bytes]
  420. (hist) ‎CHAZELLE 1986 (Counting number of intersection points / line segments Line segment intersection) ‎[380 bytes]
  421. (hist) ‎Amir et al. (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) ‎[380 bytes]
  422. (hist) ‎Eppstein (Subset Sum The Subset-Sum Problem) ‎[380 bytes]
  423. (hist) ‎Hunt and Szymanski (LCS Longest Common Subsequence) ‎[381 bytes]
  424. (hist) ‎Preparata and Hong (2-dimensional; 3-dimensional Convex Hull) ‎[381 bytes]
  425. (hist) ‎Skala (convex and non-convex polyhedral window Line Clipping) ‎[381 bytes]
  426. (hist) ‎Richardson and Domingos (Link Analysis Link Analysis) ‎[381 bytes]
  427. (hist) ‎Method of Four Russians ( Matrix Multiplication) ‎[381 bytes]
  428. (hist) ‎Revuz's algorithm (Acyclic DFA Minimization DFA Minimization) ‎[381 bytes]
  429. (hist) ‎Gunther Determinants solution (Counting Solutions; Constructing solutions n-Queens Problem) ‎[381 bytes]
  430. (hist) ‎Ahuja & Orlin ( Maximum Flow) ‎[382 bytes]
  431. (hist) ‎9-point Tensor product (3-Dimensional Poisson Problem Poisson Problem) ‎[382 bytes]
  432. (hist) ‎Reduction from All Pairs Minimum Witness (APMW) to Negative Triangle Detection ‎[382 bytes]
  433. (hist) ‎Weiler–Atherton clipping algorithm (Polygon Clipping with Arbitrary Clipping Polygon Polygon Clipping) ‎[382 bytes]
  434. (hist) ‎9-point Tensor product (2-Dimensional Poisson Problem Poisson Problem) ‎[382 bytes]
  435. (hist) ‎Ioannidou; Kyriaki; Mertzios; George B.; Nikolopoulos; Stavros D. (Longest Path on Interval Graphs Longest Path Problem) ‎[382 bytes]
  436. (hist) ‎Navarro (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) ‎[382 bytes]
  437. (hist) ‎Masek; Patterson (Edit distance Sequence Alignment) ‎[382 bytes]
  438. (hist) ‎Bareiss Algorithm (Toeplitz Matrix Linear System) ‎[383 bytes]
  439. (hist) ‎De Bruijn Graph (Idury, Waterman) (De Novo Genome Assembly De Novo Genome Assembly) ‎[383 bytes]
  440. (hist) ‎Ellipsoid method (General, Constrained optimization Convex Optimization (Non-linear)) ‎[383 bytes]
  441. (hist) ‎Wang-Zhu-Cantor additive FFT (Discrete Fourier Transform Discrete Fourier Transform) ‎[383 bytes]
  442. (hist) ‎Lenstra elliptic curve factorization (First Category Integer Factoring Integer Factoring) ‎[384 bytes]
  443. (hist) ‎Chin and Poon (LCS Longest Common Subsequence) ‎[384 bytes]
  444. (hist) ‎Bjorklund, Husfeldt, Theorem 1 ( 5 - Graph Coloring) ‎[384 bytes]
  445. (hist) ‎Bjorklund, Husfeldt, Theorem 1 ( 6 - Graph Coloring) ‎[384 bytes]
  446. (hist) ‎Bjorklund, Husfeldt, Theorem 1 ( Chromatic Number) ‎[384 bytes]
  447. (hist) ‎Matrix inverse (General Linear system of equations) ‎[384 bytes]
  448. (hist) ‎LogLog algorithm ( Cardinality Estimation) ‎[384 bytes]
  449. (hist) ‎Hariharan (Constructing Suffix Trees Constructing Suffix Trees) ‎[384 bytes]
  450. (hist) ‎Adaptive Duplicate Detection Algorithm (ADD) (Duplicate Elimination Duplicate Elimination) ‎[384 bytes]
  451. (hist) ‎Naive Solution (Median String Problem with Unbounded Alphabets Median String Problem) ‎[384 bytes]
  452. (hist) ‎Secant method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations) ‎[384 bytes]
  453. (hist) ‎Family:Graph Triangle Problems ‎[385 bytes]
  454. (hist) ‎Nivasch ( Cycle Detection) ‎[385 bytes]
  455. (hist) ‎Dantzig ( Maximum Flow) ‎[385 bytes]
  456. (hist) ‎Goldberg & Rao (Integer Maximum Flow Maximum Flow) ‎[385 bytes]
  457. (hist) ‎Schiermeyer (3-Graph Coloring Graph Coloring) ‎[385 bytes]
  458. (hist) ‎Odd Even Sort Parallel Implementation (Comparison Sorting Sorting) ‎[385 bytes]
  459. (hist) ‎Thorup's Sorting Algorithm (Comparison Sorting Sorting) ‎[386 bytes]
  460. (hist) ‎Bead Sort (Non-Comparison Sorting Sorting) ‎[386 bytes]
  461. (hist) ‎Kuo and Cross (LCS Longest Common Subsequence) ‎[386 bytes]
  462. (hist) ‎String Graph (Myers) (De Novo Genome Assembly De Novo Genome Assembly) ‎[386 bytes]
  463. (hist) ‎Boyer-Moore-Horspool (BMH) (Single String Search String Search) ‎[386 bytes]
  464. (hist) ‎Flajolet–Martin algorithm ( Cardinality Estimation) ‎[386 bytes]
  465. (hist) ‎Lawrence Gibbs Sampling (Motif Search Motif Search) ‎[387 bytes]
  466. (hist) ‎Method of Four Russians (Boolean Matrix Multiplication (Combinatorial) Matrix Product) ‎[387 bytes]
  467. (hist) ‎Haselgrove; Leech and Trotter (Bounded Subgroup Index Coset Enumeration) ‎[387 bytes]
  468. (hist) ‎Kazuhisa Makino, Takeaki Uno; Section 6 (Enumerating Maximal Cliques, arbitrary graph Clique Problems) ‎[387 bytes]
  469. (hist) ‎Lien (4NF Decomposition for Conflict-Free Dependency Sets 4NF Decomposition) ‎[387 bytes]
  470. (hist) ‎Haselgrove-Leech-Trotter (HLT) algorithm (Coset Enumeration Coset Enumeration) ‎[387 bytes]
  471. (hist) ‎Bidirectional A* Algorithm (Informed Search Informed Search) ‎[388 bytes]
  472. (hist) ‎Beigel & Eppstein (3-Graph Coloring Graph Coloring) ‎[388 bytes]
  473. (hist) ‎Fortune and Hopcroft (k-dimensional space, l m (or l infty) norm Closest Pair Problem) ‎[388 bytes]
  474. (hist) ‎NIEVERGELT. J.. AND PREPARATA (Section 2) (Reporting all intersection points / general polygons Line segment intersection) ‎[388 bytes]
  475. (hist) ‎Raita Algorithm (Single String Search String Search) ‎[388 bytes]
  476. (hist) ‎Ferguson–Forcade algorithm (Integer Relation Integer Relation) ‎[388 bytes]
  477. (hist) ‎Nivasch (Cycle Detection Cycle Detection) ‎[388 bytes]
  478. (hist) ‎Perumalla and Deo (1D Maximum Subarray Maximum Subarray Problem) ‎[389 bytes]
  479. (hist) ‎Risotto (Motif Search Motif Search) ‎[389 bytes]
  480. (hist) ‎Mukhopadhyay (LCS Longest Common Subsequence) ‎[389 bytes]
  481. (hist) ‎Tuned Boyer-Moore algorithm (Single String Search String Search) ‎[389 bytes]
  482. (hist) ‎Hsu and Du (Scheme 2) (LCS Longest Common Subsequence) ‎[389 bytes]
  483. (hist) ‎Hsu and Du (Scheme 1) (LCS Longest Common Subsequence) ‎[389 bytes]
  484. (hist) ‎Hentenryck et. al. (Arc Consistency? Stable Matching Problem) ‎[389 bytes]
  485. (hist) ‎Shiloach ( Maximum Flow) ‎[389 bytes]
  486. (hist) ‎Fast Hybrid Algorithm (Single String Search String Search) ‎[389 bytes]
  487. (hist) ‎Sthele, Zimmermann (Greatest Common Divisor Greatest Common Divisor) ‎[389 bytes]
  488. (hist) ‎Speller (Motif Search Motif Search) ‎[390 bytes]
  489. (hist) ‎PMS (Motif Search Motif Search) ‎[390 bytes]
  490. (hist) ‎NIEVERGELT. J.. AND PREPARATA (Section 3) (Reporting all intersection points, convex polygons Line segment intersection) ‎[390 bytes]
  491. (hist) ‎Brandes (Weighted Betweenness Centrality (BC)) ‎[390 bytes]
  492. (hist) ‎Almeida & Zeitoun (Cyclic Nontrivial SCCs DFA Minimization DFA Minimization) ‎[390 bytes]
  493. (hist) ‎Akkoyunlu; E. A. (Enumerating Maximal Cliques, arbitrary graph Clique Problems) ‎[390 bytes]
  494. (hist) ‎Ukkonen (Constructing Suffix Trees Constructing Suffix Trees) ‎[391 bytes]
  495. (hist) ‎Fixed priority shortest job first (Unweighted Interval Scheduling, Online?? Interval Scheduling) ‎[391 bytes]
  496. (hist) ‎Langdon ( All permutations) ‎[391 bytes]
  497. (hist) ‎Dinitz ( Maximum Flow) ‎[392 bytes]
  498. (hist) ‎Myers and Miller (Edit sequence, local alignment Sequence Alignment) ‎[392 bytes]
  499. (hist) ‎Census (Motif Search Motif Search) ‎[392 bytes]
  500. (hist) ‎The PAGERANK Algorithm (Link Analysis Link Analysis) ‎[392 bytes]

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

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