Pages with the most revisions
Jump to navigation
Jump to search
Showing below up to 50 results in range #451 to #500.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- Mitzenmacher & Upfal (Maximum Cut, Approximate Maximum Cut) (2 revisions)
- Root Computation (2 revisions)
- Flash Sort (Non-Comparison Sorting Sorting) (2 revisions)
- Fleischer forward-backward (FB) algorithm (SCCs Strongly Connected Components) (2 revisions)
- Fleury's algorithm + Thorup (Constructing Eulerian Trails in a Graph Constructing Eulerian Trails in a Graph) (2 revisions)
- Floyd–Warshall algorithm (APSP All-Pairs Shortest Paths (APSP)) (2 revisions)
- Opheim simplification ( Line Simplification) (2 revisions)
- Reumann–Witkam ( Line Simplification) (2 revisions)
- Ford–Fulkerson algorithm (Bipartite Graph MCM Maximum Cardinality Matching) (2 revisions)
- Fortune's algorithm (Voronoi Diagrams Voronoi Diagrams) (2 revisions)
- Miller; Stout (2-dimensional Convex Hull) (2 revisions)
- Ioannidou; Kyriaki; Mertzios; George B.; Nikolopoulos; Stavros D. (Longest Path on Interval Graphs Longest Path Problem) (2 revisions)
- Linde–Buzo–Gray algorithm ( Voronoi Diagrams) (2 revisions)
- Preparata and Hong (2-dimensional; 3-dimensional Convex Hull) (2 revisions)
- Press, Teukolsky, Flannery (Square Matrix LU Decomposition LU Decomposition) (2 revisions)
- Prim's algorithm + Fibonacci heaps; Fredman & Tarjan (Undirected, General MST Minimum Spanning Tree (MST)) (2 revisions)
- Hinrichs; Nievergelt; Schorn (2-dimensional space, l m (or l infty) norm Closest Pair Problem) (2 revisions)
- Hoare's Selection Algorithm (QuickSelect) (kth Order Statistic kth Order Statistic) (2 revisions)
- Liang–Barsky (Rectangular Window Line Clipping) (2 revisions)
- Lenstra elliptic curve factorization (First Category Integer Factoring Integer Factoring) (2 revisions)
- Hopcroft 2-3 Tree ( Self-Balancing Trees Creation) (2 revisions)
- Hopcroft 2-3 Tree ( Self-Balancing Trees Deletion) (2 revisions)
- Hopcroft 2-3 Tree ( Self-Balancing Trees Insertion) (2 revisions)
- Hopcroft 2-3 Tree ( Self-Balancing Trees Search) (2 revisions)
- Hopcroft–Karp algorithm (Bipartite Graph MCM Maximum Cardinality Matching) (2 revisions)
- Probabilistic Convolution Tree (Change-Making Problem Change-Making Problem) (2 revisions)
- Horowitz and Sahni (Subset Sum The Subset-Sum Problem) (2 revisions)
- Psinger (Subset Sum The Subset-Sum Problem) (2 revisions)
- Lee and Sidford ( Linear Programming) (2 revisions)
- HybridSpades (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) (2 revisions)
- Quasi-linear Topological watershed ( Image Segmentation) (2 revisions)
- Image Segmentation (2 revisions)
- Image analogies Hertzmann (Texture Synthesis Texture Synthesis) (2 revisions)
- Incremental convex hull algorithm; Michael Kallay ( Convex Hull) (2 revisions)
- Quick Kruskal algorithm (Undirected, General MST Minimum Spanning Tree (MST)) (2 revisions)
- Lawler (3-Graph Coloring Graph Coloring) (2 revisions)
- Quick Sort (Comparison Sorting Sorting) (2 revisions)
- R-tree (Nearest Neighbor Search (NNS) Nearest Neighbor Search) (2 revisions)
- Lang simplification ( Line Simplification) (2 revisions)
- Rabin Karp (The Frequent Words Problem The Frequent Words Problem) (2 revisions)
- LOOK (Disk Scheduling Disk Scheduling) (2 revisions)
- Rader–Brenner algorithm (Discrete Fourier Transform Discrete Fourier Transform) (2 revisions)
- LEE Y.; KIM H. S.; LEE S 2002 (Mesh Parameterization Mesh Parameterization) (2 revisions)
- Intro Sort (Comparison Sorting Sorting) (2 revisions)
- Rautiainen, Marschall (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) (2 revisions)
- Raymond's algorithm ( Mutual Exclusion) (2 revisions)
- Knuth-Morris-Pratt (KMP) algorithm (Single String Search String Search) (2 revisions)
- Rautiainen and Marschall (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) (2 revisions)
- Rao-Blackwellized Particle Filtering SLAM (SLAM Algorithms SLAM Algorithms) (2 revisions)
- Katajainen and M. Koppinen ( Delaunay Triangulation) (2 revisions)