Pages with the most revisions

Jump to navigation Jump to search

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

View (previous 100 | next 100) (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. Reduction from CNF-SAT to Approximate Reach Centrality‏‎ (8 revisions)
  8. Koutis; Miller and Peng (Inexact Laplacian Solver SDD Systems Solvers)‏‎ (8 revisions)
  9. Discrete Fourier Transform‏‎ (8 revisions)
  10. Goldberg & Rao (Integer Maximum Flow Maximum Flow)‏‎ (8 revisions)
  11. NFA to DFA conversion‏‎ (8 revisions)
  12. Czumaj (Approximate MCOP Matrix Chain Multiplication)‏‎ (8 revisions)
  13. Matrix Multiplication‏‎ (8 revisions)
  14. Multiplication‏‎ (8 revisions)
  15. Goldberg & Rao (Parallel) (Integer Maximum Flow Maximum Flow)‏‎ (8 revisions)
  16. Coppersmith–Winograd algorithm (Matrix Multiplication Matrix Product)‏‎ (8 revisions)
  17. Strassen's algorithm (Matrix Multiplication Matrix Product)‏‎ (8 revisions)
  18. Kathuria, Liu, Sidford ( Maximum Flow)‏‎ (8 revisions)
  19. Disk Scheduling‏‎ (8 revisions)
  20. Cycle Detection‏‎ (8 revisions)
  21. Joins‏‎ (8 revisions)
  22. Reduction from Reach Centrality to Diameter‏‎ (8 revisions)
  23. Strongly Connected Components‏‎ (8 revisions)
  24. Motif Search‏‎ (8 revisions)
  25. Mutual Exclusion‏‎ (8 revisions)
  26. Inexact GED‏‎ (7 revisions)
  27. All Permutations‏‎ (7 revisions)
  28. Stable Marriage Problem‏‎ (7 revisions)
  29. Maximum-Weight Matching‏‎ (7 revisions)
  30. General Permutations‏‎ (7 revisions)
  31. Nonnegative Integer Weights‏‎ (7 revisions)
  32. Topological Sorting‏‎ (7 revisions)
  33. Cryptanalysis of Linear Feedback Shift Registers‏‎ (7 revisions)
  34. General Graph MCM‏‎ (7 revisions)
  35. Informed Search‏‎ (7 revisions)
  36. Nonnegative Weights‏‎ (7 revisions)
  37. Square Matrix LU Decomposition‏‎ (7 revisions)
  38. Subset Sum‏‎ (7 revisions)
  39. Rectangular Window‏‎ (7 revisions)
  40. Non-Definite, Symmetric Matrix‏‎ (7 revisions)
  41. Reporting all intersection points, generalized segments‏‎ (7 revisions)
  42. Integer Maximum Flow‏‎ (7 revisions)
  43. Matrix Chain Ordering Problem‏‎ (7 revisions)
  44. DFA Minimization‏‎ (7 revisions)
  45. Reporting all intersection points, convex polygons‏‎ (7 revisions)
  46. Reporting all intersection points, line segments‏‎ (7 revisions)
  47. Key Exchange‏‎ (7 revisions)
  48. Minimum value in each row of an implicitly-defined totally monotone matrix‏‎ (7 revisions)
  49. Vandermonde Matrix‏‎ (7 revisions)
  50. Line Drawing‏‎ (7 revisions)
  51. Exact Laplacian Solver‏‎ (7 revisions)
  52. Cyclic Permutations‏‎ (7 revisions)
  53. Greatest Common Divisor‏‎ (7 revisions)
  54. Gröbner Bases‏‎ (7 revisions)
  55. Convex Polygonal Window‏‎ (7 revisions)
  56. Chen; I. Kanj; and W. Jia. (The Vertex Cover Problem The Vertex Cover Problem)‏‎ (7 revisions)
  57. Enumerating Maximal Cliques, arbitrary graph‏‎ (7 revisions)
  58. Integer Factoring‏‎ (7 revisions)
  59. Delaunay Triangulation‏‎ (7 revisions)
  60. Single String Search‏‎ (7 revisions)
  61. Minimum TSP‏‎ (7 revisions)
  62. BCNF Decomposition‏‎ (7 revisions)
  63. St-Maximum Flow‏‎ (7 revisions)
  64. Toeplitz Matrix‏‎ (7 revisions)
  65. Bipartite Graph MCM‏‎ (7 revisions)
  66. Bipartite Maximum-Weight Matching‏‎ (7 revisions)
  67. Transitive Closure‏‎ (7 revisions)
  68. Exact GED‏‎ (7 revisions)
  69. Edit Sequence, constant-size alphabet‏‎ (7 revisions)
  70. CFG Recognition‏‎ (7 revisions)
  71. CFG Parsing‏‎ (7 revisions)
  72. APSP‏‎ (7 revisions)
  73. APSP on Dense Directed Graphs with Arbitrary Weights‏‎ (7 revisions)
  74. APSP on Dense Undirected Graphs with Arbitrary Weights‏‎ (7 revisions)
  75. APSP on Dense Undirected Graphs with Positive Integer Weights‏‎ (7 revisions)
  76. APSP on Dense Undirected Unweighted Graphs‏‎ (7 revisions)
  77. APSP on Geometrically Weighted Graphs‏‎ (7 revisions)
  78. Undirected, General MST‏‎ (7 revisions)
  79. Non-Comparison Sorting‏‎ (7 revisions)
  80. APSP on Sparse Undirected Graphs with Positive Integer Weights‏‎ (7 revisions)
  81. APSP on Sparse Undirected Unweighted Graphs‏‎ (7 revisions)
  82. Alphabetic Tree Problem‏‎ (7 revisions)
  83. Planar Bipartite Graph Perfect Matching‏‎ (7 revisions)
  84. General Linear System‏‎ (6 revisions)
  85. Finding Frequent Itemsets‏‎ (6 revisions)
  86. Lossy Compression‏‎ (6 revisions)
  87. Factorization of Polynomials Over Finite Fields‏‎ (6 revisions)
  88. Longest Palindromic Substring‏‎ (6 revisions)
  89. Global Register Allocation‏‎ (6 revisions)
  90. Coset Enumeration‏‎ (6 revisions)
  91. 2-dimensional space, Euclidean metric‏‎ (6 revisions)
  92. Change-Making Problem‏‎ (6 revisions)
  93. Gabow (general Maximum-weight matching)‏‎ (6 revisions)
  94. 4-Graph Coloring‏‎ (6 revisions)
  95. Multiple String Search‏‎ (6 revisions)
  96. Multivalued Dependency Inference Problem‏‎ (6 revisions)
  97. Gronlund, Pettie (Real 3SUM 3SUM)‏‎ (6 revisions)
  98. Convex Optimization (Non-linear)‏‎ (6 revisions)
  99. Counting Solutions‏‎ (6 revisions)
  100. Constructing Eulerian Trails in a Graph‏‎ (6 revisions)

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