Proving Time Bounds for Randomized Distributed Algorithms (1994)
by
Nancy Lynch
,
Isaac Saias
,
Roberto Segala
| Venue: | In Proceedings of the 13th Annual ACM Symposium on the Principles of Distributed Computing |
| Citations: | 33 - 10 self |
BibTeX
@INPROCEEDINGS{Lynch94provingtime,
author = {Nancy Lynch and Isaac Saias and Roberto Segala},
title = {Proving Time Bounds for Randomized Distributed Algorithms},
booktitle = {In Proceedings of the 13th Annual ACM Symposium on the Principles of Distributed Computing},
year = {1994},
pages = {314--323},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A method of analyzing time bounds for randomized distributed algorithms is presented, in the context of a new and general framework for describing and reasoning about randomized algorithms. The method consists of proving auxiliary statements of the form U , which means that whenever the algorithm begins in a state in set U , with probability p, it will reach a state in set U within time t.
