Fabio Barillari Enrico Nardelli Massimo Pepe Fully dynamic distributed search trees can be balanced in O(lg2 N) time. 1617-1628 2002 62 J. Parallel Distrib. Comput. 11 http://dx.doi.org/10.1016/S0743-7315(02)00009-6 db/journals/jpdc/jpdc62.html#BarillariNP02