𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graph-based data structures for skeleton-based refinement algorithms

✍ Scribed by Suárez, J. P. ;Carey, G. F. ;Plaza, A.

Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
148 KB
Volume
17
Category
Article
ISSN
1069-8299

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Digital Access to Comparison-Based Tree
Digital Access to Comparison-Based Tree Data Structures and Algorithms
✍ Salvador Roura 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 280 KB

This paper presents a simple method of building tree data structures, which only requires visiting log N nodes and comparing D digits per search or update, where N is the number of keys and D is the length of the keys. These bounds hold independently of the order of the updates and of the digits of