Fully dynamic distributed search trees can be balanced in O(lg2 N) time

Fabio Barillari, Enrico Nardelli, Massimo Pepe. Fully dynamic distributed search trees can be balanced in O(lg2 N) time. J. Parallel Distrib. Comput., 62(11):1617-1628, 2002. [doi]

Abstract

Abstract is missing.