Oldest pages

Jump to navigation Jump to search

Showing below up to 500 results in range #1 to #500.

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

  1. 3 - Graph Coloring‏‎ (11:53, 10 October 2022)
  2. 4NF decomposition‏‎ (11:53, 10 October 2022)
  3. 4 - Graph Coloring‏‎ (11:53, 10 October 2022)
  4. A* Algorithm‏‎ (11:53, 10 October 2022)
  5. A* Informed Search‏‎ (11:53, 10 October 2022)
  6. ADI Iteration‏‎ (11:54, 10 October 2022)
  7. About Algorithm-Wiki‏‎ (11:54, 10 October 2022)
  8. Algorithm Families‏‎ (11:54, 10 October 2022)
  9. All-pairs shortest paths (Undirected)‏‎ (11:54, 10 October 2022)
  10. All permutations‏‎ (11:54, 10 October 2022)
  11. Bellman-Ford Algorithm‏‎ (11:54, 10 October 2022)
  12. Bentley-Ottmann Algorithm‏‎ (11:54, 10 October 2022)
  13. BioInformatics‏‎ (11:54, 10 October 2022)
  14. Bowyer–Watson Algorithm‏‎ (11:54, 10 October 2022)
  15. Bresenham's Line Algorithm‏‎ (11:54, 10 October 2022)
  16. Bron–Kerbosch Algorithm‏‎ (11:54, 10 October 2022)
  17. Bruun's FFT Algorithm‏‎ (11:54, 10 October 2022)
  18. Bubble Sort‏‎ (11:54, 10 October 2022)
  19. Chatlin's Algorithm‏‎ (11:54, 10 October 2022)
  20. Closest Pair Problem‏‎ (11:54, 10 October 2022)
  21. Cohen–Sutherland Algorithm‏‎ (11:54, 10 October 2022)
  22. Computer Networking‏‎ (11:54, 10 October 2022)
  23. Constants‏‎ (11:54, 10 October 2022)
  24. Constructing Eulerian trails in a Graph‏‎ (11:54, 10 October 2022)
  25. Constructing suffix trees‏‎ (11:54, 10 October 2022)
  26. Convex Hull‏‎ (11:54, 10 October 2022)
  27. Cryptography‏‎ (11:55, 10 October 2022)
  28. Cyclopeptide sequencing‏‎ (11:55, 10 October 2022)
  29. DE NOVO GENOME ASSEMBLY‏‎ (11:55, 10 October 2022)
  30. Databases‏‎ (11:55, 10 October 2022)
  31. De Bruijn Graph‏‎ (11:55, 10 October 2022)
  32. Deadlock avoidance‏‎ (11:55, 10 October 2022)
  33. Decade Analysis‏‎ (11:55, 10 October 2022)
  34. Dekker's Algorithm‏‎ (11:55, 10 October 2022)
  35. Delaunay triangulation‏‎ (11:55, 10 October 2022)
  36. Dependency inference problem‏‎ (11:55, 10 October 2022)
  37. Digraph realization problem‏‎ (11:55, 10 October 2022)
  38. Dijkstra's Algorithm‏‎ (11:55, 10 October 2022)
  39. Discovering multivalued dependencies‏‎ (11:55, 10 October 2022)
  40. Doolittle Algorithm‏‎ (11:55, 10 October 2022)
  41. Edmonds-Karp Algorithm‏‎ (11:55, 10 October 2022)
  42. Elliptic-curve Diffie-Hellman (ECDH)‏‎ (11:56, 10 October 2022)
  43. Entity resolution‏‎ (11:56, 10 October 2022)
  44. Enumerating Maximal Cliques‏‎ (11:56, 10 October 2022)
  45. Factorization of polynomials over finite fields‏‎ (11:56, 10 October 2022)
  46. Faugère F4 Algorithm‏‎ (11:56, 10 October 2022)
  47. First category integer factoring‏‎ (11:56, 10 October 2022)
  48. Fisher–Yates Shuffle‏‎ (11:56, 10 October 2022)
  49. Floyd's Cycle-Finding Algorithm‏‎ (11:56, 10 October 2022)
  50. Floyd-Warshall Algorithm‏‎ (11:56, 10 October 2022)
  51. Ford Fulkerson Algorithm‏‎ (11:56, 10 October 2022)
  52. Fortune-Hopcroft Algorithm‏‎ (11:56, 10 October 2022)
  53. Gaussian Elimination‏‎ (11:56, 10 October 2022)
  54. Generating random permutations‏‎ (11:56, 10 October 2022)
  55. Godbole's DP Algorithm‏‎ (11:56, 10 October 2022)
  56. Graph edit distance computation‏‎ (11:56, 10 October 2022)
  57. Gröbner bases‏‎ (11:56, 10 October 2022)
  58. Held–Karp Algorithm‏‎ (11:56, 10 October 2022)
  59. Hierholzer's Algorithm‏‎ (11:56, 10 October 2022)
  60. Historical Origins‏‎ (11:56, 10 October 2022)
  61. Hoare's Selection Algorithm‏‎ (11:57, 10 October 2022)
  62. Hopcroft's DFA Algorithm‏‎ (11:57, 10 October 2022)
  63. Hopcroft–Karp algorithm‏‎ (11:57, 10 October 2022)
  64. Hungarian Algorithm‏‎ (11:57, 10 October 2022)
  65. INDEGREE analysis‏‎ (11:57, 10 October 2022)
  66. Image Processing‏‎ (11:57, 10 October 2022)
  67. Improvement Rankings‏‎ (11:57, 10 October 2022)
  68. Integer relation‏‎ (11:57, 10 October 2022)
  69. Jarvis Scan‏‎ (11:57, 10 October 2022)
  70. K-d Tree‏‎ (11:57, 10 October 2022)
  71. Kahn's Algorithm‏‎ (11:57, 10 October 2022)
  72. Karatsuba Algorithm‏‎ (11:57, 10 October 2022)
  73. Key exchange‏‎ (11:57, 10 October 2022)
  74. Khachiyan Ellipsoid Algorithm‏‎ (11:57, 10 October 2022)
  75. Knuth's DP Algorithm‏‎ (11:57, 10 October 2022)
  76. Knuth-Morris-Pratt Algorithm‏‎ (11:57, 10 October 2022)
  77. Kruskal's Algorithm‏‎ (11:57, 10 October 2022)
  78. Kth order statistic‏‎ (11:57, 10 October 2022)
  79. LU decomposition‏‎ (11:57, 10 October 2022)
  80. Lawler's Graph Coloring Algorithm‏‎ (11:58, 10 October 2022)
  81. Lemke–Howson Algorithm‏‎ (11:58, 10 October 2022)
  82. Lemke–Howson algorithm‏‎ (11:58, 10 October 2022)
  83. Linde–Buzo–Gray Algorithm‏‎ (11:58, 10 October 2022)
  84. Line Clipping‏‎ (11:58, 10 October 2022)
  85. Line Intersections‏‎ (11:58, 10 October 2022)
  86. Line drawing‏‎ (11:58, 10 October 2022)
  87. Linear Equations‏‎ (11:58, 10 October 2022)
  88. Link analysis (PAGERANK and variants)‏‎ (11:58, 10 October 2022)
  89. LogLog Algorithm‏‎ (11:58, 10 October 2022)
  90. Logarithm calculations‏‎ (11:58, 10 October 2022)
  91. Longest common subsequence‏‎ (11:58, 10 October 2022)
  92. Longest palindromic substring‏‎ (11:58, 10 October 2022)
  93. Longest path on interval graphs‏‎ (11:58, 10 October 2022)
  94. Lossy compression‏‎ (11:58, 10 October 2022)
  95. Lowest common ancestor‏‎ (11:58, 10 October 2022)
  96. MDPs for optimal policies‏‎ (11:58, 10 October 2022)
  97. Matrix Factorization for Collaborative Filtering‏‎ (11:58, 10 October 2022)
  98. Matrix chain multiplication‏‎ (11:58, 10 October 2022)
  99. Maximum-weight matching‏‎ (11:59, 10 October 2022)
  100. Maximum Flow‏‎ (11:59, 10 October 2022)
  101. Maximum cardinality matching‏‎ (11:59, 10 October 2022)
  102. Maximum cut‏‎ (11:59, 10 October 2022)
  103. Maximum subarray problem‏‎ (11:59, 10 October 2022)
  104. Min. Spanning Tree‏‎ (11:59, 10 October 2022)
  105. Money Change‏‎ (11:59, 10 October 2022)
  106. N-Queens Problem‏‎ (11:59, 10 October 2022)
  107. Nash Equilibria‏‎ (11:59, 10 October 2022)
  108. Nearest Neighbour‏‎ (11:59, 10 October 2022)
  109. Needleman–Wunsch algorithm‏‎ (11:59, 10 October 2022)
  110. Nested Loop Join‏‎ (11:59, 10 October 2022)
  111. Non-priority optimal interval Scheduling‏‎ (11:59, 10 October 2022)
  112. Numerical Analysis‏‎ (11:59, 10 October 2022)
  113. Operating Systems‏‎ (11:59, 10 October 2022)
  114. Page replacements‏‎ (11:59, 10 October 2022)
  115. Parsing‏‎ (11:59, 10 October 2022)
  116. Point in Polygon‏‎ (11:59, 10 October 2022)
  117. Polygon clipping‏‎ (12:00, 10 October 2022)
  118. Polynomial interpolation‏‎ (12:00, 10 October 2022)
  119. Quadratic Sieve‏‎ (12:00, 10 October 2022)
  120. Rabin–Scott Powerset Construction‏‎ (12:00, 10 October 2022)
  121. Radix Sort‏‎ (12:00, 10 October 2022)
  122. Ramer–Douglas–Peucker Algorithm‏‎ (12:00, 10 October 2022)
  123. Recovery‏‎ (12:00, 10 October 2022)
  124. Register Allocation‏‎ (12:00, 10 October 2022)
  125. Representative Algorithms‏‎ (12:00, 10 October 2022)
  126. Robotics‏‎ (12:00, 10 October 2022)
  127. Rod-cutting problem‏‎ (12:00, 10 October 2022)
  128. SDD Systems Solvers‏‎ (12:00, 10 October 2022)
  129. SMAWK Algorithm‏‎ (12:00, 10 October 2022)
  130. Second category integer factoring‏‎ (12:00, 10 October 2022)
  131. Secret-sharing algorithms‏‎ (12:00, 10 October 2022)
  132. Self-balancing trees creation‏‎ (12:00, 10 October 2022)
  133. Self-balancing trees deletion‏‎ (12:00, 10 October 2022)
  134. Self-balancing trees insertion‏‎ (12:00, 10 October 2022)
  135. Self-balancing trees search‏‎ (12:00, 10 October 2022)
  136. Sequence Alignment‏‎ (12:00, 10 October 2022)
  137. Sequence to Graph Alignment‏‎ (12:00, 10 October 2022)
  138. Shortest Path(Directed graphs)‏‎ (12:00, 10 October 2022)
  139. Sorting - Comparison‏‎ (12:01, 10 October 2022)
  140. Sorting - Non-Comparison‏‎ (12:01, 10 October 2022)
  141. Stable Marriage Problem/Stable Roommates Problem‏‎ (12:01, 10 October 2022)
  142. Statistics‏‎ (12:01, 10 October 2022)
  143. Strassen's Algorithm‏‎ (12:01, 10 October 2022)
  144. String Search‏‎ (12:01, 10 October 2022)
  145. Tarjan's LCA Algorithm‏‎ (12:01, 10 October 2022)
  146. Tarjan's SSC Algorithm‏‎ (12:01, 10 October 2022)
  147. Template Page‏‎ (12:01, 10 October 2022)
  148. The frequent words problem‏‎ (12:01, 10 October 2022)
  149. The set-covering problem‏‎ (12:01, 10 October 2022)
  150. The subset-sum problem‏‎ (12:01, 10 October 2022)
  151. The traveling-salesman problem‏‎ (12:01, 10 October 2022)
  152. The vertex-cover problem‏‎ (12:01, 10 October 2022)
  153. Todd–Coxeter algorithm‏‎ (12:01, 10 October 2022)
  154. Transitive Reduction problem‏‎ (12:01, 10 October 2022)
  155. Translating abstract syntax trees‏‎ (12:01, 10 October 2022)
  156. Turnpike problem‏‎ (12:01, 10 October 2022)
  157. Two-pass Algorithm‏‎ (12:01, 10 October 2022)
  158. Vaidya's Algorithm‏‎ (12:02, 10 October 2022)
  159. Vatti Clipping Algorithm‏‎ (12:02, 10 October 2022)
  160. Vornoi Diagrams‏‎ (12:02, 10 October 2022)
  161. Wagner-Fischer Algorithm‏‎ (12:02, 10 October 2022)
  162. Weighted Activity selection problem‏‎ (12:02, 10 October 2022)
  163. Wheel Factorization‏‎ (12:02, 10 October 2022)
  164. List:Problem Families‏‎ (11:11, 15 February 2023)
  165. List:Hypotheses‏‎ (11:11, 15 February 2023)
  166. List:Domains‏‎ (11:11, 15 February 2023)
  167. Domain:Bioinformatics‏‎ (11:11, 15 February 2023)
  168. Domain:Databases‏‎ (11:11, 15 February 2023)
  169. Domain:Image Processing‏‎ (11:11, 15 February 2023)
  170. Domain:Robotics‏‎ (11:11, 15 February 2023)
  171. Domain:Statistics‏‎ (11:11, 15 February 2023)
  172. Domain:Cryptography‏‎ (11:11, 15 February 2023)
  173. Family:Sorting‏‎ (11:11, 15 February 2023)
  174. Family:Matrix Chain Multiplication‏‎ (11:12, 15 February 2023)
  175. Family:Longest Common Subsequence‏‎ (11:12, 15 February 2023)
  176. Family:Maximum Flow‏‎ (11:12, 15 February 2023)
  177. Family:Matrix Product‏‎ (11:12, 15 February 2023)
  178. Family:Linear System‏‎ (11:12, 15 February 2023)
  179. Family:Linear Programming‏‎ (11:12, 15 February 2023)
  180. Family:Line segment intersection‏‎ (11:12, 15 February 2023)
  181. Family:Convex Hull‏‎ (11:12, 15 February 2023)
  182. Family:Strongly Connected Components‏‎ (11:12, 15 February 2023)
  183. Family:Minimum Spanning Tree (MST)‏‎ (11:12, 15 February 2023)
  184. Family:Closest Pair Problem‏‎ (11:13, 15 February 2023)
  185. Family:Shortest Path (Directed Graphs)‏‎ (11:13, 15 February 2023)
  186. Family:All-Pairs Shortest Paths (APSP)‏‎ (11:13, 15 February 2023)
  187. Family:Integer Factoring‏‎ (11:13, 15 February 2023)
  188. Family:LU Decomposition‏‎ (11:13, 15 February 2023)
  189. Family:String Search‏‎ (11:14, 15 February 2023)
  190. Family:Sequence Alignment‏‎ (11:14, 15 February 2023)
  191. Family:Line Clipping‏‎ (11:14, 15 February 2023)
  192. Family:Maximum Cardinality Matching‏‎ (11:14, 15 February 2023)
  193. Family:SDD Systems Solvers‏‎ (11:14, 15 February 2023)
  194. Family:Generating Random Permutations‏‎ (11:14, 15 February 2023)
  195. Family:Optimal Binary Search Trees‏‎ (11:14, 15 February 2023)
  196. Family:Nash Equilibria‏‎ (11:14, 15 February 2023)
  197. Family:Maximum-Weight Matching‏‎ (11:14, 15 February 2023)
  198. Family:Polygon Clipping‏‎ (11:14, 15 February 2023)
  199. Family:Eigenvalues (Iterative Methods)‏‎ (11:14, 15 February 2023)
  200. Family:Register Allocation‏‎ (11:14, 15 February 2023)
  201. Family:DFA Minimization‏‎ (11:14, 15 February 2023)
  202. Family:Lowest Common Ancestor‏‎ (11:14, 15 February 2023)
  203. Family:Graph Edit Distance Computation‏‎ (11:14, 15 February 2023)
  204. Family:Clique Problems‏‎ (11:14, 15 February 2023)
  205. Family:The Traveling-Salesman Problem‏‎ (11:14, 15 February 2023)
  206. Family:Poisson Problem‏‎ (11:15, 15 February 2023)
  207. Family:Dependency Inference Problem‏‎ (11:15, 15 February 2023)
  208. Family:BCNF Decomposition‏‎ (11:15, 15 February 2023)
  209. Family:4NF Decomposition‏‎ (11:15, 15 February 2023)
  210. Family:The Vertex Cover Problem‏‎ (11:15, 15 February 2023)
  211. Family:CFG Problems‏‎ (11:15, 15 February 2023)
  212. Family:Data Compression‏‎ (11:15, 15 February 2023)
  213. Family:Stable Matching Problem‏‎ (11:15, 15 February 2023)
  214. Family:Maximum Subarray Problem‏‎ (11:15, 15 February 2023)
  215. Family:AST to Code Translation‏‎ (11:15, 15 February 2023)
  216. Family:Graph Isomorphism Problem‏‎ (11:15, 15 February 2023)
  217. Family:Graph Realization Problems‏‎ (11:15, 15 February 2023)
  218. Family:Feature Detection‏‎ (11:15, 15 February 2023)
  219. Family:The Set-Covering Problem‏‎ (11:15, 15 February 2023)
  220. Family:Link Analysis‏‎ (11:15, 15 February 2023)
  221. Family:Texture Mapping‏‎ (11:16, 15 February 2023)
  222. Family:Wiener Index‏‎ (11:16, 15 February 2023)
  223. Family:Integer Relation‏‎ (11:16, 15 February 2023)
  224. Family:n-Queens Problem‏‎ (11:16, 15 February 2023)
  225. Family:Median String Problem‏‎ (11:16, 15 February 2023)
  226. Family:Integral Equations‏‎ (11:16, 15 February 2023)
  227. Family:One-Way Hash Functions‏‎ (11:16, 15 February 2023)
  228. Family:Deadlock Avoidance‏‎ (11:16, 15 February 2023)
  229. Family:Page Replacements‏‎ (11:16, 15 February 2023)
  230. Family:Graph Coloring‏‎ (11:17, 15 February 2023)
  231. Family:Boolean Satisfiability‏‎ (11:17, 15 February 2023)
  232. Family:Orthogonal Vectors‏‎ (11:17, 15 February 2023)
  233. Family:Graph Metrics‏‎ (11:17, 15 February 2023)
  234. Family:Vertex Centrality‏‎ (11:17, 15 February 2023)
  235. Family:Graph Triangle Problems‏‎ (11:17, 15 February 2023)
  236. Family:Geometric Incidence Problems‏‎ (11:17, 15 February 2023)
  237. Family:Geometric Separator Problems‏‎ (11:17, 15 February 2023)
  238. Family:Geometric Covering Problems‏‎ (11:17, 15 February 2023)
  239. Family:Geometric Visibility Problems‏‎ (11:17, 15 February 2023)
  240. Family:Motion Planning Problems‏‎ (11:17, 15 February 2023)
  241. Family:Local Alignment‏‎ (11:17, 15 February 2023)
  242. Family:Minimum Witness‏‎ (11:17, 15 February 2023)
  243. Family:Graph Cycles‏‎ (11:17, 15 February 2023)
  244. Family:Matrix-Vector Multiplication‏‎ (11:17, 15 February 2023)
  245. Family:Vertex Reachability‏‎ (11:17, 15 February 2023)
  246. Family:Model-Checking Problem‏‎ (11:17, 15 February 2023)
  247. Family:Dihedral Rotation Queries‏‎ (11:17, 15 February 2023)
  248. Family:3SUM‏‎ (11:17, 15 February 2023)
  249. Ray Tracing‏‎ (11:23, 15 February 2023)
  250. Culling‏‎ (11:24, 15 February 2023)
  251. Image Compositing‏‎ (11:25, 15 February 2023)
  252. Diffuse Reflection‏‎ (11:25, 15 February 2023)
  253. Mesh Simplification‏‎ (11:25, 15 February 2023)
  254. POMDPs‏‎ (11:25, 15 February 2023)
  255. Rasterization‏‎ (11:25, 15 February 2023)
  256. Environment Mapping‏‎ (11:25, 15 February 2023)
  257. Occupancy Grid Mapping‏‎ (11:25, 15 February 2023)
  258. Fredholm Equations‏‎ (11:26, 15 February 2023)
  259. Volterra Equations‏‎ (11:26, 15 February 2023)
  260. Steal/No-Force‏‎ (11:26, 15 February 2023)
  261. No-Steal/Force‏‎ (11:26, 15 February 2023)
  262. Chromatic Polynomial‏‎ (11:27, 15 February 2023)
  263. Maximum Inner Product Search‏‎ (11:30, 15 February 2023)
  264. Approximate Hard-Margin SVM‏‎ (11:30, 15 February 2023)
  265. Exponential Time Hypothesis (ETH)‏‎ (11:30, 15 February 2023)
  266. Strong Exponential Time Hypothesis (SETH)‏‎ (11:30, 15 February 2023)
  267. Orthogonal Vectors Hypothesis (OVH)‏‎ (11:30, 15 February 2023)
  268. Unbalanced Orthogonal Vectors Hypothesis (UOVH)‏‎ (11:30, 15 February 2023)
  269. K-OV Hypothesis‏‎ (11:30, 15 February 2023)
  270. K-Clique Hypothesis‏‎ (11:30, 15 February 2023)
  271. 3SUM Hypothesis (3-SUM Hypothesis)‏‎ (11:30, 15 February 2023)
  272. All Pairs Shortest Paths Hypothesis (APSP Hypothesis)‏‎ (11:30, 15 February 2023)
  273. Hitting Set Hypothesis (HS Hypothesis)‏‎ (11:30, 15 February 2023)
  274. Min-Weight k-Clique Hypothesis‏‎ (11:30, 15 February 2023)
  275. Exact k-Clique Hypothesis‏‎ (11:30, 15 February 2023)
  276. Boolean Matrix Multiplication Hypothesis (BMM Hypothesis)‏‎ (11:30, 15 February 2023)
  277. Online Matrix Vector Multiplication Hypothesis (OMV Hypothesis)‏‎ (11:30, 15 February 2023)
  278. Nondeterministic Strong Exponential Time Hypothesis (NSETH)‏‎ (11:30, 15 February 2023)
  279. More Believable Exponential Time Hypothesis (MBETH)‏‎ (11:30, 15 February 2023)
  280. Strong Triangle Conjecture‏‎ (11:30, 15 February 2023)
  281. $\delta$-Triangle Conjecture‏‎ (11:31, 15 February 2023)
  282. Parametrized Inapproximability Hypothesis (PIH)‏‎ (11:31, 15 February 2023)
  283. Weak Parametrized Inapproximability Hypothesis (WPIH)‏‎ (11:31, 15 February 2023)
  284. Melhorn's Approximation algorithm (Approximate OBST Optimal Binary Search Trees)‏‎ (11:31, 15 February 2023)
  285. Karpinski (Approximate OBST Optimal Binary Search Trees)‏‎ (11:31, 15 February 2023)
  286. Klawe; Mumey (Alphabetic Tree Problem Optimal Binary Search Trees)‏‎ (11:31, 15 February 2023)
  287. Larmore (Approximate OBST Optimal Binary Search Trees)‏‎ (11:31, 15 February 2023)
  288. Hierarchical Navigable Small World (HNSW) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search)‏‎ (11:31, 15 February 2023)
  289. Locality-sensitive hashing (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search)‏‎ (11:31, 15 February 2023)
  290. 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)
  291. Compression/Clustering (Vector Quantization) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search)‏‎ (11:31, 15 February 2023)
  292. Pisinger (Subset Sum The Subset-Sum Problem)‏‎ (11:31, 15 February 2023)
  293. Faaland (Subset Sum The Subset-Sum Problem)‏‎ (11:31, 15 February 2023)
  294. Pferschy (Subset Sum The Subset-Sum Problem)‏‎ (11:31, 15 February 2023)
  295. Klinz (Subset Sum The Subset-Sum Problem)‏‎ (11:31, 15 February 2023)
  296. Epstein (Subset Sum The Subset-Sum Problem)‏‎ (11:31, 15 February 2023)
  297. Lokshtanov (Subset Sum The Subset-Sum Problem)‏‎ (11:31, 15 February 2023)
  298. Valentin Polishchuk, and Jukka Suomela (Almost Stable Marriage Problem Stable Matching Problem)‏‎ (11:31, 15 February 2023)
  299. Lawrence, Reilly (Motif Search Motif Search)‏‎ (11:31, 15 February 2023)
  300. Lawrence Gibbs Sampling (Motif Search Motif Search)‏‎ (11:31, 15 February 2023)
  301. MotifSampler (Motif Search Motif Search)‏‎ (11:31, 15 February 2023)
  302. Tree-structured vector quantization Wei-Levoy (Texture Synthesis Texture Synthesis)‏‎ (11:31, 15 February 2023)
  303. Spatial GAN-Based; Urs Bergmann, Nikolay Jetchev, Roland Vollgraf (Texture Synthesis Texture Synthesis)‏‎ (11:31, 15 February 2023)
  304. Grigoryan (n-Queens Completion n-Queens Problem)‏‎ (11:31, 15 February 2023)
  305. Sedgewick; Szymanski; and Yao ( Cycle Detection)‏‎ (11:31, 15 February 2023)
  306. Nivasch ( Cycle Detection)‏‎ (11:31, 15 February 2023)
  307. Counting Sort (Non-Comparison Sorting Sorting)‏‎ (11:31, 15 February 2023)
  308. Bucket Sort (Non-Comparison Sorting Sorting)‏‎ (11:31, 15 February 2023)
  309. Radix Sort (Non-Comparison Sorting Sorting)‏‎ (11:31, 15 February 2023)
  310. Ford & Fulkerson ( Maximum Flow)‏‎ (11:32, 15 February 2023)
  311. Dinitz ( Maximum Flow)‏‎ (11:32, 15 February 2023)
  312. Karzanov ( Maximum Flow)‏‎ (11:32, 15 February 2023)
  313. Naive algorithm (Matrix Multiplication Matrix Product)‏‎ (11:32, 15 February 2023)
  314. Pan's algorithm (Matrix Multiplication Matrix Product)‏‎ (11:32, 15 February 2023)
  315. Romani's algorithm (Matrix Multiplication Matrix Product)‏‎ (11:32, 15 February 2023)
  316. Vassilevska Williams (Matrix Multiplication Matrix Product)‏‎ (11:32, 15 February 2023)
  317. François Le Gall (Matrix Multiplication Matrix Product)‏‎ (11:32, 15 February 2023)
  318. Brute force (4-Graph Coloring Graph Coloring)‏‎ (11:32, 15 February 2023)
  319. Gaussian-Jordan Elimination (General Linear System; Positive Definite, Hermitian Matrix; Non-Definite, Symmetric Matrix; Toeplitz Matrix; Vandermonde Matrix Linear System)‏‎ (11:32, 15 February 2023)
  320. Cholesky (Positive Definite, Hermitian Matrix Linear System)‏‎ (11:32, 15 February 2023)
  321. Aasen's method (Non-Definite, Symmetric Matrix Linear System)‏‎ (11:32, 15 February 2023)
  322. Levinson–Durbin recursion (Toeplitz Matrix Linear System)‏‎ (11:32, 15 February 2023)
  323. Bareiss Algorithm (Toeplitz Matrix Linear System)‏‎ (11:32, 15 February 2023)
  324. Bjorck-Pereyra (Vandermonde Matrix Linear System)‏‎ (11:32, 15 February 2023)
  325. Brute Force (2-dimensional Convex Hull)‏‎ (11:32, 15 February 2023)
  326. Doolittle Algorithm (Square Matrix LU Decomposition LU Decomposition)‏‎ (11:32, 15 February 2023)
  327. Crout and LUP algorithms (Square Matrix LU Decomposition LU Decomposition)‏‎ (11:32, 15 February 2023)
  328. Okunev; Johnson (Square Matrix LU Decomposition LU Decomposition)‏‎ (11:32, 15 February 2023)
  329. A* Algorithm (Informed Search Informed Search)‏‎ (11:32, 15 February 2023)
  330. Bidirectional A* Algorithm (Informed Search Informed Search)‏‎ (11:32, 15 February 2023)
  331. Fringe Saving A* (FSA*) (Informed Search Informed Search)‏‎ (11:32, 15 February 2023)
  332. Generalized Adaptive A* (GAA*) (Informed Search Informed Search)‏‎ (11:32, 15 February 2023)
  333. Iterative Deepening A* (IDA*) (Informed Search Informed Search)‏‎ (11:33, 15 February 2023)
  334. Jump Point Search (JPS) (Informed Search Informed Search)‏‎ (11:33, 15 February 2023)
  335. Lifelong Planning A* (LPA*) (Informed Search Informed Search)‏‎ (11:33, 15 February 2023)
  336. Simplified Memory-Bounded A* (SMA*) (Informed Search Informed Search)‏‎ (11:33, 15 February 2023)
  337. Theta* (Informed Search Informed Search)‏‎ (11:33, 15 February 2023)
  338. Anytime Repairing A* (ARA*) (Informed Search Informed Search)‏‎ (11:33, 15 February 2023)
  339. Time-Bounded A* (TBA*) (Informed Search Informed Search)‏‎ (11:33, 15 February 2023)
  340. Naïve string-search algorithm (Single String Search String Search)‏‎ (11:33, 15 February 2023)
  341. Boyer-Moore (BM) algorithm (Single String Search String Search)‏‎ (11:33, 15 February 2023)
  342. Rabin-Karp (RK) algorithm (Single String Search String Search)‏‎ (11:33, 15 February 2023)
  343. Needleman–Wunsch algorithm (Edit sequence, global alignment Sequence Alignment)‏‎ (11:33, 15 February 2023)
  344. Smith–Waterman algorithm (Edit sequence, local alignment Sequence Alignment)‏‎ (11:33, 15 February 2023)
  345. Masek; Patterson (Edit distance, constant-size alphabet Sequence Alignment)‏‎ (11:33, 15 February 2023)
  346. Hirschberg's algorithm (Edit sequence, constant-size alphabet Sequence Alignment)‏‎ (11:33, 15 February 2023)
  347. FASTA (Edit sequence, local alignment Sequence Alignment)‏‎ (11:33, 15 February 2023)
  348. Gotoh (Edit sequence, local alignment Sequence Alignment)‏‎ (11:33, 15 February 2023)
  349. Altschul and Erickson (Edit sequence, local alignment Sequence Alignment)‏‎ (11:33, 15 February 2023)
  350. Myers and Miller (Edit sequence, local alignment Sequence Alignment)‏‎ (11:33, 15 February 2023)
  351. David Sankoff (Edit sequence, global alignment Sequence Alignment)‏‎ (11:33, 15 February 2023)
  352. Rabin–Scott powerset construction ( NFA to DFA conversion)‏‎ (11:33, 15 February 2023)
  353. Grenander (1D Maximum Subarray Maximum Subarray Problem)‏‎ (11:34, 15 February 2023)
  354. Kadane's Algorithm (1D Maximum Subarray Maximum Subarray Problem)‏‎ (11:34, 15 February 2023)
  355. Speller (Motif Search Motif Search)‏‎ (11:34, 15 February 2023)
  356. Mitra (Motif Search Motif Search)‏‎ (11:34, 15 February 2023)
  357. Census (Motif Search Motif Search)‏‎ (11:34, 15 February 2023)
  358. Risotto (Motif Search Motif Search)‏‎ (11:34, 15 February 2023)
  359. PMS (Motif Search Motif Search)‏‎ (11:34, 15 February 2023)
  360. Brute Force (Rod-Cutting Problem Rod-Cutting Problem)‏‎ (11:34, 15 February 2023)
  361. Dynamic Programming (Rod-Cutting Problem Rod-Cutting Problem)‏‎ (11:34, 15 February 2023)
  362. Brute Force (Change-Making Problem Change-Making Problem)‏‎ (11:34, 15 February 2023)
  363. Dynamic Programming (Change-Making Problem Change-Making Problem)‏‎ (11:34, 15 February 2023)
  364. Chandra (Approximate MCOP Matrix Chain Multiplication)‏‎ (11:34, 15 February 2023)
  365. Chin (Approximate MCOP Matrix Chain Multiplication)‏‎ (11:34, 15 February 2023)
  366. Bini's algorithm (Matrix Multiplication Matrix Product)‏‎ (11:34, 15 February 2023)
  367. Karger, Blum ( Graph Coloring)‏‎ (11:34, 15 February 2023)
  368. Miller-Tucker-Zemlin (MTZ) formulation (Minimum TSP The Traveling-Salesman Problem)‏‎ (11:34, 15 February 2023)
  369. Dantzig-Fulkerson-Johnson (DFJ) formulation (Minimum TSP The Traveling-Salesman Problem)‏‎ (11:34, 15 February 2023)
  370. Harris and Stephens algorithm ( Corner Detection)‏‎ (11:34, 15 February 2023)
  371. L. Kitchen and A. Rosenfeld (Grey-scale Corner Detection)‏‎ (11:35, 15 February 2023)
  372. The SUSAN corner detector ( Corner Detection)‏‎ (11:35, 15 February 2023)
  373. Chvatal greedy heuristic (Weighted Set-Covering The Set-Covering Problem)‏‎ (11:35, 15 February 2023)
  374. Alon; Moshkovitz & Safra (Unweighted Set-Covering The Set-Covering Problem)‏‎ (11:35, 15 February 2023)
  375. Roth AlignACE (Motif Search Motif Search)‏‎ (11:35, 15 February 2023)
  376. Petro Vlahos Algorithm (Image Compositing Image Compositing)‏‎ (11:35, 15 February 2023)
  377. Non-parametric sampling Efros and Leung (Texture Synthesis Texture Synthesis)‏‎ (11:35, 15 February 2023)
  378. R. Paget ; I.D. Longstaff (Texture Synthesis Texture Synthesis)‏‎ (11:35, 15 February 2023)
  379. Image quilting Efros-Freeman (Texture Synthesis Texture Synthesis)‏‎ (11:35, 15 February 2023)
  380. Fomin; Gaspers & Saurabh (4-Graph Coloring Graph Coloring)‏‎ (11:35, 15 February 2023)
  381. Khuller; Matias Randomized Sieve ( Closest Pair Problem)‏‎ (11:35, 15 February 2023)
  382. Bunch; Hopcroft (Square Matrix LU Decomposition LU Decomposition)‏‎ (11:35, 15 February 2023)
  383. Bitap algorithm (Single String Search String Search)‏‎ (11:35, 15 February 2023)
  384. Tim Sort (Comparison Sorting Sorting)‏‎ (11:35, 15 February 2023)
  385. Cube Sort Parallel Implementation (Comparison Sorting Sorting)‏‎ (11:35, 15 February 2023)
  386. Shell Sort; (Shell) (Comparison Sorting Sorting)‏‎ (11:35, 15 February 2023)
  387. Shell Sort; (Frank & Lazarus) (Comparison Sorting Sorting)‏‎ (11:35, 15 February 2023)
  388. Shell Sort; (Pratt) (Comparison Sorting Sorting)‏‎ (11:35, 15 February 2023)
  389. Shell Sort; (Sedgewick) (Comparison Sorting Sorting)‏‎ (11:35, 15 February 2023)
  390. Bead Sort (Non-Comparison Sorting Sorting)‏‎ (11:35, 15 February 2023)
  391. Burst Sort (Non-Comparison Sorting Sorting)‏‎ (11:35, 15 February 2023)
  392. Hashing (kth Order Statistic kth Order Statistic)‏‎ (11:35, 15 February 2023)
  393. Hunt and Szymanski (LCS Longest Common Subsequence)‏‎ (11:35, 15 February 2023)
  394. Mukhopadhyay (LCS Longest Common Subsequence)‏‎ (11:35, 15 February 2023)
  395. Cherkassky ( Maximum Flow)‏‎ (11:35, 15 February 2023)
  396. James B Orlin's + KRT (King; Rao; Tarjan)'s algorithm (st-Maximum Flow Maximum Flow)‏‎ (11:36, 15 February 2023)
  397. Schiermeyer (3-Graph Coloring Graph Coloring)‏‎ (11:36, 15 February 2023)
  398. Lawler (4-Graph Coloring Graph Coloring)‏‎ (11:36, 15 February 2023)
  399. Byskov (4-Graph Coloring Graph Coloring)‏‎ (11:36, 15 February 2023)
  400. Conjugate Gradient (Approximation? with positive definite matrix Linear System)‏‎ (11:36, 15 February 2023)
  401. Karmarkar's algorithm ( Linear Programming)‏‎ (11:36, 15 February 2023)
  402. Affine scaling ( Linear Programming)‏‎ (11:36, 15 February 2023)
  403. CHAZELLE (Reporting all intersection points, line segments Line segment intersection)‏‎ (11:36, 15 February 2023)
  404. W. Eddy Quickhull (2-dimensional Convex Hull)‏‎ (11:36, 15 February 2023)
  405. Andrew's algorithm (2-dimensional Convex Hull)‏‎ (11:36, 15 February 2023)
  406. The ultimate planar convex hull algorithm (2-dimensional Convex Hull)‏‎ (11:36, 15 February 2023)
  407. Chan's algorithm (2-dimensional; 3-dimensional Convex Hull)‏‎ (11:36, 15 February 2023)
  408. Kosaraju's algorithm (SCCs Strongly Connected Components)‏‎ (11:36, 15 February 2023)
  409. Tarjan's strongly connected components algorithm (SCCs Strongly Connected Components)‏‎ (11:37, 15 February 2023)
  410. Path-based strong components algorithm; Dijkstra (SCCs Strongly Connected Components)‏‎ (11:37, 15 February 2023)
  411. Pearce (SCCs Strongly Connected Components)‏‎ (11:37, 15 February 2023)
  412. Path-based depth-first search Gabow (SCCs Strongly Connected Components)‏‎ (11:37, 15 February 2023)
  413. Paul Purdom (Transitive Closure Strongly Connected Components)‏‎ (11:37, 15 February 2023)
  414. Lowe’s Algorithm (SCCs Strongly Connected Components)‏‎ (11:37, 15 February 2023)
  415. Renault’s Algorithm (SCCs Strongly Connected Components)‏‎ (11:37, 15 February 2023)
  416. Couvreur (SCCs Strongly Connected Components)‏‎ (11:37, 15 February 2023)
  417. OBF Algorithm (SCCs Strongly Connected Components)‏‎ (11:37, 15 February 2023)
  418. CH Algorithm (SCCs Strongly Connected Components)‏‎ (11:37, 15 February 2023)
  419. Hong’s algorithm (SCCs Strongly Connected Components)‏‎ (11:37, 15 February 2023)
  420. Prim's algorithm + adjacency matrix searching (Undirected, General MST Minimum Spanning Tree (MST))‏‎ (11:37, 15 February 2023)
  421. Rabin' Algorithm (k-dimensional space, l m (or l infty) norm Closest Pair Problem)‏‎ (11:37, 15 February 2023)
  422. Dyer (2-dimensional array representation Closest Pair Problem)‏‎ (11:37, 15 February 2023)
  423. Thorup's algorithm (Nonnegative Integer Weights Shortest Path (Directed Graphs))‏‎ (11:37, 15 February 2023)
  424. Dixon's algorithm (Second Category Integer Factoring Integer Factoring)‏‎ (11:38, 15 February 2023)
  425. Continued fraction factorization (CFRAC) (Second Category Integer Factoring Integer Factoring)‏‎ (11:38, 15 February 2023)
  426. Quadratic sieve (Second Category Integer Factoring Integer Factoring)‏‎ (11:38, 15 February 2023)
  427. Rational sieve (Second Category Integer Factoring Integer Factoring)‏‎ (11:38, 15 February 2023)
  428. Closed formula ( LU Decomposition)‏‎ (11:38, 15 February 2023)
  429. Randomized LU Decomposition (Rectangular Matrix LU Decomposition LU Decomposition)‏‎ (11:38, 15 February 2023)
  430. David ( LU Decomposition)‏‎ (11:38, 15 February 2023)
  431. Greedy Best-First Search (Informed Search Informed Search)‏‎ (11:38, 15 February 2023)
  432. Incremental Heuristic Search ( Informed Search)‏‎ (11:38, 15 February 2023)
  433. Block A* (Informed Search Informed Search)‏‎ (11:38, 15 February 2023)
  434. D* (Informed Search Informed Search)‏‎ (11:38, 15 February 2023)
  435. Field D* (Informed Search Informed Search)‏‎ (11:38, 15 February 2023)
  436. Fringe (Informed Search Informed Search)‏‎ (11:38, 15 February 2023)
  437. Tuned Boyer-Moore algorithm (Single String Search String Search)‏‎ (11:38, 15 February 2023)
  438. FOGSAA (Edit sequence, global alignment Sequence Alignment)‏‎ (11:38, 15 February 2023)
  439. Skala (convex and non-convex polyhedral window Line Clipping)‏‎ (11:38, 15 February 2023)
  440. Lamport's bakery algorithm ( Mutual Exclusion)‏‎ (11:39, 15 February 2023)
  441. Szymanski's algorithm ( Mutual Exclusion)‏‎ (11:39, 15 February 2023)
  442. Taubenfeld's black-white bakery algorithm ( Mutual Exclusion)‏‎ (11:39, 15 February 2023)
  443. Maekawa's algorithm ( Mutual Exclusion)‏‎ (11:39, 15 February 2023)
  444. Suzuki-Kasami's algorithm ( Mutual Exclusion)‏‎ (11:39, 15 February 2023)
  445. Painter's algorithm/Newell's algorithm ( Shown Surface Determination)‏‎ (11:39, 15 February 2023)
  446. Warnock's algorithm ( Shown Surface Determination)‏‎ (11:39, 15 February 2023)
  447. Ray tracing ( Shown Surface Determination)‏‎ (11:39, 15 February 2023)
  448. Binary space partitioning (BSP) ( Shown Surface Determination)‏‎ (11:39, 15 February 2023)
  449. Z-buffering ( Shown Surface Determination)‏‎ (11:39, 15 February 2023)
  450. S-buffer/Scanline Rendering ( Shown Surface Determination)‏‎ (11:39, 15 February 2023)
  451. Power Iteration (Eigenpair with the Largest Eigenvalue Eigenvalues (Iterative Methods))‏‎ (11:39, 15 February 2023)
  452. Fortune ( Delaunay triangulation)‏‎ (11:39, 15 February 2023)
  453. Gries (1D Maximum Subarray Maximum Subarray Problem)‏‎ (11:39, 15 February 2023)
  454. Bird (1D Maximum Subarray Maximum Subarray Problem)‏‎ (11:39, 15 February 2023)
  455. Resource hierarchy solution (Dining Philosophers Problem Deadlock Avoidance)‏‎ (11:39, 15 February 2023)
  456. Arbitrator solution (Dining Philosophers Problem Deadlock Avoidance)‏‎ (11:39, 15 February 2023)
  457. Applegate et al. (Approximate TSP The Traveling-Salesman Problem)‏‎ (11:39, 15 February 2023)
  458. Johnson; D. S.; McGeoch; L. A. ( The Traveling-Salesman Problem)‏‎ (11:39, 15 February 2023)
  459. Gutina; Gregory; Yeob; Anders; Zverovich; Alexey ( The Traveling-Salesman Problem)‏‎ (11:39, 15 February 2023)
  460. Rosenkrantz; D. J.; Stearns; R. E.; Lewis; P. M. (Approximate TSP The Traveling-Salesman Problem)‏‎ (11:39, 15 February 2023)
  461. Lin–Kernighan (Approximate TSP The Traveling-Salesman Problem)‏‎ (11:39, 15 February 2023)
  462. Overlap Layout Consensus (De Novo Genome Assembly De Novo Genome Assembly)‏‎ (11:39, 15 February 2023)
  463. Greedy SEQAID (De Novo Genome Assembly De Novo Genome Assembly)‏‎ (11:39, 15 February 2023)
  464. Dürer rendering algorithm ( Ray Tracing)‏‎ (11:39, 15 February 2023)
  465. Appel's algorithm 1968 ( Ray Tracing)‏‎ (11:39, 15 February 2023)
  466. Whitted's algorithm 1979 ( Ray Tracing)‏‎ (11:39, 15 February 2023)
  467. J.-C. Nebel 1998 ( Ray Tracing)‏‎ (11:39, 15 February 2023)
  468. A. Chalmers; T. Davis; and E. Reinhard 2002 ( Ray Tracing)‏‎ (11:39, 15 February 2023)
  469. Moravec's algorithm 1980 (Corner Detection Feature Detection)‏‎ (11:39, 15 February 2023)
  470. J. J. Koenderink and W. Richards 1988 (Corner Detection Feature Detection)‏‎ (11:39, 15 February 2023)
  471. Lindeberg (1994) (Corner Detection Feature Detection)‏‎ (11:39, 15 February 2023)
  472. Lindeberg (1998) (Corner Detection Feature Detection)‏‎ (11:39, 15 February 2023)
  473. K. Mikolajczyk; K. and C. Schmid LoG 2004 (Corner Detection Feature Detection)‏‎ (11:39, 15 February 2023)
  474. Lowe (2004) (Corner Detection Feature Detection)‏‎ (11:39, 15 February 2023)
  475. T. Lindeberg and J. Garding (1997) (Corner Detection Feature Detection)‏‎ (11:39, 15 February 2023)
  476. Lindeberg 2005 (Corner Detection Feature Detection)‏‎ (11:39, 15 February 2023)
  477. The Wang and Brady corner detection algorithm 1995 (Corner Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  478. The Trajkovic and Hedley corner detector 1998 (Corner Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  479. FAST E. Rosten and T. Drummond 2006 (Corner Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  480. Trujillo and Olague 2008 (Corner Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  481. Geert Willems; Tinne Tuytelaars and Luc van Gool (2008) (Corner Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  482. Tao Luo, Zaifeng Shi and Pumeng Wang (Corner Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  483. T. Lindeberg DoG 2012 (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  484. SIFT Algorithm Lowe 2004 (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  485. Hessain Determinant Lindeberg 1994 (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  486. Hessain Determinant Lindeberg 1998 (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  487. SURF Descriptor 2006 (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  488. Hessian-Laplace Mikolajczyk and Schmid 2004 (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  489. Spatio-temporal Geert Willems; Tinne Tuytelaars and Luc van Gool (2008) (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  490. Lindeberg's watershed-based grey-level blob detection algorithm 1991 (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  491. Maximally stable extremal regions Matas 2002 (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  492. A. Baumberg. 2000 (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  493. Local scale-invariant Lowe 1999 (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  494. T. Tuytelaars and L. Van Gool 2000 (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  495. View frustum culling (Culling Culling)‏‎ (11:40, 15 February 2023)
  496. Sector-Based Culling (Culling Culling)‏‎ (11:40, 15 February 2023)
  497. Occlusion Culling (Culling Culling)‏‎ (11:40, 15 February 2023)
  498. Contribution Culling (Culling Culling)‏‎ (11:40, 15 February 2023)
  499. Kwatra 2003 (Texture Synthesis Texture Synthesis)‏‎ (11:40, 15 February 2023)
  500. CNN Based Gatys; Leon A 2001 (Texture Synthesis Texture Synthesis)‏‎ (11:40, 15 February 2023)

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

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