✦ LIBER ✦

A constant update time finger search tree

✍ Scribed by Paul F Dietz; Rajeev Raman

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A balanced search tree withO(1) worst-ca

✍ Christos Levcopoulos; Mark H. Overmars 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 687 KB

Partially persistent B-trees with consta

✍ George Lagogiannis; Nikos Lorentzos 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 416 KB

Updating a balanced search tree in O(1)

✍ Robert Endre Tarjan 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 366 KB

Real-time tracking using A* heuristic se

✍ Sánchez-Nielsen, E.; Hernández-Tejera, M. 📂 Article 📅 2011 🏛 The Institution of Engineering and Technology 🌐 English ⚖ 768 KB

A tree-construction search approach for

✍ L. Wang; E.S. Chng; H. Li 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 480 KB

A tradeoff between search and update tim

✍ Allan Borodin; Faith E. Fich; Friedhelm Meyer Auf Der Heide; Eli Upfal; Avi Wigd 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 698 KB