JPDC   2002
Wall of Fame | Most Viewed JPDC-2002 Paper
104views more  JPDC 2002»
9 years 11 months ago
Fully dynamic distributed search trees can be balanced in O(lg2 N) time
In this paper we consider the dictionary problem in a message-passing distributed environment. We introduce a new version, based on AVL-trees, of distributed search trees, the fir...
Fabio Barillari, Enrico Nardelli, Massimo Pepe
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source104
2Download preprint from source103
3Download preprint from source88
4Download preprint from source71
5Download preprint from source63
6Download preprint from source54
7Download preprint from source53
8Download preprint from source50
9Download preprint from source50
10Download preprint from source49
11Download preprint from source46
12Download preprint from source46
13Download preprint from source45
14Download preprint from source42
15Download preprint from source42
16Download preprint from source42
17Download preprint from source38
18Download preprint from source38