scientific article; zbMATH DE number 7561469
From MaRDI portal
Publication:5091119
DOI10.4230/LIPIcs.ICDT.2019.9MaRDI QIDQ5091119
Arnab Ganguly, Sharma V. Thankachan, J. Ian Munro, Rahul Shah, Yakov Nekrich
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Ranked Document Retrieval in External Memory ⋮ Data structures for categorical path counting queries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal external memory planar point enclosure
- Succinct data structures for flexible text retrieval systems
- Reporting points in halfspaces
- Optimal Color Range Reporting in One Dimension
- Efficient range searching for categorical and plain data
- On Dominance Reporting in 3D
- Data Structures for Approximate Orthogonal Range Counting
- Optimal External Memory Interval Management
- Approximate range counting revisited
- New upper bounds for generalized intersection searching problems
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- Improved Bounds for Orthogonal Point Enclosure Query and Point Location in Orthogonal Subdivisions in ℝ3
- External Memory Range Reporting on a Grid
- Adaptive and Approximate Orthogonal Range Counting
- Near-Optimal Range Reporting Structures for Categorical Data
- Algorithms for generalized halfspace range searching and other intersection searching problems
This page was built for publication:
