✦ LIBER ✦
Fully dynamic distributed search trees can be balanced in O(lg2 N) time
✍ Scribed by Fabio Barillari; Enrico Nardelli; Massimo Pepe
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 168 KB
- Volume
- 62
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.