Towards Optimal Synchronous Counting

DOI10.1145/2767386.2767423zbMath1333.68066arXiv1503.06702OpenAlexW2039651269MaRDI QIDQ2796281

Christoph Lenzen, Joel Rybicki, Jukka Suomela

Publication date: 23 March 2016

Published in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.06702

zbMATH Keywords

Byzantine fault-toleranceself-stabilisationsynchronous counting

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items

Synchronous counting and computational algorithm design, Efficient Counting with Optimal Resilience, Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits

Cites Work

• Memorization and Association on a Realistic Neural Model
• Unnamed Item