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 100 results in range #51 to #150.
View (previous 100 | next 100) (20 | 50 | 100 | 250 | 500)
- Aging (Online Page Replacements)
- Aho, Garey & Ullman (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem)
- Aho, Hopcroft, and Ullman (Linking) (Lowest Common Ancestor with Linking Lowest Common Ancestor)
- Aho, Hopcroft, and Ullman (Offline) (Off-Line Lowest Common Ancestor Lowest Common Ancestor)
- Aho, Hopcroft, and Ullman (Static Trees) (Lowest Common Ancestor with Static Trees Lowest Common Ancestor)
- Aho–Corasick (AC) Algorithm (Multiple String Search String Search)
- Ahuja & Orlin ( Maximum Flow)
- Ahuja et al. ( Maximum Flow)
- Akkoyunlu; E. A. (Enumerating Maximal Cliques, arbitrary graph Clique Problems)
- Alberto Sanfeliu and King-Sun Fu ( Graph Edit Distance Computation)
- All-pairs shortest paths (Undirected)
- All permutations
- Alman, Vassilevska Williams ( Matrix Multiplication)
- Almeida & Zeitoun (Cyclic Nontrivial SCCs DFA Minimization DFA Minimization)
- Alon; Moshkovitz & Safra (Unweighted Set-Covering The Set-Covering Problem)
- Alon (st-Maximum Flow Maximum Flow)
- Alon and Kahale (3-Graph Coloring Graph Coloring)
- Alpha-HMM (Matsuyama, Yasuo) (Maximum Likelihood Methods in Unknown Latent Variables, Hidden Markov Models Maximum Likelihood Methods in Unknown Latent Variables)
- Alt, Blum, Mehlhorn, Paul (bipartite graph Maximum cardinality matching)
- Altschul and Erickson (Edit sequence, local alignment Sequence Alignment)
- Amir et al. (Sequence-to-Graph Alignment Sequence-to-Graph Alignment)
- Ananthakrishna (Entity Resolution Entity Resolution)
- Anderson–Björck algorithm (General Root Computation Root Computation)
- Andrew's algorithm (2-dimensional Convex Hull)
- Angelsmark, Jonsson (
- Anytime Dynamic A* (ADA*) ( Informed Search)
- Anytime Repairing A* (ARA*) (Informed Search Informed Search)
- Apostolico and Guerra (Algorithm 2) (LCS Longest Common Subsequence)
- Apostolico and Guerra (HS1 Algorithm) (LCS Longest Common Subsequence)
- Apostolico–Giancarlo Algorithm (Single String Search String Search)
- Appel's algorithm 1968 ( Ray Tracing)
- Applegate et al. (Approximate TSP The Traveling-Salesman Problem)
- Arbitrator solution (Dining Philosophers Problem Deadlock Avoidance)
- Asymptotically fast Toeplitz algorithms (Toeplitz Linear system of equations)
- Ausiello et al. (Maximum Cut, Approximate Maximum Cut)
- B.I. Kvasov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation)
- B. I. Kvasov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation)
- B. I. Kvasov 2000 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation)
- BEN-CHEN M.; GOTSMAN C.; BUNIN G. 2008 (Mesh Parameterization Mesh Parameterization)
- BFS/DFS for connected components (
- BLAKE2 (Optional Key? One-Way Hash Functions)
- BOM (Backward Oracle Matching) (Single String Search String Search)
- BOYS algorithm (Entity Resolution Entity Resolution)
- BST Algorithm (Duplicate Elimination Duplicate Elimination)
- Babai & Codenotti (Hypergraphs isomorphism Graph Isomorphism Problem)
- Babai (Graph Isomorphism, Bounded Number of Vertices of Each Color Graph Isomorphism Problem)
- Babai ( Graph Isomorphism Problem)
- Babai 1980 (Graph Isomorphism, Bounded Vertex Valences Graph Isomorphism Problem)
- Babai 1980 (Graph Isomporhism, Trivalent Graphs Graph Isomorphism Problem)
- Babai and Luks (Graph Isomorphism, General Graphs Graph Isomorphism Problem)
- Baby-step Giant-step (Discrete Logarithm Over Finite Fields Logarithm Calculations)
- Backward Non-Deterministic DAWG Matching (BNDM) (Single String Search String Search)
- Bader & Cong Parallel Implementation (Undirected, General MST Minimum Spanning Tree (MST))
- Bailey TL; Elkan C MEME (Motif Search Motif Search)
- Bailey TL; Elkan C MEME ( Motif Search)
- Balaban. (Reporting all intersection points, generalized segments Line segment intersection)
- Balasubramanian; Fellows (The Vertex Cover Problem The Vertex Cover Problem)
- Banker's Algorithm (Deadlock Avoidance Deadlock avoidance)
- Bansal, Williams (Boolean Matrix Multiplication (Combinatorial) Matrix Product)
- Baran, Demaine, Patrascu (Integer 3SUM 3SUM)
- Bareiss Algorithm (Toeplitz Matrix Linear System)
- Bareiss algorithm (Determinant of Matrices with Integer Entries Determinant of Matrices with Integer Entries)
- Bareiss algorithm with fast multiplication (Determinant of Matrices with Integer Entries Determinant of Matrices with Integer Entries)
- Barghout; Lauren Visual Taxometric approach ( Image Segmentation)
- Barto;Bradtke; & Singhe; 1995; (POMDPs POMDPs)
- Barvinok (Geometric Maximum TSP The Traveling-Salesman Problem)
- Basic Local Alignment Search Tool (BLAST) (Edit Sequence, constant-size alphabet Sequence Alignment)
- Bayer, McCreight B-Tree ( Self-Balancing Trees Creation)
- Bayer, McCreight B-Tree ( Self-Balancing Trees Deletion)
- Bayer, McCreight B-Tree ( Self-Balancing Trees Insertion)
- Bayer, McCreight B-Tree ( Self-Balancing Trees Search)
- Bcrypt (Unkeyed Hash Functions One-Way Hash Functions)
- Bead Sort (Non-Comparison Sorting Sorting)
- Beigel & Eppstein (3-Graph Coloring Graph Coloring)
- Bellare Active Learning (Entity Resolution Entity Resolution)
- Bellman Value Iteration (VI) (Optimal Policies for MDPs Optimal Policies for MDPs)
- Bellman dynamic programming algorithm (Subset Sum The Subset-Sum Problem)
- Bellman–Ford algorithm (Dantzig 1960) (Nonnegative Weights Shortest Path (Directed Graphs))
- Bellman–Ford algorithm (Ford 1956) (general weights Shortest Path (Directed Graphs))
- Bellman–Ford algorithm (Shimbel 1955; Bellman 1958; Moore 1959) (general weights Shortest Path (Directed Graphs))
- Belloch (2-Dimensional Delaunay Triangulation Delaunay Triangulation)
- Bentley; Shamos (k-dimensional space, l m (or l infty) norm Closest Pair Problem)
- Bentley (2-dimensional Maximum subarray problem)
- Bentley (k-dimensional space, l m (or l infty) norm Closest Pair Problem)
- Bentley–Ottmann algorithm (Reporting all intersection points, line segments Line segment intersection)
- Berger & Müller-Hannemann (DAG Realization Problem Graph Realization Problems)
- Bergland; Glenn radix-8 algorithm (Discrete Fourier Transform Discrete Fourier Transform)
- Berkman; Vishkin (Lowest Common Ancestor with Static Trees Lowest Common Ancestor)
- Berlekamp's algorithm (Distinct-degree; Equal-degree Factorization of Polynomials Over Finite Fields)
- Berlekamp–Massey algorithm (Cryptanalysis of Linear Feedback Shift Registers Cryptanalysis of Linear Feedback Shift Registers)
- Bern; Gilbert; Hendrickson (Inexact Laplacian Solver SDD Systems Solvers)
- Bertsekas & Castanon; 1999; (POMDPs POMDPs)
- Bidirectional A* Algorithm (Informed Search Informed Search)
- Bijaoui and Rué ( Image Segmentation)
- Binary GCD algorithm (Greatest Common Divisor Greatest Common Divisor)
- Binary representation search with matrix multiplication (Unweighted Graph Diameter)
- Binary space partitioning (BSP) ( Shown Surface Determination)
- Bini's algorithm (Matrix Multiplication Matrix Product)
- BioInformatics
- Bird (1D Maximum Subarray Maximum Subarray Problem)