Randomized function evaluation on a ring

DOI10.1007/BF01784021zbMath0703.68057OpenAlexW2918030272MaRDI QIDQ916384

Elsie Sterbin Gottlieb

Publication date: 1989

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01784021

zbMATH Keywords

randomizationlower boundsdistributed algorithmsnondeterminismcommunication complexityasynchrony

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Communication theory (94A05)

Related Items (3)

Hundreds of impossibility results for distributed computing ⋮ Anonymous wireless rings ⋮ New lower bound techniques for distributed leader finding and other problems on rings of processors

Cites Work

• Symmetry breaking in distributed networks
• Lower Bounds for Distributed Maximum-Finding Algorithms
• A lower bound for probabilistic distributed algorithms
• Computing on an anonymous ring
• The Bit Complexity of Randomized Leader Election on a Ring
• An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
• An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
• Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings
• Unnamed Item

This page was built for publication: Randomized function evaluation on a ring