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 #101 to #200.
View (previous 100 | next 100) (20 | 50 | 100 | 250 | 500)
- 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)
- Bisection method (Any eigenvalue Eigenvalues (Iterative Methods))
- Bisection method (General Root Computation Root Computation)
- Bisection method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations)
- Bitap algorithm (Single String Search String Search)
- Bitonic Merge Sort Parallel Implementation (Comparison Sorting Sorting)
- Bjorck-Pereyra (Vandermonde Matrix Linear System)
- Bjorck (2-D Polynomial Interpolation Polynomial Interpolation)
- Bjorklund, Husfeldt, Proposition 2 ( 5 - Graph Coloring)
- Bjorklund, Husfeldt, Proposition 2 ( 6 - Graph Coloring)
- Bjorklund, Husfeldt, Proposition 2 ( Chromatic Number)
- Bjorklund, Husfeldt, Proposition 3 ( Chromatic Polynomial)
- Bjorklund, Husfeldt, Theorem 1 ( 5 - Graph Coloring)
- Bjorklund, Husfeldt, Theorem 1 ( 6 - Graph Coloring)
- Bjorklund, Husfeldt, Theorem 1 ( Chromatic Number)
- Blakley's scheme ( Secret Sharing)
- Blelloch; Koutis; Miller; Tangwongsan (Inexact Laplacian Solver SDD Systems Solvers)
- Blinn and Newell (Environment Mapping Texture Mapping)
- Blinn–Phong (Specular Reflection Texture Mapping)
- Block A* (Informed Search Informed Search)
- Blossom Algorithm (general graph Maximum cardinality matching)
- Blowfish (Block Ciphers Block Ciphers)
- Blum, Shelton, Koller (Graphical games, Multi-agent influence diagrams Nash Equilibria)
- Blum (General Graph MCM Maximum Cardinality Matching)
- Bodlaender (Partial k-trees Graph Isomorphism Problem)
- Boissonnat; Snoeyink (Reporting all intersection points, generalized segments Line segment intersection)
- Boman; Chen; Hendrickson; Toledo (Inexact Laplacian Solver SDD Systems Solvers)
- Boman; Hendrickson (Inexact Laplacian Solver SDD Systems Solvers)
- Borůvka's algorithm (Undirected, General MST Minimum Spanning Tree (MST))
- Bottom-m sketches streaming algorithm (streaming Cardinality Estimation)
- Bowyer–Watson algorithm (2-Dimensional Delaunay Triangulation Delaunay Triangulation)
- Bowyer–Watson algorithm (Voronoi Diagrams Voronoi Diagrams)
- Boyer-Moore-Horspool (BMH) (Single String Search String Search)
- Boyer-Moore (BM) algorithm (Single String Search String Search)
- Branch and bound (Cyclic Peptide Sequencing Problem Cyclic Peptide Sequencing Problem)
- Brand et al ( Maximum Flow)
- Brandes (Unweighted Betweenness Centrality (BC))
- Brandes (Weighted Betweenness Centrality (BC))
- Braziunas & Boutilier; 2004; (POMDPs POMDPs)
- Brent's algorithm ( Cycle Detection)
- Brent-Dekker Method (General Root Computation Root Computation)
- Bresenham's line algorithm (Line Drawing Line Drawing)
- Bresenham Algorithm (Rasterization Rasterization)
- Briggs; Henson; McCormick ( SDD Systems Solvers)
- Bringman (Subset Sum The Subset-Sum Problem)
- Bron–Kerbosch algorithm (Enumerating Maximal Cliques, arbitrary graph Clique Problems)
- Brute-force search (3-Graph Coloring Graph Coloring)
- Brute Force (1D Maximum Subarray Maximum Subarray Problem)
- Brute Force (2-dimensional Convex Hull)
- Brute Force (Change-Making Problem Change-Making Problem)
- Brute Force (Matrix Chain Ordering Problem Matrix Chain Multiplication)