Lower bounds for distributed coin-flipping and randomized consensus

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1997, Pages 559-568

  Aspnes, James ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION THEORY; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILITY;

COIN FLIPPING GAMES; CONSENSUS; FISCHER LYNCH PATERSON IMPOSSIBILITY PROOF;

GAME THEORY;

EID: 0030713847     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/258533.258649     Document Type: Conference Paper

References (29)