Fully dynamic distributed search trees can be balanced in \(O(\lg^{2} N)\) time.

DOI10.1016/S0743-7315(02)00009-6zbMath1033.68550OpenAlexW1583854430MaRDI QIDQ1872689

Enrico Nardelli, Fabio Barillari, Massimo Pepe

Publication date: 14 May 2003

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0743-7315(02)00009-6

zbMATH Keywords

ScalabilityDistributed memory machinesDistributed data structures

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

This page was built for publication: Fully dynamic distributed search trees can be balanced in \(O(\lg^{2} N)\) time.