Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima

DOI10.1007/978-3-642-31594-7_28zbMath1272.68115arXiv1204.4835OpenAlexW3147024MaRDI QIDQ2843259

J. Ian Munro, Arash Farzan, Rajeev Raman

Publication date: 12 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.4835

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (5)

Two dimensional range minimum queries and Fibonacci lattices ⋮ Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search ⋮ Unnamed Item ⋮ Succinct and Implicit Data Structures for Computational Geometry ⋮ Succinct Color Searching in One Dimension

This page was built for publication: Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima