A combinatorial treatment of balancing networks

DOI10.1145/197917.198092zbMath1377.68033OpenAlexW2088374403MaRDI QIDQ5361411

Costas Busch, Marios Mavronicolas

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.198092

Mathematics Subject Classification ID

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

Related Items (4)

Counting networks with arbitrary fan-out ⋮ 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: A combinatorial treatment of balancing networks