Optimal cooperative search in fractional cascaded data structures
From MaRDI portal
Publication:1907234
DOI10.1007/BF01941686zbMath0840.68033MaRDI QIDQ1907234
Roberto Tamassia, Jeffrey Scott Vitter
Publication date: 7 March 1996
Published in: Algorithmica (Search for Journal in Brave)
Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Data structures (68P05)
Related Items
Lower bounds for intersection searching and fractional cascading in higher dimension ⋮ A time-optimal parallel algorithm for three-dimensional convex hulls ⋮ Algorithms for testing occurrences of length 4 patterns in permutations ⋮ Parallel algorithms for separable permutations ⋮ Dominance made simple
Cites Work
- Unnamed Item
- Dynamic fractional cascading
- Fractional cascading. I: A data structuring technique
- Fractional cascading. II: Applications
- Parallel triangulation of a polygon in two calls to the trapezoidal map
- Parallel construction of subdivision hierarchies
- How to search in history
- A new point-location algorithm and its practical efficiency: comparison with existing algorithms
- Optimal Point Location in a Monotone Subdivision
- On Parallel Searching
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
- Optimal Search in Planar Subdivisions
- Parallel Transitive Closure and Point Location in Planar Structures
- RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS
- ERRATUM: "RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS"
- Location of a Point in a Planar Subdivision and Its Applications
- Triangulating a polygon in parallel
