ESA
2010
Springer
14 years 5 months ago
2010
Springer
The two dimensional range minimum query problem is to preprocess a static two dimensional m by n array A of size N = m
CPM
2007
Springer
14 years 11 months ago
2007
Springer
We consider the two-dimensional Range Minimum Query problem: for a static (m × n)-matrix of size N = mn which may be preprocessed, answer on-line queries of the form “where is t...
ICALP
2009
Springer
15 years 5 months ago
2009
Springer
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...