Permuting and Batched Geometric Lower Bounds in the I/O Model
From MaRDI portal
Publication:5111685
DOI10.4230/LIPICS.ESA.2017.2zbMATH Open1442.68245OpenAlexW2759561597MaRDI QIDQ5111685FDOQ5111685
Ingo van Duijn, Peyman Afshani
Publication date: 27 May 2020
Full work available at URL: https://dblp.uni-trier.de/db/conf/esa/esa2017.html#AfshaniD17
Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The buffer tree: A technique for designing batched external data structures
- Algorithms and data structures for external memory
- Lower bounds for orthogonal range searching: I. The reporting case
- Computational models for parallel computers
- Lower Bounds for Sorted Geometric Queries in the I/O Model
- Orthogonal range reporting
- On a model of indexability and its bounds for range queries
- External-memory algorithms for processing line segments in geographic information systems
- RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
- Fast permuting on disk arrays
- Improved pointer machine and I/O lower bounds for simplex range reporting and related problems
- Orthogonal Range Reporting in Three and Higher Dimensions
- Permuting Information in Idealized Two-Level Storage
- I/O-Efficient Range Minima Queries
- Algorithms – ESA 2004
Cited In (3)
This page was built for publication: Permuting and Batched Geometric Lower Bounds in the I/O Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111685)
