Efficient dynamic range minimum query

The Range Minimum Query problem consists in answering efficiently the simple question: “what is the minimal element between two specified indices of a given array?”. In this paper we present a novel structure that offers a trade-off between time and space. Moreover we show how the structure can be e...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 656; pp. 108 - 117
Main Authors Heliou, A., Léonard, M., Mouchard, L., Salson, M.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 20.12.2016
Elsevier
Subjects
Compressed bit vector
Computer Science
Data Structures and Algorithms
Dynamic structure
Longest common prefix
Range minimum query
Range minimum query
Dynamic structure
Compressed bit vector
Longest common prefix
Longest Common Prefix
Range Minimum Query
Dynamic Structure
Compressed Bit Vector
Online AccessGet full text

Cover

More Information
Summary:The Range Minimum Query problem consists in answering efficiently the simple question: “what is the minimal element between two specified indices of a given array?”. In this paper we present a novel structure that offers a trade-off between time and space. Moreover we show how the structure can be easily maintained whenever an insertion, modification or deletion modifies the input sequence.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2016.07.002