Coin Lemmas with Random Variables
Authors:
- 30 August 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 71-86
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case studyDistributed Computing, 2000
- The Essence of Coin LemmasElectronic Notes in Theoretical Computer Science, 1999
- Formal verification of timed properties of randomized distributed algorithms1995
- Proving probabilistic correctness statements1992
- Bisimulation through probabilistic testing (preliminary report)1989
- Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols1983
- On the andvantages of free choice1981
- Denumerable Markov Chains1976
- Probabilistic automataInformation and Control, 1963