Erik D. Demaine, Gad M. Landau, Oren Weimann. On Cartesian Trees and Range Minimum Queries. In Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris E. Nikoletseas, Wolfgang Thomas, editors, Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I. Volume 5555 of Lecture Notes in Computer Science, pages 341-353, Springer, 2009. [doi]
@inproceedings{DemaineLW09, title = {On Cartesian Trees and Range Minimum Queries}, author = {Erik D. Demaine and Gad M. Landau and Oren Weimann}, year = {2009}, doi = {10.1007/978-3-642-02927-1_29}, url = {http://dx.doi.org/10.1007/978-3-642-02927-1_29}, researchr = {https://researchr.org/publication/DemaineLW09}, cites = {0}, citedby = {0}, pages = {341-353}, booktitle = {Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I}, editor = {Susanne Albers and Alberto Marchetti-Spaccamela and Yossi Matias and Sotiris E. Nikoletseas and Wolfgang Thomas}, volume = {5555}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-02926-4}, }