Dead-end pages

Jump to navigation Jump to search

The following pages do not link to other pages in Algorithm Wiki.

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

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

  1. $O(n\log n)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling)
  2. $O(n^2)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling)
  3. $O(n^3)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling)
  4. (Boolean Matrix Multiplication (Combinatorial) Matrix Product)
  5. ( Negative Triangle)
  6. (many more...) (2-dimensional Convex Hull, Dynamic Convex Hull)
  7. 3 - Graph Coloring
  8. 4NF decomposition
  9. 4 - Graph Coloring
  10. 5-point ADI iteration (2-Dimensional Poisson Problem Poisson Problem)
  11. 5-point ADI iteration (3-Dimensional Poisson Problem Poisson Problem)
  12. 5-point FFT (2-Dimensional Poisson Problem Poisson Problem)
  13. 5-point FFT (3-Dimensional Poisson Problem Poisson Problem)
  14. 5-point Gauss Seidel iteration (2-Dimensional Poisson Problem Poisson Problem)
  15. 5-point Gauss Seidel iteration (3-Dimensional Poisson Problem Poisson Problem)
  16. 5-point Gauss elimination (2-Dimensional Poisson Problem Poisson Problem)
  17. 5-point Gauss elimination (3-Dimensional Poisson Problem Poisson Problem)
  18. 5-point SOR iteration (2-Dimensional Poisson Problem Poisson Problem)
  19. 5-point SOR iteration (3-Dimensional Poisson Problem Poisson Problem)
  20. 5-point cyclic reduction (2-Dimensional Poisson Problem Poisson Problem)
  21. 5-point cyclic reduction (3-Dimensional Poisson Problem Poisson Problem)
  22. 5-point star Cramer's rule (2-Dimensional Poisson Problem Poisson Problem)
  23. 5-point star Cramer's rule (3-Dimensional Poisson Problem Poisson Problem)
  24. 9-point ADI iteration (2-Dimensional Poisson Problem Poisson Problem)
  25. 9-point ADI iteration (3-Dimensional Poisson Problem Poisson Problem)
  26. 9-point ADI iteration + smooth guess (2-Dimensional Poisson Problem Poisson Problem)
  27. 9-point ADI iteration + smooth guess (3-Dimensional Poisson Problem Poisson Problem)
  28. 9-point FFT (2-Dimensional Poisson Problem Poisson Problem)
  29. 9-point FFT (3-Dimensional Poisson Problem Poisson Problem)
  30. 9-point SOR iteration (2-Dimensional Poisson Problem Poisson Problem)
  31. 9-point SOR iteration (3-Dimensional Poisson Problem Poisson Problem)
  32. 9-point Tensor product (2-Dimensional Poisson Problem Poisson Problem)
  33. 9-point Tensor product (3-Dimensional Poisson Problem Poisson Problem)
  34. A* Algorithm (Informed Search Informed Search)
  35. A-Priori algorithm (Finding Frequent Itemsets Finding Frequent Itemsets)
  36. A. Baumberg. 2000 (Blob Detection Feature Detection)
  37. A. Chalmers; T. Davis; and E. Reinhard 2002 ( Ray Tracing)
  38. APSP algorithm (3-Clique Min-Weight k-Clique Problem)
  39. ARIES (Steal, No-Force Recovery)
  40. ASP (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems)
  41. AVL Tree ( Self-Balancing Trees Creation)
  42. AVL Tree ( Self-Balancing Trees Deletion)
  43. AVL Tree ( Self-Balancing Trees Insertion)
  44. AVL Tree ( Self-Balancing Trees Search)
  45. Aasen's method (Non-Definite, Symmetric Matrix Linear System)
  46. Abboud, Williams, Yu (OV Orthogonal Vectors)
  47. About Algorithm-Wiki
  48. Achlioptas (Link Analysis Link Analysis)
  49. Adaptive Duplicate Detection Algorithm (ADD) (Duplicate Elimination Duplicate Elimination)
  50. Affine scaling ( Linear Programming)
  51. Aging (Online Page Replacements)
  52. Aho, Garey & Ullman (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem)
  53. Aho, Hopcroft, and Ullman (Linking) (Lowest Common Ancestor with Linking Lowest Common Ancestor)
  54. Aho, Hopcroft, and Ullman (Offline) (Off-Line Lowest Common Ancestor Lowest Common Ancestor)
  55. Aho, Hopcroft, and Ullman (Static Trees) (Lowest Common Ancestor with Static Trees Lowest Common Ancestor)
  56. Aho–Corasick (AC) Algorithm (Multiple String Search String Search)
  57. Ahuja & Orlin ( Maximum Flow)
  58. Ahuja et al. ( Maximum Flow)
  59. Akkoyunlu; E. A. (Enumerating Maximal Cliques, arbitrary graph Clique Problems)
  60. Alberto Sanfeliu and King-Sun Fu ( Graph Edit Distance Computation)
  61. All-pairs shortest paths (Undirected)
  62. All permutations
  63. Alman, Vassilevska Williams ( Matrix Multiplication)
  64. Almeida & Zeitoun (Cyclic Nontrivial SCCs DFA Minimization DFA Minimization)
  65. Alon; Moshkovitz & Safra (Unweighted Set-Covering The Set-Covering Problem)
  66. Alon (st-Maximum Flow Maximum Flow)
  67. Alon and Kahale (3-Graph Coloring Graph Coloring)
  68. Alpha-HMM (Matsuyama, Yasuo) (Maximum Likelihood Methods in Unknown Latent Variables, Hidden Markov Models Maximum Likelihood Methods in Unknown Latent Variables)
  69. Alt, Blum, Mehlhorn, Paul (bipartite graph Maximum cardinality matching)
  70. Altschul and Erickson (Edit sequence, local alignment Sequence Alignment)
  71. Amir et al. (Sequence-to-Graph Alignment Sequence-to-Graph Alignment)
  72. Ananthakrishna (Entity Resolution Entity Resolution)
  73. Anderson–Björck algorithm (General Root Computation Root Computation)
  74. Andrew's algorithm (2-dimensional Convex Hull)
  75. Angelsmark, Jonsson (
  76. Anytime Dynamic A* (ADA*) ( Informed Search)
  77. Anytime Repairing A* (ARA*) (Informed Search Informed Search)
  78. Apostolico and Guerra (Algorithm 2) (LCS Longest Common Subsequence)
  79. Apostolico and Guerra (HS1 Algorithm) (LCS Longest Common Subsequence)
  80. Apostolico–Giancarlo Algorithm (Single String Search String Search)
  81. Appel's algorithm 1968 ( Ray Tracing)
  82. Applegate et al. (Approximate TSP The Traveling-Salesman Problem)
  83. Arbitrator solution (Dining Philosophers Problem Deadlock Avoidance)
  84. Asymptotically fast Toeplitz algorithms (Toeplitz Linear system of equations)
  85. Ausiello et al. (Maximum Cut, Approximate Maximum Cut)
  86. B.I. Kvasov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation)
  87. B. I. Kvasov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation)
  88. B. I. Kvasov 2000 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation)
  89. BEN-CHEN M.; GOTSMAN C.; BUNIN G. 2008 (Mesh Parameterization Mesh Parameterization)
  90. BFS/DFS for connected components (
  91. BLAKE2 (Optional Key? One-Way Hash Functions)
  92. BOM (Backward Oracle Matching) (Single String Search String Search)
  93. BOYS algorithm (Entity Resolution Entity Resolution)
  94. BST Algorithm (Duplicate Elimination Duplicate Elimination)
  95. Babai & Codenotti (Hypergraphs isomorphism Graph Isomorphism Problem)
  96. Babai (Graph Isomorphism, Bounded Number of Vertices of Each Color Graph Isomorphism Problem)
  97. Babai ( Graph Isomorphism Problem)
  98. Babai 1980 (Graph Isomorphism, Bounded Vertex Valences Graph Isomorphism Problem)
  99. Babai 1980 (Graph Isomporhism, Trivalent Graphs Graph Isomorphism Problem)
  100. Babai and Luks (Graph Isomorphism, General Graphs Graph Isomorphism Problem)
  101. Baby-step Giant-step (Discrete Logarithm Over Finite Fields Logarithm Calculations)
  102. Backward Non-Deterministic DAWG Matching (BNDM) (Single String Search String Search)
  103. Bader & Cong Parallel Implementation (Undirected, General MST Minimum Spanning Tree (MST))
  104. Bailey TL; Elkan C MEME (Motif Search Motif Search)
  105. Bailey TL; Elkan C MEME ( Motif Search)
  106. Balaban. (Reporting all intersection points, generalized segments Line segment intersection)
  107. Balasubramanian; Fellows (The Vertex Cover Problem The Vertex Cover Problem)
  108. Banker's Algorithm (Deadlock Avoidance Deadlock avoidance)
  109. Bansal, Williams (Boolean Matrix Multiplication (Combinatorial) Matrix Product)
  110. Baran, Demaine, Patrascu (Integer 3SUM 3SUM)
  111. Bareiss Algorithm (Toeplitz Matrix Linear System)
  112. Bareiss algorithm (Determinant of Matrices with Integer Entries Determinant of Matrices with Integer Entries)
  113. Bareiss algorithm with fast multiplication (Determinant of Matrices with Integer Entries Determinant of Matrices with Integer Entries)
  114. Barghout; Lauren Visual Taxometric approach ( Image Segmentation)
  115. Barto;Bradtke; & Singhe; 1995; (POMDPs POMDPs)
  116. Barvinok (Geometric Maximum TSP The Traveling-Salesman Problem)
  117. Basic Local Alignment Search Tool (BLAST) (Edit Sequence, constant-size alphabet Sequence Alignment)
  118. Bayer, McCreight B-Tree ( Self-Balancing Trees Creation)
  119. Bayer, McCreight B-Tree ( Self-Balancing Trees Deletion)
  120. Bayer, McCreight B-Tree ( Self-Balancing Trees Insertion)
  121. Bayer, McCreight B-Tree ( Self-Balancing Trees Search)
  122. Bcrypt (Unkeyed Hash Functions One-Way Hash Functions)
  123. Bead Sort (Non-Comparison Sorting Sorting)
  124. Beigel & Eppstein (3-Graph Coloring Graph Coloring)
  125. Bellare Active Learning (Entity Resolution Entity Resolution)
  126. Bellman Value Iteration (VI) (Optimal Policies for MDPs Optimal Policies for MDPs)
  127. Bellman dynamic programming algorithm (Subset Sum The Subset-Sum Problem)
  128. Bellman–Ford algorithm (Dantzig 1960) (Nonnegative Weights Shortest Path (Directed Graphs))
  129. Bellman–Ford algorithm (Ford 1956) (general weights Shortest Path (Directed Graphs))
  130. Bellman–Ford algorithm (Shimbel 1955; Bellman 1958; Moore 1959) (general weights Shortest Path (Directed Graphs))
  131. Belloch (2-Dimensional Delaunay Triangulation Delaunay Triangulation)
  132. Bentley; Shamos (k-dimensional space, l m (or l infty) norm Closest Pair Problem)
  133. Bentley (2-dimensional Maximum subarray problem)
  134. Bentley (k-dimensional space, l m (or l infty) norm Closest Pair Problem)
  135. Bentley–Ottmann algorithm (Reporting all intersection points, line segments Line segment intersection)
  136. Berger & Müller-Hannemann (DAG Realization Problem Graph Realization Problems)
  137. Bergland; Glenn radix-8 algorithm (Discrete Fourier Transform Discrete Fourier Transform)
  138. Berkman; Vishkin (Lowest Common Ancestor with Static Trees Lowest Common Ancestor)
  139. Berlekamp's algorithm (Distinct-degree; Equal-degree Factorization of Polynomials Over Finite Fields)
  140. Berlekamp–Massey algorithm (Cryptanalysis of Linear Feedback Shift Registers Cryptanalysis of Linear Feedback Shift Registers)
  141. Bern; Gilbert; Hendrickson (Inexact Laplacian Solver SDD Systems Solvers)
  142. Bertsekas & Castanon; 1999; (POMDPs POMDPs)
  143. Bidirectional A* Algorithm (Informed Search Informed Search)
  144. Bijaoui and Rué ( Image Segmentation)
  145. Binary GCD algorithm (Greatest Common Divisor Greatest Common Divisor)
  146. Binary representation search with matrix multiplication (Unweighted Graph Diameter)
  147. Binary space partitioning (BSP) ( Shown Surface Determination)
  148. Bini's algorithm (Matrix Multiplication Matrix Product)
  149. BioInformatics
  150. Bird (1D Maximum Subarray Maximum Subarray Problem)
  151. Bisection method (Any eigenvalue Eigenvalues (Iterative Methods))
  152. Bisection method (General Root Computation Root Computation)
  153. Bisection method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations)
  154. Bitap algorithm (Single String Search String Search)
  155. Bitonic Merge Sort Parallel Implementation (Comparison Sorting Sorting)
  156. Bjorck-Pereyra (Vandermonde Matrix Linear System)
  157. Bjorck (2-D Polynomial Interpolation Polynomial Interpolation)
  158. Bjorklund, Husfeldt, Proposition 2 ( 5 - Graph Coloring)
  159. Bjorklund, Husfeldt, Proposition 2 ( 6 - Graph Coloring)
  160. Bjorklund, Husfeldt, Proposition 2 ( Chromatic Number)
  161. Bjorklund, Husfeldt, Proposition 3 ( Chromatic Polynomial)
  162. Bjorklund, Husfeldt, Theorem 1 ( 5 - Graph Coloring)
  163. Bjorklund, Husfeldt, Theorem 1 ( 6 - Graph Coloring)
  164. Bjorklund, Husfeldt, Theorem 1 ( Chromatic Number)
  165. Blakley's scheme ( Secret Sharing)
  166. Blelloch; Koutis; Miller; Tangwongsan (Inexact Laplacian Solver SDD Systems Solvers)
  167. Blinn and Newell (Environment Mapping Texture Mapping)
  168. Blinn–Phong (Specular Reflection Texture Mapping)
  169. Block A* (Informed Search Informed Search)
  170. Blossom Algorithm (general graph Maximum cardinality matching)
  171. Blowfish (Block Ciphers Block Ciphers)
  172. Blum, Shelton, Koller (Graphical games, Multi-agent influence diagrams Nash Equilibria)
  173. Blum (General Graph MCM Maximum Cardinality Matching)
  174. Bodlaender (Partial k-trees Graph Isomorphism Problem)
  175. Boissonnat; Snoeyink (Reporting all intersection points, generalized segments Line segment intersection)
  176. Boman; Chen; Hendrickson; Toledo (Inexact Laplacian Solver SDD Systems Solvers)
  177. Boman; Hendrickson (Inexact Laplacian Solver SDD Systems Solvers)
  178. Borůvka's algorithm (Undirected, General MST Minimum Spanning Tree (MST))
  179. Bottom-m sketches streaming algorithm (streaming Cardinality Estimation)
  180. Bowyer–Watson algorithm (2-Dimensional Delaunay Triangulation Delaunay Triangulation)
  181. Bowyer–Watson algorithm (Voronoi Diagrams Voronoi Diagrams)
  182. Boyer-Moore-Horspool (BMH) (Single String Search String Search)
  183. Boyer-Moore (BM) algorithm (Single String Search String Search)
  184. Branch and bound (Cyclic Peptide Sequencing Problem Cyclic Peptide Sequencing Problem)
  185. Brand et al ( Maximum Flow)
  186. Brandes (Unweighted Betweenness Centrality (BC))
  187. Brandes (Weighted Betweenness Centrality (BC))
  188. Braziunas & Boutilier; 2004; (POMDPs POMDPs)
  189. Brent's algorithm ( Cycle Detection)
  190. Brent-Dekker Method (General Root Computation Root Computation)
  191. Bresenham's line algorithm (Line Drawing Line Drawing)
  192. Bresenham Algorithm (Rasterization Rasterization)
  193. Briggs; Henson; McCormick ( SDD Systems Solvers)
  194. Bringman (Subset Sum The Subset-Sum Problem)
  195. Bron–Kerbosch algorithm (Enumerating Maximal Cliques, arbitrary graph Clique Problems)
  196. Brute-force search (3-Graph Coloring Graph Coloring)
  197. Brute Force (1D Maximum Subarray Maximum Subarray Problem)
  198. Brute Force (2-dimensional Convex Hull)
  199. Brute Force (Change-Making Problem Change-Making Problem)
  200. Brute Force (Matrix Chain Ordering Problem Matrix Chain Multiplication)
  201. Brute Force (Rod-Cutting Problem Rod-Cutting Problem)
  202. Brute force (2-dimensional Maximum subarray problem)
  203. Brute force (4-Graph Coloring Graph Coloring)
  204. Brute force (Cyclic Peptide Sequencing Problem Cyclic Peptide Sequencing Problem)
  205. Brute force (Lossy Compression Data Compression)
  206. Brute force ( The Set-Covering Problem)
  207. Brute force (backtracking search) (The Vertex Cover Problem The Vertex Cover Problem)
  208. Brute force algorithm (Functional Dependency Inference Problem Dependency Inference Problem)
  209. Brute force algorithm (Weighted Activity Selection Problem Interval Scheduling)
  210. Brute force enumeration (k-Clique k-Clique Problem)
  211. Bruun's FFT algorithm (Discrete Fourier Transform Discrete Fourier Transform)
  212. Brzozowski's algorithm (DFA Minimization DFA Minimization)
  213. Brélaz (DSatur) (3-Graph Coloring Graph Coloring)
  214. Bubble Sort (Comparison Sorting Sorting)
  215. Buchberger's algorithm (Gröbner Bases Gröbner Bases)
  216. Bucket Sort (Non-Comparison Sorting Sorting)
  217. Bunch; Hopcroft (Square Matrix LU Decomposition LU Decomposition)
  218. Burst Sort (Non-Comparison Sorting Sorting)
  219. Byskov, Theorem 14 ( 6 - Graph Coloring)
  220. Byskov, Theorem 20 ( 6 - Graph Coloring)
  221. Byskov (4-Graph Coloring Graph Coloring)
  222. Byskov ( 5 - Graph Coloring)
  223. Byskov ( Chromatic Number)
  224. C-LOOK (Disk Scheduling Disk Scheduling)
  225. C-SCAN (Disk Scheduling Disk Scheduling)
  226. CHAZELLE (Reporting all intersection points, line segments Line segment intersection)
  227. CHAZELLE 1986 (Counting number of intersection points / line segments Line segment intersection)
  228. CHEN Z. G.; LIU L. G.; ZHANG Z. Y.; WANG G. J. 2007 (Mesh Parameterization Mesh Parameterization)
  229. CH Algorithm (SCCs Strongly Connected Components)
  230. CNN Based Gatys; Leon A 2001 (Texture Synthesis Texture Synthesis)
  231. Cabral; B.; Max; N.; and Springmeyer; R 1990 (Diffuse Reflection Texture Mapping)
  232. Calvetti, Reichel (2-D Polynomial Interpolation Polynomial Interpolation)
  233. Cantor–Zassenhaus algorithm (Equal-degree Factorization of Polynomials Over Finite Fields)
  234. Cardoso; Nuno; Abreu; Rui ( The Set-Covering Problem)
  235. Catriel Beeri Ronald Fagin John H. Howard (Multivalued Dependency Inference Problem Dependency Inference Problem)
  236. Census (Motif Search Motif Search)
  237. Chaitin's Algorithm (Global Register Allocation Register Allocation)
  238. Chan's algorithm (2-dimensional; 3-dimensional Convex Hull)
  239. Chan's algorithm Parallel Implementation ( Variance Calculations)
  240. Chan, Williams (OV Orthogonal Vectors)
  241. Chan-Singhal-Liu ( Mutual Exclusion)
  242. Chan (APSP on Dense Directed Graphs with Arbitrary Weights; APSP on Dense Undirected Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP))
  243. Chan (Boolean Matrix Multiplication (Combinatorial) Matrix Product)
  244. Chan (Geometrically Weighted) (APSP on Geometrically Weighted Graphs All-Pairs Shortest Paths (APSP))
  245. Chan (Real 3SUM 3SUM)
  246. Chand-Kapur, Gift Wrapping (d-dimensional Convex Hull Convex Hull)
  247. Chandra (Approximate MCOP Matrix Chain Multiplication)
  248. Chandran and F. Grandoni (The Vertex Cover Problem The Vertex Cover Problem)
  249. Chandran and Hochbaum (Bipartite Graph MCM Maximum Cardinality Matching)
  250. Chazelle's algorithm (Undirected, General MST Minimum Spanning Tree (MST))

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

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