A lower bound for probabilistic distributed algorithms

DOI10.1016/0196-6774(87)90027-7zbMath0642.68042DBLPjournals/jal/Pachl87OpenAlexW2059198817WikidataQ58329997 ScholiaQ58329997MaRDI QIDQ3783527

Jan K. Pachl

Publication date: 1987

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(87)90027-7

zbMATH Keywords

probabilistic distributed algorithmsasynchronous unidirectional ring configurationmaximum label

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25) Algorithms in computer science (68W99)

Related Items (4)

Randomized function evaluation on a ring ⋮ Hundreds of impossibility results for distributed computing ⋮ Message terminating algorithms for anonymous rings of unknown size ⋮ New lower bound techniques for distributed leader finding and other problems on rings of processors

This page was built for publication: A lower bound for probabilistic distributed algorithms