Coins, weights and contention in balancing networks

DOI10.1145/197917.198090zbMath1377.68029OpenAlexW2061686008MaRDI QIDQ5361410

Ramarathnam Venkatesan, William Aiello, Mordechai M. Yung

Publication date: 29 September 2017

Published in: Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/197917.198090

Mathematics Subject Classification ID

Data structures (68P05) Distributed systems (68M14)

Related Items (7)

Self-stabilizing smoothing and balancing networks ⋮ Linearizable counting networks ⋮ The impact of randomization in smoothing networks ⋮ An efficient counting network ⋮ Sequentially consistent versus linearizable counting networks ⋮ Timing conditions for linearizability in uniform counting networks ⋮ Public data structures: counters as a special case.

This page was built for publication: Coins, weights and contention in balancing networks