We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two specified array indices. We show how to preprocess A into...
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin...
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...