Proving time bounds for randomized distributed algorithms
From MaRDI portal
Publication:5361423
DOI10.1145/197917.198117zbMath1373.68448arXivmath/9409221MaRDI QIDQ5361423
Isaac Saias, Roberto Segala, Nancy A. Lynch
Publication date: 29 September 2017
Published in: Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/9409221
68Q25: Analysis of algorithms and problem complexity
68W20: Randomized algorithms
68W15: Distributed algorithms
Related Items
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study, Randomized Dining Philosophers without Fairness Assumption, Switched PIOA: parallel composition via distributed scheduling, Quantitative program logic and expected time bounds in probabilistic distributed algorithms., Task-structured probabilistic I/O automata, Fair Termination for Parameterized Probabilistic Concurrent Systems