Pages that link to "Item:Q1187202"
From MaRDI portal
The following pages link to Optimal randomized parallel algorithms for computational geometry (Q1187202):
Displaying 19 items.
- Parallel algorithms for planar dominance counting (Q916374) (← links)
- An optimal parallel algorithm for triangulating a set of points in the plane (Q1100899) (← links)
- Optimal parallel algorithms for point-set and polygon problems (Q1187196) (← links)
- Dynamic point location in arrangements of hyperplanes (Q1199133) (← links)
- Point location among hyperplanes and unidirectional ray-shooting (Q1330461) (← links)
- Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems (Q1389649) (← links)
- An optimal parallel algorithm for solving the maximal elements problem in the plane (Q1822975) (← links)
- Applications of random sampling in computational geometry. II (Q1823685) (← links)
- Sweep methods for parallel computational geometry (Q1907233) (← links)
- (Q3484356) (← links)
- (Q3745337) (← links)
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms (Q3833604) (← links)
- Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems (Q4291568) (← links)
- RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS (Q4682170) (← links)
- (Q4788601) (← links)
- Distribution-sensitive algorithms (Q5054869) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465867) (← links)
- Fast Algorithms for Geometric Consensuses (Q6060001) (← links)
- Density-based clustering in MapReduce with guarantees on parallel time, space, and solution quality (Q6670755) (← links)