"Optimal Time Randomized Consensus - Making Resilient Algorithms Fast in ..."

Michael E. Saks, Nir Shavit, Heather Woll (1991)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2012-12-07

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/soda/SaksSW91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/SaksSW91
Michael E. Saks, Nir Shavit, Heather Woll:
Optimal Time Randomized Consensus - Making Resilient Algorithms Fast in Practice. SODA 1991: 351-362

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.