An inherent bottleneck in distributed counting

DOI10.1145/259380.259436MaRDI QIDQ5361479zbMATH OpenOpenAlexFDO

Authors Roger Wattenhofer, Peter Widmayer

Publication date 29 September 2017

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

Full work available at URL http://hdl.handle.net/20.500.11850/68791

Mathematics Subject Classification ID

Distributed systems (68M14) Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: An inherent bottleneck in distributed counting

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