Pages that link to "Item:Q3978176"
From MaRDI portal
The following pages link to Parallel Transitive Closure and Point Location in Planar Structures (Q3978176):
Displaying 12 items.
- Parallel batched planar point location on the CCC (Q582096) (← links)
- Parallel algorithms for planar dominance counting (Q916374) (← links)
- Approximating nearest neighbor among triangles in convex position (Q975498) (← links)
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488) (← links)
- A near-linear algorithm for the planar segment-center problem (Q1816414) (← links)
- Bipolar orientations revisited (Q1842650) (← links)
- An efficient parallel algorithm for finding rectangular duals of plane triangular graphs (Q1892581) (← links)
- An efficient parallel algorithm for shortest paths in planar layered digraphs (Q1899220) (← links)
- A time-optimal parallel algorithm for three-dimensional convex hulls (Q1899449) (← links)
- Optimal cooperative search in fractional cascaded data structures (Q1907234) (← links)
- Designing checkers for programs that run in parallel (Q1911462) (← links)
- Selecting distances in the plane (Q2366232) (← links)