Balanced distributed search trees do not exist

DOI10.1007/3-540-60220-8_50zbMATH Open1502.68100OpenAlexW2104717202WikidataQ60142282 ScholiaQ60142282MaRDI QIDQ5057421FDOQ5057421

Authors: Brigitte Kröll, Peter Widmayer Edit this on Wikidata

Publication date: 16 December 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60220-8_50

Recommendations

• Fully dynamic distributed search trees can be balanced in \(O(\lg^{2} N)\) time.
• Height balance distribution of search trees
• Binary search trees: How low can you go?
• Randomized search trees
• Distributed search trees: fault tolerance in an asynchronous environment

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Balanced distributed search trees do not exist

Cited In (9)

• Family trees, an ordered dictionary with optimal congestion, locality, degree, and search time
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fully dynamic distributed search trees can be balanced in \(O(\lg^{2} N)\) time.
• Maintaining balanced trees for structured distributed streaming systems
• Distributing a \(B^+\)-tree in a loosely coupled environment
• \(D^{3}\)-tree: a dynamic deterministic decentralized structure
• Balanced distributed search trees do not exist
• Maintaining balanced trees for structured distributed streaming systems

This page was built for publication: Balanced distributed search trees do not exist

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5057421)