Tight lower bounds for probabilistic solitude verification on anonymous rings

DOI10.1145/174652.174656zbMath0806.68038OpenAlexW2039349963MaRDI QIDQ4299009

No author found.

Publication date: 29 June 1994

Published in: Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

bit complexityasynchronous unidirectional rings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Related Items (2)

Hundreds of impossibility results for distributed computing ⋮ Computing on Anonymous Quantum Network

This page was built for publication: Tight lower bounds for probabilistic solitude verification on anonymous rings