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

Fabio Barillari, Enrico Nardelli, Massimo Pepe (2002)

> Home

Details and statistics

DOI: 10.1016/S0743-7315(02)00009-6

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jpdc/BarillariNP02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jpdc/BarillariNP02
Fabio Barillari, Enrico Nardelli, Massimo Pepe:
Fully dynamic distributed search trees can be balanced in O(lg2 N) time. J. Parallel Distributed Comput. 62(11): 1617-1628 (2002)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.