Uncategorized pages

Jump to navigation Jump to search

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

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

  1. $(\min, \leq)$ Product
  2. $O(n\log n)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling)
  3. $O(n^2)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling)
  4. $O(n^3)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling)
  5. $\delta$-Triangle Conjecture
  6. (3-Dimensional, i.e. project onto a 2D plane)
  7. (5/3)-approximate ap-shortest paths
  8. (Boolean Matrix Multiplication (Combinatorial) Matrix Product)
  9. ( Negative Triangle)
  10. (many more...) (2-dimensional Convex Hull, Dynamic Convex Hull)
  11. 0-1 Linear Programming
  12. 1-in-3SAT
  13. 1-sensitive (3/2)-approximate ss-shortest paths
  14. 1-sensitive (4/3)-approximate decremental diameter
  15. 1-sensitive (4/3)-approximate decremental eccentricity
  16. 1-sensitive decremental diameter
  17. 1-sensitive decremental st-shortest paths
  18. 1-sensitive incremental ss-reach
  19. 1D Maximum Subarray
  20. 2-Dimensional Poisson Problem
  21. 2-Graph Coloring
  22. 2-Player
  23. 2-dimensional Convex Hull
  24. 2-dimensional Convex Hull, Dynamic
  25. 2-dimensional Convex Hull, Online
  26. 2-dimensional array representation
  27. 2-dimensional space, $l m$ (or $l \infty$) norm
  28. 2-dimensional space, Euclidean metric
  29. 2-sensitive (7/5)-approximate st-shortest paths
  30. 2-sensitive decremental st-shortest paths
  31. 2-sensitive incremental st-reach
  32. 2D Maximum Subarray
  33. 2SAT
  34. 2 Strong Components (dynamic)
  35. 3-Dimensional Poisson Problem
  36. 3-Graph Coloring
  37. 3-OV
  38. 3-dimensional Convex Hull
  39. 3D Motion Planning
  40. 3SAT
  41. 3SAT-5
  42. 3SUM
  43. 3SUM'
  44. 3SUM Hypothesis (3-SUM Hypothesis)
  45. 3 - Graph Coloring
  46. 3 Points on Line
  47. 4-Graph Coloring
  48. 4NF Decomposition
  49. 4NF Decomposition for Conflict-Free Dependency Sets
  50. 4NF Decomposition for Functional and Multivalued Dependency Sets
  51. 4NF decomposition
  52. 4SAT
  53. 4 - Graph Coloring
  54. 5-Graph Coloring
  55. 5-point ADI iteration (2-Dimensional Poisson Problem Poisson Problem)
  56. 5-point ADI iteration (3-Dimensional Poisson Problem Poisson Problem)
  57. 5-point FFT (2-Dimensional Poisson Problem Poisson Problem)
  58. 5-point FFT (3-Dimensional Poisson Problem Poisson Problem)
  59. 5-point Gauss Seidel iteration (2-Dimensional Poisson Problem Poisson Problem)
  60. 5-point Gauss Seidel iteration (3-Dimensional Poisson Problem Poisson Problem)
  61. 5-point Gauss elimination (2-Dimensional Poisson Problem Poisson Problem)
  62. 5-point Gauss elimination (3-Dimensional Poisson Problem Poisson Problem)
  63. 5-point SOR iteration (2-Dimensional Poisson Problem Poisson Problem)
  64. 5-point SOR iteration (3-Dimensional Poisson Problem Poisson Problem)
  65. 5-point cyclic reduction (2-Dimensional Poisson Problem Poisson Problem)
  66. 5-point cyclic reduction (3-Dimensional Poisson Problem Poisson Problem)
  67. 5-point star Cramer's rule (2-Dimensional Poisson Problem Poisson Problem)
  68. 5-point star Cramer's rule (3-Dimensional Poisson Problem Poisson Problem)
  69. 9-point ADI iteration (2-Dimensional Poisson Problem Poisson Problem)
  70. 9-point ADI iteration (3-Dimensional Poisson Problem Poisson Problem)
  71. 9-point ADI iteration + smooth guess (2-Dimensional Poisson Problem Poisson Problem)
  72. 9-point ADI iteration + smooth guess (3-Dimensional Poisson Problem Poisson Problem)
  73. 9-point FFT (2-Dimensional Poisson Problem Poisson Problem)
  74. 9-point FFT (3-Dimensional Poisson Problem Poisson Problem)
  75. 9-point SOR iteration (2-Dimensional Poisson Problem Poisson Problem)
  76. 9-point SOR iteration (3-Dimensional Poisson Problem Poisson Problem)
  77. 9-point Tensor product (2-Dimensional Poisson Problem Poisson Problem)
  78. 9-point Tensor product (3-Dimensional Poisson Problem Poisson Problem)
  79. A* Algorithm
  80. A* Algorithm (Informed Search Informed Search)
  81. A* Informed Search
  82. A-Priori algorithm (Finding Frequent Itemsets Finding Frequent Itemsets)
  83. A. Baumberg. 2000 (Blob Detection Feature Detection)
  84. A. Chalmers; T. Davis; and E. Reinhard 2002 ( Ray Tracing)
  85. ADI Iteration
  86. APSP
  87. APSP algorithm (3-Clique Min-Weight k-Clique Problem)
  88. APSP on Dense Directed Graphs with Arbitrary Weights
  89. APSP on Dense Directed Unweighted Graphs
  90. APSP on Dense Undirected Graphs with Arbitrary Weights
  91. APSP on Dense Undirected Graphs with Positive Integer Weights
  92. APSP on Dense Undirected Unweighted Graphs
  93. APSP on Geometrically Weighted Graphs
  94. APSP on Sparse Directed Graphs with Arbitrary Weights
  95. APSP on Sparse Directed Unweighted Graphs
  96. APSP on Sparse Undirected Graphs with Arbitrary Weights
  97. APSP on Sparse Undirected Graphs with Positive Integer Weights
  98. APSP on Sparse Undirected Unweighted Graphs
  99. ARIES (Steal, No-Force Recovery)
  100. ASP (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems)
  101. AST to Code Translation
  102. AVL Tree ( Self-Balancing Trees Creation)
  103. AVL Tree ( Self-Balancing Trees Deletion)
  104. AVL Tree ( Self-Balancing Trees Insertion)
  105. AVL Tree ( Self-Balancing Trees Search)
  106. Aasen's method (Non-Definite, Symmetric Matrix Linear System)
  107. Abboud, Williams, Yu (OV Orthogonal Vectors)
  108. About Algorithm-Wiki
  109. Achlioptas (Link Analysis Link Analysis)
  110. Acyclic DFA Minimization
  111. Adaptive Duplicate Detection Algorithm (ADD) (Duplicate Elimination Duplicate Elimination)
  112. Affine scaling ( Linear Programming)
  113. Aging (Online Page Replacements)
  114. Aho, Garey & Ullman (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem)
  115. Aho, Hopcroft, and Ullman (Linking) (Lowest Common Ancestor with Linking Lowest Common Ancestor)
  116. Aho, Hopcroft, and Ullman (Offline) (Off-Line Lowest Common Ancestor Lowest Common Ancestor)
  117. Aho, Hopcroft, and Ullman (Static Trees) (Lowest Common Ancestor with Static Trees Lowest Common Ancestor)
  118. Aho–Corasick (AC) Algorithm (Multiple String Search String Search)
  119. Ahuja & Orlin ( Maximum Flow)
  120. Ahuja et al. ( Maximum Flow)
  121. Akkoyunlu; E. A. (Enumerating Maximal Cliques, arbitrary graph Clique Problems)
  122. Alberto Sanfeliu and King-Sun Fu ( Graph Edit Distance Computation)
  123. Algorithm Families
  124. All-Equal-SAT
  125. All-Integers 3SUM
  126. All-Nodes Median Parity
  127. All-Pairs Maximum Flow
  128. All-pairs shortest paths (Undirected)
  129. All Eigenpairs
  130. All Eigenvalues
  131. All Maximal Non-Branching Paths in a Graph
  132. All Pairs Minimum Witness
  133. All Pairs Shortest Paths Hypothesis (APSP Hypothesis)
  134. All Permutations
  135. All permutations
  136. Alman, Vassilevska Williams ( Matrix Multiplication)
  137. Almeida & Zeitoun (Cyclic Nontrivial SCCs DFA Minimization DFA Minimization)
  138. Almost Stable Marriage Problem
  139. Alon; Moshkovitz & Safra (Unweighted Set-Covering The Set-Covering Problem)
  140. Alon (st-Maximum Flow Maximum Flow)
  141. Alon and Kahale (3-Graph Coloring Graph Coloring)
  142. Alpha-HMM (Matsuyama, Yasuo) (Maximum Likelihood Methods in Unknown Latent Variables, Hidden Markov Models Maximum Likelihood Methods in Unknown Latent Variables)
  143. Alphabetic Tree Problem
  144. Alt, Blum, Mehlhorn, Paul (bipartite graph Maximum cardinality matching)
  145. Altschul and Erickson (Edit sequence, local alignment Sequence Alignment)
  146. Amir et al. (Sequence-to-Graph Alignment Sequence-to-Graph Alignment)
  147. Ananthakrishna (Entity Resolution Entity Resolution)
  148. Anderson–Björck algorithm (General Root Computation Root Computation)
  149. Andrew's algorithm (2-dimensional Convex Hull)
  150. Angelsmark, Jonsson (
  151. Any Eigenpair
  152. Any Eigenvalue
  153. Anytime Dynamic A* (ADA*) ( Informed Search)
  154. Anytime Repairing A* (ARA*) (Informed Search Informed Search)
  155. Ap-reach
  156. Apostolico and Guerra (Algorithm 2) (LCS Longest Common Subsequence)
  157. Apostolico and Guerra (HS1 Algorithm) (LCS Longest Common Subsequence)
  158. Apostolico–Giancarlo Algorithm (Single String Search String Search)
  159. Appel's algorithm 1968 ( Ray Tracing)
  160. Applegate et al. (Approximate TSP The Traveling-Salesman Problem)
  161. Approximate Betweenness Centrality
  162. Approximate Diameter
  163. Approximate Hard-Margin SVM
  164. Approximate MCOP
  165. Approximate MCSP
  166. Approximate OBST
  167. Approximate Reach Centrality
  168. Approximate TSP
  169. Arbitrator solution (Dining Philosophers Problem Deadlock Avoidance)
  170. Arithmetic Expression Binary Tree
  171. Asymptotically fast Toeplitz algorithms (Toeplitz Linear system of equations)
  172. Ausiello et al. (Maximum Cut, Approximate Maximum Cut)
  173. B.I. Kvasov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation)
  174. B. I. Kvasov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation)
  175. B. I. Kvasov 2000 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation)
  176. BCNF Decomposition
  177. BEN-CHEN M.; GOTSMAN C.; BUNIN G. 2008 (Mesh Parameterization Mesh Parameterization)
  178. BFS/DFS for connected components (
  179. BLAKE2 (Optional Key? One-Way Hash Functions)
  180. BOM (Backward Oracle Matching) (Single String Search String Search)
  181. BOYS algorithm (Entity Resolution Entity Resolution)
  182. BST Algorithm (Duplicate Elimination Duplicate Elimination)
  183. Babai & Codenotti (Hypergraphs isomorphism Graph Isomorphism Problem)
  184. Babai (Graph Isomorphism, Bounded Number of Vertices of Each Color Graph Isomorphism Problem)
  185. Babai ( Graph Isomorphism Problem)
  186. Babai 1980 (Graph Isomorphism, Bounded Vertex Valences Graph Isomorphism Problem)
  187. Babai 1980 (Graph Isomporhism, Trivalent Graphs Graph Isomorphism Problem)
  188. Babai and Luks (Graph Isomorphism, General Graphs Graph Isomorphism Problem)
  189. Baby-step Giant-step (Discrete Logarithm Over Finite Fields Logarithm Calculations)
  190. Backward Non-Deterministic DAWG Matching (BNDM) (Single String Search String Search)
  191. Bader & Cong Parallel Implementation (Undirected, General MST Minimum Spanning Tree (MST))
  192. Bailey TL; Elkan C MEME (Motif Search Motif Search)
  193. Bailey TL; Elkan C MEME ( Motif Search)
  194. Balaban. (Reporting all intersection points, generalized segments Line segment intersection)
  195. Balasubramanian; Fellows (The Vertex Cover Problem The Vertex Cover Problem)
  196. Banker's Algorithm (Deadlock Avoidance Deadlock avoidance)
  197. Bansal, Williams (Boolean Matrix Multiplication (Combinatorial) Matrix Product)
  198. Baran, Demaine, Patrascu (Integer 3SUM 3SUM)
  199. Bareiss Algorithm (Toeplitz Matrix Linear System)
  200. Bareiss algorithm (Determinant of Matrices with Integer Entries Determinant of Matrices with Integer Entries)
  201. Bareiss algorithm with fast multiplication (Determinant of Matrices with Integer Entries Determinant of Matrices with Integer Entries)
  202. Barghout; Lauren Visual Taxometric approach ( Image Segmentation)
  203. Barto;Bradtke; & Singhe; 1995; (POMDPs POMDPs)
  204. Barvinok (Geometric Maximum TSP The Traveling-Salesman Problem)
  205. Basic Local Alignment Search Tool (BLAST) (Edit Sequence, constant-size alphabet Sequence Alignment)
  206. Bayer, McCreight B-Tree ( Self-Balancing Trees Creation)
  207. Bayer, McCreight B-Tree ( Self-Balancing Trees Deletion)
  208. Bayer, McCreight B-Tree ( Self-Balancing Trees Insertion)
  209. Bayer, McCreight B-Tree ( Self-Balancing Trees Search)
  210. Bcrypt (Unkeyed Hash Functions One-Way Hash Functions)
  211. Bead Sort (Non-Comparison Sorting Sorting)
  212. Beigel & Eppstein (3-Graph Coloring Graph Coloring)
  213. Bellare Active Learning (Entity Resolution Entity Resolution)
  214. Bellman-Ford Algorithm
  215. Bellman Value Iteration (VI) (Optimal Policies for MDPs Optimal Policies for MDPs)
  216. Bellman dynamic programming algorithm (Subset Sum The Subset-Sum Problem)
  217. Bellman–Ford algorithm (Dantzig 1960) (Nonnegative Weights Shortest Path (Directed Graphs))
  218. Bellman–Ford algorithm (Ford 1956) (general weights Shortest Path (Directed Graphs))
  219. Bellman–Ford algorithm (Shimbel 1955; Bellman 1958; Moore 1959) (general weights Shortest Path (Directed Graphs))
  220. Belloch (2-Dimensional Delaunay Triangulation Delaunay Triangulation)
  221. Bentley-Ottmann Algorithm
  222. Bentley; Shamos (k-dimensional space, l m (or l infty) norm Closest Pair Problem)
  223. Bentley (2-dimensional Maximum subarray problem)
  224. Bentley (k-dimensional space, l m (or l infty) norm Closest Pair Problem)
  225. Bentley–Ottmann algorithm (Reporting all intersection points, line segments Line segment intersection)
  226. Berger & Müller-Hannemann (DAG Realization Problem Graph Realization Problems)
  227. Bergland; Glenn radix-8 algorithm (Discrete Fourier Transform Discrete Fourier Transform)
  228. Berkman; Vishkin (Lowest Common Ancestor with Static Trees Lowest Common Ancestor)
  229. Berlekamp's algorithm (Distinct-degree; Equal-degree Factorization of Polynomials Over Finite Fields)
  230. Berlekamp–Massey algorithm (Cryptanalysis of Linear Feedback Shift Registers Cryptanalysis of Linear Feedback Shift Registers)
  231. Bern; Gilbert; Hendrickson (Inexact Laplacian Solver SDD Systems Solvers)
  232. Bertsekas & Castanon; 1999; (POMDPs POMDPs)
  233. Betweenness Centrality
  234. Bichromatic Hamming Close Pair
  235. Bidirectional A* Algorithm (Informed Search Informed Search)
  236. Bijaoui and Rué ( Image Segmentation)
  237. Binary GCD algorithm (Greatest Common Divisor Greatest Common Divisor)
  238. Binary representation search with matrix multiplication (Unweighted Graph Diameter)
  239. Binary space partitioning (BSP) ( Shown Surface Determination)
  240. Bini's algorithm (Matrix Multiplication Matrix Product)
  241. BioInformatics
  242. Bipartite Graph MCM
  243. Bipartite Maximum-Weight Matching
  244. Bird (1D Maximum Subarray Maximum Subarray Problem)
  245. Bisection method (Any eigenvalue Eigenvalues (Iterative Methods))
  246. Bisection method (General Root Computation Root Computation)
  247. Bisection method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations)
  248. Bitap algorithm (Single String Search String Search)
  249. Bitonic Merge Sort Parallel Implementation (Comparison Sorting Sorting)
  250. Bjorck-Pereyra (Vandermonde Matrix Linear System)

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

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