8 citations · 9 across the 3 of their papers we have counts for
3 papers
math.CO1994★ 8 cited
Proving time bounds for randomized distributed algorithms
Nancy Lynch, Isaac Saias, Roberto Segala
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 al…
math.CO1994
Number of faults a system can withstand without repairs
Michel Goemans, Nancy Lynch, Isaac Saias
We consider the following scheduling problem. A system is composed of processors drawn from a pool of . The processors can become faulty while in operation and faulty proces…
math.CO1994★ 1 cited
Proving probabilistic correctness statements: the case of Rabin's algorithm for mutual exclusion
Isaac Saias
The correctness of most randomized distributed algorithms is expressed by a statement of the form ``some predicate of the executions holds with high probability, regardless of the…