Proving Time Bounds for Randomized Distributed Algorithms
[LSS94] N. Lynch, I. Saias and R. Segala. Proving Time Bounds for Randomized Distributed Algorithms. In Proc. 13th Annual ACM Symposium on Principles of Distributed Computing (PODC'94), pages 314--323, ACM Press. 1994. bib
- Downloads
BibTeX
- Search for this paper
- Google · Google Scholar