Fully dynamic distributed search trees can be balanced in \(O(\lg^{2} N)\) time. (Q1872689)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fully dynamic distributed search trees can be balanced in \(O(\lg^{2} N)\) time. |
scientific article; zbMATH DE number 1910825
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fully dynamic distributed search trees can be balanced in \(O(\lg^{2} N)\) time. |
scientific article; zbMATH DE number 1910825 |
Statements
Fully dynamic distributed search trees can be balanced in \(O(\lg^{2} N)\) time. (English)
0 references
14 May 2003
0 references
Scalability
0 references
Distributed data structures
0 references
Distributed memory machines
0 references
