Most linked-to pages
Jump to navigation
Jump to search
Showing below up to 500 results in range #501 to #1,000.
View (previous 500 | next 500) (20 | 50 | 100 | 250 | 500)
- J. Chen; L. Liu; and W. Jia. (The Vertex Cover Problem, Degrees Bounded By 3 The Vertex Cover Problem) (3 links)
- Kadane's Algorithm (1D Maximum Subarray Maximum Subarray Problem) (3 links)
- Key Exchange (3 links)
- Keyed Hash Functions (3 links)
- Kmett (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) (3 links)
- Kth Order Statistic (3 links)
- Lien (4NF Decomposition for Conflict-Free Dependency Sets 4NF Decomposition) (3 links)
- Line Drawing (3 links)
- Line Simplification (3 links)
- Local Register Allocation (3 links)
- Longest Palindromic Substring (3 links)
- Longest Path on Interval Graphs (3 links)
- Lossless Compression (3 links)
- Lund & Yannakakis ( The Set-Covering Problem) (3 links)
- Maximum Flow (3 links)
- Maximum Likelihood Methods in Unknown Latent Variables (3 links)
- Maximum Likelihood Parameters (3 links)
- Merge Sort (Comparison Sorting Sorting) (3 links)
- Mesh Parameterization (3 links)
- Mesh Simplification (3 links)
- Micali; Vazirani ( Maximum-Weight Matching) (3 links)
- Minimum Wiener Connector Problem (3 links)
- Modified van Leeuwen (Static Trees) (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) (3 links)
- More Believable Exponential Time Hypothesis (MBETH) (3 links)
- Mucha and Sankowski ( Maximum-Weight Matching) (3 links)
- Muller's method (General Root Computation Root Computation) (3 links)
- Multilevel queue scheduling (Unweighted Interval Scheduling, Online Interval Scheduling) (3 links)
- N-Player (3 links)
- Naive Implementation ( Integral Equations) (3 links)
- Naive sorting (Comparison Sorting Sorting) (3 links)
- Negative Triangle (3 links)
- Newton's method (Root Computation with continuous first derivative Root Computation) (3 links)
- No-Steal, Force (3 links)
- O'Neil 1973 (Boolean Matrix Multiplication Matrix Product) (3 links)
- Odd Even Sort Parallel Implementation (Comparison Sorting Sorting) (3 links)
- Online 2-d Convex Hull, Preparata (2-dimensional Convex Hull, Online Convex Hull) (3 links)
- Online Matrix-Vector Multiplication (3 links)
- Online Vector-Matrix-Vector Multiplication (3 links)
- Optimal Policies for MDPs (3 links)
- Output-Sensitive Quantum BMM (Boolean Matrix Multiplication Matrix Product) (3 links)
- Paturi, Pudlák, Saks, Zane (PPSZ) 2005 (k-SAT Boolean Satisfiability) (3 links)
- Perumalla and Deo (1D Maximum Subarray Maximum Subarray Problem) (3 links)
- Point-in-Polygon (3 links)
- Polygon Clipping with Convex Clipping Polygon (3 links)
- Priority scheduling (Unweighted Interval Scheduling, Online Interval Scheduling) (3 links)
- Quick Sort (Comparison Sorting Sorting) (3 links)
- RNA Folding (3 links)
- Rasterization (3 links)
- Ray Tracing (3 links)
- Raz & Safra ( The Set-Covering Problem) (3 links)
- Reduction to Abboud, Williams, Yu (k-OV Orthogonal Vectors) (3 links)
- Reduction to Chan, Williams (k-OV Orthogonal Vectors) (3 links)
- Replacement Paths Problem (RPP) (3 links)
- Revuz's algorithm (Acyclic DFA Minimization DFA Minimization) (3 links)
- Ridder's method (General Root Computation Root Computation) (3 links)
- Rod-Cutting Problem (3 links)
- Round-robin scheduling (Unweighted Interval Scheduling, Online Interval Scheduling) (3 links)
- SLAM Algorithms (3 links)
- Schieber; Vishkin (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) (3 links)
- Schieber; Vishkin (Parallel) (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) (3 links)
- Sciore (4NF Decomposition for Conflict-Free Dependency Sets 4NF Decomposition) (3 links)
- Secant method (General Root Computation Root Computation) (3 links)
- Secret Sharing (3 links)
- Selection Sort (Comparison Sorting Sorting) (3 links)
- Self-Balancing Trees Creation (3 links)
- Self-Balancing Trees Deletion (3 links)
- Self-Balancing Trees Insertion (3 links)
- Self-Balancing Trees Search (3 links)
- Sequence-To-Graph Alignment (3 links)
- Shamos (1D Maximum Subarray Maximum Subarray Problem) (3 links)
- Shell Sort (Frank & Lazarus) (Comparison Sorting Sorting) (3 links)
- Shell Sort (Pratt) (Comparison Sorting Sorting) (3 links)
- Shell Sort (Sedgewick) (Comparison Sorting Sorting) (3 links)
- Shell Sort (Shell) (Comparison Sorting Sorting) (3 links)
- Shi 2009 (NAE 3SAT Boolean Satisfiability) (3 links)
- Shimbel Algorithm (APSP on Dense Directed Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP)) (3 links)
- Shortest k-Cycle (3 links)
- Shortest remaining time first (Unweighted Interval Scheduling, Online Interval Scheduling) (3 links)
- Sleator and Tarjan (Linking) (Lowest Common Ancestor with Linking Lowest Common Ancestor) (3 links)
- Sleator and Tarjan (Linking and Cutting) (Lowest Common Ancestor with Linking and Cutting Lowest Common Ancestor) (3 links)
- Solutions to Nonlinear Equations (3 links)
- Sorting - Comparison (3 links)
- Steffensen's method (General Root Computation Root Computation) (3 links)
- Stephen Alstrup, Cyril Gavoille, Haim Kaplan & Theis Rauhe (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) (3 links)
- Tao D; Tang X; Li X et al ( Graph Edit Distance Computation) (3 links)
- Tarjan's off-line lowest common ancestors algorithm (Off-Line Lowest Common Ancestor Lowest Common Ancestor) (3 links)
- Texture Synthesis (3 links)
- Thorup's Sorting Algorithm (Comparison Sorting Sorting) (3 links)
- Tim Sort (Comparison Sorting Sorting) (3 links)
- Tower of Hanoi (3 links)
- Transitive Reduction Problem of Directed Graphs (3 links)
- Tree sort (Comparison Sorting Sorting) (3 links)
- Turnpike Problem (3 links)
- Unbalanced Orthogonal Vectors Hypothesis (UOVH) (3 links)
- Valentin Polishchuk, and Jukka Suomela (Almost Stable Marriage Problem Stable Matching Problem) (3 links)
- Variance Calculations (3 links)
- Volterra Equations (3 links)
- Voronoi Diagrams (3 links)
- Wang Y-K; Fan K-C; Horng J-T ( Graph Edit Distance Computation) (3 links)
- Whirlpool ( One-Way Hash Functions) (3 links)
- Williams (APSP on Dense Directed Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP)) (3 links)
- Work-conserving schedulers (Unweighted Interval Scheduling, Online Interval Scheduling) (3 links)
- Wu and Manber, Fuzzy String Matching ( String Search) (3 links)
- (3-Dimensional, i.e. project onto a 2D plane) (2 links)
- 5-point ADI iteration (2-Dimensional Poisson Problem Poisson Problem) (2 links)
- 5-point ADI iteration (3-Dimensional Poisson Problem Poisson Problem) (2 links)
- 5-point FFT (2-Dimensional Poisson Problem Poisson Problem) (2 links)
- 5-point FFT (3-Dimensional Poisson Problem Poisson Problem) (2 links)
- 5-point Gauss Seidel iteration (2-Dimensional Poisson Problem Poisson Problem) (2 links)
- 5-point Gauss Seidel iteration (3-Dimensional Poisson Problem Poisson Problem) (2 links)
- 5-point Gauss elimination (2-Dimensional Poisson Problem Poisson Problem) (2 links)
- 5-point Gauss elimination (3-Dimensional Poisson Problem Poisson Problem) (2 links)
- 5-point SOR iteration (2-Dimensional Poisson Problem Poisson Problem) (2 links)
- 5-point SOR iteration (3-Dimensional Poisson Problem Poisson Problem) (2 links)
- 5-point cyclic reduction (2-Dimensional Poisson Problem Poisson Problem) (2 links)
- 5-point cyclic reduction (3-Dimensional Poisson Problem Poisson Problem) (2 links)
- 5-point star Cramer's rule (2-Dimensional Poisson Problem Poisson Problem) (2 links)
- 5-point star Cramer's rule (3-Dimensional Poisson Problem Poisson Problem) (2 links)
- 9-point ADI iteration (2-Dimensional Poisson Problem Poisson Problem) (2 links)
- 9-point ADI iteration (3-Dimensional Poisson Problem Poisson Problem) (2 links)
- 9-point ADI iteration + smooth guess (2-Dimensional Poisson Problem Poisson Problem) (2 links)
- 9-point ADI iteration + smooth guess (3-Dimensional Poisson Problem Poisson Problem) (2 links)
- 9-point FFT (2-Dimensional Poisson Problem Poisson Problem) (2 links)
- 9-point FFT (3-Dimensional Poisson Problem Poisson Problem) (2 links)
- 9-point SOR iteration (2-Dimensional Poisson Problem Poisson Problem) (2 links)
- 9-point SOR iteration (3-Dimensional Poisson Problem Poisson Problem) (2 links)
- 9-point Tensor product (2-Dimensional Poisson Problem Poisson Problem) (2 links)
- 9-point Tensor product (3-Dimensional Poisson Problem Poisson Problem) (2 links)
- A* Algorithm (Informed Search Informed Search) (2 links)
- A-Priori algorithm (Finding Frequent Itemsets Finding Frequent Itemsets) (2 links)
- A. Baumberg. 2000 (Blob Detection Feature Detection) (2 links)
- A. Chalmers; T. Davis; and E. Reinhard 2002 ( Ray Tracing) (2 links)
- ARIES (Steal, No-Force Recovery) (2 links)
- ASP (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems) (2 links)
- AVL Tree ( Self-Balancing Trees Creation) (2 links)
- AVL Tree ( Self-Balancing Trees Deletion) (2 links)
- AVL Tree ( Self-Balancing Trees Insertion) (2 links)
- AVL Tree ( Self-Balancing Trees Search) (2 links)
- Aasen's method (Non-Definite, Symmetric Matrix Linear System) (2 links)
- Abboud, Williams, Yu (OV Orthogonal Vectors) (2 links)
- Achlioptas (Link Analysis Link Analysis) (2 links)
- Adaptive Duplicate Detection Algorithm (ADD) (Duplicate Elimination Duplicate Elimination) (2 links)
- Aging (Online Page Replacements) (2 links)
- Aho, Garey & Ullman (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem) (2 links)
- Aho–Corasick (AC) Algorithm (Multiple String Search String Search) (2 links)
- Akkoyunlu; E. A. (Enumerating Maximal Cliques, arbitrary graph Clique Problems) (2 links)
- All-Nodes Positive Betweenness Centrality (2 links)
- All Pairs Minimum Witness (APMW) (2 links)
- All Pairs Shortest Paths Hypothesis (APSP Hypothesis) (2 links)
- All permutations (2 links)
- Alon; Moshkovitz & Safra (Unweighted Set-Covering The Set-Covering Problem) (2 links)
- Alon (st-Maximum Flow Maximum Flow) (2 links)
- Alon and Kahale (3-Graph Coloring Graph Coloring) (2 links)
- Alpha-HMM (Matsuyama, Yasuo) (Maximum Likelihood Methods in Unknown Latent Variables, Hidden Markov Models Maximum Likelihood Methods in Unknown Latent Variables) (2 links)
- Ananthakrishna (Entity Resolution Entity Resolution) (2 links)
- Anytime Dynamic A* (ADA*) ( Informed Search) (2 links)
- Anytime Repairing A* (ARA*) (Informed Search Informed Search) (2 links)
- Apostolico–Giancarlo Algorithm (Single String Search String Search) (2 links)
- Appel's algorithm 1968 ( Ray Tracing) (2 links)
- Applegate et al. (Approximate TSP The Traveling-Salesman Problem) (2 links)
- Approximate 2-CSP (2 links)
- Arbitrator solution (Dining Philosophers Problem Deadlock Avoidance) (2 links)
- Ausiello et al. (Maximum Cut, Approximate Maximum Cut) (2 links)
- B.I. Kvasov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) (2 links)
- B. I. Kvasov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) (2 links)
- BEN-CHEN M.; GOTSMAN C.; BUNIN G. 2008 (Mesh Parameterization Mesh Parameterization) (2 links)
- BOM (Backward Oracle Matching) (Single String Search String Search) (2 links)
- BOYS algorithm (Entity Resolution Entity Resolution) (2 links)
- BST Algorithm (Duplicate Elimination Duplicate Elimination) (2 links)
- Babai (Graph Isomorphism, Bounded Number of Vertices of Each Color Graph Isomorphism Problem) (2 links)
- Babai 1980 (Graph Isomorphism, Bounded Vertex Valences Graph Isomorphism Problem) (2 links)
- Babai and Luks (Graph Isomorphism, General Graphs Graph Isomorphism Problem) (2 links)
- Baby-step Giant-step (Discrete Logarithm Over Finite Fields Logarithm Calculations) (2 links)
- Backward Non-Deterministic DAWG Matching (BNDM) (Single String Search String Search) (2 links)
- Bader & Cong Parallel Implementation (Undirected, General MST Minimum Spanning Tree (MST)) (2 links)
- Bailey TL; Elkan C MEME (Motif Search Motif Search) (2 links)
- Balaban. (Reporting all intersection points, generalized segments Line segment intersection) (2 links)
- Balasubramanian; Fellows (The Vertex Cover Problem The Vertex Cover Problem) (2 links)
- Baran, Demaine, Patrascu (Integer 3SUM 3SUM) (2 links)
- Bareiss Algorithm (Toeplitz Matrix Linear System) (2 links)
- Bareiss algorithm (Determinant of Matrices with Integer Entries Determinant of Matrices with Integer Entries) (2 links)
- Bareiss algorithm with fast multiplication (Determinant of Matrices with Integer Entries Determinant of Matrices with Integer Entries) (2 links)
- Barghout; Lauren Visual Taxometric approach ( Image Segmentation) (2 links)
- Barto;Bradtke; & Singhe; 1995; (POMDPs POMDPs) (2 links)
- Barvinok (Geometric Maximum TSP The Traveling-Salesman Problem) (2 links)
- Basic Local Alignment Search Tool (BLAST) (Edit Sequence, constant-size alphabet Sequence Alignment) (2 links)
- Bayer, McCreight B-Tree ( Self-Balancing Trees Creation) (2 links)
- Bayer, McCreight B-Tree ( Self-Balancing Trees Deletion) (2 links)
- Bayer, McCreight B-Tree ( Self-Balancing Trees Insertion) (2 links)
- Bayer, McCreight B-Tree ( Self-Balancing Trees Search) (2 links)
- Bcrypt (Unkeyed Hash Functions One-Way Hash Functions) (2 links)
- Beigel & Eppstein (3-Graph Coloring Graph Coloring) (2 links)
- Bellare Active Learning (Entity Resolution Entity Resolution) (2 links)
- Bellman Value Iteration (VI) (Optimal Policies for MDPs Optimal Policies for MDPs) (2 links)
- Bellman dynamic programming algorithm (Subset Sum The Subset-Sum Problem) (2 links)
- Bellman–Ford algorithm (Dantzig 1960) (Nonnegative Weights Shortest Path (Directed Graphs)) (2 links)
- Belloch (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (2 links)
- Bentley–Ottmann algorithm (Reporting all intersection points, line segments Line segment intersection) (2 links)
- Berger & Müller-Hannemann (DAG Realization Problem Graph Realization Problems) (2 links)
- Bergland; Glenn radix-8 algorithm (Discrete Fourier Transform Discrete Fourier Transform) (2 links)
- Berlekamp–Massey algorithm (Cryptanalysis of Linear Feedback Shift Registers Cryptanalysis of Linear Feedback Shift Registers) (2 links)
- Bern; Gilbert; Hendrickson (Inexact Laplacian Solver SDD Systems Solvers) (2 links)
- Bertsekas & Castanon; 1999; (POMDPs POMDPs) (2 links)
- Bidirectional A* Algorithm (Informed Search Informed Search) (2 links)
- Bijaoui and Rué ( Image Segmentation) (2 links)
- Binary GCD algorithm (Greatest Common Divisor Greatest Common Divisor) (2 links)
- Binary space partitioning (BSP) ( Shown Surface Determination) (2 links)
- Bini's algorithm (Matrix Multiplication Matrix Product) (2 links)
- Bisection method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations) (2 links)
- Bitap algorithm (Single String Search String Search) (2 links)
- Bjorck-Pereyra (Vandermonde Matrix Linear System) (2 links)
- Bjorck (2-D Polynomial Interpolation Polynomial Interpolation) (2 links)
- Blakley's scheme ( Secret Sharing) (2 links)
- Blelloch; Koutis; Miller; Tangwongsan (Inexact Laplacian Solver SDD Systems Solvers) (2 links)
- Blinn and Newell (Environment Mapping Texture Mapping) (2 links)
- Blinn–Phong (Specular Reflection Texture Mapping) (2 links)
- Block A* (Informed Search Informed Search) (2 links)
- Blowfish (Block Ciphers Block Ciphers) (2 links)
- Blum (General Graph MCM Maximum Cardinality Matching) (2 links)
- Boissonnat; Snoeyink (Reporting all intersection points, generalized segments Line segment intersection) (2 links)
- Boman; Chen; Hendrickson; Toledo (Inexact Laplacian Solver SDD Systems Solvers) (2 links)
- Boman; Hendrickson (Inexact Laplacian Solver SDD Systems Solvers) (2 links)
- Borůvka's algorithm (Undirected, General MST Minimum Spanning Tree (MST)) (2 links)
- Bowyer–Watson algorithm (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (2 links)
- Bowyer–Watson algorithm (Voronoi Diagrams Voronoi Diagrams) (2 links)
- Boyer-Moore-Horspool (BMH) (Single String Search String Search) (2 links)
- Boyer-Moore (BM) algorithm (Single String Search String Search) (2 links)
- Branch and bound (Cyclic Peptide Sequencing Problem Cyclic Peptide Sequencing Problem) (2 links)
- Braziunas & Boutilier; 2004; (POMDPs POMDPs) (2 links)
- Brent's algorithm ( Cycle Detection) (2 links)
- Bresenham's line algorithm (Line Drawing Line Drawing) (2 links)
- Bresenham Algorithm (Rasterization Rasterization) (2 links)
- Bringman (Subset Sum The Subset-Sum Problem) (2 links)
- Bron–Kerbosch algorithm (Enumerating Maximal Cliques, arbitrary graph Clique Problems) (2 links)
- Brute-force search (3-Graph Coloring Graph Coloring) (2 links)
- Brute Force (Change-Making Problem Change-Making Problem) (2 links)
- Brute Force (Matrix Chain Ordering Problem Matrix Chain Multiplication) (2 links)
- Brute Force (Rod-Cutting Problem Rod-Cutting Problem) (2 links)
- Brute force (4-Graph Coloring Graph Coloring) (2 links)
- Brute force (Cyclic Peptide Sequencing Problem Cyclic Peptide Sequencing Problem) (2 links)
- Brute force (Lossy Compression Data Compression) (2 links)
- Brute force (backtracking search) (The Vertex Cover Problem The Vertex Cover Problem) (2 links)
- Brute force algorithm (Functional Dependency Inference Problem Dependency Inference Problem) (2 links)
- Bruun's FFT algorithm (Discrete Fourier Transform Discrete Fourier Transform) (2 links)
- Brzozowski's algorithm (DFA Minimization DFA Minimization) (2 links)
- Brélaz (DSatur) (3-Graph Coloring Graph Coloring) (2 links)
- Buchberger's algorithm (Gröbner Bases Gröbner Bases) (2 links)
- Bunch; Hopcroft (Square Matrix LU Decomposition LU Decomposition) (2 links)
- Byskov (4-Graph Coloring Graph Coloring) (2 links)
- C-LOOK (Disk Scheduling Disk Scheduling) (2 links)
- C-SCAN (Disk Scheduling Disk Scheduling) (2 links)
- CHAZELLE (Reporting all intersection points, line segments Line segment intersection) (2 links)
- CHEN Z. G.; LIU L. G.; ZHANG Z. Y.; WANG G. J. 2007 (Mesh Parameterization Mesh Parameterization) (2 links)
- CNN Based Gatys; Leon A 2001 (Texture Synthesis Texture Synthesis) (2 links)
- Cabral; B.; Max; N.; and Springmeyer; R 1990 (Diffuse Reflection Texture Mapping) (2 links)
- Calvetti, Reichel (2-D Polynomial Interpolation Polynomial Interpolation) (2 links)
- Catriel Beeri Ronald Fagin John H. Howard (Multivalued Dependency Inference Problem Dependency Inference Problem) (2 links)
- Census (Motif Search Motif Search) (2 links)
- Chaitin's Algorithm (Global Register Allocation Register Allocation) (2 links)
- Chan's algorithm Parallel Implementation ( Variance Calculations) (2 links)
- Chan, Williams (OV Orthogonal Vectors) (2 links)
- Chan-Singhal-Liu ( Mutual Exclusion) (2 links)
- Chand-Kapur, Gift Wrapping (d-dimensional Convex Hull Convex Hull) (2 links)
- Chandra (Approximate MCOP Matrix Chain Multiplication) (2 links)
- Chandran and F. Grandoni (The Vertex Cover Problem The Vertex Cover Problem) (2 links)
- Chandran and Hochbaum (Bipartite Graph MCM Maximum Cardinality Matching) (2 links)
- Chazelle's algorithm (Undirected, General MST Minimum Spanning Tree (MST)) (2 links)
- Chazelle & Edelsbrunner (Reporting all intersection points, line segments Line segment intersection) (2 links)
- Chen's lambda-connected segmentation ( Image Segmentation) (2 links)
- Chen; I. Kanj; and W. Jia. (The Vertex Cover Problem The Vertex Cover Problem) (2 links)
- Chen Ensembles of classifiers (Entity Resolution Entity Resolution) (2 links)
- Cheriton-Tarjan (dense) (Undirected, Dense MST Minimum Spanning Tree (MST)) (2 links)
- Cheriton-Tarjan (planar) (Undirected, Planar MST Minimum Spanning Tree (MST)) (2 links)
- Cheriton-Tarjan Algorithm (Undirected, General MST Minimum Spanning Tree (MST)) (2 links)
- Cheriyan & Hagerup (st-Maximum Flow Maximum Flow) (2 links)
- Cheriyan et al. (st-Maximum Flow Maximum Flow) (2 links)
- Chiba and Nishizeki (Enumerating Maximal Cliques, arbitrary graph Clique Problems) (2 links)
- Chin (Approximate MCOP Matrix Chain Multiplication) (2 links)
- Cholesky (Positive Definite, Hermitian Matrix Linear System) (2 links)
- Cholesky Decomposition (Matrix Factorization Collaborative Filtering) (2 links)
- Chow's Algorithm (Global Register Allocation Register Allocation) (2 links)
- Christofides algorithm (Approximate TSP The Traveling-Salesman Problem) (2 links)
- Chu-Liu-Edmonds Algorithm (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST)) (2 links)
- Chubby (Mike Burrows) (Distributed Locking Algorithms Distributed Locking Algorithms) (2 links)
- Chvatal greedy heuristic (Weighted Set-Covering The Set-Covering Problem) (2 links)
- Ciliberti; Mézard (Lossy Compression Data Compression) (2 links)
- Clock-sampling mutual network synchronization (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems) (2 links)
- Clock (Online Page Replacements) (2 links)
- Closed formula (Square Matrix LU Decomposition LU Decomposition) (2 links)
- Closest Pair Problem (2 links)
- Cocke–Younger–Kasami algorithm (CFG Recognition CFG Problems) (2 links)
- Cohen–Sutherland (Rectangular Window Line Clipping) (2 links)
- Commentz-Walter Algorithm (Multiple String Search String Search) (2 links)
- Compressed Extended KF (SLAM Algorithms SLAM Algorithms) (2 links)
- Conflict-Driven Clause Learning (CDCL) (CNF-SAT Boolean Satisfiability) (2 links)
- Continued fraction factorization (CFRAC) (Second Category Integer Factoring Integer Factoring) (2 links)
- Contribution Culling (Culling Culling) (2 links)
- Controlled vertex/edge/face decimation - Cohen; J.; Varshney; A 1996 (Mesh Simplification Mesh Simplification) (2 links)
- Controlled vertex/edge/face decimation - Guéziec 1996 (Mesh Simplification Mesh Simplification) (2 links)
- Controlled vertex/edge/face decimation - Hamann 1994 (Mesh Simplification Mesh Simplification) (2 links)
- Controlled vertex/edge/face decimation - M.E. Algorri and F. Schmitt 1996 (Mesh Simplification Mesh Simplification) (2 links)
- Controlled vertex/edge/face decimation - R. Ronfard and J. Rossignac 1996 (Mesh Simplification Mesh Simplification) (2 links)
- Convex Hull (2 links)
- Convex Optimization (Non-linear) (2 links)
- Cook–Torrance (microfacets) (Specular Reflection Texture Mapping) (2 links)
- Cooley–Tukey algorithm (Discrete Fourier Transform Discrete Fourier Transform) (2 links)
- Coplanar facets merging - A.D. Kalvin and R.H. Taylor 1996 (Mesh Simplification Mesh Simplification) (2 links)
- Coplanar facets merging - Hinker; P. and Hansen; C. 1993 (Mesh Simplification Mesh Simplification) (2 links)
- Coplanar facets merging - Kalvin; A. D.; Cutting; C. B.; Haddad; B. and Noz; M. E. 1991 (Mesh Simplification Mesh Simplification) (2 links)
- Coplanar facets merging - M.J. De Haemer and M.J. Zyda 1991 (Mesh Simplification Mesh Simplification) (2 links)
- Coppersmith–Winograd algorithm (Matrix Multiplication Matrix Product) (2 links)
- Covanov and Thomé ( Multiplication) (2 links)
- Crout and LUP algorithms (Square Matrix LU Decomposition LU Decomposition) (2 links)
- Cyrus–Beck (Convex Polygonal Window; Convex Polyhedral window Line Clipping) (2 links)
- Czumaj (Approximate MCOP Matrix Chain Multiplication) (2 links)
- Czumaj (Matrix Chain Scheduling Problem Matrix Chain Multiplication) (2 links)
- D* (Informed Search Informed Search) (2 links)
- D* Lite ( Informed Search) (2 links)
- DESBRUN M.; MEYER M.; ALLIEZ P. 2002 (Mesh Parameterization Mesh Parameterization) (2 links)
- Daitch; Spielman (Inexact Laplacian Solver SDD Systems Solvers) (2 links)
- Damiano Brigo; Bernard Hanzon and François LeGland (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (2 links)
- Dantzig-Fulkerson-Johnson (DFJ) formulation (Minimum TSP The Traveling-Salesman Problem) (2 links)
- David (Square Matrix LU Decomposition LU Decomposition) (2 links)
- David Eppstein, Maarten Löffler, Darren Strash (Enumerating Maximal Cliques, arbitrary graph Clique Problems) (2 links)
- David Mumford and Jayant Shah (1989) ( Image Segmentation) (2 links)
- Davis-Putnam-Logemann-Loveland Algorithm (DPLL) (CNF-SAT Boolean Satisfiability) (2 links)
- De ( Multiplication) (2 links)
- De Berg; Cheong (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (2 links)
- De Bruijn Graph (Idury, Waterman) (De Novo Genome Assembly De Novo Genome Assembly) (2 links)
- De Prisco (Approximate OBST Optimal Binary Search Trees) (2 links)
- Dekel; Nassimi & Sahni Parallel Implementation (Topological Sorting Topological Sorting) (2 links)
- Dekker's algorithm (2-thread Mutual Exclusion Mutual Exclusion) (2 links)
- Del Moral; Pierre (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (2 links)
- Demand-Driven Register Allocation (Global Register Allocation Register Allocation) (2 links)
- Diffie–Hellman key exchange (Key Exchange Key Exchange) (2 links)
- Digital Differential Analyzer (DDA) (Rasterization Rasterization) (2 links)
- Digital Differential Analyzer (Line Drawing Line Drawing) (2 links)
- Dijkstra's algorithm with Fibonacci heap (Fredman & Tarjan 1984; Fredman & Tarjan 1987) (Nonnegative Weights Shortest Path (Directed Graphs)) (2 links)
- Dijkstra's algorithm with Fibonacci heap (Johnson 1981; Karlsson & Poblete 1983) (Nonnegative Integer Weights Shortest Path (Directed Graphs)) (2 links)
- Dijkstra's algorithm with binary heap (Johnson 1977) (Nonnegative Weights Shortest Path (Directed Graphs)) (2 links)
- Dijkstra's algorithm with list (Whiting & Hillier 1960) (Nonnegative Weights Shortest Path (Directed Graphs)) (2 links)
- Dijkstra (Counting Solutions; Constructing solutions n-Queens Problem) (2 links)
- Discrete Cosine Transform (Lossy Compression Data Compression) (2 links)
- Divide and Conquer ( Minimum value in each row of an implicitly-defined totally monotone matrix) (2 links)
- Dixon's algorithm (Second Category Integer Factoring Integer Factoring) (2 links)
- Doolittle Algorithm (Square Matrix LU Decomposition LU Decomposition) (2 links)
- Downey, Fellows (The Vertex Cover Problem The Vertex Cover Problem) (2 links)
- Downey (The Vertex Cover Problem The Vertex Cover Problem) (2 links)
- Drysdale; Su (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (2 links)
- Dual clustering - Guberman ( Image Segmentation) (2 links)
- Dunning; Gupta & Silberholz (Maximum Cut, Approximate Maximum Cut) (2 links)
- Duplicate Elimination Sorted Neighborhood Algorithm (DE-SNA) (Duplicate Elimination Duplicate Elimination) (2 links)
- Durstenfeld's Algorithm 235 (General Permutations Generating Random Permutations) (2 links)
- Dwyer (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (2 links)
- Dwyer (higher dimensions) (General Delaunay Triangulation (d-dimensions) Delaunay Triangulation) (2 links)
- Dyer (2-dimensional array representation Closest Pair Problem) (2 links)
- Dynamic Connected Subgraph (2 links)
- Dynamic Dihedral Rotation Queries (2 links)
- Dynamic MaxSCC (2 links)
- Dynamic Programming (Change-Making Problem Change-Making Problem) (2 links)
- Dynamic Programming (Longest Palindromic Substring Longest Palindromic Substring) (2 links)
- Dynamic Programming (Rod-Cutting Problem Rod-Cutting Problem) (2 links)
- Dynamic Programming Algorithm (S. S. Godbole) (Matrix Chain Ordering Problem Matrix Chain Multiplication) (2 links)
- Dynamic ST-Reach (2 links)
- Dynamic st-Reach (2 links)
- Dürer rendering algorithm ( Ray Tracing) (2 links)
- ECK M.; DEROSE T.; DUCHAMP T.; 1995 (Mesh Parameterization Mesh Parameterization) (2 links)
- EKF SLAM (SLAM Algorithms SLAM Algorithms) (2 links)
- EM Based Winkler (Entity Resolution Entity Resolution) (2 links)
- EM with Quasi-Newton Methods (Jamshidian; Mortaza; Jennrich; Robert I.) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) (2 links)
- Earley parser (CFG Parsing CFG Problems) (2 links)
- Edit Distance (2 links)
- Edmonds (Maximum-Weight Matching Maximum-Weight Matching) (2 links)
- Elliptic-curve Diffie-Hellman (ECDH) (Key Exchange Key Exchange) (2 links)
- Emil Praun (Environment Mapping Texture Mapping) (2 links)
- Eppstein (Subset Sum The Subset-Sum Problem) (2 links)
- Euclid's algorithm (Greatest Common Divisor Greatest Common Divisor) (2 links)
- Euler's factorization method (First Category Integer Factoring Integer Factoring) (2 links)
- Exact k-Clique Hypothesis (2 links)
- Exhaustive search (The Vertex Cover Problem The Vertex Cover Problem) (2 links)
- Expectation-Maximization (EM) algorithm (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) (2 links)
- Expectation conditional maximization (ECM) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) (2 links)
- Expectation conditional maximization (ECM) ( Maximum Likelihood Parameters) (2 links)
- Expectation conditional maximization either (ECME) (Liu; Chuanhai; Rubin; Donald B) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) (2 links)
- Expectation–maximization (EM) algorithm ( Maximum Likelihood Parameters) (2 links)
- Extended Split Radix FFT algorithm (Discrete Fourier Transform Discrete Fourier Transform) (2 links)
- FAST E. Rosten and T. Drummond 2006 (Corner Detection Feature Detection) (2 links)
- FCFS (Disk Scheduling Disk Scheduling) (2 links)
- FLOATER 1997 (Mesh Parameterization Mesh Parameterization) (2 links)
- FLOATER 2003 (Mesh Parameterization Mesh Parameterization) (2 links)
- Faaland (Subset Sum The Subset-Sum Problem) (2 links)
- Family:Closest Pair Problem (2 links)
- Family:Disk Scheduling (2 links)
- Family:Duplicate Elimination (2 links)
- Family:Linear Programming (2 links)
- Family:Matrix Product (2 links)
- Family:Maximum Flow (2 links)
- Family:Sorting (2 links)
- Family:Topological Sorting (2 links)
- Family:kth Order Statistic (2 links)
- Farach (Constructing Suffix Trees Constructing Suffix Trees) (2 links)
- FastSlam (SLAM Algorithms SLAM Algorithms) (2 links)
- Fast Hybrid Algorithm (Single String Search String Search) (2 links)
- Fast clipping (Rectangular Window Line Clipping) (2 links)
- Faugère F4 algorithm (Gröbner Bases Gröbner Bases) (2 links)
- Faugère F5 algorithm (Gröbner Bases Gröbner Bases) (2 links)
- Fellegi & Sunter Model (Entity Resolution Entity Resolution) (2 links)
- Fermat's factorization method (First Category Integer Factoring Integer Factoring) (2 links)
- Field D* (Informed Search Informed Search) (2 links)
- Filter Kruskal algorithm (Undirected, General MST Minimum Spanning Tree (MST)) (2 links)
- Finch (Inexact GED Graph Edit Distance Computation) (2 links)
- First-in, first-out (Online Page Replacements) (2 links)
- Fisher–Yates/Knuth shuffle (General Permutations Generating Random Permutations) (2 links)
- Flajolet–Martin algorithm ( Cardinality Estimation) (2 links)
- Fleury's algorithm + Tarjan (Constructing Eulerian Trails in a Graph Constructing Eulerian Trails in a Graph) (2 links)
- Fleury's algorithm + Thorup (Constructing Eulerian Trails in a Graph Constructing Eulerian Trails in a Graph) (2 links)
- Flipping algorithm (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (2 links)
- Florack and Kuijper ( Image Segmentation) (2 links)
- Floyd's tortoise and hare algorithm ( Cycle Detection) (2 links)
- Floyd–Warshall algorithm (APSP All-Pairs Shortest Paths (APSP)) (2 links)
- Focused D* ( Informed Search) (2 links)
- Folded spectrum method (Eigenpair closest to mu; Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods)) (2 links)
- Fomin; Gaspers & Saurabh (4-Graph Coloring Graph Coloring) (2 links)
- Ford–Fulkerson algorithm (Bipartite Graph MCM Maximum Cardinality Matching) (2 links)
- Fortune's algorithm (Voronoi Diagrams Voronoi Diagrams) (2 links)
- Fortune (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (2 links)
- Fortune ( Delaunay Triangulation) (2 links)
- François Le Gall (Matrix Multiplication Matrix Product) (2 links)
- Fredman & Tarjan (Undirected, General MST Minimum Spanning Tree (MST)) (2 links)
- Fredman & Willard (Undirected, Integer Weights MST Minimum Spanning Tree (MST)) (2 links)
- Fringe (Informed Search Informed Search) (2 links)
- Fringe Saving A* (FSA*) (Informed Search Informed Search) (2 links)
- Fulkerson–Chen–Anstee (Digraph Realization Problem Graph Realization Problems) (2 links)
- Function Field Sieve (FFS) (Discrete Logarithm Over Finite Fields Logarithm Calculations) (2 links)
- Furer's algorithm ( Multiplication) (2 links)
- Förstner algorithm 1987 (Corner Detection Feature Detection) (2 links)
- GLR parser (CFG Parsing CFG Problems) (2 links)
- GSAT (CNF-SAT Boolean Satisfiability) (2 links)
- Gabow's algorithm (Nonnegative Weights Shortest Path (Directed Graphs)) (2 links)
- Gabow, Galil, Spencer (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST)) (2 links)
- Gabow; Tarjan (General Graph MCM Maximum Cardinality Matching) (2 links)
- Gabow Ahuja Algorithm (Nonnegative Integer Weights Shortest Path (Directed Graphs)) (2 links)
- Gabow et al, Section 2 (Undirected, General MST Minimum Spanning Tree (MST)) (2 links)
- Gabow et al, Section 3 (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST)) (2 links)
- Gale–Shapley algorithm (Stable Marriage Problem Stable Matching Problem) (2 links)
- Gao’s additive FFT (Discrete Fourier Transform Discrete Fourier Transform) (2 links)
- Gapped BLAST (Edit Sequence, constant-size alphabet Sequence Alignment) (2 links)
- Garsia–Wachs algorithm (Alphabetic Tree Problem Optimal Binary Search Trees) (2 links)
- Gaussian Elimination (Exact Laplacian Solver SDD Systems Solvers) (2 links)
- Gaussian elimination (2-D Polynomial Interpolation Polynomial Interpolation) (2 links)
- Geert Willems; Tinne Tuytelaars and Luc van Gool (2008) (Corner Detection Feature Detection) (2 links)
- Geman and Geman Markov random fields ( Image Segmentation) (2 links)
- General number field sieve (Second Category Integer Factoring Integer Factoring) (2 links)
- General weights (2 links)
- Generalized Adaptive A* (GAA*) (Informed Search Informed Search) (2 links)
- Generalized expectation maximization (GEM) algorithm ( Maximum Likelihood Parameters) (2 links)
- Gent; I.P.; Irving; R.W.; Manlove; D.F.; Prosser; P.; Smith; B.M. (Stable Marriage Problem Stable Matching Problem) (2 links)
- Gentleman; Morven and Gordon Sande radix-4 algorithm (Discrete Fourier Transform Discrete Fourier Transform) (2 links)
- Geometric Base (2 links)
- Goldberg & Rao (Integer Maximum Flow Maximum Flow) (2 links)
- Goldberg & Rao (Parallel) (Integer Maximum Flow Maximum Flow) (2 links)
- Goodrich (Reporting all intersection points, line segments Line segment intersection) (2 links)
- Gosper's algorithm ( Cycle Detection) (2 links)
- Gray-code based (Tower of Hanoi Tower of Hanoi) (2 links)
- Greedy Best-First Search (Informed Search Informed Search) (2 links)
- Greedy SEQAID (De Novo Genome Assembly De Novo Genome Assembly) (2 links)
- Greiner–Hormann clipping algorithm (Polygon Clipping with Arbitrary Clipping Polygon Polygon Clipping) (2 links)
- Gremban; Miller; Zagha (Inexact Laplacian Solver SDD Systems Solvers) (2 links)
- Gries, Martin (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem) (2 links)
- Grigoryan (n-Queens Completion n-Queens Problem) (2 links)
- Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Creation) (2 links)
- Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Deletion) (2 links)
- Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Insertion) (2 links)
- Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Search) (2 links)
- Guibas; Stofli (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (2 links)
- Gunther Determinants solution (Counting Solutions; Constructing solutions n-Queens Problem) (2 links)
- Gupta-Sproull algorithm (Line Drawing Line Drawing) (2 links)
- Gupta; Verdu (Lossy Compression Data Compression) (2 links)
- Gupta & Sarawagi CRF (Entity Resolution Entity Resolution) (2 links)
- Gusfield (Longest Palindromic Substring Longest Palindromic Substring) (2 links)
- H.W.Jensen 2001 (Diffuse Reflection Texture Mapping) (2 links)
- HEALPix mapping Wong (Environment Mapping Texture Mapping) (2 links)
- HORMANN K.; GREINER G 1999 (Mesh Parameterization Mesh Parameterization) (2 links)
- Hadlock (Maximum Cut Maximum Cut) (2 links)
- Halley's method (Root Computation with continuous second derivative Root Computation) (2 links)
- Hanoi graph (Tower of Hanoi Tower of Hanoi) (2 links)
- Hanrahan–Krueger (Specular Reflection Texture Mapping) (2 links)
- Hariharan (Constructing Suffix Trees Constructing Suffix Trees) (2 links)
- Harris and Stephens algorithm (Corner Detection Feature Detection) (2 links)
- Harrow (Quantum) (Sparse Linear System Linear System) (2 links)
- Harvey; Hoeven; Lecerf ( Multiplication) (2 links)
- Harvey; Hoeven ( Multiplication) (2 links)
- Haselgrove-Leech-Trotter (HLT) algorithm (Coset Enumeration Coset Enumeration) (2 links)
- Hash join ( Joins) (2 links)
- Hashing (kth Order Statistic kth Order Statistic) (2 links)
- Hauskrecht; 2000; (POMDPs POMDPs) (2 links)
- Haveliwala (Link Analysis Link Analysis) (2 links)
- He; X. D.; Torrance; K. E.; Sillion; 1991 (Diffuse Reflection Texture Mapping) (2 links)
- Heap's algorithm (All Permutations All Permutations) (2 links)
- Heejo Lee; Jong Kim; Sungje Hong; and Sunggu Lee (Approximate MCSP Matrix Chain Multiplication) (2 links)