scientific article; zbMATH DE number 7053301
From MaRDI portal
Publication:5743422
zbMath1422.68049MaRDI QIDQ5743422
Rasmus Pagh, Kasper Green Larsen
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095165
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items
I/O-efficient 2-d orthogonal range skyline and attrition priority queues, I/O-optimal categorical 3-sided skyline queries, Dynamic 3-sided planar range queries with expected doubly-logarithmic time, Unnamed Item, Partial sums on the ultra-wide word RAM
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A log log n data structure for three-sided range queries
- Surpassing the information theoretic bound with fusion trees
- Algorithms for parallel memory, I: Two-level memories
- Supporting random access in files of variable length records
- Dynamic 3-sided planar range queries with expected doubly-logarithmic time
- Cache-Oblivious Algorithms
- On Dominance Reporting in 3D
- Fast Prefix Search in Little Space, with Applications
- Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time
- Priority Search Trees
- Orthogonal Range Reporting in Three and Higher Dimensions
- Optimal static range reporting in one dimension
- Cache-oblivious data structures for orthogonal range searching
- Cache-oblivious planar orthogonal range searching and counting
- Cache-oblivious range reporting with optimal queries requires superlinear space
- External Memory Range Reporting on a Grid
- I/O-Efficient Point Location in a Set of Rectangles
