✦ LIBER ✦

On Cartesian Trees and Range Minimum Queries

✍ Scribed by Erik D. Demaine, Gad M. Landau, Oren Weimann

Book ID: 120910014
Publisher: Springer
Year: 2012
Tongue: English
Weight: 562 KB
Volume: 68
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-012-9683-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Space-Efficient Preprocessing Schemes fo

Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays

✍ Fischer, Johannes; Heun, Volker 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 414 KB

Dynamic LCA Queries on Trees

✍ Cole, Richard; Hariharan, Ramesh 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 323 KB

Parallel multi-dimensional range query p

Parallel multi-dimensional range query processing with R-trees on GPU

✍ Kim, Jinwoong; Kim, Sul-Gi; Nam, Beomseok 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 623 KB

Efficient range query processing over DH

Efficient range query processing over DHTs based on the balanced Kautz tree

✍ Yiming Zhang; Ling Liu; Xicheng Lu; Dongsheng Li 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 440 KB

A note on construction of treaps and car

A note on construction of treaps and cartesian trees

✍ M.A. Weiss 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 42 KB

On the crossing numbers of Cartesian pro

On the crossing numbers of Cartesian products with trees

✍ Drago Bokal 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

## Abstract Zip product was recently used in a note establishing the crossing number of the Cartesian product __K__~1~,__n__ □ __P__~m~. In this article, we further investigate the relations of this graph operation with the crossing numbers of graphs. First, we use a refining of the embedding metho