Short pages

Jump to navigation Jump to search

Showing below up to 50 results in range #851 to #900.

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

  1. (hist) ‎Moore's algorithm (DFA Minimization DFA Minimization) ‎[371 bytes]
  2. (hist) ‎Stege, Fellows + Interleaving method (Niedermeier, Rossmanith) (The Vertex Cover Problem The Vertex Cover Problem) ‎[371 bytes]
  3. (hist) ‎Mitra (Motif Search Motif Search) ‎[372 bytes]
  4. (hist) ‎Apostolico and Guerra (HS1 Algorithm) (LCS Longest Common Subsequence) ‎[372 bytes]
  5. (hist) ‎Schieber; Vishkin (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) ‎[372 bytes]
  6. (hist) ‎Gent; I.P.; Irving; R.W.; Manlove; D.F.; Prosser; P.; Smith; B.M. (Stable Marriage Problem Stable Matching Problem) ‎[372 bytes]
  7. (hist) ‎Tree-structured vector quantization Wei-Levoy (Texture Synthesis Texture Synthesis) ‎[373 bytes]
  8. (hist) ‎Bjorck-Pereyra (Vandermonde Matrix Linear System) ‎[373 bytes]
  9. (hist) ‎K-d Tree (Nearest Neighbor Search (NNS) Nearest Neighbor Search) ‎[373 bytes]
  10. (hist) ‎Faster Brute Force (via x(L:U) = x(L:U-1)+x(U)) (1D Maximum Subarray Maximum Subarray Problem) ‎[373 bytes]
  11. (hist) ‎Gaussian Elimination (Exact Laplacian Solver SDD Systems Solvers) ‎[373 bytes]
  12. (hist) ‎Grigoryan (n-Queens Completion n-Queens Problem) ‎[374 bytes]
  13. (hist) ‎Bentley (k-dimensional space, l m (or l infty) norm Closest Pair Problem) ‎[374 bytes]
  14. (hist) ‎Bentley; Shamos (k-dimensional space, l m (or l infty) norm Closest Pair Problem) ‎[374 bytes]
  15. (hist) ‎Apostolico and Guerra (Algorithm 2) (LCS Longest Common Subsequence) ‎[374 bytes]
  16. (hist) ‎Drysdale; Su (2-Dimensional Delaunay Triangulation Delaunay Triangulation) ‎[374 bytes]
  17. (hist) ‎Gale–Shapley algorithm (Stable Marriage Problem Stable Matching Problem) ‎[374 bytes]
  18. (hist) ‎Shor's algorithm Quantum Implementation (Second Category Integer Factoring Integer Factoring) ‎[374 bytes]
  19. (hist) ‎Hopcroft's algorithm (DFA Minimization DFA Minimization) ‎[374 bytes]
  20. (hist) ‎Tomita; Tanaka & Takahashi (Enumerating Maximal Cliques, arbitrary graph Clique Problems) ‎[374 bytes]
  21. (hist) ‎BLAKE2 (Optional Key? One-Way Hash Functions) ‎[374 bytes]
  22. (hist) ‎Bentley (2-dimensional Maximum subarray problem) ‎[374 bytes]
  23. (hist) ‎Thorup (reverse-delete) (Undirected, General MST Minimum Spanning Tree (MST)) ‎[375 bytes]
  24. (hist) ‎Achlioptas (Link Analysis Link Analysis) ‎[375 bytes]
  25. (hist) ‎Bjorklund, Husfeldt, Proposition 2 ( 5 - Graph Coloring) ‎[375 bytes]
  26. (hist) ‎Bjorklund, Husfeldt, Proposition 2 ( 6 - Graph Coloring) ‎[375 bytes]
  27. (hist) ‎Bjorklund, Husfeldt, Proposition 2 ( Chromatic Number) ‎[375 bytes]
  28. (hist) ‎Brandes (Unweighted Betweenness Centrality (BC)) ‎[375 bytes]
  29. (hist) ‎Nakatsu et al. (LCS Longest Common Subsequence) ‎[375 bytes]
  30. (hist) ‎Bruun's FFT algorithm (Discrete Fourier Transform Discrete Fourier Transform) ‎[375 bytes]
  31. (hist) ‎Lawler (4-Graph Coloring Graph Coloring) ‎[376 bytes]
  32. (hist) ‎Harrow (Quantum) (Sparse Linear System Linear System) ‎[376 bytes]
  33. (hist) ‎Pearce (SCCs Strongly Connected Components) ‎[376 bytes]
  34. (hist) ‎Dwyer (higher dimensions) (General Delaunay Triangulation (d-dimensions) Delaunay Triangulation) ‎[376 bytes]
  35. (hist) ‎Subgradient method (General, Constrained optimization Convex Optimization (Non-linear)) ‎[376 bytes]
  36. (hist) ‎Weiner's algorithm (Constructing Suffix Trees Constructing Suffix Trees) ‎[376 bytes]
  37. (hist) ‎McCreight (Constructing Suffix Trees Constructing Suffix Trees) ‎[376 bytes]
  38. (hist) ‎EM Based Winkler (Entity Resolution Entity Resolution) ‎[376 bytes]
  39. (hist) ‎Scapegoat Tree ( Self-Balancing Trees Creation) ‎[376 bytes]
  40. (hist) ‎Gotoh (Edit sequence, local alignment Sequence Alignment) ‎[377 bytes]
  41. (hist) ‎Dantzig-Fulkerson-Johnson (DFJ) formulation (Minimum TSP The Traveling-Salesman Problem) ‎[377 bytes]
  42. (hist) ‎Gries (1D Maximum Subarray Maximum Subarray Problem) ‎[377 bytes]
  43. (hist) ‎Irving's Algorithm (Stable Roommates Problem Stable Matching Problem) ‎[377 bytes]
  44. (hist) ‎S. S. TSENG and R. C. T. LEE (Stable Marriage Problem Stable Matching Problem) ‎[377 bytes]
  45. (hist) ‎Jeuring (Longest Palindromic Substring Longest Palindromic Substring) ‎[377 bytes]
  46. (hist) ‎Boolean Matrix Multiplication Hypothesis (BMM Hypothesis) ‎[378 bytes]
  47. (hist) ‎Hirschberg's algorithm (Edit sequence, constant-size alphabet Sequence Alignment) ‎[378 bytes]
  48. (hist) ‎Fleischer forward-backward (FB) algorithm (SCCs Strongly Connected Components) ‎[378 bytes]
  49. (hist) ‎Shanks's square forms factorization (SQUFOF) (Second Category Integer Factoring Integer Factoring) ‎[378 bytes]
  50. (hist) ‎The Algorithm of Park; Chen; and Yu (PCY) (Finding Frequent Itemsets Finding Frequent Itemsets) ‎[378 bytes]

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

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