Short pages

Jump to navigation Jump to search

Showing below up to 50 results in range #751 to #800.

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

  1. (hist) ‎Tarjan (directed, dense) (Directed (Optimum Branchings), Super Dense MST Minimum Spanning Tree (MST)) ‎[360 bytes]
  2. (hist) ‎Tompkins–Paige algorithm (All Permutations All Permutations) ‎[360 bytes]
  3. (hist) ‎Inverse iteration (Eigenpair closest to mu; Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods)) ‎[360 bytes]
  4. (hist) ‎Lucifer / DES (Block Ciphers Block Ciphers) ‎[360 bytes]
  5. (hist) ‎Grahne and Räihä (4NF Decomposition for Functional and Multivalued Dependency Sets 4NF Decomposition) ‎[360 bytes]
  6. (hist) ‎Shell Sort; (Sedgewick) (Comparison Sorting Sorting) ‎[361 bytes]
  7. (hist) ‎Leases (Cary G Gray and David R Cheriton) (Distributed Locking Algorithms Distributed Locking Algorithms) ‎[361 bytes]
  8. (hist) ‎QR algorithm (All eigenvalues; Any eigenvalue Eigenvalues (Iterative Methods)) ‎[361 bytes]
  9. (hist) ‎Farach (Constructing Suffix Trees Constructing Suffix Trees) ‎[361 bytes]
  10. (hist) ‎Hopcroft 2-3 Tree ( Self-Balancing Trees Insertion) ‎[361 bytes]
  11. (hist) ‎Ford & Fulkerson ( Maximum Flow) ‎[362 bytes]
  12. (hist) ‎Smith–Waterman algorithm (Edit sequence, local alignment Sequence Alignment) ‎[362 bytes]
  13. (hist) ‎Wheel factorization (First Category Integer Factoring Integer Factoring) ‎[362 bytes]
  14. (hist) ‎Resource hierarchy solution (Dining Philosophers Problem Deadlock Avoidance) ‎[362 bytes]
  15. (hist) ‎Manlove; Malley (Stable Marriage Problem Stable Matching Problem) ‎[362 bytes]
  16. (hist) ‎Lee, Sidford ( Maximum Flow) ‎[362 bytes]
  17. (hist) ‎Eppstein ( Chromatic Number) ‎[362 bytes]
  18. (hist) ‎Modified Knuth's DP algorithm (OBST Optimal Binary Search Trees) ‎[362 bytes]
  19. (hist) ‎Knuth's DP algorithm (OBST Optimal Binary Search Trees) ‎[362 bytes]
  20. (hist) ‎Greiner–Hormann clipping algorithm (Polygon Clipping with Arbitrary Clipping Polygon Polygon Clipping) ‎[362 bytes]
  21. (hist) ‎Vatti clipping algorithm (Polygon Clipping with Arbitrary Clipping Polygon Polygon Clipping) ‎[362 bytes]
  22. (hist) ‎Stephen Alstrup, Cyril Gavoille, Haim Kaplan & Theis Rauhe (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) ‎[362 bytes]
  23. (hist) ‎X Chen (Exact GED Graph Edit Distance Computation) ‎[362 bytes]
  24. (hist) ‎Sorted Neighborhood Algorithm (SNA) (Duplicate Elimination Duplicate Elimination) ‎[362 bytes]
  25. (hist) ‎Rivin, Zabih (Counting Solutions n-Queens Problem) ‎[362 bytes]
  26. (hist) ‎A* Algorithm (Informed Search Informed Search) ‎[363 bytes]
  27. (hist) ‎Altschul and Erickson (Edit sequence, local alignment Sequence Alignment) ‎[363 bytes]
  28. (hist) ‎David Sankoff (Edit sequence, global alignment Sequence Alignment) ‎[363 bytes]
  29. (hist) ‎Pollard's rho algorithm (First Category Integer Factoring Integer Factoring) ‎[363 bytes]
  30. (hist) ‎Yu (Boolean Matrix Multiplication (Combinatorial) Matrix Product) ‎[363 bytes]
  31. (hist) ‎Alman, Vassilevska Williams ( Matrix Multiplication) ‎[363 bytes]
  32. (hist) ‎Neuhaus, Riesen, Bunke (Inexact GED Graph Edit Distance Computation) ‎[363 bytes]
  33. (hist) ‎Sleator and Tarjan (Linking and Cutting) (Lowest Common Ancestor with Linking and Cutting Lowest Common Ancestor) ‎[363 bytes]
  34. (hist) ‎Sleator and Tarjan (Linking) (Lowest Common Ancestor with Linking Lowest Common Ancestor) ‎[363 bytes]
  35. (hist) ‎Tango Tree ( Self-Balancing Trees Creation) ‎[363 bytes]
  36. (hist) ‎OBF Algorithm (SCCs Strongly Connected Components) ‎[364 bytes]
  37. (hist) ‎Cheriton-Tarjan Algorithm (Undirected, General MST Minimum Spanning Tree (MST)) ‎[364 bytes]
  38. (hist) ‎Dijkstra's algorithm with binary heap (Johnson 1977) (Nonnegative Weights Shortest Path (Directed Graphs)) ‎[364 bytes]
  39. (hist) ‎Binary space partitioning (BSP) ( Shown Surface Determination) ‎[364 bytes]
  40. (hist) ‎Liang Cwinnower ( Motif Search) ‎[364 bytes]
  41. (hist) ‎Madry ( Maximum Flow) ‎[364 bytes]
  42. (hist) ‎Two-way String-Matching Algorithm (Single String Search String Search) ‎[364 bytes]
  43. (hist) ‎Babai (Graph Isomorphism, Bounded Number of Vertices of Each Color Graph Isomorphism Problem) ‎[364 bytes]
  44. (hist) ‎Aho, Hopcroft, and Ullman (Static Trees) (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) ‎[364 bytes]
  45. (hist) ‎Liang Cwinnower (Motif Search Motif Search) ‎[364 bytes]
  46. (hist) ‎Quick Sort (Comparison Sorting Sorting) ‎[365 bytes]
  47. (hist) ‎Paul Purdom (Transitive Closure Strongly Connected Components) ‎[365 bytes]
  48. (hist) ‎Field D* (Informed Search Informed Search) ‎[365 bytes]
  49. (hist) ‎Galil ( Maximum Flow) ‎[365 bytes]
  50. (hist) ‎Mucha, Sankowski (general) (General Graph MCM Maximum Cardinality Matching) ‎[365 bytes]

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

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