✦ LIBER ✦

Relaxed red-black trees with group updates

✍ Scribed by Kim S. Larsen

Book ID: 105930752
Publisher: Springer-Verlag
Year: 2002
Tongue: English
Weight: 137 KB
Volume: 38
Category: Article
ISSN: 0001-5903
DOI: 10.1007/s00236-002-0086-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Relaxed multi-way trees with group updat

Relaxed multi-way trees with group updates

✍ Kim S. Larsen 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 206 KB

Data structures with relaxed balance differ from standard structures in that rebalancing can be delayed and interspersed with updates. This gives extra flexibility in both sequential and parallel applications. We study the version of multi-way trees called ða; bÞ-trees (which includes B-trees) with

Red-black trees with types

✍ KAHRS, STEFAN 📂 Article 📅 2001 🏛 Cambridge University Press 🌐 English ⚖ 609 KB

Red-black trees with relative node keys

✍ Holenderski, Mike; Bril, Reinder J.; Lukkien, Johan J. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 330 KB

Optimal Tree Structures for Group Key Ma

Optimal Tree Structures for Group Key Management with Batch Updates

✍ Graham, Ronald L.; Li, Minming; Yao., Frances F. 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 204 KB