✦ LIBER ✦

Chromatic binary search trees

✍ Scribed by Otto Nurmi; Eljas Soisalon-Soininen

Publisher: Springer-Verlag
Year: 1996
Tongue: English
Weight: 103 KB
Volume: 33
Category: Article
ISSN: 0001-5903
DOI: 10.1007/s002360050057

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ Otto Nurmi; Eljas Soisalon-Soininen 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 705 KB

Efficient rebalancing of chromatic searc

Efficient rebalancing of chromatic search trees

✍ Joan Boyar; Kim S. Larsen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 827 KB

Chromatic trees were defined by Nurmi and Soisalon-Soininen, as a new type of binary search tree for databases. The aim is to improve runtime performance by allowing a greater degree of concurrency, which, in turn, is obtained by uncoupling updating from rebalancing. This also allows rebalancing to

On binary search trees

✍ Roberto De Prisco; Alfredo De Santis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 378 KB

Optimum binary search trees

✍ Donald E. Knuth 📂 Article 📅 1972 🏛 Springer-Verlag 🌐 English ⚖ 39 KB

Optimum binary search trees

✍ D. E. Knuth 📂 Article 📅 1971 🏛 Springer-Verlag 🌐 English ⚖ 510 KB

Dynamic weighted binary search trees

✍ Karl Unterauer 📂 Article 📅 1979 🏛 Springer-Verlag 🌐 English ⚖ 673 KB