On Space Efficient Two Dimensional Range Minimum Data Structures

DOI10.1007/978-3-642-15781-3_15zbMath1287.68026OpenAlexW1858259429MaRDI QIDQ3586393

Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao

Publication date: 6 September 2010

Published in: Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15781-3_15

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05)

Related Items (5)

Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search ⋮ Tight lower bounds for the longest common extension problem ⋮ LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations ⋮ LRM-trees: compressed indices, adaptive sorting, and compressed permutations ⋮ Linear-space data structures for range mode query in arrays

This page was built for publication: On Space Efficient Two Dimensional Range Minimum Data Structures