Pages with the most revisions

Jump to navigation Jump to search

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

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

  1. Aho, Garey & Ullman (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem)‏‎ (34 revisions)
  2. Reduction from Matrix Product to Negative Triangle Detection‏‎ (16 revisions)
  3. Baran, Demaine, Patrascu (Integer 3SUM 3SUM)‏‎ (11 revisions)
  4. Harvey; Hoeven; Lecerf ( Multiplication)‏‎ (10 revisions)
  5. Covanov and Thomé ( Multiplication)‏‎ (9 revisions)
  6. Reduction from Triangle Collection* to dynamic 4/3-Diameter‏‎ (9 revisions)
  7. Strassen's algorithm (Matrix Multiplication Matrix Product)‏‎ (8 revisions)
  8. Reduction from Reach Centrality to Diameter‏‎ (8 revisions)
  9. Multiplication‏‎ (8 revisions)
  10. Disk Scheduling‏‎ (8 revisions)
  11. Discrete Fourier Transform‏‎ (8 revisions)
  12. NFA to DFA conversion‏‎ (8 revisions)
  13. Reduction from CNF-SAT to Approximate Reach Centrality‏‎ (8 revisions)
  14. Goldberg & Rao (Integer Maximum Flow Maximum Flow)‏‎ (8 revisions)
  15. Coppersmith–Winograd algorithm (Matrix Multiplication Matrix Product)‏‎ (8 revisions)
  16. Mutual Exclusion‏‎ (8 revisions)
  17. Goldberg & Rao (Parallel) (Integer Maximum Flow Maximum Flow)‏‎ (8 revisions)
  18. Strongly Connected Components‏‎ (8 revisions)
  19. Joins‏‎ (8 revisions)
  20. Koutis; Miller and Peng (Inexact Laplacian Solver SDD Systems Solvers)‏‎ (8 revisions)
  21. Cycle Detection‏‎ (8 revisions)
  22. Matrix Multiplication‏‎ (8 revisions)
  23. Czumaj (Approximate MCOP Matrix Chain Multiplication)‏‎ (8 revisions)
  24. Kathuria, Liu, Sidford ( Maximum Flow)‏‎ (8 revisions)
  25. Motif Search‏‎ (8 revisions)
  26. Non-Definite, Symmetric Matrix‏‎ (7 revisions)
  27. Inexact GED‏‎ (7 revisions)
  28. Enumerating Maximal Cliques, arbitrary graph‏‎ (7 revisions)
  29. Topological Sorting‏‎ (7 revisions)
  30. Planar Bipartite Graph Perfect Matching‏‎ (7 revisions)
  31. Key Exchange‏‎ (7 revisions)
  32. Reporting all intersection points, line segments‏‎ (7 revisions)
  33. Reporting all intersection points, convex polygons‏‎ (7 revisions)
  34. Single String Search‏‎ (7 revisions)
  35. DFA Minimization‏‎ (7 revisions)
  36. Integer Maximum Flow‏‎ (7 revisions)
  37. Minimum value in each row of an implicitly-defined totally monotone matrix‏‎ (7 revisions)
  38. General Permutations‏‎ (7 revisions)
  39. Edit Sequence, constant-size alphabet‏‎ (7 revisions)
  40. Exact GED‏‎ (7 revisions)
  41. General Graph MCM‏‎ (7 revisions)
  42. Rectangular Window‏‎ (7 revisions)
  43. Integer Factoring‏‎ (7 revisions)
  44. Greatest Common Divisor‏‎ (7 revisions)
  45. APSP‏‎ (7 revisions)
  46. APSP on Dense Directed Graphs with Arbitrary Weights‏‎ (7 revisions)
  47. Stable Marriage Problem‏‎ (7 revisions)
  48. APSP on Dense Undirected Graphs with Arbitrary Weights‏‎ (7 revisions)
  49. APSP on Dense Undirected Graphs with Positive Integer Weights‏‎ (7 revisions)
  50. APSP on Dense Undirected Unweighted Graphs‏‎ (7 revisions)
  51. APSP on Geometrically Weighted Graphs‏‎ (7 revisions)
  52. Transitive Closure‏‎ (7 revisions)
  53. APSP on Sparse Undirected Graphs with Positive Integer Weights‏‎ (7 revisions)
  54. APSP on Sparse Undirected Unweighted Graphs‏‎ (7 revisions)
  55. Cryptanalysis of Linear Feedback Shift Registers‏‎ (7 revisions)
  56. Undirected, General MST‏‎ (7 revisions)
  57. Cyclic Permutations‏‎ (7 revisions)
  58. Matrix Chain Ordering Problem‏‎ (7 revisions)
  59. Delaunay Triangulation‏‎ (7 revisions)
  60. Minimum TSP‏‎ (7 revisions)
  61. Exact Laplacian Solver‏‎ (7 revisions)
  62. All Permutations‏‎ (7 revisions)
  63. Alphabetic Tree Problem‏‎ (7 revisions)
  64. Reporting all intersection points, generalized segments‏‎ (7 revisions)
  65. Nonnegative Integer Weights‏‎ (7 revisions)
  66. Gröbner Bases‏‎ (7 revisions)
  67. CFG Recognition‏‎ (7 revisions)
  68. BCNF Decomposition‏‎ (7 revisions)
  69. St-Maximum Flow‏‎ (7 revisions)
  70. Informed Search‏‎ (7 revisions)
  71. Toeplitz Matrix‏‎ (7 revisions)
  72. Nonnegative Weights‏‎ (7 revisions)
  73. Subset Sum‏‎ (7 revisions)
  74. Square Matrix LU Decomposition‏‎ (7 revisions)
  75. Chen; I. Kanj; and W. Jia. (The Vertex Cover Problem The Vertex Cover Problem)‏‎ (7 revisions)
  76. CFG Parsing‏‎ (7 revisions)
  77. Vandermonde Matrix‏‎ (7 revisions)
  78. Line Drawing‏‎ (7 revisions)
  79. Convex Polygonal Window‏‎ (7 revisions)
  80. Maximum-Weight Matching‏‎ (7 revisions)
  81. Bipartite Graph MCM‏‎ (7 revisions)
  82. Bipartite Maximum-Weight Matching‏‎ (7 revisions)
  83. Non-Comparison Sorting‏‎ (7 revisions)
  84. Eigenpair with the Largest Eigenvalue‏‎ (6 revisions)
  85. Vaidya ( Linear Programming)‏‎ (6 revisions)
  86. Lowest Common Ancestor‏‎ (6 revisions)
  87. Polygon Clipping with Arbitrary Clipping Polygon‏‎ (6 revisions)
  88. 1D Maximum Subarray‏‎ (6 revisions)
  89. 2-Dimensional Poisson Problem‏‎ (6 revisions)
  90. Stratonovich (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes))‏‎ (6 revisions)
  91. 2-dimensional space, Euclidean metric‏‎ (6 revisions)
  92. Discrete Logarithm Over Finite Fields‏‎ (6 revisions)
  93. 3-Dimensional Poisson Problem‏‎ (6 revisions)
  94. 3-Graph Coloring‏‎ (6 revisions)
  95. Self-Balancing Trees Creation‏‎ (6 revisions)
  96. 4-Graph Coloring‏‎ (6 revisions)
  97. Lossy Compression‏‎ (6 revisions)
  98. Longest Palindromic Substring‏‎ (6 revisions)
  99. Global Register Allocation‏‎ (6 revisions)
  100. Reduction from k-Clique to RNA Folding‏‎ (6 revisions)
  101. Finding Frequent Itemsets‏‎ (6 revisions)
  102. Smith (2-dimensional Maximum subarray problem)‏‎ (6 revisions)
  103. Cardinality Estimation‏‎ (6 revisions)
  104. Duplicate Elimination‏‎ (6 revisions)
  105. Longest Common Subsequence‏‎ (6 revisions)
  106. Coset Enumeration‏‎ (6 revisions)
  107. Voronoi Diagrams‏‎ (6 revisions)
  108. Acyclic DFA Minimization‏‎ (6 revisions)
  109. De Novo Genome Assembly‏‎ (6 revisions)
  110. Median String Problem with Unbounded Alphabets‏‎ (6 revisions)
  111. Determinant of Matrices with Integer Entries‏‎ (6 revisions)
  112. Off-Line Lowest Common Ancestor‏‎ (6 revisions)
  113. All Maximal Non-Branching Paths in a Graph‏‎ (6 revisions)
  114. Polygon Clipping with Convex Clipping Polygon‏‎ (6 revisions)
  115. Factorization of Polynomials Over Finite Fields‏‎ (6 revisions)
  116. Positive Definite, Hermitian Matrix‏‎ (6 revisions)
  117. Gabow (general Maximum-weight matching)‏‎ (6 revisions)
  118. Multivalued Dependency Inference Problem‏‎ (6 revisions)
  119. General Linear System‏‎ (6 revisions)
  120. Eigenpair closest to mu‏‎ (6 revisions)
  121. Gronlund, Pettie (Real 3SUM 3SUM)‏‎ (6 revisions)
  122. Frequent Words with Mismatches Problem‏‎ (6 revisions)
  123. Functional Dependency Inference Problem‏‎ (6 revisions)
  124. Reduction from k-Clique to CFG Recognition‏‎ (6 revisions)
  125. Tower of Hanoi‏‎ (6 revisions)
  126. The Frequent Words Problem‏‎ (6 revisions)
  127. Self-Balancing Trees Deletion‏‎ (6 revisions)
  128. Change-Making Problem‏‎ (6 revisions)
  129. Self-Balancing Trees Insertion‏‎ (6 revisions)
  130. Self-Balancing Trees Search‏‎ (6 revisions)
  131. Stable Roommates Problem‏‎ (6 revisions)
  132. Rod-Cutting Problem‏‎ (6 revisions)
  133. Transitive Reduction Problem of Directed Graphs‏‎ (6 revisions)
  134. Convex Optimization (Non-linear)‏‎ (6 revisions)
  135. Constructing Eulerian Trails in a Graph‏‎ (6 revisions)
  136. Variance Calculations‏‎ (6 revisions)
  137. Lowest Common Ancestor with Static Trees‏‎ (6 revisions)
  138. Counting Solutions‏‎ (6 revisions)
  139. Cyclic Nontrivial SCCs DFA Minimization‏‎ (6 revisions)
  140. Beigel & Eppstein (3-Graph Coloring Graph Coloring)‏‎ (6 revisions)
  141. Turnpike Problem‏‎ (6 revisions)
  142. Decisional BCNF‏‎ (6 revisions)
  143. Multiple String Search‏‎ (6 revisions)
  144. Comparison Sorting‏‎ (6 revisions)
  145. Polynomial Interpolation‏‎ (6 revisions)
  146. InDegree Analysis‏‎ (5 revisions)
  147. Sorting‏‎ (5 revisions)
  148. Maximum Likelihood Parameters‏‎ (5 revisions)
  149. Matrix Factorization‏‎ (5 revisions)
  150. Offline‏‎ (5 revisions)
  151. OV‏‎ (5 revisions)
  152. 4NF Decomposition‏‎ (5 revisions)
  153. 4NF Decomposition for Conflict-Free Dependency Sets‏‎ (5 revisions)
  154. 4NF Decomposition for Functional and Multivalued Dependency Sets‏‎ (5 revisions)
  155. Solutions to Nonlinear Equations‏‎ (5 revisions)
  156. AST to Code Translation‏‎ (5 revisions)
  157. Cyclic Peptide Sequencing Problem‏‎ (5 revisions)
  158. Optimal Policies for MDPs‏‎ (5 revisions)
  159. Online‏‎ (5 revisions)
  160. Entity Resolution‏‎ (5 revisions)
  161. Distributed Locking Algorithms‏‎ (5 revisions)
  162. Rick (LCS Longest Common Subsequence)‏‎ (5 revisions)
  163. Filtering Problem (Stochastic Processes)‏‎ (5 revisions)
  164. Hyperbolic Spline Interpolation‏‎ (5 revisions)
  165. Arithmetic Expression Binary Tree‏‎ (5 revisions)
  166. Clock Synchronization in Distributed Systems‏‎ (5 revisions)
  167. Point-in-Polygon‏‎ (5 revisions)
  168. Kth Order Statistic‏‎ (5 revisions)
  169. Constructing Suffix Trees‏‎ (5 revisions)
  170. Link Analysis‏‎ (5 revisions)
  171. Longest Path on Interval Graphs‏‎ (5 revisions)
  172. Main Page‏‎ (5 revisions)
  173. Maximum Likelihood Methods in Unknown Latent Variables‏‎ (5 revisions)
  174. Digraph Realization Problem‏‎ (5 revisions)
  175. Boolean Matrix Multiplication‏‎ (4 revisions)
  176. 2-dimensional Convex Hull‏‎ (4 revisions)
  177. Weighted Set-Covering‏‎ (4 revisions)
  178. Reduction from Maximum Inner Product Search to Stable Pair Checking‏‎ (4 revisions)
  179. 3SAT‏‎ (4 revisions)
  180. 3SUM‏‎ (4 revisions)
  181. Triangle Detection‏‎ (4 revisions)
  182. Maximum Cut‏‎ (4 revisions)
  183. Disjunctive Reachability Queries in MDPs‏‎ (4 revisions)
  184. Graph Isomorphism, Bounded Number of Vertices of Each Color‏‎ (4 revisions)
  185. Huffman Encoding‏‎ (4 revisions)
  186. The Vertex Cover Problem‏‎ (4 revisions)
  187. APSP on Sparse Undirected Graphs with Arbitrary Weights‏‎ (4 revisions)
  188. D-Neighborhood of a String‏‎ (4 revisions)
  189. Reduction from MAX-CNF-SAT to All-Pairs Maximum Flow‏‎ (4 revisions)
  190. Reduction from MAX-CNF-SAT to st-Maximum Flow‏‎ (4 revisions)
  191. Fomin; Gaspers & Saurabh (‏‎ (4 revisions)
  192. SAT‏‎ (4 revisions)
  193. Secret Sharing‏‎ (4 revisions)
  194. Serang (Subset Sum The Subset-Sum Problem)‏‎ (4 revisions)
  195. Chan (Boolean Matrix Multiplication (Combinatorial) Matrix Product)‏‎ (4 revisions)
  196. K Approximate Nearest Neighbors Search‏‎ (4 revisions)
  197. Unweighted Set-Covering‏‎ (4 revisions)
  198. Unweighted Interval Scheduling‏‎ (4 revisions)
  199. Bansal, Williams (Boolean Matrix Multiplication (Combinatorial) Matrix Product)‏‎ (4 revisions)
  200. Lowest Common Ancestor with Linking‏‎ (4 revisions)
  201. Maximum Subarray‏‎ (4 revisions)
  202. Maximum TSP‏‎ (4 revisions)
  203. Max-Weight Rectangle‏‎ (3 revisions)
  204. (5/3)-approximate ap-shortest paths‏‎ (3 revisions)
  205. 1-in-3SAT‏‎ (3 revisions)
  206. 1-sensitive (4/3)-approximate decremental diameter‏‎ (3 revisions)
  207. 1-sensitive (4/3)-approximate decremental eccentricity‏‎ (3 revisions)
  208. 2-dimensional Convex Hull, Dynamic‏‎ (3 revisions)
  209. Monotone 3SAT‏‎ (3 revisions)
  210. 2-sensitive incremental st-reach‏‎ (3 revisions)
  211. 4SAT‏‎ (3 revisions)
  212. 5-Graph Coloring‏‎ (3 revisions)
  213. Min-Weight k-Clique‏‎ (3 revisions)
  214. Median String Problem with Bounded Alphabets‏‎ (3 revisions)
  215. Multiple Local Alignment‏‎ (3 revisions)
  216. Constructing Solutions‏‎ (3 revisions)
  217. Minimum Witness Finding‏‎ (3 revisions)
  218. D-dimensional Convex Hull‏‎ (3 revisions)
  219. Minimum-Cost Flow‏‎ (3 revisions)
  220. DAG Realization Problem‏‎ (3 revisions)
  221. Monotone Not-Exactly-1-in-3SAT‏‎ (3 revisions)
  222. Monotone Not-All-Equal 3-SAT (Monotone NAE 3SAT)‏‎ (3 revisions)
  223. All-Equal-SAT‏‎ (3 revisions)
  224. All-Integers 3SUM‏‎ (3 revisions)
  225. All-Nodes Median Parity‏‎ (3 revisions)
  226. All-Pairs Maximum Flow‏‎ (3 revisions)
  227. Constant sensitivity (4/3)-approximate incremental diameter‏‎ (3 revisions)
  228. Linear Programming with Reals‏‎ (3 revisions)
  229. Counting number of intersection points, line segments‏‎ (3 revisions)
  230. Convex Polyhedral Window‏‎ (3 revisions)
  231. Lowest Common Ancestor with Linking Roots‏‎ (3 revisions)
  232. Largest Common Subtree‏‎ (3 revisions)
  233. Matrix Chain Scheduling Problem‏‎ (3 revisions)
  234. Lowest Common Ancestors with Linking and Cutting‏‎ (3 revisions)
  235. Minimum Triangle‏‎ (3 revisions)
  236. Max-Weight k-Clique‏‎ (3 revisions)
  237. MaxSAT‏‎ (3 revisions)
  238. Maximum Local Edge Connectivity‏‎ (3 revisions)
  239. Deadlock Avoidance‏‎ (3 revisions)
  240. Median‏‎ (3 revisions)
  241. Median String Problem with Binary Alphabets‏‎ (3 revisions)
  242. Betweenness Centrality‏‎ (3 revisions)
  243. Bichromatic Hamming Close Pair‏‎ (3 revisions)
  244. Metricity‏‎ (3 revisions)
  245. Diameter 2 vs 3‏‎ (3 revisions)
  246. Diameter 3 vs 7‏‎ (3 revisions)
  247. Diameter‏‎ (3 revisions)
  248. Monotone 1-in-3SAT‏‎ (3 revisions)
  249. Minimum Wiener Connector Problem‏‎ (3 revisions)
  250. Decremental Diameter‏‎ (3 revisions)

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

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