Pages with the fewest revisions
Jump to navigation
Jump to search
Showing below up to 100 results in range #1 to #100.
View (previous 100 | next 100) (20 | 50 | 100 | 250 | 500)
- Approximate Hard-Margin SVM (1 revision)
- Banker's Algorithm (Deadlock Avoidance Deadlock avoidance) (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)
- Apostolico and Guerra (Algorithm 2) (LCS Longest Common Subsequence) (1 revision)
- Bailey TL; Elkan C MEME ( Motif Search) (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)
- Arbitrator solution (Dining Philosophers Problem Deadlock Avoidance) (1 revision)
- Applegate et al. (Approximate TSP The Traveling-Salesman Problem) (1 revision)
- Berger & Müller-Hannemann (DAG Realization Problem Graph Realization Problems) (1 revision)
- Anytime Repairing A* (ARA*) (Informed Search Informed Search) (1 revision)
- Almeida & Zeitoun (Cyclic Nontrivial SCCs DFA Minimization DFA Minimization) (1 revision)
- All Pairs Shortest Paths Hypothesis (APSP Hypothesis) (1 revision)
- BFS/DFS for connected components ( (1 revision)
- Alt, Blum, Mehlhorn, Paul (bipartite graph Maximum cardinality matching) (1 revision)
- Aging (Online Page Replacements) (1 revision)
- Aho–Corasick (AC) Algorithm (Multiple String Search String Search) (1 revision)
- Ananthakrishna (Entity Resolution Entity Resolution) (1 revision)
- Angelsmark, Jonsson ( (1 revision)
- Asymptotically fast Toeplitz algorithms (Toeplitz Linear system of equations) (1 revision)
- Anytime Dynamic A* (ADA*) ( Informed Search) (1 revision)
- Bayer, McCreight B-Tree ( Self-Balancing Trees Deletion) (1 revision)
- Bertsekas & Castanon; 1999; (POMDPs POMDPs) (1 revision)
- Berkman; Vishkin (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) (1 revision)
- Affine scaling ( Linear Programming) (1 revision)
- Binary space partitioning (BSP) ( Shown Surface Determination) (1 revision)
- Bird (1D Maximum Subarray Maximum Subarray Problem) (1 revision)
- Appel's algorithm 1968 ( Ray Tracing) (1 revision)
- All permutations (1 revision)
- Babai ( Graph Isomorphism Problem) (1 revision)
- BOYS algorithm (Entity Resolution Entity Resolution) (1 revision)
- Aho, Hopcroft, and Ullman (Linking) (Lowest Common Ancestor with Linking Lowest Common Ancestor) (1 revision)
- Aho, Hopcroft, and Ullman (Static Trees) (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) (1 revision)
- Alman, Vassilevska Williams ( Matrix Multiplication) (1 revision)
- Alon and Kahale (3-Graph Coloring Graph Coloring) (1 revision)
- Alon; Moshkovitz & Safra (Unweighted Set-Covering The Set-Covering Problem) (1 revision)
- Backward Non-Deterministic DAWG Matching (BNDM) (Single String Search String Search) (1 revision)
- Barto;Bradtke; & Singhe; 1995; (POMDPs POMDPs) (1 revision)
- Bayer, McCreight B-Tree ( Self-Balancing Trees Insertion) (1 revision)
- Altschul and Erickson (Edit sequence, local alignment Sequence Alignment) (1 revision)
- 3SUM Hypothesis (3-SUM Hypothesis) (1 revision)
- Bareiss Algorithm (Toeplitz Matrix Linear System) (1 revision)
- Anderson–Björck algorithm (General Root Computation Root Computation) (1 revision)
- Aho, Hopcroft, and Ullman (Offline) (Off-Line Lowest Common Ancestor Lowest Common Ancestor) (1 revision)
- Alberto Sanfeliu and King-Sun Fu ( Graph Edit Distance Computation) (1 revision)
- Ahuja et al. ( Maximum Flow) (1 revision)
- Bcrypt (Unkeyed Hash Functions One-Way Hash Functions) (1 revision)
- Bentley-Ottmann Algorithm (1 revision)
- Apostolico–Giancarlo Algorithm (Single String Search String Search) (1 revision)
- Bentley (2-dimensional Maximum subarray problem) (1 revision)
- Apostolico and Guerra (HS1 Algorithm) (LCS Longest Common Subsequence) (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)
- Bini's algorithm (Matrix Multiplication Matrix Product) (1 revision)
- Binary representation search with matrix multiplication (Unweighted Graph Diameter) (1 revision)
- BioInformatics (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)
- 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)
- 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)
- BLAKE2 (Optional Key? One-Way Hash Functions) (1 revision)
- Babai & Codenotti (Hypergraphs isomorphism Graph Isomorphism Problem) (1 revision)
- BOM (Backward Oracle Matching) (Single String Search String Search) (1 revision)
- Babai 1980 (Graph Isomporhism, Trivalent Graphs Graph Isomorphism Problem) (1 revision)
- Babai 1980 (Graph Isomorphism, Bounded Vertex Valences Graph Isomorphism Problem) (1 revision)
- Babai and Luks (Graph Isomorphism, General Graphs Graph Isomorphism Problem) (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)
- Baby-step Giant-step (Discrete Logarithm Over Finite Fields Logarithm Calculations) (1 revision)
- A* Algorithm (Informed Search Informed Search) (1 revision)
- Bailey TL; Elkan C MEME (Motif Search Motif Search) (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)
- Balasubramanian; Fellows (The Vertex Cover Problem The Vertex Cover Problem) (1 revision)
- Bead Sort (Non-Comparison Sorting Sorting) (1 revision)
- APSP algorithm (3-Clique Min-Weight k-Clique Problem) (1 revision)
- Abboud, Williams, Yu (OV Orthogonal Vectors) (1 revision)
- Basic Local Alignment Search Tool (BLAST) (Edit Sequence, constant-size alphabet Sequence Alignment) (1 revision)
- Aasen's method (Non-Definite, Symmetric Matrix Linear System) (1 revision)
- AVL Tree ( Self-Balancing Trees Search) (1 revision)
- AVL Tree ( Self-Balancing Trees Insertion) (1 revision)
- Adaptive Duplicate Detection Algorithm (ADD) (Duplicate Elimination Duplicate Elimination) (1 revision)
- Bellman-Ford Algorithm (1 revision)
- Andrew's algorithm (2-dimensional Convex Hull) (1 revision)
- All-pairs shortest paths (Undirected) (1 revision)
- Achlioptas (Link Analysis Link Analysis) (1 revision)
- AVL Tree ( Self-Balancing Trees Deletion) (1 revision)
- ARIES (Steal, No-Force Recovery) (1 revision)
- ASP (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems) (1 revision)