Efficient dynamic range minimum query

International audienceThe Range Minimum Query problem consists in answering efficiently to a simple question: " what is the minimal element appearing between two specified indices of a given array? ". In this paper we present a novel approach that offers a satisfying trade-off between time and space. Moreover we show how the structure can be easily maintained whenever an insertion, modification or deletion modifies the array

Efficient Dynamic Range Minimum Query

International audienc

Efficient dynamic range minimum query

No abstract availabl

Efficient Dynamic Range Minimum Query

International audienc

Efficient Dynamic Range Minimum Query

International audienc