Pages with the fewest revisions
Jump to navigation
Jump to search
Showing below up to 100 results in range #51 to #150.
View (previous 100 | next 100) (20 | 50 | 100 | 250 | 500)
- Brandes (Unweighted Betweenness Centrality (BC)) (1 revision)
- Bron–Kerbosch Algorithm (1 revision)
- Brandes (Weighted Betweenness Centrality (BC)) (1 revision)
- Bead Sort (Non-Comparison Sorting Sorting) (1 revision)
- Bresenham Algorithm (Rasterization Rasterization) (1 revision)
- Brute Force (2-dimensional Convex Hull) (1 revision)
- Brute Force (Change-Making Problem Change-Making Problem) (1 revision)
- Brute force ( The Set-Covering Problem) (1 revision)
- Brute force (4-Graph Coloring Graph Coloring) (1 revision)
- Bruun's FFT Algorithm (1 revision)
- 5-point Gauss elimination (2-Dimensional Poisson Problem Poisson Problem) (1 revision)
- 5-point Gauss elimination (3-Dimensional Poisson Problem Poisson Problem) (1 revision)
- Burst Sort (Non-Comparison Sorting Sorting) (1 revision)
- Bertsekas & Castanon; 1999; (POMDPs POMDPs) (1 revision)
- Berger & Müller-Hannemann (DAG Realization Problem Graph Realization Problems) (1 revision)
- Binary GCD algorithm (Greatest Common Divisor Greatest Common Divisor) (1 revision)
- 5-point star Cramer's rule (2-Dimensional Poisson Problem Poisson Problem) (1 revision)
- 5-point star Cramer's rule (3-Dimensional Poisson Problem Poisson Problem) (1 revision)
- Bini's algorithm (Matrix Multiplication Matrix Product) (1 revision)
- Bisection method (General Root Computation Root Computation) (1 revision)
- BioInformatics (1 revision)
- Bjorklund, Husfeldt, Proposition 2 ( 6 - Graph Coloring) (1 revision)
- Bjorklund, Husfeldt, Proposition 2 ( 5 - Graph Coloring) (1 revision)
- Bjorklund, Husfeldt, Proposition 2 ( Chromatic Number) (1 revision)
- 9-point SOR iteration (2-Dimensional Poisson Problem Poisson Problem) (1 revision)
- 9-point SOR iteration (3-Dimensional Poisson Problem Poisson Problem) (1 revision)
- 9-point Tensor product (2-Dimensional Poisson Problem Poisson Problem) (1 revision)
- 9-point Tensor product (3-Dimensional Poisson Problem Poisson Problem) (1 revision)
- Bjorklund, Husfeldt, Theorem 1 ( 6 - Graph Coloring) (1 revision)
- A* Algorithm (Informed Search Informed Search) (1 revision)
- Blakley's scheme ( Secret Sharing) (1 revision)
- A-Priori algorithm (Finding Frequent Itemsets Finding Frequent Itemsets) (1 revision)
- A. Baumberg. 2000 (Blob Detection Feature Detection) (1 revision)
- A. Chalmers; T. Davis; and E. Reinhard 2002 ( Ray Tracing) (1 revision)
- Blinn and Newell (Environment Mapping Texture Mapping) (1 revision)
- Applegate et al. (Approximate TSP The Traveling-Salesman Problem) (1 revision)
- APSP algorithm (3-Clique Min-Weight k-Clique Problem) (1 revision)
- Appel's algorithm 1968 ( Ray Tracing) (1 revision)
- Bottom-m sketches streaming algorithm (streaming Cardinality Estimation) (1 revision)
- Apostolico–Giancarlo Algorithm (Single String Search String Search) (1 revision)
- Apostolico and Guerra (HS1 Algorithm) (LCS Longest Common Subsequence) (1 revision)
- Apostolico and Guerra (Algorithm 2) (LCS Longest Common Subsequence) (1 revision)
- Bcrypt (Unkeyed Hash Functions One-Way Hash Functions) (1 revision)
- Boyer-Moore-Horspool (BMH) (Single String Search String Search) (1 revision)
- Bjorklund, Husfeldt, Theorem 1 ( Chromatic Number) (1 revision)
- BOYS algorithm (Entity Resolution Entity Resolution) (1 revision)
- Approximate Hard-Margin SVM (1 revision)
- Bellman-Ford Algorithm (1 revision)
- ARIES (Steal, No-Force Recovery) (1 revision)
- ASP (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems) (1 revision)
- B. I. Kvasov 2000 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) (1 revision)
- Brand et al ( Maximum Flow) (1 revision)
- AVL Tree ( Self-Balancing Trees Deletion) (1 revision)
- AVL Tree ( Self-Balancing Trees Insertion) (1 revision)
- AVL Tree ( Self-Balancing Trees Search) (1 revision)
- Aasen's method (Non-Definite, Symmetric Matrix Linear System) (1 revision)
- Abboud, Williams, Yu (OV Orthogonal Vectors) (1 revision)
- Brent-Dekker Method (General Root Computation Root Computation) (1 revision)
- Achlioptas (Link Analysis Link Analysis) (1 revision)
- Asymptotically fast Toeplitz algorithms (Toeplitz Linear system of equations) (1 revision)
- Adaptive Duplicate Detection Algorithm (ADD) (Duplicate Elimination Duplicate Elimination) (1 revision)
- Affine scaling ( Linear Programming) (1 revision)
- Aging (Online Page Replacements) (1 revision)
- Anytime Dynamic A* (ADA*) ( Informed Search) (1 revision)
- Aho, Hopcroft, and Ullman (Linking) (Lowest Common Ancestor with Linking Lowest Common Ancestor) (1 revision)
- Aho, Hopcroft, and Ullman (Offline) (Off-Line Lowest Common Ancestor Lowest Common Ancestor) (1 revision)
- Aho, Hopcroft, and Ullman (Static Trees) (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) (1 revision)
- Aho–Corasick (AC) Algorithm (Multiple String Search String Search) (1 revision)
- Brute Force (Rod-Cutting Problem Rod-Cutting Problem) (1 revision)
- Ahuja et al. ( Maximum Flow) (1 revision)
- Bubble Sort (1 revision)
- Alberto Sanfeliu and King-Sun Fu ( Graph Edit Distance Computation) (1 revision)
- Brute force enumeration (k-Clique k-Clique Problem) (1 revision)
- Bentley (2-dimensional Maximum subarray problem) (1 revision)
- Bowyer–Watson Algorithm (1 revision)
- Buchberger's algorithm (Gröbner Bases Gröbner Bases) (1 revision)
- Bunch; Hopcroft (Square Matrix LU Decomposition LU Decomposition) (1 revision)
- All-pairs shortest paths (Undirected) (1 revision)
- Bidirectional A* Algorithm (Informed Search Informed Search) (1 revision)
- Berkman; Vishkin (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) (1 revision)
- Bodlaender (Partial k-trees Graph Isomorphism Problem) (1 revision)
- Babai & Codenotti (Hypergraphs isomorphism Graph Isomorphism Problem) (1 revision)
- All Pairs Shortest Paths Hypothesis (APSP Hypothesis) (1 revision)
- Boolean Matrix Multiplication Hypothesis (BMM Hypothesis) (1 revision)
- All permutations (1 revision)
- Alman, Vassilevska Williams ( Matrix Multiplication) (1 revision)
- Almeida & Zeitoun (Cyclic Nontrivial SCCs DFA Minimization DFA Minimization) (1 revision)
- Babai 1980 (Graph Isomorphism, Bounded Vertex Valences Graph Isomorphism Problem) (1 revision)
- Alon; Moshkovitz & Safra (Unweighted Set-Covering The Set-Covering Problem) (1 revision)
- Bitap algorithm (Single String Search String Search) (1 revision)
- Alon and Kahale (3-Graph Coloring Graph Coloring) (1 revision)
- Bisection method (Any eigenvalue Eigenvalues (Iterative Methods)) (1 revision)
- Anytime Repairing A* (ARA*) (Informed Search Informed Search) (1 revision)
- Alt, Blum, Mehlhorn, Paul (bipartite graph Maximum cardinality matching) (1 revision)
- Altschul and Erickson (Edit sequence, local alignment Sequence Alignment) (1 revision)
- Bjorck (2-D Polynomial Interpolation Polynomial Interpolation) (1 revision)
- Ananthakrishna (Entity Resolution Entity Resolution) (1 revision)
- Anderson–Björck algorithm (General Root Computation Root Computation) (1 revision)
- Andrew's algorithm (2-dimensional Convex Hull) (1 revision)
- Angelsmark, Jonsson ( (1 revision)