Pages with the fewest revisions
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)
- Bunch; Hopcroft (Square Matrix LU Decomposition LU Decomposition) (1 revision)
- Closest Pair Problem (1 revision)
- $O(n^2)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling) (1 revision)
- $O(n^3)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling) (1 revision)
- $\delta$-Triangle Conjecture (1 revision)
- Brzozowski's algorithm (DFA Minimization DFA Minimization) (1 revision)
- Bron–Kerbosch Algorithm (1 revision)
- (Boolean Matrix Multiplication (Combinatorial) Matrix Product) (1 revision)
- ( Negative Triangle) (1 revision)
- (many more...) (2-dimensional Convex Hull, Dynamic Convex Hull) (1 revision)
- Byskov ( Chromatic Number) (1 revision)
- Bucket Sort (Non-Comparison Sorting Sorting) (1 revision)
- Coplanar facets merging - Kalvin; A. D.; Cutting; C. B.; Haddad; B. and Noz; M. E. 1991 (Mesh Simplification Mesh Simplification) (1 revision)
- Bruun's FFT Algorithm (1 revision)
- Bresenham Algorithm (Rasterization Rasterization) (1 revision)
- Brandes (Weighted Betweenness Centrality (BC)) (1 revision)
- Catriel Beeri Ronald Fagin John H. Howard (Multivalued Dependency Inference Problem Dependency Inference Problem) (1 revision)
- Brute Force (Rod-Cutting Problem Rod-Cutting Problem) (1 revision)
- Bodlaender (Partial k-trees Graph Isomorphism Problem) (1 revision)
- Continued fraction factorization (CFRAC) (Second Category Integer Factoring Integer Factoring) (1 revision)
- Conjugate Gradient (Approximation? with positive definite matrix Linear System) (1 revision)
- CHAZELLE 1986 (Counting number of intersection points / line segments Line segment intersection) (1 revision)
- Boyer-Moore-Horspool (BMH) (Single String Search String Search) (1 revision)
- Brute force enumeration (k-Clique k-Clique Problem) (1 revision)
- Byskov ( 5 - Graph Coloring) (1 revision)
- Cube Sort Parallel Implementation (Comparison Sorting Sorting) (1 revision)
- Couvreur (SCCs Strongly Connected Components) (1 revision)
- Blum, Shelton, Koller (Graphical games, Multi-agent influence diagrams Nash Equilibria) (1 revision)
- De Bruijn Graph (Idury, Waterman) (De Novo Genome Assembly De Novo Genome Assembly) (1 revision)
- Del Moral; Pierre (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (1 revision)
- Byskov, Theorem 14 ( 6 - Graph Coloring) (1 revision)
- Brent-Dekker Method (General Root Computation Root Computation) (1 revision)
- Brent's algorithm ( Cycle Detection) (1 revision)
- Chan's algorithm (2-dimensional; 3-dimensional Convex Hull) (1 revision)
- Cocke–Younger–Kasami algorithm (CFG Recognition CFG Problems) (1 revision)
- Boman; Hendrickson (Inexact Laplacian Solver SDD Systems Solvers) (1 revision)
- Chin (Approximate MCOP Matrix Chain Multiplication) (1 revision)
- Clock-sampling mutual network synchronization (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems) (1 revision)
- CHEN Z. G.; LIU L. G.; ZHANG Z. Y.; WANG G. J. 2007 (Mesh Parameterization Mesh Parameterization) (1 revision)
- Christofides algorithm (Approximate TSP The Traveling-Salesman Problem) (1 revision)
- Brute Force (2-dimensional Convex Hull) (1 revision)
- Boyer-Moore (BM) algorithm (Single String Search String Search) (1 revision)
- Brute force (4-Graph Coloring Graph Coloring) (1 revision)
- 3SUM Hypothesis (3-SUM Hypothesis) (1 revision)
- Compression/Clustering (Vector Quantization) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search) (1 revision)
- Brute force ( The Set-Covering Problem) (1 revision)
- Clock (Online Page Replacements) (1 revision)
- Commentz-Walter Algorithm (Multiple String Search String Search) (1 revision)
- Bottom-m sketches streaming algorithm (streaming Cardinality Estimation) (1 revision)
- Contribution Culling (Culling Culling) (1 revision)
- Cooper and Dasgupta algorithm ( Register Allocation) (1 revision)
- Bubble Sort (1 revision)
- Counting Sort (Non-Comparison Sorting Sorting) (1 revision)
- David (Square Matrix LU Decomposition LU Decomposition) (1 revision)
- D* (Informed Search Informed Search) (1 revision)
- Dantzig-Fulkerson-Johnson (DFJ) formulation (Minimum TSP The Traveling-Salesman Problem) (1 revision)
- David Mumford and Jayant Shah (1989) ( Image Segmentation) (1 revision)
- Decade Analysis (1 revision)
- Deadlock avoidance (1 revision)
- Delaunay triangulation (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)
- Α-EM algorithm ( Maximum Likelihood Parameters) (1 revision)
- Cabral; B.; Max; N.; and Springmeyer; R 1990 (Diffuse Reflection Texture Mapping) (1 revision)
- CH Algorithm (SCCs Strongly Connected Components) (1 revision)
- Cardoso; Nuno; Abreu; Rui ( The Set-Covering Problem) (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)
- Census (Motif Search Motif Search) (1 revision)
- Chan (Real 3SUM 3SUM) (1 revision)
- Chaitin's Algorithm (Global Register Allocation Register Allocation) (1 revision)
- Chen et al ( Maximum Flow) (1 revision)
- Chatlin's Algorithm (1 revision)
- Cheriton-Tarjan (dense) (Undirected, Dense MST Minimum Spanning Tree (MST)) (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)
- Cholesky (Positive Definite, Hermitian Matrix Linear System) (1 revision)
- A* Algorithm (Informed Search Informed Search) (1 revision)
- Chromatic Polynomial (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)
- Closed formula (Square Matrix LU Decomposition LU Decomposition) (1 revision)
- Blinn–Phong (Specular Reflection Texture Mapping) (1 revision)
- APSP algorithm (3-Clique Min-Weight k-Clique Problem) (1 revision)
- Blinn and Newell (Environment Mapping Texture Mapping) (1 revision)
- Constants (1 revision)
- Closed formula ( LU Decomposition) (1 revision)
- Blakley's scheme ( Secret Sharing) (1 revision)
- Bjorklund, Husfeldt, Theorem 1 ( 6 - Graph Coloring) (1 revision)
- Block A* (Informed Search Informed Search) (1 revision)
- Brute force algorithm (Weighted Activity Selection Problem Interval Scheduling) (1 revision)
- Cholesky Decomposition (Matrix Factorization Collaborative Filtering) (1 revision)
- Brand et al ( Maximum Flow) (1 revision)
- Blowfish (Block Ciphers Block Ciphers) (1 revision)
- Dekker's Algorithm (1 revision)
- ARIES (Steal, No-Force Recovery) (1 revision)
- ASP (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems) (1 revision)
- Bowyer–Watson Algorithm (1 revision)
- Cook–Torrance (microfacets) (Specular Reflection Texture Mapping) (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)
- Culling (1 revision)
- Achlioptas (Link Analysis Link Analysis) (1 revision)
- Boolean Matrix Multiplication Hypothesis (BMM Hypothesis) (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)
- Bjorklund, Husfeldt, Proposition 2 ( 6 - Graph Coloring) (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)
- De Prisco (Approximate OBST Optimal Binary Search Trees) (1 revision)
- Ahuja et al. ( Maximum Flow) (1 revision)
- Dense APSP algorithm (Arbitrary edge weights, Dense graph Graph Diameter) (1 revision)
- Alberto Sanfeliu and King-Sun Fu ( Graph Edit Distance Computation) (1 revision)
- Dekker's algorithm (2-thread Mutual Exclusion Mutual Exclusion) (1 revision)
- CHAZELLE (Reporting all intersection points, line segments Line segment intersection) (1 revision)
- Constructing suffix trees (1 revision)
- Byskov (4-Graph Coloring Graph Coloring) (1 revision)
- Byskov, Theorem 20 ( 6 - Graph Coloring) (1 revision)
- All-pairs shortest paths (Undirected) (1 revision)
- Calvetti, Reichel (2-D Polynomial Interpolation Polynomial Interpolation) (1 revision)
- CNN Based Gatys; Leon A 2001 (Texture Synthesis Texture Synthesis) (1 revision)
- Computer Networking (1 revision)
- Braziunas & Boutilier; 2004; (POMDPs POMDPs) (1 revision)
- All Pairs Shortest Paths Hypothesis (APSP Hypothesis) (1 revision)
- Bjorklund, Husfeldt, Theorem 1 ( 5 - Graph Coloring) (1 revision)
- All permutations (1 revision)
- Alman, Vassilevska Williams ( Matrix Multiplication) (1 revision)
- Almeida & Zeitoun (Cyclic Nontrivial SCCs DFA Minimization DFA Minimization) (1 revision)
- Bresenham's Line Algorithm (1 revision)
- Alon; Moshkovitz & Safra (Unweighted Set-Covering The Set-Covering Problem) (1 revision)
- Chand-Kapur, Gift Wrapping (d-dimensional Convex Hull Convex Hull) (1 revision)
- Alon and Kahale (3-Graph Coloring Graph Coloring) (1 revision)
- Chan, Williams (OV Orthogonal Vectors) (1 revision)
- Bjorklund, Husfeldt, Theorem 1 ( Chromatic Number) (1 revision)
- Alt, Blum, Mehlhorn, Paul (bipartite graph Maximum cardinality matching) (1 revision)
- Altschul and Erickson (Edit sequence, local alignment Sequence Alignment) (1 revision)
- Chandran and F. Grandoni (The Vertex Cover Problem The Vertex Cover Problem) (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)
- Cheriton-Tarjan (planar) (Undirected, Planar MST Minimum Spanning Tree (MST)) (1 revision)
- Cherkassky ( Maximum Flow) (1 revision)
- Anytime Dynamic A* (ADA*) ( Informed Search) (1 revision)
- Anytime Repairing A* (ARA*) (Informed Search Informed Search) (1 revision)
- Chandra (Approximate MCOP Matrix Chain Multiplication) (1 revision)
- Apostolico and Guerra (Algorithm 2) (LCS Longest Common Subsequence) (1 revision)
- Apostolico and Guerra (HS1 Algorithm) (LCS Longest Common Subsequence) (1 revision)
- Apostolico–Giancarlo Algorithm (Single String Search String Search) (1 revision)
- Appel's algorithm 1968 ( Ray Tracing) (1 revision)
- Applegate et al. (Approximate TSP The Traveling-Salesman Problem) (1 revision)
- Christofides ( Chromatic Number) (1 revision)
- Chow's Algorithm (Global Register Allocation Register Allocation) (1 revision)
- Approximate Hard-Margin SVM (1 revision)
- Chvatal greedy heuristic (Weighted Set-Covering The Set-Covering Problem) (1 revision)
- Chubby (Mike Burrows) (Distributed Locking Algorithms Distributed Locking Algorithms) (1 revision)
- Brute Force (Change-Making Problem Change-Making Problem) (1 revision)
- Chu-Liu-Edmonds Algorithm (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST)) (1 revision)
- Brute force (2-dimensional Maximum subarray problem) (1 revision)
- Arbitrator solution (Dining Philosophers Problem Deadlock Avoidance) (1 revision)
- Controlled vertex/edge/face decimation - M.E. Algorri and F. Schmitt 1996 (Mesh Simplification Mesh Simplification) (1 revision)
- Asymptotically fast Toeplitz algorithms (Toeplitz Linear system of equations) (1 revision)
- Cohen–Sutherland Algorithm (1 revision)
- B.I. Kvasov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) (1 revision)
- B. I. Kvasov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) (1 revision)
- B. I. Kvasov 2000 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) (1 revision)
- Bjorklund, Husfeldt, Proposition 3 ( Chromatic Polynomial) (1 revision)
- Compression/Clustering (Vector Quantization) (k-ANNS Nearest Neighbor Search) (1 revision)
- BFS/DFS for connected components ( (1 revision)
- BLAKE2 (Optional Key? One-Way Hash Functions) (1 revision)
- BOM (Backward Oracle Matching) (Single String Search String Search) (1 revision)
- BOYS algorithm (Entity Resolution Entity Resolution) (1 revision)
- Conflict-Driven Clause Learning (CDCL) (CNF-SAT Boolean Satisfiability) (1 revision)
- Babai & Codenotti (Hypergraphs isomorphism Graph Isomorphism Problem) (1 revision)
- Conjugate Gradient (Positive Definite Matrix Linear System) (1 revision)
- Babai ( Graph Isomorphism Problem) (1 revision)
- Babai 1980 (Graph Isomorphism, Bounded Vertex Valences Graph Isomorphism Problem) (1 revision)
- Babai 1980 (Graph Isomporhism, Trivalent Graphs Graph Isomorphism Problem) (1 revision)
- Babai and Luks (Graph Isomorphism, General Graphs Graph Isomorphism Problem) (1 revision)
- Baby-step Giant-step (Discrete Logarithm Over Finite Fields Logarithm Calculations) (1 revision)
- Backward Non-Deterministic DAWG Matching (BNDM) (Single String Search String Search) (1 revision)
- Constructing Eulerian trails in a Graph (1 revision)
- Bailey TL; Elkan C MEME (Motif Search Motif Search) (1 revision)
- Bailey TL; Elkan C MEME ( Motif Search) (1 revision)
- Controlled vertex/edge/face decimation - Cohen; J.; Varshney; A 1996 (Mesh Simplification Mesh Simplification) (1 revision)
- Balasubramanian; Fellows (The Vertex Cover Problem The Vertex Cover Problem) (1 revision)
- Banker's Algorithm (Deadlock Avoidance Deadlock avoidance) (1 revision)
- Brandes (Unweighted Betweenness Centrality (BC)) (1 revision)
- Bjorklund, Husfeldt, Proposition 2 ( Chromatic Number) (1 revision)
- Bareiss Algorithm (Toeplitz Matrix Linear System) (1 revision)
- Controlled vertex/edge/face decimation - Hamann 1994 (Mesh Simplification Mesh Simplification) (1 revision)
- Controlled vertex/edge/face decimation - Guéziec 1996 (Mesh Simplification Mesh Simplification) (1 revision)
- Controlled vertex/edge/face decimation - R. Ronfard and J. Rossignac 1996 (Mesh Simplification Mesh Simplification) (1 revision)
- Barto;Bradtke; & Singhe; 1995; (POMDPs POMDPs) (1 revision)
- Coplanar facets merging - A.D. Kalvin and R.H. Taylor 1996 (Mesh Simplification Mesh Simplification) (1 revision)
- Basic Local Alignment Search Tool (BLAST) (Edit Sequence, constant-size alphabet Sequence Alignment) (1 revision)
- Convex Hull (1 revision)
- Bayer, McCreight B-Tree ( Self-Balancing Trees Deletion) (1 revision)
- Bayer, McCreight B-Tree ( Self-Balancing Trees Insertion) (1 revision)
- Bayer, McCreight B-Tree ( Self-Balancing Trees Search) (1 revision)
- Bcrypt (Unkeyed Hash Functions One-Way Hash Functions) (1 revision)
- Bead Sort (Non-Comparison Sorting Sorting) (1 revision)
- Coplanar facets merging - Hinker; P. and Hansen; C. 1993 (Mesh Simplification Mesh Simplification) (1 revision)
- Coplanar facets merging - M.J. De Haemer and M.J. Zyda 1991 (Mesh Simplification Mesh Simplification) (1 revision)
- Bellman-Ford Algorithm (1 revision)
- Bellman Value Iteration (VI) (Optimal Policies for MDPs Optimal Policies for MDPs) (1 revision)
- Cryptography (1 revision)
- Cygan, Gabow, Sankowski (Bounded integer weights Graph Diameter) (1 revision)
- Cyclopeptide sequencing (1 revision)
- Crout and LUP algorithms (Square Matrix LU Decomposition LU Decomposition) (1 revision)
- Czumaj (Matrix Chain Scheduling Problem Matrix Chain Multiplication) (1 revision)
- Bentley-Ottmann Algorithm (1 revision)
- D* Lite ( Informed Search) (1 revision)
- Bentley (2-dimensional Maximum subarray problem) (1 revision)
- DE NOVO GENOME ASSEMBLY (1 revision)
- Databases (1 revision)
- Berger & Müller-Hannemann (DAG Realization Problem Graph Realization Problems) (1 revision)
- DESBRUN M.; MEYER M.; ALLIEZ P. 2002 (Mesh Parameterization Mesh Parameterization) (1 revision)
- Berkman; Vishkin (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) (1 revision)
- David ( LU Decomposition) (1 revision)
- Davis-Putnam-Logemann-Loveland Algorithm (DPLL) (CNF-SAT Boolean Satisfiability) (1 revision)
- David Sankoff (Edit sequence, global alignment Sequence Alignment) (1 revision)
- Bertsekas & Castanon; 1999; (POMDPs POMDPs) (1 revision)
- Burst Sort (Non-Comparison Sorting Sorting) (1 revision)
- Buchberger's algorithm (Gröbner Bases Gröbner Bases) (1 revision)
- Bidirectional A* Algorithm (Informed Search Informed Search) (1 revision)
- Bijaoui and Rué ( Image Segmentation) (1 revision)
- Binary GCD algorithm (Greatest Common Divisor Greatest Common Divisor) (1 revision)
- Binary representation search with matrix multiplication (Unweighted Graph Diameter) (1 revision)
- Binary space partitioning (BSP) ( Shown Surface Determination) (1 revision)
- Bini's algorithm (Matrix Multiplication Matrix Product) (1 revision)
- BioInformatics (1 revision)
- Blossom Algorithm (general graph Maximum cardinality matching) (1 revision)
- De Bruijn Graph (1 revision)
- Bird (1D Maximum Subarray Maximum Subarray Problem) (1 revision)
- Bisection method (Any eigenvalue Eigenvalues (Iterative Methods)) (1 revision)
- Bisection method (General Root Computation Root Computation) (1 revision)
- Demand-Driven Register Allocation (Global Register Allocation Register Allocation) (1 revision)
- Bitap algorithm (Single String Search String Search) (1 revision)
- Dependency inference problem (1 revision)
- Bjorck-Pereyra (Vandermonde Matrix Linear System) (1 revision)