All pages
Jump to navigation
Jump to search
Previous page ($(\min, +)$ Matrix Multiplication) | Next page (Family:Distributed Locking Algorithms)
- 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)
- CNF-SAT
- CNN Based Gatys; Leon A 2001 (Texture Synthesis Texture Synthesis)
- CPSP
- 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 Büchi Objectives
- Conjunctive Normal Form SAT
- Conjunctive Reachability Queries in MDPs
- Conjunctive Safety Queries in MDPs
- ConnSub
- 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
- Cycle Finding
- Cyclic Nontrivial SCCs DFA Minimization
- Cyclic Peptide Sequencing Problem
- Cyclic Permutations
- Cyclopeptide sequencing
- 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
- DNF-SAT
- DTW
- 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-Duplication
- 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
- Decisional Boyce-Codd Normal Form
- 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)
- Dependency inference problem
- 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
- Diffie–Hellman key exchange (Key Exchange Key Exchange)
- Diffuse Reflection
- Digital Differential Analyzer (DDA) (Rasterization Rasterization)
- Digital Differential Analyzer (Line Drawing Line Drawing)
- Digraph Realization Problem
- Digraph realization problem
- Dijkstra's Algorithm
- Dijkstra's algorithm with Fibonacci heap (Fredman & Tarjan 1984; Fredman & Tarjan 1987) (Nonnegative Weights Shortest Path (Directed Graphs))
- Dijkstra's algorithm with Fibonacci heap (Johnson 1981; Karlsson & Poblete 1983) (Nonnegative Integer Weights Shortest Path (Directed Graphs))
- Dijkstra's algorithm with binary heap (Johnson 1977) (Nonnegative Weights Shortest Path (Directed Graphs))
- Dijkstra's algorithm with list (Whiting & Hillier 1960) (Nonnegative Weights Shortest Path (Directed Graphs))
- Dijkstra (Counting Solutions; Constructing solutions n-Queens Problem)
- Dining Philosophers Problem
- Dinitz ( Maximum Flow)
- Dinitz (with dynamic trees) ( Maximum Flow)
- Dinur & Steurer ( The Set-Covering Problem)
- Directed (Optimum Branchings), General MST
- Directed (Optimum Branchings), Super Dense MST
- Directed All-Nodes Positive Betweenness Centrality
- Directed All-Nodes Reach Centrality
- Discovering multivalued dependencies
- Discrete Cosine Transform (Lossy Compression Data Compression)
- Discrete Fourier Transform
- Discrete Logarithm Over Finite Fields
- Disjunctive Normal Form SAT
- Disjunctive Queries of Safety in Graphs
- Disjunctive Reachability Queries in MDPs
- Disjunctive Safety Queries in MDPs
- Disjunctive coBüchi Objectives
- Disk Scheduling
- Distance Product
- Distinct-degree factorization (Distinct-degree Factorization of Polynomials Over Finite Fields)
- Distributed Locking Algorithms
- Divide-and-conquer (All eigenvalues; Any eigenvalue Eigenvalues (Iterative Methods))
- Divide and Conquer ( Minimum value in each row of an implicitly-defined totally monotone matrix)
- Dixon's algorithm (Second Category Integer Factoring Integer Factoring)
- Domain:Bioinformatics
- Domain:Combinatorics
- Domain:Cryptography
- Domain:Databases
- Domain:Image Processing
- Domain:Numerical Analysis
- Domain:Operating Systems
- Domain:Robotics
- Domain:Signal Processing
- Domain:Statistics
- Doolittle Algorithm
- Doolittle Algorithm (Square Matrix LU Decomposition LU Decomposition)
- Downey, Fellows (The Vertex Cover Problem The Vertex Cover Problem)
- Downey (The Vertex Cover Problem The Vertex Cover Problem)
- Drysdale; Su (2-Dimensional Delaunay Triangulation Delaunay Triangulation)
- Dual-Horn SAT
- Dual clustering - Guberman ( Image Segmentation)
- Dual subgradients and the drift-plus-penalty method (Stochastic optimization Convex Optimization (Non-linear))
- Dunning; Gupta & Silberholz (Maximum Cut, Approximate Maximum Cut)
- Duplicate Elimination
- Duplicate Elimination Sorted Neighborhood Algorithm (DE-SNA) (Duplicate Elimination Duplicate Elimination)
- Durstenfeld's Algorithm 235 (General Permutations Generating Random Permutations)
- Dwyer (2-Dimensional Delaunay Triangulation Delaunay Triangulation)
- Dwyer (higher dimensions) (General Delaunay Triangulation (d-dimensions) Delaunay Triangulation)
- Dyer (2-dimensional array representation Closest Pair Problem)
- Dynamic 2-d Convex Hull, Overmars and van Leeuwen (2-dimensional Convex Hull, Dynamic Convex Hull)
- Dynamic Dihedral Rotation Queries
- Dynamic Programming (Change-Making Problem Change-Making Problem)
- Dynamic Programming (Longest Palindromic Substring Longest Palindromic Substring)
- Dynamic Programming (Rod-Cutting Problem Rod-Cutting Problem)
- Dynamic Programming Algorithm (S. S. Godbole) (Matrix Chain Ordering Problem Matrix Chain Multiplication)
- Dynamic Time Warping
- Dürer rendering algorithm ( Ray Tracing)
- ECK M.; DEROSE T.; DUCHAMP T.; 1995 (Mesh Parameterization Mesh Parameterization)
- EKF SLAM (SLAM Algorithms SLAM Algorithms)
- EM Based Winkler (Entity Resolution Entity Resolution)
- EM with Quasi-Newton Methods (Jamshidian; Mortaza; Jennrich; Robert I.) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables)
- ER
- Earley parser (CFG Parsing CFG Problems)
- Eccentricity
- Edit Distance, constant-size alphabet
- Edit Sequence, constant-size alphabet
- Edmonds-Karp (bipartite (i.e. assignment), general Maximum-weight matching)
- Edmonds-Karp Algorithm
- Edmonds & Karp ( Maximum Flow)
- Edmonds (Maximum-Weight Matching Maximum-Weight Matching)
- Eigenpair closest to mu
- Eigenpair with the Largest Eigenvalue
- Ellipsoid method (General, Constrained optimization Convex Optimization (Non-linear))
- Elliptic-curve Diffie-Hellman (ECDH)
- Elliptic-curve Diffie-Hellman (ECDH) (Key Exchange Key Exchange)
- Emil Praun (Environment Mapping Texture Mapping)
- Entity Resolution
- Entity resolution
- Enumerating Maximal Cliques
- Enumerating Maximal Cliques, arbitrary graph
- Environment Mapping
- Eppstein (Subset Sum The Subset-Sum Problem)
- Eppstein ( Chromatic Number)
- Epstein (Subset Sum The Subset-Sum Problem)
- Euclid's algorithm (Greatest Common Divisor Greatest Common Divisor)
- Euler's factorization method (First Category Integer Factoring Integer Factoring)
- Exact GED
- Exact Laplacian Solver
- Exact k-Clique
- Exact k-Clique Hypothesis
- Exhaustive search (Minimum Wiener Connector problem Wiener Index)
- Exhaustive search (The Vertex Cover Problem The Vertex Cover Problem)
- Exhaustive search (k-OV Orthogonal Vectors)
- Expectation-Maximization (EM) algorithm (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables)
- Expectation conditional maximization (ECM) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables)
- Expectation conditional maximization (ECM) ( Maximum Likelihood Parameters)
- Expectation conditional maximization either (ECME) (Liu; Chuanhai; Rubin; Donald B) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables)
- Expectation–maximization (EM) algorithm ( Maximum Likelihood Parameters)
- Exponential Time Hypothesis (ETH)
- Extended Split Radix FFT algorithm (Discrete Fourier Transform Discrete Fourier Transform)
- F. Preparata and M. Shamos (k-dimensional space, l m (or l infty) norm Closest Pair Problem)
- FASTA (Edit sequence, local alignment Sequence Alignment)
- FAST E. Rosten and T. Drummond 2006 (Corner Detection Feature Detection)
- FCFS (Disk Scheduling Disk Scheduling)
- FLOATER 1997 (Mesh Parameterization Mesh Parameterization)
- FLOATER 2003 (Mesh Parameterization Mesh Parameterization)
- FOGSAA (Edit sequence, global alignment Sequence Alignment)
- Faaland (Subset Sum The Subset-Sum Problem)
- Factorization of Polynomials Over Finite Fields
- Factorization of polynomials over finite fields
- Fagin (4NF Decomposition for Functional and Multivalued Dependency Sets 4NF Decomposition)
- False position method (General Root Computation Root Computation)
- Family:3SUM
- Family:4NF Decomposition
- Family:AST to Code Translation
- Family:All-Pairs Shortest Paths (APSP)
- Family:All Maximal Non-Branching Paths in a Graph
- Family:All Permutations
- Family:BCNF Decomposition
- Family:Bichromatic Hamming Close Pair
- Family:Block Ciphers
- Family:Boolean Satisfiability
- Family:CFG Problems
- Family:Cardinality Estimation
- Family:Change-Making Problem
- Family:Clique Problems
- Family:Clock Synchronization in Distributed Systems
- Family:Closest Pair Problem
- Family:Collaborative Filtering
- Family:Constructing Eulerian Trails in a Graph
- Family:Constructing Suffix Trees
- Family:Convex Hull
- Family:Convex Optimization (Non-linear)
- Family:Coset Enumeration
- Family:Cryptanalysis of Linear Feedback Shift Registers
- Family:Culling
- Family:Cycle Detection
- Family:Cyclic Peptide Sequencing Problem
- Family:DFA Minimization
- Family:Data Compression
- Family:De Novo Genome Assembly
- Family:Deadlock Avoidance
- Family:Delaunay Triangulation
- Family:Dependency Inference Problem
- Family:Determinant of Matrices with Integer Entries
- Family:Dihedral Rotation Queries
- Family:Discrete Fourier Transform
- Family:Disk Scheduling