Pages with the most revisions

Jump to navigation Jump to search

Showing below up to 50 results in range #501 to #550.

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

  1. R-tree (Nearest Neighbor Search (NNS) Nearest Neighbor Search)‏‎ (2 revisions)
  2. Quick Sort (Comparison Sorting Sorting)‏‎ (2 revisions)
  3. Lawler (3-Graph Coloring Graph Coloring)‏‎ (2 revisions)
  4. Quick Kruskal algorithm (Undirected, General MST Minimum Spanning Tree (MST))‏‎ (2 revisions)
  5. Incremental convex hull algorithm; Michael Kallay ( Convex Hull)‏‎ (2 revisions)
  6. Image analogies Hertzmann (Texture Synthesis Texture Synthesis)‏‎ (2 revisions)
  7. Image Segmentation‏‎ (2 revisions)
  8. Quasi-linear Topological watershed ( Image Segmentation)‏‎ (2 revisions)
  9. HybridSpades (Sequence-to-Graph Alignment Sequence-to-Graph Alignment)‏‎ (2 revisions)
  10. Lee and Sidford ( Linear Programming)‏‎ (2 revisions)
  11. Psinger (Subset Sum The Subset-Sum Problem)‏‎ (2 revisions)
  12. Horowitz and Sahni (Subset Sum The Subset-Sum Problem)‏‎ (2 revisions)
  13. Probabilistic Convolution Tree (Change-Making Problem Change-Making Problem)‏‎ (2 revisions)
  14. Hopcroft–Karp algorithm (Bipartite Graph MCM Maximum Cardinality Matching)‏‎ (2 revisions)
  15. Hopcroft 2-3 Tree ( Self-Balancing Trees Search)‏‎ (2 revisions)
  16. Hopcroft 2-3 Tree ( Self-Balancing Trees Insertion)‏‎ (2 revisions)
  17. Hopcroft 2-3 Tree ( Self-Balancing Trees Deletion)‏‎ (2 revisions)
  18. Hopcroft 2-3 Tree ( Self-Balancing Trees Creation)‏‎ (2 revisions)
  19. Lenstra elliptic curve factorization (First Category Integer Factoring Integer Factoring)‏‎ (2 revisions)
  20. Liang–Barsky (Rectangular Window Line Clipping)‏‎ (2 revisions)
  21. Hoare's Selection Algorithm (QuickSelect) (kth Order Statistic kth Order Statistic)‏‎ (2 revisions)
  22. Hinrichs; Nievergelt; Schorn (2-dimensional space, l m (or l infty) norm Closest Pair Problem)‏‎ (2 revisions)
  23. Prim's algorithm + Fibonacci heaps; Fredman & Tarjan (Undirected, General MST Minimum Spanning Tree (MST))‏‎ (2 revisions)
  24. Press, Teukolsky, Flannery (Square Matrix LU Decomposition LU Decomposition)‏‎ (2 revisions)
  25. Preparata and Hong (2-dimensional; 3-dimensional Convex Hull)‏‎ (2 revisions)
  26. Linde–Buzo–Gray algorithm ( Voronoi Diagrams)‏‎ (2 revisions)
  27. Gabow Ahuja Algorithm (Nonnegative Integer Weights Shortest Path (Directed Graphs))‏‎ (2 revisions)
  28. Longest Common Substring with don't cares‏‎ (2 revisions)
  29. Phillips & Westbrook (st-Maximum Flow Maximum Flow)‏‎ (2 revisions)
  30. Lossless Compression‏‎ (2 revisions)
  31. Pettie & Ramachandran (APSP on Dense Undirected Graphs with Arbitrary Weights; APSP on Sparse Undirected Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP))‏‎ (2 revisions)
  32. Gentleman; Morven and Gordon Sande radix-4 algorithm (Discrete Fourier Transform Discrete Fourier Transform)‏‎ (2 revisions)
  33. Petford and Welsh (3-Graph Coloring Graph Coloring)‏‎ (2 revisions)
  34. Perumalla and Deo (1D Maximum Subarray Maximum Subarray Problem)‏‎ (2 revisions)
  35. LÉVY B.; PETITJEAN S.; RAY N.; MAILLOT J 2002 (Mesh Parameterization Mesh Parameterization)‏‎ (2 revisions)
  36. M. Chrobak and D. Eppstein (Enumerating Maximal Cliques, arbitrary graph Clique Problems)‏‎ (2 revisions)
  37. Generalized expectation maximization (GEM) algorithm ( Maximum Likelihood Parameters)‏‎ (2 revisions)
  38. Manacher (Longest Palindromic Substring Longest Palindromic Substring)‏‎ (2 revisions)
  39. Maneva and M. J. Wainwright (Lossy Compression Data Compression)‏‎ (2 revisions)
  40. Generalized Büchi Games‏‎ (2 revisions)
  41. Martinian and M. J. Wainwright (Lossy Compression Data Compression)‏‎ (2 revisions)
  42. Galil & Naamad ( Maximum Flow)‏‎ (2 revisions)
  43. Maybeck; Peter S Extended Kalman Filter (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes))‏‎ (2 revisions)
  44. Micali and Vazirani ( Maximum Cardinality Matching)‏‎ (2 revisions)
  45. Micali; Vazirani ( Maximum-Weight Matching)‏‎ (2 revisions)
  46. Fortune and Hopcroft (k-dimensional space, l m (or l infty) norm Closest Pair Problem)‏‎ (2 revisions)
  47. Fourier–Motzkin elimination ( Linear Programming)‏‎ (2 revisions)
  48. Mesh Parameterization‏‎ (2 revisions)
  49. Merge Sort (Comparison Sorting Sorting)‏‎ (2 revisions)
  50. Replacement Paths Problem‏‎ (2 revisions)

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

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