The impact of communication patterns on distributed self-adjusting binary search trees

DOI10.1007/978-3-319-15612-5_16MaRDI QIDQ5176582zbMATH OpenOpenAlexFDO

Authors Thim Strothmann

Publication date 27 February 2015

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-15612-5_16

zbMATH Keywords

basic network creation gamebinary search treedistributed data structureself-optimizationsink equilibrium

Mathematics Subject Classification ID

Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10) Applications of game theory (91A80)

Recommendations

• The impact of communication patterns on distributed self-adjusting binary search tree
• Self-adjusting binary search trees
• Self-adjusting binary search trees: what makes them tick?
• Principles of Distributed Systems
• Fully dynamic distributed search trees can be balanced in \(O(\lg^{2} N)\) time.

Cited in

(2)

• Self-adjusting linear networks
• The impact of communication patterns on distributed self-adjusting binary search tree

This page was built for publication: The impact of communication patterns on distributed self-adjusting binary search trees

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