A lower bound for probabilistic distributed algorithms

Authors:
Jan K. Pachl
Affiliations:
Univ. of Waterloo, Waterloo, Ontario, Canada
Venue:
Journal of Algorithms
Year:
1987

Citing 0
Cited 3

A hundred impossibility proofs for distributed computing

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
On randomization in sequential and distributed algorithms

ACM Computing Surveys (CSUR)
Hundreds of impossibility results for distributed computing

Distributed Computing - Papers in celebration of the 20th anniversary of PODC

Quantified Score

Hi-index	0.00

Visualization

Abstract