Pages without language links
Jump to navigation
Jump to search
The following pages do not link to other language versions.
Showing below up to 50 results in range #1,651 to #1,700.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- Reduction from Triangle Detection to Dynamic Bipartite Maximum-Weight Matching
- Reduction from Triangle Detection to Dynamic st-Reach
- Reduction from Triangle Detection to Independent Set Queries
- Reduction from Triangle Detection to Strong Connectivity (dynamic)
- Reduction from Triangles Cover Triangle to 3D Motion Planning
- Reduction from Triangles Cover Triangle to Hole in Union
- Reduction from Triangles Cover Triangle to Triangle Measure
- Reduction from Triangles Cover Triangle to Visible Triangle
- Reduction from UOV to Dynamic Time Warping
- Reduction from UOV to Longest Common Subsequence
- Reduction from Undirected, Weighted APSP to All-Nodes Median Parity
- Reduction from Undirected, Weighted APSP to Directed, Weighted APSP
- Reduction from Undirected, Weighted APSP to Undirected All-Nodes Positive Betweenness Centrality
- Reduction from Undirected, Weighted APSP to Undirected All-Nodes Reach Centrality
- Reduction from Undirected Median to Undirected, Weighted APSP
- Reduction from Undirected Radius to Undirected, Weighted APSP
- Reduction from Visible Triangle to Triangles Cover Triangle
- Reduction from Weighted, Undirected APSP to 2D Maximum Subarray
- Reduction from k-Clique to CFG Recognition
- Reduction from k-Clique to RNA Folding
- Reduction from k-SAT to Subset Sum
- Reduction to Abboud, Williams, Yu (k-OV Orthogonal Vectors)
- Reduction to Chan, Williams (k-OV Orthogonal Vectors)
- Register Allocation
- Regula Falsi method (Solutions to Nonlinear Equations Solutions to Nonlinear Equations)
- Renamable Horn
- Renault’s Algorithm (SCCs Strongly Connected Components)
- Replacement Paths Problem
- Reporting all intersection points, convex polygons
- Reporting all intersection points, general polygons
- Reporting all intersection points, generalized segments
- Reporting all intersection points, line segments
- Representative Algorithms
- Resource hierarchy solution (Dining Philosophers Problem Deadlock Avoidance)
- Reumann–Witkam ( Line Simplification)
- Revuz's algorithm (Acyclic DFA Minimization DFA Minimization)
- Richardson and Domingos (Link Analysis Link Analysis)
- Rick (LCS Longest Common Subsequence)
- Ridder's method (General Root Computation Root Computation)
- Rijndael / AES (Block Ciphers Block Ciphers)
- Risotto (Motif Search Motif Search)
- Rivin, Zabih (Counting Solutions n-Queens Problem)
- Robotics
- Robson (3-Graph Coloring Graph Coloring)
- Rod-Cutting Problem
- Rod-cutting problem
- Romani's algorithm (Matrix Multiplication Matrix Product)
- Root Computation
- Root Computation with continuous first derivative
- Rosenkrantz; D. J.; Stearns; R. E.; Lewis; P. M. (Approximate TSP The Traveling-Salesman Problem)