✦ LIBER ✦

Dynamic LCA Queries on Trees

✍ Scribed by Cole, Richard; Hariharan, Ramesh

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Cartesian Trees and Range Minimum Que

✍ Erik D. Demaine, Gad M. Landau, Oren Weimann 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 562 KB

Multidimensional data querying on tree-s

✍ Xu Lizhen; Wang Shiyuan 📂 Article 📅 2006 🏛 Wuhan University 🌐 English ⚖ 574 KB

Virtual Tree: A robust architecture for

✍ Baldoni, Roberto; Bonomi, Silvia; Cerocchi, Adriano; Querzoni, Leonardo 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 791 KB

On the hardness of learning queries from

✍ Liu, Xianmin; Li, Jianzhong 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 433 KB

Efficient Bulk Operations on Dynamic R-T

✍ L. Arge, K. H. Hinrichs, J. Vahrenhold and J. S. Vitter 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 217 KB

Dynamical percolation on general trees

✍ Davar Khoshnevisan 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 348 KB