Uncategorized pages
Jump to navigation
Jump to search
Showing below up to 500 results in range #1 to #500.
View (previous 500 | next 500) (20 | 50 | 100 | 250 | 500)
- $(\min, \leq)$ Product
- $O(n\log n)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling)
- $O(n^2)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling)
- $O(n^3)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling)
- $\delta$-Triangle Conjecture
- (3-Dimensional, i.e. project onto a 2D plane)
- (5/3)-approximate ap-shortest paths
- (Boolean Matrix Multiplication (Combinatorial) Matrix Product)
- ( Negative Triangle)
- (many more...) (2-dimensional Convex Hull, Dynamic Convex Hull)
- 0-1 Linear Programming
- 1-in-3SAT
- 1-sensitive (3/2)-approximate ss-shortest paths
- 1-sensitive (4/3)-approximate decremental diameter
- 1-sensitive (4/3)-approximate decremental eccentricity
- 1-sensitive decremental diameter
- 1-sensitive decremental st-shortest paths
- 1-sensitive incremental ss-reach
- 1D Maximum Subarray
- 2-Dimensional Poisson Problem
- 2-Graph Coloring
- 2-Player
- 2-dimensional Convex Hull
- 2-dimensional Convex Hull, Dynamic
- 2-dimensional Convex Hull, Online
- 2-dimensional array representation
- 2-dimensional space, $l m$ (or $l \infty$) norm
- 2-dimensional space, Euclidean metric
- 2-sensitive (7/5)-approximate st-shortest paths
- 2-sensitive decremental st-shortest paths
- 2-sensitive incremental st-reach
- 2D Maximum Subarray
- 2SAT
- 2 Strong Components (dynamic)
- 3-Dimensional Poisson Problem
- 3-Graph Coloring
- 3-OV
- 3-dimensional Convex Hull
- 3D Motion Planning
- 3SAT
- 3SAT-5
- 3SUM
- 3SUM'
- 3SUM Hypothesis (3-SUM Hypothesis)
- 3 - Graph Coloring
- 3 Points on Line
- 4-Graph Coloring
- 4NF Decomposition
- 4NF Decomposition for Conflict-Free Dependency Sets
- 4NF Decomposition for Functional and Multivalued Dependency Sets
- 4NF decomposition
- 4SAT
- 4 - Graph Coloring
- 5-Graph Coloring
- 5-point ADI iteration (2-Dimensional Poisson Problem Poisson Problem)
- 5-point ADI iteration (3-Dimensional Poisson Problem Poisson Problem)
- 5-point FFT (2-Dimensional Poisson Problem Poisson Problem)
- 5-point FFT (3-Dimensional Poisson Problem Poisson Problem)
- 5-point Gauss Seidel iteration (2-Dimensional Poisson Problem Poisson Problem)
- 5-point Gauss Seidel iteration (3-Dimensional Poisson Problem Poisson Problem)
- 5-point Gauss elimination (2-Dimensional Poisson Problem Poisson Problem)
- 5-point Gauss elimination (3-Dimensional Poisson Problem Poisson Problem)
- 5-point SOR iteration (2-Dimensional Poisson Problem Poisson Problem)
- 5-point SOR iteration (3-Dimensional Poisson Problem Poisson Problem)
- 5-point cyclic reduction (2-Dimensional Poisson Problem Poisson Problem)
- 5-point cyclic reduction (3-Dimensional Poisson Problem Poisson Problem)
- 5-point star Cramer's rule (2-Dimensional Poisson Problem Poisson Problem)
- 5-point star Cramer's rule (3-Dimensional Poisson Problem Poisson Problem)
- 9-point ADI iteration (2-Dimensional Poisson Problem Poisson Problem)
- 9-point ADI iteration (3-Dimensional Poisson Problem Poisson Problem)
- 9-point ADI iteration + smooth guess (2-Dimensional Poisson Problem Poisson Problem)
- 9-point ADI iteration + smooth guess (3-Dimensional Poisson Problem Poisson Problem)
- 9-point FFT (2-Dimensional Poisson Problem Poisson Problem)
- 9-point FFT (3-Dimensional Poisson Problem Poisson Problem)
- 9-point SOR iteration (2-Dimensional Poisson Problem Poisson Problem)
- 9-point SOR iteration (3-Dimensional Poisson Problem Poisson Problem)
- 9-point Tensor product (2-Dimensional Poisson Problem Poisson Problem)
- 9-point Tensor product (3-Dimensional Poisson Problem Poisson Problem)
- A* Algorithm
- A* Algorithm (Informed Search Informed Search)
- A* Informed Search
- A-Priori algorithm (Finding Frequent Itemsets Finding Frequent Itemsets)
- A. Baumberg. 2000 (Blob Detection Feature Detection)
- A. Chalmers; T. Davis; and E. Reinhard 2002 ( Ray Tracing)
- ADI Iteration
- APSP
- APSP algorithm (3-Clique Min-Weight k-Clique Problem)
- APSP on Dense Directed Graphs with Arbitrary Weights
- APSP on Dense Directed Unweighted Graphs
- APSP on Dense Undirected Graphs with Arbitrary Weights
- APSP on Dense Undirected Graphs with Positive Integer Weights
- APSP on Dense Undirected Unweighted Graphs
- APSP on Geometrically Weighted Graphs
- APSP on Sparse Directed Graphs with Arbitrary Weights
- APSP on Sparse Directed Unweighted Graphs
- APSP on Sparse Undirected Graphs with Arbitrary Weights
- APSP on Sparse Undirected Graphs with Positive Integer Weights
- APSP on Sparse Undirected Unweighted Graphs
- ARIES (Steal, No-Force Recovery)
- ASP (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems)
- AST to Code Translation
- AVL Tree ( Self-Balancing Trees Creation)
- AVL Tree ( Self-Balancing Trees Deletion)
- AVL Tree ( Self-Balancing Trees Insertion)
- AVL Tree ( Self-Balancing Trees Search)
- Aasen's method (Non-Definite, Symmetric Matrix Linear System)
- Abboud, Williams, Yu (OV Orthogonal Vectors)
- About Algorithm-Wiki
- Achlioptas (Link Analysis Link Analysis)
- Acyclic DFA Minimization
- Adaptive Duplicate Detection Algorithm (ADD) (Duplicate Elimination Duplicate Elimination)
- Affine scaling ( Linear Programming)
- 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)
- Algorithm Families
- All-Equal-SAT
- All-Integers 3SUM
- All-Nodes Median Parity
- All-Pairs Maximum Flow
- All-pairs shortest paths (Undirected)
- All Eigenpairs
- All Eigenvalues
- All Maximal Non-Branching Paths in a Graph
- All Pairs Minimum Witness
- All Pairs Shortest Paths Hypothesis (APSP Hypothesis)
- All Permutations
- All permutations
- Alman, Vassilevska Williams ( Matrix Multiplication)
- Almeida & Zeitoun (Cyclic Nontrivial SCCs DFA Minimization DFA Minimization)
- Almost Stable Marriage Problem
- 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)
- Alphabetic Tree Problem
- 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 (
- Any Eigenpair
- Any Eigenvalue
- Anytime Dynamic A* (ADA*) ( Informed Search)
- Anytime Repairing A* (ARA*) (Informed Search Informed Search)
- Ap-reach
- 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)
- Approximate Betweenness Centrality
- Approximate Diameter
- Approximate Hard-Margin SVM
- Approximate MCOP
- Approximate MCSP
- Approximate OBST
- Approximate Reach Centrality
- Approximate TSP
- Arbitrator solution (Dining Philosophers Problem Deadlock Avoidance)
- Arithmetic Expression Binary Tree
- 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)
- BCNF Decomposition
- 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-Ford Algorithm
- 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-Ottmann Algorithm
- 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)
- Betweenness Centrality
- Bichromatic Hamming Close Pair
- 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
- Bipartite Graph MCM
- Bipartite Maximum-Weight Matching
- 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)
- Blob Detection
- Block A* (Informed Search Informed Search)
- Block Ciphers
- 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)
- Boolean Matrix Multiplication
- Boolean Matrix Multiplication (Combinatorial)
- Boolean Matrix Multiplication Hypothesis (BMM Hypothesis)
- Boolean d-Attribute Stable Matching
- Borůvka's algorithm (Undirected, General MST Minimum Spanning Tree (MST))
- Bottom-m sketches streaming algorithm (streaming Cardinality Estimation)
- Bowyer–Watson Algorithm
- 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
- 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
- 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)
- Brute Force (Rod-Cutting Problem Rod-Cutting Problem)
- Brute force (2-dimensional Maximum subarray problem)
- Brute force (4-Graph Coloring Graph Coloring)
- Brute force (Cyclic Peptide Sequencing Problem Cyclic Peptide Sequencing Problem)
- Brute force (Lossy Compression Data Compression)
- Brute force ( The Set-Covering Problem)
- Brute force (backtracking search) (The Vertex Cover Problem The Vertex Cover Problem)
- Brute force algorithm (Functional Dependency Inference Problem Dependency Inference Problem)
- Brute force algorithm (Weighted Activity Selection Problem Interval Scheduling)
- Brute force enumeration (k-Clique k-Clique Problem)
- Bruun's FFT Algorithm
- Bruun's FFT algorithm (Discrete Fourier Transform Discrete Fourier Transform)
- Brzozowski's algorithm (DFA Minimization DFA Minimization)
- Brélaz (DSatur) (3-Graph Coloring Graph Coloring)
- Bubble Sort
- Bubble Sort (Comparison Sorting Sorting)
- Buchberger's algorithm (Gröbner Bases Gröbner Bases)
- Bucket Sort (Non-Comparison Sorting Sorting)
- Bunch; Hopcroft (Square Matrix LU Decomposition LU Decomposition)
- Burst Sort (Non-Comparison Sorting Sorting)
- Byskov, Theorem 14 ( 6 - Graph Coloring)
- Byskov, Theorem 20 ( 6 - Graph Coloring)
- Byskov (4-Graph Coloring Graph Coloring)
- Byskov ( 5 - Graph Coloring)
- Byskov ( Chromatic Number)
- C-LOOK (Disk Scheduling Disk Scheduling)
- C-SCAN (Disk Scheduling Disk Scheduling)
- CFG Parsing
- CFG Recognition
- CHAZELLE (Reporting all intersection points, line segments Line segment intersection)
- CHAZELLE 1986 (Counting number of intersection points / line segments Line segment intersection)
- CHEN Z. G.; LIU L. G.; ZHANG Z. Y.; WANG G. J. 2007 (Mesh Parameterization Mesh Parameterization)
- CH Algorithm (SCCs Strongly Connected Components)
- CNN Based Gatys; Leon A 2001 (Texture Synthesis Texture Synthesis)
- Cabral; B.; Max; N.; and Springmeyer; R 1990 (Diffuse Reflection Texture Mapping)
- Calvetti, Reichel (2-D Polynomial Interpolation Polynomial Interpolation)
- Cantor–Zassenhaus algorithm (Equal-degree Factorization of Polynomials Over Finite Fields)
- Cardinality Estimation
- Cardoso; Nuno; Abreu; Rui ( The Set-Covering Problem)
- Catriel Beeri Ronald Fagin John H. Howard (Multivalued Dependency Inference Problem Dependency Inference Problem)
- Census (Motif Search Motif Search)
- Chaitin's Algorithm (Global Register Allocation Register Allocation)
- Chan's algorithm (2-dimensional; 3-dimensional Convex Hull)
- Chan's algorithm Parallel Implementation ( Variance Calculations)
- Chan, Williams (OV Orthogonal Vectors)
- Chan-Singhal-Liu ( Mutual Exclusion)
- Chan (APSP on Dense Directed Graphs with Arbitrary Weights; APSP on Dense Undirected Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP))
- Chan (Boolean Matrix Multiplication (Combinatorial) Matrix Product)
- Chan (Geometrically Weighted) (APSP on Geometrically Weighted Graphs All-Pairs Shortest Paths (APSP))
- Chan (Real 3SUM 3SUM)
- Chand-Kapur, Gift Wrapping (d-dimensional Convex Hull Convex Hull)
- Chandra (Approximate MCOP Matrix Chain Multiplication)
- Chandran and F. Grandoni (The Vertex Cover Problem The Vertex Cover Problem)
- Chandran and Hochbaum (Bipartite Graph MCM Maximum Cardinality Matching)
- Change-Making Problem
- Chatlin's Algorithm
- Chazelle's algorithm (Undirected, General MST Minimum Spanning Tree (MST))
- Chazelle & Edelsbrunner (Reporting all intersection points, line segments Line segment intersection)
- Chen's lambda-connected segmentation ( Image Segmentation)
- Chen; I. Kanj; and W. Jia. (The Vertex Cover Problem The Vertex Cover Problem)
- Chen Ensembles of classifiers (Entity Resolution Entity Resolution)
- Chen et al ( Maximum Flow)
- Cheriton-Tarjan (dense) (Undirected, Dense MST Minimum Spanning Tree (MST))
- Cheriton-Tarjan (planar) (Undirected, Planar MST Minimum Spanning Tree (MST))
- Cheriton-Tarjan Algorithm (Undirected, General MST Minimum Spanning Tree (MST))
- Cheriyan & Hagerup (st-Maximum Flow Maximum Flow)
- Cheriyan et al. (st-Maximum Flow Maximum Flow)
- Cherkassky ( Maximum Flow)
- Chiba and Nishizeki (Enumerating Maximal Cliques, arbitrary graph Clique Problems)
- Chin (Approximate MCOP Matrix Chain Multiplication)
- Chin and Poon (LCS Longest Common Subsequence)
- Cholesky (Positive Definite, Hermitian Matrix Linear System)
- Cholesky Decomposition (Matrix Factorization Collaborative Filtering)
- Chow's Algorithm (Global Register Allocation Register Allocation)
- Christofides ( Chromatic Number)
- Christofides algorithm (Approximate TSP The Traveling-Salesman Problem)
- Chromatic Number
- Chromatic Polynomial
- Chu-Liu-Edmonds Algorithm (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST))
- Chubby (Mike Burrows) (Distributed Locking Algorithms Distributed Locking Algorithms)
- Chvatal greedy heuristic (Weighted Set-Covering The Set-Covering Problem)
- Ciliberti; Mézard (Lossy Compression Data Compression)
- Clock-sampling mutual network synchronization (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems)
- Clock (Online Page Replacements)
- Clock Synchronization in Distributed Systems
- Closed formula (Square Matrix LU Decomposition LU Decomposition)
- Closed formula ( LU Decomposition)
- Closest Pair Problem
- Cocke–Younger–Kasami algorithm (CFG Recognition CFG Problems)
- Cohen; Lee and Song ( Linear Programming)
- Cohen–Sutherland (Rectangular Window Line Clipping)
- Cohen–Sutherland Algorithm
- Commentz-Walter Algorithm (Multiple String Search String Search)
- Comparison Sorting
- Compressed Extended KF (SLAM Algorithms SLAM Algorithms)
- Compression/Clustering (Vector Quantization) (k-ANNS Nearest Neighbor Search)
- Compression/Clustering (Vector Quantization) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search)
- Computer Networking
- Conflict-Driven Clause Learning (CDCL) (CNF-SAT Boolean Satisfiability)
- Conjugate Gradient (Approximation? with positive definite matrix Linear System)
- Conjugate Gradient (Positive Definite Matrix Linear System)
- Conjunctive Normal Form SAT
- Conjunctive Reachability Queries in MDPs
- Conjunctive Safety Queries in MDPs
- Connected Subgraph
- Constant sensitivity (4/3)-approximate incremental diameter
- Constant sensitivity incremental ST-Reach
- Constants
- Constructing Eulerian Trails in a Graph
- Constructing Eulerian trails in a Graph
- Constructing Solutions
- Constructing Suffix Trees
- Constructing suffix trees
- Continued fraction factorization (CFRAC) (Second Category Integer Factoring Integer Factoring)
- Contribution Culling (Culling Culling)
- Controlled vertex/edge/face decimation - Cohen; J.; Varshney; A 1996 (Mesh Simplification Mesh Simplification)
- Controlled vertex/edge/face decimation - Guéziec 1996 (Mesh Simplification Mesh Simplification)
- Controlled vertex/edge/face decimation - Hamann 1994 (Mesh Simplification Mesh Simplification)
- Controlled vertex/edge/face decimation - M.E. Algorri and F. Schmitt 1996 (Mesh Simplification Mesh Simplification)
- Controlled vertex/edge/face decimation - R. Ronfard and J. Rossignac 1996 (Mesh Simplification Mesh Simplification)
- Convex Hull
- Convex Optimization (Non-linear)
- Convex Polygonal Window
- Convex Polyhedral Window
- Cook–Torrance (microfacets) (Specular Reflection Texture Mapping)
- Cooley–Tukey algorithm (Discrete Fourier Transform Discrete Fourier Transform)
- Cooper and Dasgupta algorithm ( Register Allocation)
- Coplanar facets merging - A.D. Kalvin and R.H. Taylor 1996 (Mesh Simplification Mesh Simplification)
- Coplanar facets merging - Hinker; P. and Hansen; C. 1993 (Mesh Simplification Mesh Simplification)
- Coplanar facets merging - Kalvin; A. D.; Cutting; C. B.; Haddad; B. and Noz; M. E. 1991 (Mesh Simplification Mesh Simplification)
- Coplanar facets merging - M.J. De Haemer and M.J. Zyda 1991 (Mesh Simplification Mesh Simplification)
- Coppersmith–Winograd algorithm (Matrix Multiplication Matrix Product)
- Corner Detection
- Coset Enumeration
- Counting Solutions
- Counting Sort (Non-Comparison Sorting Sorting)
- Counting number of intersection points, line segments
- Couvreur (SCCs Strongly Connected Components)
- Covanov and Thomé ( Multiplication)
- Crout and LUP algorithms (Square Matrix LU Decomposition LU Decomposition)
- Cryptanalysis of Linear Feedback Shift Registers
- Cryptography
- Cube Sort Parallel Implementation (Comparison Sorting Sorting)
- Culling
- Cycle Detection
- Cyclic Nontrivial SCCs DFA Minimization
- Cyclic Peptide Sequencing Problem
- Cyclic Permutations
- Cygan, Gabow, Sankowski (Bounded integer weights Graph Diameter)
- Cyrus–Beck (Convex Polygonal Window; Convex Polyhedral window Line Clipping)
- Czumaj (Approximate MCOP Matrix Chain Multiplication)
- Czumaj (Matrix Chain Scheduling Problem Matrix Chain Multiplication)
- D* (Informed Search Informed Search)
- D* Lite ( Informed Search)
- D-Neighborhood of a String
- D-dimensional Convex Hull
- DAG Realization Problem
- DESBRUN M.; MEYER M.; ALLIEZ P. 2002 (Mesh Parameterization Mesh Parameterization)
- DE NOVO GENOME ASSEMBLY
- DFA Minimization
- Daitch; Spielman (Inexact Laplacian Solver SDD Systems Solvers)
- Damiano Brigo; Bernard Hanzon and François LeGland (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes))
- Dantzig-Fulkerson-Johnson (DFJ) formulation (Minimum TSP The Traveling-Salesman Problem)
- Dantzig ( Maximum Flow)
- Databases
- David (Square Matrix LU Decomposition LU Decomposition)
- David ( LU Decomposition)
- David Eppstein, Maarten Löffler, Darren Strash (Enumerating Maximal Cliques, arbitrary graph Clique Problems)
- David Mumford and Jayant Shah (1989) ( Image Segmentation)
- David Sankoff (Edit sequence, global alignment Sequence Alignment)
- Davis-Putnam-Logemann-Loveland Algorithm (DPLL) (CNF-SAT Boolean Satisfiability)
- De ( Multiplication)
- De Berg; Cheong (2-Dimensional Delaunay Triangulation Delaunay Triangulation)
- De Bruijn Graph
- De Bruijn Graph (Idury, Waterman) (De Novo Genome Assembly De Novo Genome Assembly)
- De Novo Genome Assembly
- De Prisco (Approximate OBST Optimal Binary Search Trees)
- Deadlock Avoidance
- Deadlock avoidance
- Decade Analysis
- Decisional BCNF
- Decremental Diameter
- Dekel; Nassimi & Sahni Parallel Implementation (Topological Sorting Topological Sorting)
- Dekker's Algorithm
- Dekker's algorithm (2-thread Mutual Exclusion Mutual Exclusion)
- Del Moral; Pierre (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes))
- Delaunay Triangulation
- Delaunay triangulation
- Demand-Driven Register Allocation (Global Register Allocation Register Allocation)
- Dense APSP algorithm (Arbitrary edge weights, Dense graph Graph Diameter)
- Derek's + Maxwell ( 4NF Decomposition)
- Derek's Algorithm ( 4NF Decomposition)
- Determinant of Matrices with Integer Entries
- Dial's Algorithm (nonnegative integer weights Shortest Path (Directed graphs))
- Diameter
- Diameter 2 vs 3
- Diameter 3 vs 7