Long 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) ‎N-Queens Completion ‎[782 bytes]
  2. (hist) ‎Monotone Not-All-Equal 3-SAT (Monotone NAE 3SAT) ‎[780 bytes]
  3. (hist) ‎Longest common subsequence ‎[778 bytes]
  4. (hist) ‎Monotone 3SAT ‎[772 bytes]
  5. (hist) ‎Reduction from Triangle Detection to Dynamic Bipartite Maximum-Weight Matching ‎[767 bytes]
  6. (hist) ‎Reduction from Positive Betweenness Centrality to Diameter ‎[766 bytes]
  7. (hist) ‎Root Computation with continuous first derivative ‎[764 bytes]
  8. (hist) ‎Maximum-weight matching ‎[759 bytes]
  9. (hist) ‎Reduction from Triangle Detection to Strong Connectivity (dynamic) ‎[755 bytes]
  10. (hist) ‎Disjunctive Normal Form SAT ‎[755 bytes]
  11. (hist) ‎Deadlock Avoidance ‎[748 bytes]
  12. (hist) ‎Connected Subgraph ‎[744 bytes]
  13. (hist) ‎Reduction from Negative Triangle Detection to All-Nodes Positive Betweenness Centrality ‎[739 bytes]
  14. (hist) ‎Reduction from Reach Centrality to Diameter ‎[737 bytes]
  15. (hist) ‎3SAT-5 ‎[736 bytes]
  16. (hist) ‎Reduction from CNF-SAT to Positive Betweenness Centrality ‎[732 bytes]
  17. (hist) ‎2SAT ‎[732 bytes]
  18. (hist) ‎NFA to DFA conversion ‎[726 bytes]
  19. (hist) ‎2-Player ‎[723 bytes]
  20. (hist) ‎Reduction from CNF-SAT to Approximate Betweenness Centrality ‎[720 bytes]
  21. (hist) ‎The frequent words problem ‎[714 bytes]
  22. (hist) ‎Chromatic Number ‎[709 bytes]
  23. (hist) ‎Cohen; Lee and Song ( Linear Programming) ‎[706 bytes]
  24. (hist) ‎Strong Triangle Conjecture ‎[705 bytes]
  25. (hist) ‎Turnpike Problem ‎[705 bytes]
  26. (hist) ‎Reduction from Reach Centrality to Positive Betweenness Centrality ‎[704 bytes]
  27. (hist) ‎Reduction from Bichromatic Hamming Close Pair to Approximate Hard-Margin SVM ‎[701 bytes]
  28. (hist) ‎Strongly Connected Components ‎[701 bytes]
  29. (hist) ‎Reduction from CNF-SAT to Dynamic Connected Subgraph ‎[699 bytes]
  30. (hist) ‎Reduction from Diameter to Positive Betweenness Centrality ‎[696 bytes]
  31. (hist) ‎String Search ‎[696 bytes]
  32. (hist) ‎XOR-SAT ‎[695 bytes]
  33. (hist) ‎Reduction from Triangle Detection to Disjunctive coBüchi Objectives ‎[692 bytes]
  34. (hist) ‎Fredholm Equations ‎[691 bytes]
  35. (hist) ‎Online Matrix-Vector Multiplication ‎[690 bytes]
  36. (hist) ‎5-Graph Coloring ‎[689 bytes]
  37. (hist) ‎Reduction from CNF-SAT to Approximate Reach Centrality ‎[688 bytes]
  38. (hist) ‎Constant sensitivity incremental ST-Reach ‎[688 bytes]
  39. (hist) ‎Reduction from CNF-SAT to Dynamic MaxSCC ‎[687 bytes]
  40. (hist) ‎Reduction from Diameter to Reach Centrality ‎[681 bytes]
  41. (hist) ‎Reduction from OV to Generalized Büchi Games ‎[678 bytes]
  42. (hist) ‎Optimal Binary Search Tree Problem ‎[678 bytes]
  43. (hist) ‎Reduction from CNF-SAT to ‎[677 bytes]
  44. (hist) ‎Reduction from Directed, Weighted APSP to Dynamic Bipartite Maximum-Weight Matching ‎[676 bytes]
  45. (hist) ‎Reduction from CNF-SAT to Dynamic 4/3-Diameter ‎[676 bytes]
  46. (hist) ‎Reduction from CNF-SAT to SC2 ‎[676 bytes]
  47. (hist) ‎Median String Problem with Bounded Alphabets ‎[675 bytes]
  48. (hist) ‎Median String Problem with Binary Alphabets ‎[674 bytes]
  49. (hist) ‎Reduction from CNF-SAT to Dynamic ST-Reach ‎[672 bytes]
  50. (hist) ‎Volterra Equations ‎[670 bytes]
  51. (hist) ‎ST-Reach ‎[669 bytes]
  52. (hist) ‎Convex Polyhedral Window ‎[669 bytes]
  53. (hist) ‎Reduction from Triangle Collection* to dynamic 4/3-Diameter ‎[666 bytes]
  54. (hist) ‎St-Reach ‎[663 bytes]
  55. (hist) ‎Reduction from Directed, Weighted APSP to Dynamic $st$-Shortest Path ‎[661 bytes]
  56. (hist) ‎Reduction from Negative Triangle Detection to All-Nodes Median Parity ‎[656 bytes]
  57. (hist) ‎Fomin; Gaspers & Saurabh (4-Graph Coloring Graph Coloring) ‎[654 bytes]
  58. (hist) ‎Reduction from Triangle Detection to Disjunctive Queries of Reachability in MDPs ‎[653 bytes]
  59. (hist) ‎Dekel; Nassimi & Sahni Parallel Implementation (Topological Sorting Topological Sorting) ‎[652 bytes]
  60. (hist) ‎Stable Marriage Problem/Stable Roommates Problem ‎[652 bytes]
  61. (hist) ‎Reduction from Triangle Detection to Disjunctive Reachability Queries in MDPs ‎[650 bytes]
  62. (hist) ‎Factorization of polynomials over finite fields ‎[650 bytes]
  63. (hist) ‎Reduction from Negative Triangle Detection to Radius ‎[643 bytes]
  64. (hist) ‎Dixon's algorithm (Second Category Integer Factoring Integer Factoring) ‎[643 bytes]
  65. (hist) ‎Reduction from Triangle Detection to Disjunctive Queries of Safety in Graphs ‎[642 bytes]
  66. (hist) ‎Huffman Encoding ‎[642 bytes]
  67. (hist) ‎Reduction from Maximum Inner Product Search to Stable Pair Checking ‎[641 bytes]
  68. (hist) ‎Reduction from Negative Triangle Detection to Median ‎[639 bytes]
  69. (hist) ‎Reduction from Min-Weight k-Clique to Minimum Weight k-Cycle ‎[635 bytes]
  70. (hist) ‎Strong Exponential Time Hypothesis (SETH) ‎[629 bytes]
  71. (hist) ‎Minimum Wiener Connector Problem ‎[629 bytes]
  72. (hist) ‎Discovering multivalued dependencies ‎[628 bytes]
  73. (hist) ‎Reduction from Negative Triangle Detection to Betweenness Centrality (BC) ‎[626 bytes]
  74. (hist) ‎Reduction from 3SUM to Local Alignment ‎[625 bytes]
  75. (hist) ‎All permutations ‎[624 bytes]
  76. (hist) ‎Reduction from Max-Weight k-Clique to Maximum Subarray ‎[623 bytes]
  77. (hist) ‎Reduction from Max-Weight K-Clique to Weighted Depth ‎[619 bytes]
  78. (hist) ‎Reduction from CNF-SAT to constant sensitivity (4/3)-approximate incremental diameter ‎[619 bytes]
  79. (hist) ‎Template Page ‎[619 bytes]
  80. (hist) ‎Longest path on interval graphs ‎[618 bytes]
  81. (hist) ‎Reduction from Max-Weight k-Clique to Max-Weight Rectangle ‎[616 bytes]
  82. (hist) ‎Reduction from Undirected, Weighted APSP to Undirected All-Nodes Positive Betweenness Centrality ‎[616 bytes]
  83. (hist) ‎Longest palindromic substring ‎[614 bytes]
  84. (hist) ‎Reduction from Directed, Weighted APSP to Directed All-Nodes Positive Betweenness Centrality ‎[612 bytes]
  85. (hist) ‎Transitive Reduction problem ‎[612 bytes]
  86. (hist) ‎Dependency inference problem ‎[612 bytes]
  87. (hist) ‎Enumerating Maximal Cliques ‎[610 bytes]
  88. (hist) ‎Digraph realization problem ‎[610 bytes]
  89. (hist) ‎Reduction from CNF-SAT to Multiple Local Alignment ‎[607 bytes]
  90. (hist) ‎MDPs for optimal policies ‎[606 bytes]
  91. (hist) ‎Constructing suffix trees ‎[606 bytes]
  92. (hist) ‎Maximum subarray problem ‎[604 bytes]
  93. (hist) ‎Reduction from MAX-CNF-SAT to All-Pairs Maximum Flow ‎[602 bytes]
  94. (hist) ‎DE NOVO GENOME ASSEMBLY ‎[602 bytes]
  95. (hist) ‎Cyclopeptide sequencing ‎[602 bytes]
  96. (hist) ‎Reduction from Undirected, Weighted APSP to Undirected All-Nodes Reach Centrality ‎[601 bytes]
  97. (hist) ‎The subset-sum problem ‎[600 bytes]
  98. (hist) ‎Lowest common ancestor ‎[600 bytes]
  99. (hist) ‎Delaunay triangulation ‎[600 bytes]
  100. (hist) ‎Edit Distance, constant-size alphabet ‎[599 bytes]
  101. (hist) ‎Reduction from Directed, Weighted APSP to Directed All-Nodes Reach Centrality ‎[597 bytes]
  102. (hist) ‎Reduction from Max-Weight K-Clique to Maximum Square Subarray ‎[596 bytes]
  103. (hist) ‎Any Eigenpair ‎[596 bytes]
  104. (hist) ‎Reduction from k-Clique to CFG Recognition ‎[594 bytes]
  105. (hist) ‎Orthogonal Vectors Hypothesis (OVH) ‎[594 bytes]
  106. (hist) ‎Rod-cutting problem ‎[594 bytes]
  107. (hist) ‎Register Allocation ‎[594 bytes]
  108. (hist) ‎Reduction from Maximum Inner Product Search to Boolean d-Attribute Stable Matching ‎[591 bytes]
  109. (hist) ‎Lossless Compression ‎[591 bytes]
  110. (hist) ‎Reduction from OV to Disjunctive Queries of Safety in Graphs ‎[590 bytes]
  111. (hist) ‎Reduction from k-Clique to RNA Folding ‎[590 bytes]
  112. (hist) ‎Reduction from CNF-SAT to sensitive incremental ST-Reach ‎[590 bytes]
  113. (hist) ‎Unbalanced Orthogonal Vectors Hypothesis (UOVH) ‎[590 bytes]
  114. (hist) ‎Lossy compression ‎[590 bytes]
  115. (hist) ‎Entity resolution ‎[590 bytes]
  116. (hist) ‎4NF decomposition ‎[590 bytes]
  117. (hist) ‎Reduction from Betweenness Centrality (BC) to Diameter ‎[588 bytes]
  118. (hist) ‎Min-Weight k-Clique Hypothesis ‎[588 bytes]
  119. (hist) ‎Polygon clipping ‎[588 bytes]
  120. (hist) ‎Integer relation ‎[588 bytes]
  121. (hist) ‎Reduction from Undirected, Weighted APSP to All-Nodes Median Parity ‎[587 bytes]
  122. (hist) ‎Reduction from CNF-SAT to sensitive incremental ‎[586 bytes]
  123. (hist) ‎Vornoi Diagrams ‎[586 bytes]
  124. (hist) ‎Reduction from Maximum Inner Product Search to Stable Matching Verification ‎[585 bytes]
  125. (hist) ‎Reduction from Directed, Weighted APSP to All-Nodes Median Parity ‎[585 bytes]
  126. (hist) ‎Edmonds-Karp (bipartite (i.e. assignment), general Maximum-weight matching) ‎[581 bytes]
  127. (hist) ‎Line drawing ‎[580 bytes]
  128. (hist) ‎Exponential Time Hypothesis (ETH) ‎[579 bytes]
  129. (hist) ‎Reduction from Negative Triangle Listing to Negative Triangle Detection ‎[578 bytes]
  130. (hist) ‎2-Graph Coloring ‎[578 bytes]
  131. (hist) ‎Maximum cut ‎[578 bytes]
  132. (hist) ‎Family:Boolean Satisfiability ‎[577 bytes]
  133. (hist) ‎Reduction from CNF-SAT to Local Alignment ‎[576 bytes]
  134. (hist) ‎HJLS algorithm ( Integer Relation) ‎[574 bytes]
  135. (hist) ‎Reduction from Weighted, Undirected APSP to 2D Maximum Subarray ‎[572 bytes]
  136. (hist) ‎Translating abstract syntax trees ‎[572 bytes]
  137. (hist) ‎Parsing ‎[570 bytes]
  138. (hist) ‎Reduction from Negative Triangle Detection to 2D Maximum Subarray ‎[569 bytes]
  139. (hist) ‎More Believable Exponential Time Hypothesis (MBETH) ‎[567 bytes]
  140. (hist) ‎Weighted Interval Schedule Maximization Problem (ISMP) ‎[567 bytes]
  141. (hist) ‎Reduction from CNF-SAT to Longest Common Substring with don't cares ‎[566 bytes]
  142. (hist) ‎Reduction from OV to Disjunctive Reachability Queries in MDPs ‎[563 bytes]
  143. (hist) ‎Reduction from OV to Disjunctive Queries of Reachability in MDPs ‎[563 bytes]
  144. (hist) ‎Reduction from OV to Largest Common Subtree ‎[563 bytes]
  145. (hist) ‎Reduction from Replacement Paths Problem (RPP) to 1-sensitive decremental st-shortest paths ‎[560 bytes]
  146. (hist) ‎Family:Vertex Centrality ‎[560 bytes]
  147. (hist) ‎Reduction from OV to Subtree Isomorphism ‎[557 bytes]
  148. (hist) ‎Maximum Strongly Connected Component ‎[557 bytes]
  149. (hist) ‎Spielman, Teng (Inexact Laplacian Solver SDD Systems Solvers) ‎[556 bytes]
  150. (hist) ‎Reduction from Approximate Betweenness Centrality to Diameter ‎[556 bytes]
  151. (hist) ‎Reduction from Diameter to Approximate Betweenness Centrality ‎[556 bytes]
  152. (hist) ‎Reduction from BMM to 1-sensitive (4/3)-approximate decremental diameter ‎[555 bytes]
  153. (hist) ‎Reduction from Directed, Weighted APSP to 2-sensitive decremental st-shortest paths ‎[554 bytes]
  154. (hist) ‎Steal/No-Force ‎[554 bytes]
  155. (hist) ‎Reduction from BMM to 1-sensitive (3/2)-approximate ss-shortest paths ‎[552 bytes]
  156. (hist) ‎Reduction from BMM to 2-sensitive (7/5)-approximate st-shortest paths ‎[552 bytes]
  157. (hist) ‎Reduction from CNF-SAT to dynamic st-Maximum Flow ‎[551 bytes]
  158. (hist) ‎Pohlig-Hellman (Discrete Logarithm Over Finite Fields Logarithm Calculations) ‎[551 bytes]
  159. (hist) ‎Reduction from OuMv to Bipartite Graph MCM ‎[550 bytes]
  160. (hist) ‎Mucha; Sankowski (planar) (Bipartite Graph MCM Maximum Cardinality Matching) ‎[550 bytes]
  161. (hist) ‎Reduction from OuMV to dynamic st-Maximum Flow ‎[548 bytes]
  162. (hist) ‎Reduction from BMM to 1-sensitive decremental st-shortest paths ‎[547 bytes]
  163. (hist) ‎Reduction from Directed, Weighted APSP to 1-sensitive decremental diameter ‎[545 bytes]
  164. (hist) ‎Reduction from k-SAT to Subset Sum ‎[544 bytes]
  165. (hist) ‎Pollard's p − 1 algorithm (First Category Integer Factoring Integer Factoring) ‎[543 bytes]
  166. (hist) ‎Online Matrix Vector Multiplication Hypothesis (OMV Hypothesis) ‎[541 bytes]
  167. (hist) ‎Brent-Dekker Method (General Root Computation Root Computation) ‎[539 bytes]
  168. (hist) ‎Longest distance first (LDF) page replacement algorithm (Online Page Replacements) ‎[539 bytes]
  169. (hist) ‎Image Compositing ‎[538 bytes]
  170. (hist) ‎Gusfield (Longest Palindromic Substring Longest Palindromic Substring) ‎[537 bytes]
  171. (hist) ‎Reduction from OV to Edit Distance ‎[536 bytes]
  172. (hist) ‎Furer's algorithm ( Multiplication) ‎[533 bytes]
  173. (hist) ‎Klein (section 5) (Planar Bipartite Graph Perfect Matching Maximum Cardinality Matching) ‎[532 bytes]
  174. (hist) ‎Family:Shortest Path (Directed Graphs) ‎[532 bytes]
  175. (hist) ‎Finch (Inexact GED Graph Edit Distance Computation) ‎[531 bytes]
  176. (hist) ‎Rijndael / AES (Block Ciphers Block Ciphers) ‎[529 bytes]
  177. (hist) ‎Z-buffering ( Shown Surface Determination) ‎[529 bytes]
  178. (hist) ‎Reduction from Triangle Detection to Independent Set Queries ‎[528 bytes]
  179. (hist) ‎Randomized LU Decomposition (Rectangular Matrix LU Decomposition LU Decomposition) ‎[528 bytes]
  180. (hist) ‎Convex Optimization (Non-linear) ‎[528 bytes]
  181. (hist) ‎Reduction from BMM to 1-sensitive (4/3)-approximate decremental eccentricity ‎[527 bytes]
  182. (hist) ‎Brzozowski's algorithm (DFA Minimization DFA Minimization) ‎[526 bytes]
  183. (hist) ‎Earley parser (CFG Parsing CFG Problems) ‎[526 bytes]
  184. (hist) ‎Reduction from OV to Bichromatic Hamming Close Pair ‎[525 bytes]
  185. (hist) ‎Overlap Layout Consensus (De Novo Genome Assembly De Novo Genome Assembly) ‎[525 bytes]
  186. (hist) ‎Reduction from Matrix Product to Negative Triangle Detection ‎[524 bytes]
  187. (hist) ‎Cantor–Zassenhaus algorithm (Equal-degree Factorization of Polynomials Over Finite Fields) ‎[523 bytes]
  188. (hist) ‎Dinitz (with dynamic trees) ( Maximum Flow) ‎[523 bytes]
  189. (hist) ‎Czumaj (Approximate MCOP Matrix Chain Multiplication) ‎[523 bytes]
  190. (hist) ‎Exact k-Clique Hypothesis ‎[521 bytes]
  191. (hist) ‎Α-EM Algorithm (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) ‎[518 bytes]
  192. (hist) ‎Victor Shoup's algorithm (Equal-degree Factorization of Polynomials Over Finite Fields) ‎[517 bytes]
  193. (hist) ‎All Pairs Shortest Paths Hypothesis (APSP Hypothesis) ‎[517 bytes]
  194. (hist) ‎Ausiello et al. (Maximum Cut, Approximate Maximum Cut) ‎[516 bytes]
  195. (hist) ‎Clock-sampling mutual network synchronization (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems) ‎[515 bytes]
  196. (hist) ‎Reduction from Betweenness Centrality (BC) to Undirected, Weighted APSP ‎[514 bytes]
  197. (hist) ‎Chandran and F. Grandoni (The Vertex Cover Problem The Vertex Cover Problem) ‎[514 bytes]
  198. (hist) ‎Dynamic Dihedral Rotation Queries ‎[514 bytes]
  199. (hist) ‎Lee; Peng; Spielman (Inexact Laplacian Solver SDD Systems Solvers) ‎[513 bytes]
  200. (hist) ‎Reduction from BMM to Independent Set Queries ‎[513 bytes]
  201. (hist) ‎Press, Teukolsky, Flannery (Square Matrix LU Decomposition LU Decomposition) ‎[513 bytes]
  202. (hist) ‎K Approximate Nearest Neighbors Search ‎[513 bytes]
  203. (hist) ‎Smallest Factor ‎[513 bytes]
  204. (hist) ‎Reduction from Betweenness Centrality (BC) to Directed, Weighted APSP ‎[512 bytes]
  205. (hist) ‎Tarjan's off-line lowest common ancestors algorithm (Off-Line Lowest Common Ancestor Lowest Common Ancestor) ‎[510 bytes]
  206. (hist) ‎Family:Model-Checking Problem ‎[510 bytes]
  207. (hist) ‎All Eigenpairs ‎[509 bytes]
  208. (hist) ‎Reduction from BMM to (5/3)-approximate ap-shortest paths ‎[508 bytes]
  209. (hist) ‎Bareiss algorithm (Determinant of Matrices with Integer Entries Determinant of Matrices with Integer Entries) ‎[507 bytes]
  210. (hist) ‎Reduction from OV to Diameter 2 vs 3 ‎[506 bytes]
  211. (hist) ‎Constructing Solutions ‎[506 bytes]
  212. (hist) ‎Reduction from BMM to 1-sensitive incremental ss-reach ‎[505 bytes]
  213. (hist) ‎Reduction from BMM to 2-sensitive incremental st-reach ‎[505 bytes]
  214. (hist) ‎Reduction from Undirected Median to Undirected, Weighted APSP ‎[504 bytes]
  215. (hist) ‎Reduction from Undirected Radius to Undirected, Weighted APSP ‎[504 bytes]
  216. (hist) ‎Chazelle's algorithm (Undirected, General MST Minimum Spanning Tree (MST)) ‎[504 bytes]
  217. (hist) ‎Reduction from MAX-CNF-SAT to st-Maximum Flow ‎[503 bytes]
  218. (hist) ‎Reduction from Negative Triangle to Price Query ‎[503 bytes]
  219. (hist) ‎Reduction from Distance Product to Second Shortest Simple Path ‎[503 bytes]
  220. (hist) ‎De Prisco (Approximate OBST Optimal Binary Search Trees) ‎[502 bytes]
  221. (hist) ‎Belloch (2-Dimensional Delaunay Triangulation Delaunay Triangulation) ‎[502 bytes]
  222. (hist) ‎Chandra (Approximate MCOP Matrix Chain Multiplication) ‎[502 bytes]
  223. (hist) ‎Todd–Coxeter algorithm (Coset Enumeration Coset Enumeration) ‎[501 bytes]
  224. (hist) ‎Todd–Coxeter algorithm (Bounded Subgroup Index Coset Enumeration) ‎[501 bytes]
  225. (hist) ‎Family:Graph Metrics ‎[501 bytes]
  226. (hist) ‎Faugère F4 algorithm (Gröbner Bases Gröbner Bases) ‎[500 bytes]
  227. (hist) ‎Reduction from Directed Median to Directed, Weighted APSP ‎[500 bytes]
  228. (hist) ‎Reduction from Directed Radius to Directed, Weighted APSP ‎[500 bytes]
  229. (hist) ‎Rautiainen, Marschall (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) ‎[499 bytes]
  230. (hist) ‎Reduction from Maximum Subarray to Distance Product ‎[499 bytes]
  231. (hist) ‎Blossom Algorithm (general graph Maximum cardinality matching) ‎[498 bytes]
  232. (hist) ‎Daitch; Spielman (Inexact Laplacian Solver SDD Systems Solvers) ‎[498 bytes]
  233. (hist) ‎AST to Code Translation ‎[498 bytes]
  234. (hist) ‎Householder's Method (Root Computation with continuous derivatives (up to d) Root Computation) ‎[497 bytes]
  235. (hist) ‎Reduction from Directed, Weighted APSP to Second Shortest Simple Path ‎[497 bytes]
  236. (hist) ‎Jalali and T. Weissman (Lossy Compression Data Compression) ‎[497 bytes]
  237. (hist) ‎Spaghetti Sort Parallel Implementation (Non-Comparison Sorting Sorting) ‎[496 bytes]
  238. (hist) ‎Reduction from CNF-SAT to Frechet Distance ‎[495 bytes]
  239. (hist) ‎Reduction from Metricity to Negative Triangle Detection ‎[495 bytes]
  240. (hist) ‎Reduction from Directed, Weighted APSP to Replacement Paths Problem (RPP) ‎[494 bytes]
  241. (hist) ‎Reduction from Negative Triangle Detection to Metricity ‎[494 bytes]
  242. (hist) ‎Reduction from CNF-SAT to Approximate Diameter ‎[493 bytes]
  243. (hist) ‎No-Steal, Force ‎[492 bytes]
  244. (hist) ‎Digital Differential Analyzer (DDA) (Rasterization Rasterization) ‎[492 bytes]
  245. (hist) ‎Williams (APSP on Dense Directed Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP)) ‎[492 bytes]
  246. (hist) ‎Reduction from 3SUM' to Static Dihedral Rotation Queries ‎[491 bytes]
  247. (hist) ‎Nondeterministic Strong Exponential Time Hypothesis (NSETH) ‎[491 bytes]
  248. (hist) ‎K Nearest Neighbors Search ‎[491 bytes]
  249. (hist) ‎Inverse quadratic interpolation (General Root Computation Root Computation) ‎[490 bytes]
  250. (hist) ‎Harel, Tarjan (Linking Roots) (Lowest Common Ancestor with Linking Roots Lowest Common Ancestor) ‎[487 bytes]
  251. (hist) ‎Generalized expectation maximization (GEM) algorithm ( Maximum Likelihood Parameters) ‎[485 bytes]
  252. (hist) ‎Khuller; Raghavachari & Young, "Greedy Methods" (Maximum Cut, Approximate Maximum Cut) ‎[484 bytes]
  253. (hist) ‎Miyake 2006 (Lossy Compression Data Compression) ‎[483 bytes]
  254. (hist) ‎Halley's method (Root Computation with continuous second derivative Root Computation) ‎[482 bytes]
  255. (hist) ‎Faugère F5 algorithm (Gröbner Bases Gröbner Bases) ‎[482 bytes]
  256. (hist) ‎Harvey; Hoeven ( Multiplication) ‎[482 bytes]
  257. (hist) ‎Reduction from BMM to ap-reach ‎[481 bytes]
  258. (hist) ‎Shamir's scheme ( Secret Sharing) ‎[481 bytes]
  259. (hist) ‎Pollard's kangaroo algorithm (Discrete Logarithm Over Finite Fields Logarithm Calculations) ‎[481 bytes]
  260. (hist) ‎EM with Quasi-Newton Methods (Jamshidian; Mortaza; Jennrich; Robert I.) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) ‎[481 bytes]
  261. (hist) ‎Shi 2009 (NAE 3SAT Boolean Satisfiability) ‎[480 bytes]
  262. (hist) ‎Reduction from MAX-CNF-SAT to Maximum Local Edge Connectivity ‎[480 bytes]
  263. (hist) ‎K-Clique Hypothesis ‎[480 bytes]
  264. (hist) ‎Chow's Algorithm (Global Register Allocation Register Allocation) ‎[479 bytes]
  265. (hist) ‎Muller's method (General Root Computation Root Computation) ‎[479 bytes]
  266. (hist) ‎Newton's method (Root Computation with continuous first derivative Root Computation) ‎[479 bytes]
  267. (hist) ‎Reduction from Minimum Triangle to Second Shortest Simple Path ‎[479 bytes]
  268. (hist) ‎Iterative naive (d-Neighborhood of a String d-Neighborhood of a String) ‎[479 bytes]
  269. (hist) ‎Any Eigenvalue ‎[479 bytes]
  270. (hist) ‎Optimal Register Allocation (ORA), Goodwin & Wilken Algorithm (Global Register Allocation Register Allocation) ‎[478 bytes]
  271. (hist) ‎Ridder's method (General Root Computation Root Computation) ‎[478 bytes]
  272. (hist) ‎Greedy SEQAID (De Novo Genome Assembly De Novo Genome Assembly) ‎[478 bytes]
  273. (hist) ‎Opheim simplification ( Line Simplification) ‎[477 bytes]
  274. (hist) ‎Expectation conditional maximization (ECM) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) ‎[476 bytes]
  275. (hist) ‎Locality-sensitive hashing (k-ANNS Nearest Neighbor Search) ‎[474 bytes]
  276. (hist) ‎Locality-sensitive hashing (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search) ‎[474 bytes]
  277. (hist) ‎Shuji Tsukiyama, Mikio Ide, Hiromu Ariyoshi, and Isao Shirakawa (Enumerating Maximal Cliques, arbitrary graph Clique Problems) ‎[473 bytes]
  278. (hist) ‎Segundo; Artieda; Strash Parallel (Enumerating Maximal Cliques, arbitrary graph Clique Problems) ‎[473 bytes]
  279. (hist) ‎Naive Implementation (Exact Laplacian Solver SDD Systems Solvers) ‎[473 bytes]
  280. (hist) ‎Peng, Vempala (Sparse Linear system of equations) ‎[473 bytes]
  281. (hist) ‎Rytter (Constructing Suffix Trees Constructing Suffix Trees) ‎[472 bytes]
  282. (hist) ‎Maneva and M. J. Wainwright (Lossy Compression Data Compression) ‎[472 bytes]
  283. (hist) ‎Exact k-Clique ‎[472 bytes]
  284. (hist) ‎Linear Scan, Poletto & Sarkar (Global Register Allocation Register Allocation) ‎[471 bytes]
  285. (hist) ‎Anderson–Björck algorithm (General Root Computation Root Computation) ‎[470 bytes]
  286. (hist) ‎Illinois Algorithm (General Root Computation Root Computation) ‎[470 bytes]
  287. (hist) ‎ARIES (Steal, No-Force Recovery) ‎[470 bytes]
  288. (hist) ‎No-Steal/Force ‎[470 bytes]
  289. (hist) ‎Reduction from 3-OV to Diameter 3 vs 7 ‎[469 bytes]
  290. (hist) ‎All Eigenvalues ‎[468 bytes]
  291. (hist) ‎Downey, Fellows (The Vertex Cover Problem The Vertex Cover Problem) ‎[467 bytes]
  292. (hist) ‎Bader & Cong Parallel Implementation (Undirected, General MST Minimum Spanning Tree (MST)) ‎[467 bytes]
  293. (hist) ‎Reduction from BMM to CFG Parsing ‎[467 bytes]
  294. (hist) ‎Reduction from CFG Parsing to BMM ‎[467 bytes]
  295. (hist) ‎3SUM Hypothesis (3-SUM Hypothesis) ‎[467 bytes]
  296. (hist) ‎Reduction from CNF-SAT to k-OV ‎[466 bytes]
  297. (hist) ‎Blakley's scheme ( Secret Sharing) ‎[466 bytes]
  298. (hist) ‎O(lg N) algorithm (convex polygonal window Line Clipping) ‎[466 bytes]
  299. (hist) ‎RC5 (Block Ciphers Block Ciphers) ‎[465 bytes]
  300. (hist) ‎Tomlin (Link Analysis Link Analysis) ‎[465 bytes]
  301. (hist) ‎Petford and Welsh (3-Graph Coloring Graph Coloring) ‎[465 bytes]
  302. (hist) ‎Sutherland–Hodgman algorithm (Polygon Clipping with Convex Clipping Polygon Polygon Clipping) ‎[464 bytes]
  303. (hist) ‎Hungarian algorithm (Bipartite Maximum-Weight Matching Maximum-Weight Matching) ‎[464 bytes]
  304. (hist) ‎Szymanski's algorithm ( Mutual Exclusion) ‎[464 bytes]
  305. (hist) ‎SHA-3 (Unkeyed Hash Functions One-Way Hash Functions) ‎[463 bytes]
  306. (hist) ‎5-point star Cramer's rule (2-Dimensional Poisson Problem Poisson Problem) ‎[463 bytes]
  307. (hist) ‎Reduction from Negative Triangle Detection to Shortest Cycle ‎[463 bytes]
  308. (hist) ‎5-point star Cramer's rule (3-Dimensional Poisson Problem Poisson Problem) ‎[463 bytes]
  309. (hist) ‎Miller; Stout (2-dimensional Convex Hull) ‎[463 bytes]
  310. (hist) ‎Knuth–Bendix algorithm (Coset Enumeration Coset Enumeration) ‎[462 bytes]
  311. (hist) ‎Knuth–Bendix algorithm (General Groups (uncompleted?) Coset Enumeration) ‎[462 bytes]
  312. (hist) ‎Reduction from Triangles Cover Triangle to 3D Motion Planning ‎[462 bytes]
  313. (hist) ‎Jiang, Song, Weinstein and Zhang ( Linear Programming) ‎[462 bytes]
  314. (hist) ‎PHITS Coheng Chan (Link Analysis Link Analysis) ‎[461 bytes]
  315. (hist) ‎Fortune ( Delaunay Triangulation) ‎[460 bytes]
  316. (hist) ‎Reduction from Triangles Cover Triangle to Triangle Measure ‎[460 bytes]
  317. (hist) ‎Reduction from Strips Cover Box to Triangles Cover Triangle ‎[460 bytes]
  318. (hist) ‎Weighted incremental algorithm ( Variance Calculations) ‎[460 bytes]
  319. (hist) ‎Reduction from Triangles Cover Triangle to Visible Triangle ‎[460 bytes]
  320. (hist) ‎Reduction from Visible Triangle to Triangles Cover Triangle ‎[460 bytes]
  321. (hist) ‎Bresenham Algorithm (Rasterization Rasterization) ‎[460 bytes]
  322. (hist) ‎Gupta-Sproull algorithm (Line Drawing Line Drawing) ‎[459 bytes]
  323. (hist) ‎Suzuki-Kasami's algorithm ( Mutual Exclusion) ‎[459 bytes]
  324. (hist) ‎Christofides algorithm (Approximate TSP The Traveling-Salesman Problem) ‎[458 bytes]
  325. (hist) ‎Melhorn's Approximation algorithm (Approximate OBST Optimal Binary Search Trees) ‎[458 bytes]
  326. (hist) ‎Reduction from Hole in Union to Triangles Cover Triangle ‎[457 bytes]
  327. (hist) ‎Reduction from Triangles Cover Triangle to Hole in Union ‎[457 bytes]
  328. (hist) ‎Fortune ( Delaunay triangulation) ‎[457 bytes]
  329. (hist) ‎Naive solution ( Frequent Words with Mismatches Problem) ‎[456 bytes]
  330. (hist) ‎Ford–Fulkerson algorithm (Bipartite Graph MCM Maximum Cardinality Matching) ‎[456 bytes]
  331. (hist) ‎Reduction from GeomBase to Visibility Between Segments ‎[455 bytes]
  332. (hist) ‎Chvatal greedy heuristic (Weighted Set-Covering The Set-Covering Problem) ‎[455 bytes]
  333. (hist) ‎Gremban; Miller; Zagha (Inexact Laplacian Solver SDD Systems Solvers) ‎[454 bytes]
  334. (hist) ‎YOSHIZAWA S.; BELYAEV A. G.; SEIDEL H.-P 2004 (Mesh Parameterization Mesh Parameterization) ‎[454 bytes]
  335. (hist) ‎Papadimitriou and M Yannakakis 1996 + Buss (The Vertex Cover Problem The Vertex Cover Problem) ‎[453 bytes]
  336. (hist) ‎Jean-Daniel Boissonnat and Franco P. Preparata. (Reporting all intersection points, generalized segments Line segment intersection) ‎[453 bytes]
  337. (hist) ‎Reduction from Point on 3 Lines to 3 Points on Line ‎[452 bytes]
  338. (hist) ‎Reduction from 3 Points on Line to Point on 3 Lines ‎[452 bytes]
  339. (hist) ‎Ruchansky (Minimum Wiener Connector problem Wiener Index) ‎[452 bytes]
  340. (hist) ‎Boman; Chen; Hendrickson; Toledo (Inexact Laplacian Solver SDD Systems Solvers) ‎[452 bytes]
  341. (hist) ‎Elliptic-curve Diffie-Hellman (ECDH) (Key Exchange Key Exchange) ‎[452 bytes]
  342. (hist) ‎Reduction from GeomBase to Visibility From Infinity ‎[452 bytes]
  343. (hist) ‎Parameter-expanded expectation maximization (PX-EM) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) ‎[452 bytes]
  344. (hist) ‎Power Iteration (Eigenpair with the Largest Eigenvalue Eigenvalues (Iterative Methods)) ‎[452 bytes]
  345. (hist) ‎Parametrized Inapproximability Hypothesis (PIH) ‎[452 bytes]
  346. (hist) ‎Reduction from Strips Cover Box to Point Covering ‎[450 bytes]
  347. (hist) ‎Fellegi & Sunter Model (Entity Resolution Entity Resolution) ‎[450 bytes]
  348. (hist) ‎Newton–Raphson algorithm ( Maximum Likelihood Parameters) ‎[450 bytes]
  349. (hist) ‎Reduction from Min-Weight k-Cycle to Undirected Wiener Index ‎[450 bytes]
  350. (hist) ‎Reduction from Directed, Weighted APSP to Undirected, Weighted APSP ‎[450 bytes]
  351. (hist) ‎Reduction from Undirected, Weighted APSP to Directed, Weighted APSP ‎[450 bytes]
  352. (hist) ‎Reduction from GeomBase to Planar Motion Planning ‎[450 bytes]
  353. (hist) ‎K-OV Hypothesis ‎[450 bytes]
  354. (hist) ‎Gupta; Verdu (Lossy Compression Data Compression) ‎[449 bytes]
  355. (hist) ‎Rosenkrantz; D. J.; Stearns; R. E.; Lewis; P. M. (Approximate TSP The Traveling-Salesman Problem) ‎[449 bytes]
  356. (hist) ‎Haveliwala (Link Analysis Link Analysis) ‎[448 bytes]
  357. (hist) ‎Jalali; A. Montanari; and T. Weissman (Lossy Compression Data Compression) ‎[448 bytes]
  358. (hist) ‎Srba (SLAM Algorithms SLAM Algorithms) ‎[448 bytes]
  359. (hist) ‎Cheriyan et al. (st-Maximum Flow Maximum Flow) ‎[448 bytes]
  360. (hist) ‎Shaban; Amirreza; Mehrdad; Farajtabar (Maximum Likelihood Methods in Unknown Latent Variables; multi-view model, discrete observations Maximum Likelihood Methods in Unknown Latent Variables) ‎[447 bytes]
  361. (hist) ‎Ciliberti; Mézard (Lossy Compression Data Compression) ‎[447 bytes]
  362. (hist) ‎Papadimitriou and M Yannakakis (The Vertex Cover Problem The Vertex Cover Problem) ‎[447 bytes]
  363. (hist) ‎Sam Buss (The Vertex Cover Problem The Vertex Cover Problem) ‎[447 bytes]
  364. (hist) ‎Goodrich (Reporting all intersection points, line segments Line segment intersection) ‎[447 bytes]
  365. (hist) ‎Khuller; Matias ( Closest Pair Problem) ‎[444 bytes]
  366. (hist) ‎Reduction from GeomBase to Strips Cover Box ‎[444 bytes]
  367. (hist) ‎Banker's Algorithm (Deadlock Avoidance Deadlock avoidance) ‎[444 bytes]
  368. (hist) ‎Koutis; Miller and Peng (Inexact Laplacian Solver SDD Systems Solvers) ‎[444 bytes]
  369. (hist) ‎Raymond's algorithm ( Mutual Exclusion) ‎[444 bytes]
  370. (hist) ‎Madry's algorithm (Bipartite Graph MCM Maximum Cardinality Matching) ‎[443 bytes]
  371. (hist) ‎Naive (All Maximal Non-Branching Paths in a Graph All Maximal Non-Branching Paths in a Graph) ‎[443 bytes]
  372. (hist) ‎Family:Line segment intersection ‎[443 bytes]
  373. (hist) ‎Stege, Fellows (The Vertex Cover Problem The Vertex Cover Problem) ‎[442 bytes]
  374. (hist) ‎Bresenham's line algorithm (Line Drawing Line Drawing) ‎[442 bytes]
  375. (hist) ‎Naimi-Trehel's algorithm ( Mutual Exclusion) ‎[442 bytes]
  376. (hist) ‎CHAZELLE (Reporting all intersection points, line segments Line segment intersection) ‎[442 bytes]
  377. (hist) ‎Hitting Set Hypothesis (HS Hypothesis) ‎[442 bytes]
  378. (hist) ‎B. I. Kvasov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) ‎[441 bytes]
  379. (hist) ‎Kazuhisa Makino, Takeaki Uno; Section 5 (Enumerating Maximal Cliques, arbitrary graph Clique Problems) ‎[441 bytes]
  380. (hist) ‎Kushner non-linear filter (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) ‎[441 bytes]
  381. (hist) ‎Tarjan's strongly connected components algorithm (SCCs Strongly Connected Components) ‎[441 bytes]
  382. (hist) ‎Reduction from 3SUM to 3 Points on Line ‎[440 bytes]
  383. (hist) ‎Nesetril, Poljak (k-Clique k-Clique Problem) ‎[440 bytes]
  384. (hist) ‎Α-EM algorithm ( Maximum Likelihood Parameters) ‎[440 bytes]
  385. (hist) ‎Apostolico–Giancarlo Algorithm (Single String Search String Search) ‎[440 bytes]
  386. (hist) ‎Schönhage–Strassen algorithm ( Multiplication) ‎[439 bytes]
  387. (hist) ‎Reduction from GeomBase to Separator2 ‎[438 bytes]
  388. (hist) ‎Reduction from GeomBase to Separator1 ‎[438 bytes]
  389. (hist) ‎Folded spectrum method (Eigenpair closest to mu; Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods)) ‎[438 bytes]
  390. (hist) ‎MATSF (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems) ‎[438 bytes]
  391. (hist) ‎Valiant (CFG Recognition CFG Problems) ‎[438 bytes]
  392. (hist) ‎ITP Method (General Root Computation Root Computation) ‎[437 bytes]
  393. (hist) ‎ASP (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems) ‎[437 bytes]
  394. (hist) ‎Schonhage's algorithm (Matrix Multiplication Matrix Product) ‎[437 bytes]
  395. (hist) ‎List:Domains ‎[437 bytes]
  396. (hist) ‎Blum (General Graph MCM Maximum Cardinality Matching) ‎[436 bytes]
  397. (hist) ‎Del Moral; Pierre (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) ‎[436 bytes]
  398. (hist) ‎Cheriyan & Hagerup (st-Maximum Flow Maximum Flow) ‎[436 bytes]
  399. (hist) ‎Parameter-expanded expectation maximization (PX-EM) algorithm ( Maximum Likelihood Parameters) ‎[434 bytes]
  400. (hist) ‎Secant method (General Root Computation Root Computation) ‎[434 bytes]
  401. (hist) ‎Blelloch; Koutis; Miller; Tangwongsan (Inexact Laplacian Solver SDD Systems Solvers) ‎[434 bytes]
  402. (hist) ‎Commentz-Walter Algorithm (Multiple String Search String Search) ‎[434 bytes]
  403. (hist) ‎FastSlam (SLAM Algorithms SLAM Algorithms) ‎[434 bytes]
  404. (hist) ‎Reduction from 3SUM' to GeomBase ‎[433 bytes]
  405. (hist) ‎Reduction from GeomBase to 3SUM' ‎[433 bytes]
  406. (hist) ‎Alt, Blum, Mehlhorn, Paul (bipartite graph Maximum cardinality matching) ‎[433 bytes]
  407. (hist) ‎Wu and Manber, Fuzzy String Matching ( String Search) ‎[433 bytes]
  408. (hist) ‎Gries, Martin (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem) ‎[433 bytes]
  409. (hist) ‎Bitonic Merge Sort Parallel Implementation (Comparison Sorting Sorting) ‎[433 bytes]
  410. (hist) ‎Chin (Approximate MCOP Matrix Chain Multiplication) ‎[433 bytes]
  411. (hist) ‎Toom-3 ( Multiplication) ‎[433 bytes]
  412. (hist) ‎Karpinski (Approximate OBST Optimal Binary Search Trees) ‎[433 bytes]
  413. (hist) ‎Manacher (Longest Palindromic Substring Longest Palindromic Substring) ‎[432 bytes]
  414. (hist) ‎M. Chrobak and D. Eppstein (Enumerating Maximal Cliques, arbitrary graph Clique Problems) ‎[432 bytes]
  415. (hist) ‎Chaitin's Algorithm (Global Register Allocation Register Allocation) ‎[432 bytes]
  416. (hist) ‎Gabow; Tarjan (General Graph MCM Maximum Cardinality Matching) ‎[432 bytes]
  417. (hist) ‎Khuller, Matias (k-dimensional space, Euclidean metric Closest Pair Problem) ‎[432 bytes]
  418. (hist) ‎The (Stochastic Approach for Link Structure Analysis) SALSA Algorithm (Link Analysis Link Analysis) ‎[432 bytes]
  419. (hist) ‎Dyer (2-dimensional array representation Closest Pair Problem) ‎[432 bytes]
  420. (hist) ‎Weak Parametrized Inapproximability Hypothesis (WPIH) ‎[432 bytes]
  421. (hist) ‎Helden Oligo-Analysis (Motif Search Motif Search) ‎[431 bytes]
  422. (hist) ‎PSLQ algorithm (Integer Relation Integer Relation) ‎[431 bytes]
  423. (hist) ‎Gomory's cutting method (ILP;MILPs Convex Optimization (Non-linear)) ‎[431 bytes]
  424. (hist) ‎Kelner; Orecchia; Sidford; Zhu (Inexact Laplacian Solver SDD Systems Solvers) ‎[431 bytes]
  425. (hist) ‎Helden Oligo-Analysis ( Motif Search) ‎[431 bytes]
  426. (hist) ‎Trial Multiplication (Discrete Logarithm Over Finite Fields Logarithm Calculations) ‎[430 bytes]
  427. (hist) ‎De Berg; Cheong (2-Dimensional Delaunay Triangulation Delaunay Triangulation) ‎[430 bytes]
  428. (hist) ‎Maekawa's algorithm ( Mutual Exclusion) ‎[430 bytes]
  429. (hist) ‎Alon (st-Maximum Flow Maximum Flow) ‎[430 bytes]
  430. (hist) ‎Reduction from 3SUM' to 3SUM ‎[429 bytes]
  431. (hist) ‎Reduction from 3SUM to 3SUM' ‎[429 bytes]
  432. (hist) ‎Brute force algorithm (Functional Dependency Inference Problem Dependency Inference Problem) ‎[429 bytes]
  433. (hist) ‎Quadratic sieve (Second Category Integer Factoring Integer Factoring) ‎[429 bytes]
  434. (hist) ‎Gupta & Sarawagi CRF (Entity Resolution Entity Resolution) ‎[428 bytes]
  435. (hist) ‎Räihä; Manilla (Multivalued Dependency Inference Problem Dependency Inference Problem) ‎[428 bytes]
  436. (hist) ‎Expectation conditional maximization (ECM) ( Maximum Likelihood Parameters) ‎[427 bytes]
  437. (hist) ‎Bowyer–Watson algorithm (2-Dimensional Delaunay Triangulation Delaunay Triangulation) ‎[427 bytes]
  438. (hist) ‎Chan (APSP on Dense Directed Graphs with Arbitrary Weights; APSP on Dense Undirected Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP)) ‎[427 bytes]
  439. (hist) ‎Boyer-Moore (BM) algorithm (Single String Search String Search) ‎[427 bytes]
  440. (hist) ‎MD5 (Unkeyed Hash Functions One-Way Hash Functions) ‎[426 bytes]
  441. (hist) ‎Ananthakrishna (Entity Resolution Entity Resolution) ‎[426 bytes]
  442. (hist) ‎MRRR algorithm (Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods)) ‎[426 bytes]
  443. (hist) ‎Heejo Lee; Jong Kim; Sungje Hong; and Sunggu Lee (Approximate MCSP Matrix Chain Multiplication) ‎[426 bytes]
  444. (hist) ‎Miller-Tucker-Zemlin (MTZ) formulation (Minimum TSP The Traveling-Salesman Problem) ‎[426 bytes]
  445. (hist) ‎Rabin-Karp (RK) algorithm (Single String Search String Search) ‎[426 bytes]
  446. (hist) ‎Kleitman–Wang Algorithm (Digraph Realization Problem Graph Realization Problems) ‎[425 bytes]
  447. (hist) ‎False position method (General Root Computation Root Computation) ‎[425 bytes]
  448. (hist) ‎Bisection method (General Root Computation Root Computation) ‎[425 bytes]
  449. (hist) ‎Path-based depth-first search Gabow (SCCs Strongly Connected Components) ‎[425 bytes]
  450. (hist) ‎Harel, Tarjan (Static Trees) (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) ‎[424 bytes]
  451. (hist) ‎Expectation–maximization (EM) algorithm ( Maximum Likelihood Parameters) ‎[424 bytes]
  452. (hist) ‎Bisection method (Any eigenvalue Eigenvalues (Iterative Methods)) ‎[424 bytes]
  453. (hist) ‎Expectation conditional maximization either (ECME) (Liu; Chuanhai; Rubin; Donald B) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) ‎[424 bytes]
  454. (hist) ‎Expectation-Maximization (EM) algorithm (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) ‎[424 bytes]
  455. (hist) ‎Rational sieve (Second Category Integer Factoring Integer Factoring) ‎[424 bytes]
  456. (hist) ‎Filter Kruskal algorithm (Undirected, General MST Minimum Spanning Tree (MST)) ‎[424 bytes]
  457. (hist) ‎Counting Sort (Non-Comparison Sorting Sorting) ‎[424 bytes]
  458. (hist) ‎Xiaolin Wu's line algorithm (Line Drawing Line Drawing) ‎[423 bytes]
  459. (hist) ‎CH Algorithm (SCCs Strongly Connected Components) ‎[423 bytes]
  460. (hist) ‎Karatsuba Algorithm ( Multiplication) ‎[423 bytes]
  461. (hist) ‎Zaks' prefix reversal algorithm ( All permutations) ‎[422 bytes]
  462. (hist) ‎Newton's method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations) ‎[422 bytes]
  463. (hist) ‎Chan-Singhal-Liu ( Mutual Exclusion) ‎[422 bytes]
  464. (hist) ‎Hopcroft–Karp algorithm (Bipartite Graph MCM Maximum Cardinality Matching) ‎[422 bytes]
  465. (hist) ‎Reduction from Directed, Weighted APSP to Negative Triangle Detection ‎[421 bytes]
  466. (hist) ‎Compressed Extended KF (SLAM Algorithms SLAM Algorithms) ‎[421 bytes]
  467. (hist) ‎Ramer–Douglas–Peucker algorithm ( Line Simplification) ‎[421 bytes]
  468. (hist) ‎Welford's Online algorithm ( Variance Calculations) ‎[420 bytes]
  469. (hist) ‎Steinhaus–Johnson–Trotter algorithm (All Permutations All Permutations) ‎[420 bytes]
  470. (hist) ‎Distinct-degree factorization (Distinct-degree Factorization of Polynomials Over Finite Fields) ‎[420 bytes]
  471. (hist) ‎Hierarchical Navigable Small World (HNSW) (k-ANNS Nearest Neighbor Search) ‎[419 bytes]
  472. (hist) ‎Special number field sieve (First Category Integer Factoring Integer Factoring) ‎[419 bytes]
  473. (hist) ‎J. Chen; L. Liu; and W. Jia. (The Vertex Cover Problem, Degrees Bounded By 3 The Vertex Cover Problem) ‎[419 bytes]
  474. (hist) ‎Phillips & Westbrook (st-Maximum Flow Maximum Flow) ‎[419 bytes]
  475. (hist) ‎Hierarchical Navigable Small World (HNSW) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search) ‎[419 bytes]
  476. (hist) ‎Kingsford (Motif Search Motif Search) ‎[418 bytes]
  477. (hist) ‎Projected radial search (k-ANNS for a dense 3D map of geometric points Nearest Neighbor Search) ‎[418 bytes]
  478. (hist) ‎Edmonds (Maximum-Weight Matching Maximum-Weight Matching) ‎[418 bytes]
  479. (hist) ‎Kingsford ( Motif Search) ‎[418 bytes]
  480. (hist) ‎Projected radial search (k Approximate Nearest Neighbors Search (k-ANNS) for a dense 3D map of geometric points Nearest Neighbor Search) ‎[418 bytes]
  481. (hist) ‎Y Bai (Inexact GED Graph Edit Distance Computation) ‎[417 bytes]
  482. (hist) ‎HyperLogLog algorithm ( Cardinality Estimation) ‎[417 bytes]
  483. (hist) ‎Lawler ( Chromatic Number) ‎[417 bytes]
  484. (hist) ‎EKF SLAM (SLAM Algorithms SLAM Algorithms) ‎[417 bytes]
  485. (hist) ‎Steffensen's method (General Root Computation Root Computation) ‎[416 bytes]
  486. (hist) ‎Blowfish (Block Ciphers Block Ciphers) ‎[416 bytes]
  487. (hist) ‎PSOS algorithm (Integer Relation Integer Relation) ‎[416 bytes]
  488. (hist) ‎SMAWK algorithm ( Minimum value in each row of an implicitly-defined totally monotone matrix) ‎[416 bytes]
  489. (hist) ‎Chandran and Hochbaum (Bipartite Graph MCM Maximum Cardinality Matching) ‎[416 bytes]
  490. (hist) ‎Süleyman Cenk Sahinalp ; Uzi Vishkin (Constructing Suffix Trees Constructing Suffix Trees) ‎[415 bytes]
  491. (hist) ‎Niedermeier, Rossmanith (The Vertex Cover Problem The Vertex Cover Problem) ‎[415 bytes]
  492. (hist) ‎Barvinok (Geometric Maximum TSP The Traveling-Salesman Problem) ‎[415 bytes]
  493. (hist) ‎Index calculus algorithm (Discrete Logarithm Over Finite Fields, F q Logarithm Calculations) ‎[414 bytes]
  494. (hist) ‎Sun; M. Shao; J. Chen; K. Wong; and X. Wu (Lossy Compression Data Compression) ‎[414 bytes]
  495. (hist) ‎Downey (The Vertex Cover Problem The Vertex Cover Problem) ‎[414 bytes]
  496. (hist) ‎Bini's algorithm (Matrix Multiplication Matrix Product) ‎[414 bytes]
  497. (hist) ‎B.I. Kvasov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) ‎[413 bytes]
  498. (hist) ‎Schieber; Vishkin (Parallel) (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) ‎[413 bytes]
  499. (hist) ‎Bareiss algorithm with fast multiplication (Determinant of Matrices with Integer Entries Determinant of Matrices with Integer Entries) ‎[413 bytes]
  500. (hist) ‎Fortune's algorithm (Voronoi Diagrams Voronoi Diagrams) ‎[413 bytes]

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

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