Abstract
We revisit the range minimum query problem and present a new O(n)-space data structure that supports queries in O(1) time. Although previous data structures exist whose asymptotic bounds match ours, our goal is to introduce a new solution that is simple, intuitive, and practical without increasing asymptotic costs for query time or space. © Springer-Verlag 2013.
Cite
CITATION STYLE
Durocher, S. (2013). A simple linear-space data structure for constant-time range minimum query. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8066 LNCS, pp. 48–60). Springer Verlag. https://doi.org/10.1007/978-3-642-40273-9_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
