Efficient Counting with Optimal Resilience

DOI10.1137/16M107877XzbMath1374.68072arXiv1508.02535MaRDI QIDQ5359491

Joel Rybicki, Christoph Lenzen, Jukka Suomela

Publication date: 25 September 2017

Published in: SIAM Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

self-stabilizationByzantine fault-tolerance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items

Efficient Counting with Optimal Resilience, Near-optimal self-stabilising counting and firing squads

Cites Work

• Unnamed Item
• Unnamed Item
• Self-stabilizing Byzantine asynchronous unison
• Stabilizing leader election in partial synchronous systems with crash failures
• The influence of large coalitions
• Synchronous counting and computational algorithm design
• Stabilizing unison
• Synchronous vs. asynchronous unison
• A lower bound for the time to assure interactive consistency
• Towards Optimal Synchronous Counting
• Fast self-stabilizing byzantine tolerant digital clock synchronization
• Self-stabilizing clock synchronization in the presence of Byzantine faults
• On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
• Bounds on information exchange for Byzantine agreement
• Reaching Agreement in the Presence of Faults
• The Byzantine generals strike again
• Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits
• Efficient Counting with Optimal Resilience
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Near-optimal self-stabilising counting and firing squads