Coin Lemmas with Random Variables

This publication has 9 references indexed in Scilit:

• Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
  Distributed Computing, 2000
• The Essence of Coin Lemmas
  Electronic Notes in Theoretical Computer Science, 1999
• Formal verification of timed properties of randomized distributed algorithms
  Published by Association for Computing Machinery (ACM) ,1995
• Proving probabilistic correctness statements
  Published by Association for Computing Machinery (ACM) ,1992
• Bisimulation through probabilistic testing (preliminary report)
  Published by Association for Computing Machinery (ACM) ,1989
• Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
  Published by Association for Computing Machinery (ACM) ,1983
• On the andvantages of free choice
  Published by Association for Computing Machinery (ACM) ,1981
• Denumerable Markov Chains
  Published by Springer Nature ,1976
• Probabilistic automata
  Information and Control, 1963