Proving time bounds for randomized distributed algorithms

DOI10.1145/197917.198117zbMath1373.68448arXivmath/9409221OpenAlexW2016403002MaRDI 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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items

Switched PIOA: parallel composition via distributed scheduling ⋮ Testing probabilistic automata ⋮ Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study ⋮ Randomized Dining Philosophers without Fairness Assumption ⋮ Fair Termination for Parameterized Probabilistic Concurrent Systems ⋮ Task-structured probabilistic I/O automata ⋮ Quantitative program logic and expected time bounds in probabilistic distributed algorithms.