Pages with the fewest revisions

Jump to navigation Jump to search

Showing below up to 50 results in range #351 to #400.

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

  1. Lemke–Howson algorithm‏‎ (1 revision)
  2. Lemke–Howson Algorithm‏‎ (1 revision)
  3. Lemke-Howson Algorithm (2 player games Nash Equilibria)‏‎ (1 revision)
  4. Lehmer's GCD algorithm (Greatest Common Divisor Greatest Common Divisor)‏‎ (1 revision)
  5. Lee; Peng; Spielman (Inexact Laplacian Solver SDD Systems Solvers)‏‎ (1 revision)
  6. Lee, Sidford ( Maximum Flow)‏‎ (1 revision)
  7. Least recently used (Online Page Replacements)‏‎ (1 revision)
  8. Leases (Cary G Gray and David R Cheriton) (Distributed Locking Algorithms Distributed Locking Algorithms)‏‎ (1 revision)
  9. Lawrence Gibbs Sampling (Motif Search Motif Search)‏‎ (1 revision)
  10. Lawrence, Reilly (Motif Search Motif Search)‏‎ (1 revision)
  11. Lawler ( Chromatic Number)‏‎ (1 revision)
  12. Lawler (4-Graph Coloring Graph Coloring)‏‎ (1 revision)
  13. Lawler; E. L. (Minimum TSP The Traveling-Salesman Problem)‏‎ (1 revision)
  14. Lawler's Graph Coloring Algorithm‏‎ (1 revision)
  15. Larsen, Williams (follows from Theorem 2.1) ( Online Matrix Vector Multiplication (OMV))‏‎ (1 revision)
  16. Larsen, Williams (Theorem 1.1) ( Online Matrix Vector Multiplication (OMV))‏‎ (1 revision)
  17. Knuth's DP Algorithm‏‎ (1 revision)
  18. K Riesen (Inexact GED Graph Edit Distance Computation)‏‎ (1 revision)
  19. Kadane's Algorithm (1D Maximum Subarray Maximum Subarray Problem)‏‎ (1 revision)
  20. Kahn's Algorithm‏‎ (1 revision)
  21. Kajiya; J. Anisotropic Reflection Models 1985 (Diffuse Reflection Texture Mapping)‏‎ (1 revision)
  22. Kalman Filter (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes))‏‎ (1 revision)
  23. Karatsuba Algorithm‏‎ (1 revision)
  24. Karger, Blum ( Graph Coloring)‏‎ (1 revision)
  25. Karmarkar's algorithm ( Linear Programming)‏‎ (1 revision)
  26. Karpinski (Approximate OBST Optimal Binary Search Trees)‏‎ (1 revision)
  27. Karzanov ( Maximum Flow)‏‎ (1 revision)
  28. Kass; Witkin and Terzopoulos ( Image Segmentation)‏‎ (1 revision)
  29. Kazuhisa Makino, Takeaki Uno; Section 6 (Enumerating Maximal Cliques, arbitrary graph Clique Problems)‏‎ (1 revision)
  30. Key exchange‏‎ (1 revision)
  31. Khachiyan Ellipsoid Algorithm‏‎ (1 revision)
  32. Khuller, Matias (k-dimensional space, Euclidean metric Closest Pair Problem)‏‎ (1 revision)
  33. Khuller; Matias ( Closest Pair Problem)‏‎ (1 revision)
  34. Khuller; Matias Randomized Sieve ( Closest Pair Problem)‏‎ (1 revision)
  35. Kingsford (Motif Search Motif Search)‏‎ (1 revision)
  36. Kingsford ( Motif Search)‏‎ (1 revision)
  37. Klawe; Mumey (Alphabetic Tree Problem Optimal Binary Search Trees)‏‎ (1 revision)
  38. Klein (section 5) (Planar Bipartite Graph Perfect Matching Maximum Cardinality Matching)‏‎ (1 revision)
  39. Kleinberg (Link Analysis Link Analysis)‏‎ (1 revision)
  40. Kleitman–Wang Algorithm (Digraph Realization Problem Graph Realization Problems)‏‎ (1 revision)
  41. Klinz (Subset Sum The Subset-Sum Problem)‏‎ (1 revision)
  42. Kmett (Lowest Common Ancestor with Static Trees Lowest Common Ancestor)‏‎ (1 revision)
  43. LU decomposition‏‎ (1 revision)
  44. Kwatra 2003 (Texture Synthesis Texture Synthesis)‏‎ (1 revision)
  45. L. Kitchen and A. Rosenfeld (Corner Detection Feature Detection)‏‎ (1 revision)
  46. L. Kitchen and A. Rosenfeld (Grey-scale Corner Detection)‏‎ (1 revision)
  47. LLL algorithm (Integer Relation Integer Relation)‏‎ (1 revision)
  48. LOBPCG algorithm (Eigenpair closest to mu; Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods))‏‎ (1 revision)
  49. LU Matrix Decomposition (Matrix Factorization Collaborative Filtering)‏‎ (1 revision)
  50. Laguerre iteration (Any eigenvalue Eigenvalues (Iterative Methods))‏‎ (1 revision)

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

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