Oldest pages

Jump to navigation Jump to search

Showing below up to 250 results in range #51 to #300.

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

  1. Ford Fulkerson Algorithm‏‎ (11:56, 10 October 2022)
  2. Fortune-Hopcroft Algorithm‏‎ (11:56, 10 October 2022)
  3. Gaussian Elimination‏‎ (11:56, 10 October 2022)
  4. Generating random permutations‏‎ (11:56, 10 October 2022)
  5. Godbole's DP Algorithm‏‎ (11:56, 10 October 2022)
  6. Graph edit distance computation‏‎ (11:56, 10 October 2022)
  7. Gröbner bases‏‎ (11:56, 10 October 2022)
  8. Held–Karp Algorithm‏‎ (11:56, 10 October 2022)
  9. Hierholzer's Algorithm‏‎ (11:56, 10 October 2022)
  10. Historical Origins‏‎ (11:56, 10 October 2022)
  11. Hoare's Selection Algorithm‏‎ (11:57, 10 October 2022)
  12. Hopcroft's DFA Algorithm‏‎ (11:57, 10 October 2022)
  13. Hopcroft–Karp algorithm‏‎ (11:57, 10 October 2022)
  14. Hungarian Algorithm‏‎ (11:57, 10 October 2022)
  15. INDEGREE analysis‏‎ (11:57, 10 October 2022)
  16. Image Processing‏‎ (11:57, 10 October 2022)
  17. Improvement Rankings‏‎ (11:57, 10 October 2022)
  18. Integer relation‏‎ (11:57, 10 October 2022)
  19. Jarvis Scan‏‎ (11:57, 10 October 2022)
  20. K-d Tree‏‎ (11:57, 10 October 2022)
  21. Kahn's Algorithm‏‎ (11:57, 10 October 2022)
  22. Karatsuba Algorithm‏‎ (11:57, 10 October 2022)
  23. Key exchange‏‎ (11:57, 10 October 2022)
  24. Khachiyan Ellipsoid Algorithm‏‎ (11:57, 10 October 2022)
  25. Knuth's DP Algorithm‏‎ (11:57, 10 October 2022)
  26. Knuth-Morris-Pratt Algorithm‏‎ (11:57, 10 October 2022)
  27. Kruskal's Algorithm‏‎ (11:57, 10 October 2022)
  28. Kth order statistic‏‎ (11:57, 10 October 2022)
  29. LU decomposition‏‎ (11:57, 10 October 2022)
  30. Lawler's Graph Coloring Algorithm‏‎ (11:58, 10 October 2022)
  31. Lemke–Howson Algorithm‏‎ (11:58, 10 October 2022)
  32. Lemke–Howson algorithm‏‎ (11:58, 10 October 2022)
  33. Linde–Buzo–Gray Algorithm‏‎ (11:58, 10 October 2022)
  34. Line Clipping‏‎ (11:58, 10 October 2022)
  35. Line Intersections‏‎ (11:58, 10 October 2022)
  36. Line drawing‏‎ (11:58, 10 October 2022)
  37. Linear Equations‏‎ (11:58, 10 October 2022)
  38. Link analysis (PAGERANK and variants)‏‎ (11:58, 10 October 2022)
  39. LogLog Algorithm‏‎ (11:58, 10 October 2022)
  40. Logarithm calculations‏‎ (11:58, 10 October 2022)
  41. Longest common subsequence‏‎ (11:58, 10 October 2022)
  42. Longest palindromic substring‏‎ (11:58, 10 October 2022)
  43. Longest path on interval graphs‏‎ (11:58, 10 October 2022)
  44. Lossy compression‏‎ (11:58, 10 October 2022)
  45. Lowest common ancestor‏‎ (11:58, 10 October 2022)
  46. MDPs for optimal policies‏‎ (11:58, 10 October 2022)
  47. Matrix Factorization for Collaborative Filtering‏‎ (11:58, 10 October 2022)
  48. Matrix chain multiplication‏‎ (11:58, 10 October 2022)
  49. Maximum-weight matching‏‎ (11:59, 10 October 2022)
  50. Maximum Flow‏‎ (11:59, 10 October 2022)
  51. Maximum cardinality matching‏‎ (11:59, 10 October 2022)
  52. Maximum cut‏‎ (11:59, 10 October 2022)
  53. Maximum subarray problem‏‎ (11:59, 10 October 2022)
  54. Min. Spanning Tree‏‎ (11:59, 10 October 2022)
  55. Money Change‏‎ (11:59, 10 October 2022)
  56. N-Queens Problem‏‎ (11:59, 10 October 2022)
  57. Nash Equilibria‏‎ (11:59, 10 October 2022)
  58. Nearest Neighbour‏‎ (11:59, 10 October 2022)
  59. Needleman–Wunsch algorithm‏‎ (11:59, 10 October 2022)
  60. Nested Loop Join‏‎ (11:59, 10 October 2022)
  61. Non-priority optimal interval Scheduling‏‎ (11:59, 10 October 2022)
  62. Numerical Analysis‏‎ (11:59, 10 October 2022)
  63. Operating Systems‏‎ (11:59, 10 October 2022)
  64. Page replacements‏‎ (11:59, 10 October 2022)
  65. Parsing‏‎ (11:59, 10 October 2022)
  66. Point in Polygon‏‎ (11:59, 10 October 2022)
  67. Polygon clipping‏‎ (12:00, 10 October 2022)
  68. Polynomial interpolation‏‎ (12:00, 10 October 2022)
  69. Quadratic Sieve‏‎ (12:00, 10 October 2022)
  70. Rabin–Scott Powerset Construction‏‎ (12:00, 10 October 2022)
  71. Radix Sort‏‎ (12:00, 10 October 2022)
  72. Ramer–Douglas–Peucker Algorithm‏‎ (12:00, 10 October 2022)
  73. Recovery‏‎ (12:00, 10 October 2022)
  74. Register Allocation‏‎ (12:00, 10 October 2022)
  75. Representative Algorithms‏‎ (12:00, 10 October 2022)
  76. Robotics‏‎ (12:00, 10 October 2022)
  77. Rod-cutting problem‏‎ (12:00, 10 October 2022)
  78. SDD Systems Solvers‏‎ (12:00, 10 October 2022)
  79. SMAWK Algorithm‏‎ (12:00, 10 October 2022)
  80. Second category integer factoring‏‎ (12:00, 10 October 2022)
  81. Secret-sharing algorithms‏‎ (12:00, 10 October 2022)
  82. Self-balancing trees creation‏‎ (12:00, 10 October 2022)
  83. Self-balancing trees deletion‏‎ (12:00, 10 October 2022)
  84. Self-balancing trees insertion‏‎ (12:00, 10 October 2022)
  85. Self-balancing trees search‏‎ (12:00, 10 October 2022)
  86. Sequence Alignment‏‎ (12:00, 10 October 2022)
  87. Sequence to Graph Alignment‏‎ (12:00, 10 October 2022)
  88. Shortest Path(Directed graphs)‏‎ (12:00, 10 October 2022)
  89. Sorting - Comparison‏‎ (12:01, 10 October 2022)
  90. Sorting - Non-Comparison‏‎ (12:01, 10 October 2022)
  91. Stable Marriage Problem/Stable Roommates Problem‏‎ (12:01, 10 October 2022)
  92. Statistics‏‎ (12:01, 10 October 2022)
  93. Strassen's Algorithm‏‎ (12:01, 10 October 2022)
  94. String Search‏‎ (12:01, 10 October 2022)
  95. Tarjan's LCA Algorithm‏‎ (12:01, 10 October 2022)
  96. Tarjan's SSC Algorithm‏‎ (12:01, 10 October 2022)
  97. Template Page‏‎ (12:01, 10 October 2022)
  98. The frequent words problem‏‎ (12:01, 10 October 2022)
  99. The set-covering problem‏‎ (12:01, 10 October 2022)
  100. The subset-sum problem‏‎ (12:01, 10 October 2022)
  101. The traveling-salesman problem‏‎ (12:01, 10 October 2022)
  102. The vertex-cover problem‏‎ (12:01, 10 October 2022)
  103. Todd–Coxeter algorithm‏‎ (12:01, 10 October 2022)
  104. Transitive Reduction problem‏‎ (12:01, 10 October 2022)
  105. Translating abstract syntax trees‏‎ (12:01, 10 October 2022)
  106. Turnpike problem‏‎ (12:01, 10 October 2022)
  107. Two-pass Algorithm‏‎ (12:01, 10 October 2022)
  108. Vaidya's Algorithm‏‎ (12:02, 10 October 2022)
  109. Vatti Clipping Algorithm‏‎ (12:02, 10 October 2022)
  110. Vornoi Diagrams‏‎ (12:02, 10 October 2022)
  111. Wagner-Fischer Algorithm‏‎ (12:02, 10 October 2022)
  112. Weighted Activity selection problem‏‎ (12:02, 10 October 2022)
  113. Wheel Factorization‏‎ (12:02, 10 October 2022)
  114. List:Problem Families‏‎ (11:11, 15 February 2023)
  115. List:Hypotheses‏‎ (11:11, 15 February 2023)
  116. List:Domains‏‎ (11:11, 15 February 2023)
  117. Domain:Bioinformatics‏‎ (11:11, 15 February 2023)
  118. Domain:Databases‏‎ (11:11, 15 February 2023)
  119. Domain:Image Processing‏‎ (11:11, 15 February 2023)
  120. Domain:Robotics‏‎ (11:11, 15 February 2023)
  121. Domain:Statistics‏‎ (11:11, 15 February 2023)
  122. Domain:Cryptography‏‎ (11:11, 15 February 2023)
  123. Family:Sorting‏‎ (11:11, 15 February 2023)
  124. Family:Matrix Chain Multiplication‏‎ (11:12, 15 February 2023)
  125. Family:Longest Common Subsequence‏‎ (11:12, 15 February 2023)
  126. Family:Maximum Flow‏‎ (11:12, 15 February 2023)
  127. Family:Matrix Product‏‎ (11:12, 15 February 2023)
  128. Family:Linear System‏‎ (11:12, 15 February 2023)
  129. Family:Linear Programming‏‎ (11:12, 15 February 2023)
  130. Family:Line segment intersection‏‎ (11:12, 15 February 2023)
  131. Family:Convex Hull‏‎ (11:12, 15 February 2023)
  132. Family:Strongly Connected Components‏‎ (11:12, 15 February 2023)
  133. Family:Minimum Spanning Tree (MST)‏‎ (11:12, 15 February 2023)
  134. Family:Closest Pair Problem‏‎ (11:13, 15 February 2023)
  135. Family:Shortest Path (Directed Graphs)‏‎ (11:13, 15 February 2023)
  136. Family:All-Pairs Shortest Paths (APSP)‏‎ (11:13, 15 February 2023)
  137. Family:Integer Factoring‏‎ (11:13, 15 February 2023)
  138. Family:LU Decomposition‏‎ (11:13, 15 February 2023)
  139. Family:String Search‏‎ (11:14, 15 February 2023)
  140. Family:Sequence Alignment‏‎ (11:14, 15 February 2023)
  141. Family:Line Clipping‏‎ (11:14, 15 February 2023)
  142. Family:Maximum Cardinality Matching‏‎ (11:14, 15 February 2023)
  143. Family:SDD Systems Solvers‏‎ (11:14, 15 February 2023)
  144. Family:Generating Random Permutations‏‎ (11:14, 15 February 2023)
  145. Family:Optimal Binary Search Trees‏‎ (11:14, 15 February 2023)
  146. Family:Nash Equilibria‏‎ (11:14, 15 February 2023)
  147. Family:Maximum-Weight Matching‏‎ (11:14, 15 February 2023)
  148. Family:Polygon Clipping‏‎ (11:14, 15 February 2023)
  149. Family:Eigenvalues (Iterative Methods)‏‎ (11:14, 15 February 2023)
  150. Family:Register Allocation‏‎ (11:14, 15 February 2023)
  151. Family:DFA Minimization‏‎ (11:14, 15 February 2023)
  152. Family:Lowest Common Ancestor‏‎ (11:14, 15 February 2023)
  153. Family:Graph Edit Distance Computation‏‎ (11:14, 15 February 2023)
  154. Family:Clique Problems‏‎ (11:14, 15 February 2023)
  155. Family:The Traveling-Salesman Problem‏‎ (11:14, 15 February 2023)
  156. Family:Poisson Problem‏‎ (11:15, 15 February 2023)
  157. Family:Dependency Inference Problem‏‎ (11:15, 15 February 2023)
  158. Family:BCNF Decomposition‏‎ (11:15, 15 February 2023)
  159. Family:4NF Decomposition‏‎ (11:15, 15 February 2023)
  160. Family:The Vertex Cover Problem‏‎ (11:15, 15 February 2023)
  161. Family:CFG Problems‏‎ (11:15, 15 February 2023)
  162. Family:Data Compression‏‎ (11:15, 15 February 2023)
  163. Family:Stable Matching Problem‏‎ (11:15, 15 February 2023)
  164. Family:Maximum Subarray Problem‏‎ (11:15, 15 February 2023)
  165. Family:AST to Code Translation‏‎ (11:15, 15 February 2023)
  166. Family:Graph Isomorphism Problem‏‎ (11:15, 15 February 2023)
  167. Family:Graph Realization Problems‏‎ (11:15, 15 February 2023)
  168. Family:Feature Detection‏‎ (11:15, 15 February 2023)
  169. Family:The Set-Covering Problem‏‎ (11:15, 15 February 2023)
  170. Family:Link Analysis‏‎ (11:15, 15 February 2023)
  171. Family:Texture Mapping‏‎ (11:16, 15 February 2023)
  172. Family:Wiener Index‏‎ (11:16, 15 February 2023)
  173. Family:Integer Relation‏‎ (11:16, 15 February 2023)
  174. Family:n-Queens Problem‏‎ (11:16, 15 February 2023)
  175. Family:Median String Problem‏‎ (11:16, 15 February 2023)
  176. Family:Integral Equations‏‎ (11:16, 15 February 2023)
  177. Family:One-Way Hash Functions‏‎ (11:16, 15 February 2023)
  178. Family:Deadlock Avoidance‏‎ (11:16, 15 February 2023)
  179. Family:Page Replacements‏‎ (11:16, 15 February 2023)
  180. Family:Graph Coloring‏‎ (11:17, 15 February 2023)
  181. Family:Boolean Satisfiability‏‎ (11:17, 15 February 2023)
  182. Family:Orthogonal Vectors‏‎ (11:17, 15 February 2023)
  183. Family:Graph Metrics‏‎ (11:17, 15 February 2023)
  184. Family:Vertex Centrality‏‎ (11:17, 15 February 2023)
  185. Family:Graph Triangle Problems‏‎ (11:17, 15 February 2023)
  186. Family:Geometric Incidence Problems‏‎ (11:17, 15 February 2023)
  187. Family:Geometric Separator Problems‏‎ (11:17, 15 February 2023)
  188. Family:Geometric Covering Problems‏‎ (11:17, 15 February 2023)
  189. Family:Geometric Visibility Problems‏‎ (11:17, 15 February 2023)
  190. Family:Motion Planning Problems‏‎ (11:17, 15 February 2023)
  191. Family:Local Alignment‏‎ (11:17, 15 February 2023)
  192. Family:Minimum Witness‏‎ (11:17, 15 February 2023)
  193. Family:Graph Cycles‏‎ (11:17, 15 February 2023)
  194. Family:Matrix-Vector Multiplication‏‎ (11:17, 15 February 2023)
  195. Family:Vertex Reachability‏‎ (11:17, 15 February 2023)
  196. Family:Model-Checking Problem‏‎ (11:17, 15 February 2023)
  197. Family:Dihedral Rotation Queries‏‎ (11:17, 15 February 2023)
  198. Family:3SUM‏‎ (11:17, 15 February 2023)
  199. Ray Tracing‏‎ (11:23, 15 February 2023)
  200. Culling‏‎ (11:24, 15 February 2023)
  201. Image Compositing‏‎ (11:25, 15 February 2023)
  202. Diffuse Reflection‏‎ (11:25, 15 February 2023)
  203. Mesh Simplification‏‎ (11:25, 15 February 2023)
  204. POMDPs‏‎ (11:25, 15 February 2023)
  205. Rasterization‏‎ (11:25, 15 February 2023)
  206. Environment Mapping‏‎ (11:25, 15 February 2023)
  207. Occupancy Grid Mapping‏‎ (11:25, 15 February 2023)
  208. Fredholm Equations‏‎ (11:26, 15 February 2023)
  209. Volterra Equations‏‎ (11:26, 15 February 2023)
  210. Steal/No-Force‏‎ (11:26, 15 February 2023)
  211. No-Steal/Force‏‎ (11:26, 15 February 2023)
  212. Chromatic Polynomial‏‎ (11:27, 15 February 2023)
  213. Maximum Inner Product Search‏‎ (11:30, 15 February 2023)
  214. Approximate Hard-Margin SVM‏‎ (11:30, 15 February 2023)
  215. Exponential Time Hypothesis (ETH)‏‎ (11:30, 15 February 2023)
  216. Strong Exponential Time Hypothesis (SETH)‏‎ (11:30, 15 February 2023)
  217. Orthogonal Vectors Hypothesis (OVH)‏‎ (11:30, 15 February 2023)
  218. Unbalanced Orthogonal Vectors Hypothesis (UOVH)‏‎ (11:30, 15 February 2023)
  219. K-OV Hypothesis‏‎ (11:30, 15 February 2023)
  220. K-Clique Hypothesis‏‎ (11:30, 15 February 2023)
  221. 3SUM Hypothesis (3-SUM Hypothesis)‏‎ (11:30, 15 February 2023)
  222. All Pairs Shortest Paths Hypothesis (APSP Hypothesis)‏‎ (11:30, 15 February 2023)
  223. Hitting Set Hypothesis (HS Hypothesis)‏‎ (11:30, 15 February 2023)
  224. Min-Weight k-Clique Hypothesis‏‎ (11:30, 15 February 2023)
  225. Exact k-Clique Hypothesis‏‎ (11:30, 15 February 2023)
  226. Boolean Matrix Multiplication Hypothesis (BMM Hypothesis)‏‎ (11:30, 15 February 2023)
  227. Online Matrix Vector Multiplication Hypothesis (OMV Hypothesis)‏‎ (11:30, 15 February 2023)
  228. Nondeterministic Strong Exponential Time Hypothesis (NSETH)‏‎ (11:30, 15 February 2023)
  229. More Believable Exponential Time Hypothesis (MBETH)‏‎ (11:30, 15 February 2023)
  230. Strong Triangle Conjecture‏‎ (11:30, 15 February 2023)
  231. $\delta$-Triangle Conjecture‏‎ (11:31, 15 February 2023)
  232. Parametrized Inapproximability Hypothesis (PIH)‏‎ (11:31, 15 February 2023)
  233. Weak Parametrized Inapproximability Hypothesis (WPIH)‏‎ (11:31, 15 February 2023)
  234. Melhorn's Approximation algorithm (Approximate OBST Optimal Binary Search Trees)‏‎ (11:31, 15 February 2023)
  235. Karpinski (Approximate OBST Optimal Binary Search Trees)‏‎ (11:31, 15 February 2023)
  236. Klawe; Mumey (Alphabetic Tree Problem Optimal Binary Search Trees)‏‎ (11:31, 15 February 2023)
  237. Larmore (Approximate OBST Optimal Binary Search Trees)‏‎ (11:31, 15 February 2023)
  238. Hierarchical Navigable Small World (HNSW) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search)‏‎ (11:31, 15 February 2023)
  239. Locality-sensitive hashing (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search)‏‎ (11:31, 15 February 2023)
  240. Projected radial search (k Approximate Nearest Neighbors Search (k-ANNS) for a dense 3D map of geometric points Nearest Neighbor Search)‏‎ (11:31, 15 February 2023)
  241. Compression/Clustering (Vector Quantization) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search)‏‎ (11:31, 15 February 2023)
  242. Pisinger (Subset Sum The Subset-Sum Problem)‏‎ (11:31, 15 February 2023)
  243. Faaland (Subset Sum The Subset-Sum Problem)‏‎ (11:31, 15 February 2023)
  244. Pferschy (Subset Sum The Subset-Sum Problem)‏‎ (11:31, 15 February 2023)
  245. Klinz (Subset Sum The Subset-Sum Problem)‏‎ (11:31, 15 February 2023)
  246. Epstein (Subset Sum The Subset-Sum Problem)‏‎ (11:31, 15 February 2023)
  247. Lokshtanov (Subset Sum The Subset-Sum Problem)‏‎ (11:31, 15 February 2023)
  248. Valentin Polishchuk, and Jukka Suomela (Almost Stable Marriage Problem Stable Matching Problem)‏‎ (11:31, 15 February 2023)
  249. Lawrence, Reilly (Motif Search Motif Search)‏‎ (11:31, 15 February 2023)
  250. Lawrence Gibbs Sampling (Motif Search Motif Search)‏‎ (11:31, 15 February 2023)

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

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