| dc.contributor.author | Demaine, Erik D. | |
| dc.contributor.author | Landau, Gad M. | |
| dc.contributor.author | Weimann, Oren | |
| dc.date.accessioned | 2011-03-25T15:21:18Z | |
| dc.date.available | 2011-03-25T15:21:18Z | |
| dc.date.issued | 2009-07 | |
| dc.date.submitted | 2009-07 | |
| dc.identifier.isbn | 978-3-642-02926-4 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/61963 | |
| dc.description.abstract | 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. | en_US |
| dc.description.sponsorship | Israel Science Foundation (grant no. 35/05) | en_US |
| dc.description.sponsorship | Danish National Research Foundation. Center for Massive Data Algorithmics (MADALGO) | en_US |
| dc.description.sponsorship | Yahoo! Inc. | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Springer Berlin / Heidelberg | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1007/978-3-642-02927-1_29 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike 3.0 | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | en_US |
| dc.source | MIT web domain | en_US |
| dc.title | On Cartesian trees and range minimum queries | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Demaine, Erik, Gad Landau, and Oren Weimann. “On Cartesian Trees and Range Minimum Queries.” Automata, Languages and Programming. Springer Berlin / Heidelberg, 2009. 341-353-353. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.contributor.approver | Demaine, Erik D. | |
| dc.contributor.mitauthor | Demaine, Erik D. | |
| dc.contributor.mitauthor | Weimann, Oren | |
| dc.relation.journal | Automata, Languages and Programming. Proceedings of the 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Part I | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| dspace.orderedauthors | Demaine, Erik D.; Landau, Gad M.; Weimann, Oren | en |
| dc.identifier.orcid | https://orcid.org/0000-0003-3803-5703 | |
| mit.license | OPEN_ACCESS_POLICY | en_US |
| mit.metadata.status | Complete | |
