A steady state analysis of diffracting trees

DOI10.1007/S002240000095MaRDI QIDQ1265162zbMATH OpenOpenAlexWikidataFDO

Authors Nir Shavit, Asaph Zemach, Eliezer Upfal

Publication date 11 January 1999

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002240000095

zbMATH Keywords

diffracting trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Self-tuning reactive diffracting trees
• Principles of Distributed Systems
• Automata, Languages and Programming
• Maintaining balanced trees for structured distributed streaming systems
• On the stability of dynamic diffusion load balancing

Cited in

(8)

• Elimination trees and the construction of pools and stacks
• Linearizable counting networks
• Software transactional memory
• Principles of Distributed Systems
• Sequentially consistent versus linearizable counting networks
• A scalable lock-free stack algorithm
• Self-tuning reactive diffracting trees
• An efficient counting network

This page was built for publication: A steady state analysis of diffracting trees

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