A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query
Data Structures and Algorithms
2011-09-22 v1
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 costs for query time or space.
Cite
@article{arxiv.1109.4460,
title = {A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query},
author = {Stephane Durocher},
journal= {arXiv preprint arXiv:1109.4460},
year = {2011}
}