A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query

Details A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query

2011-09-21

arxiv.org/abs/1109.4460v1

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-256929