Highly dynamic distributed computing with byzantine failures

DOI10.1145/2484239.2484263zbMath1323.68557arXiv1202.3084OpenAlexW2130555261MaRDI QIDQ5176093

Anne-Marie Kermarrec, Florian Huc, Rachid Guerraoui

Publication date: 2 March 2015

Published in: Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

random walksdynamic networksByzantine failures

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) Random walks on graphs (05C81)

Related Items (2)

Resource Burning for Permissionless Systems (Invited Paper) ⋮ Bankrupting Sybil despite churn

This page was built for publication: Highly dynamic distributed computing with byzantine failures