Average probe complexity in quorum systems

DOI10.1145/383962.384014zbMath1333.68146MaRDI QIDQ5890495

Yehuda Hassin, David Peleg

Publication date: 4 March 2016

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

Full work available at URL: https://doi.org/10.1145/383962.384014

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68M14: Distributed systems

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

68W20: Randomized algorithms

68W15: Distributed algorithms

Related Items

Signed quorum systems