Efficient counting with optimal resilience

DOI10.1007/978-3-662-48653-5_2zbMath1394.68040OpenAlexW1941306591MaRDI QIDQ1664123

Joel Rybicki, Christoph Lenzen

Publication date: 24 August 2018

Full work available at URL: https://aaltodoc.aalto.fi/handle/123456789/36724

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)

Related Items (1)

Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits

This page was built for publication: Efficient counting with optimal resilience