TY - GEN
T1 - On cartesian trees and range minimum queries
AU - Demaine, Erik D.
AU - Landau, Gad M.
AU - Weimann, Oren
PY - 2009
Y1 - 2009
N2 - 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 range minimum query problem, a Cartesian tree of a tree for the bottleneck edge query problem on trees and undirected graphs, and a proof that no Cartesian tree exists for the two-dimensional version of the range minimum query problem.
AB - 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 range minimum query problem, a Cartesian tree of a tree for the bottleneck edge query problem on trees and undirected graphs, and a proof that no Cartesian tree exists for the two-dimensional version of the range minimum query problem.
UR - http://www.scopus.com/inward/record.url?scp=70449378436&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-02927-1_29
DO - 10.1007/978-3-642-02927-1_29
M3 - Conference contribution
AN - SCOPUS:70449378436
SN - 3642029264
SN - 9783642029264
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 341
EP - 353
BT - Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings
T2 - 36th International Colloquium on Automata, Languages and Programming, ICALP 2009
Y2 - 5 July 2009 through 12 July 2009
ER -