SIGN IN
SIGN UP
Byzantine agreement with homonyms
Full Text:
PDF
Buy this Article
Authors:
Carole Delporte-Gallet
University Paris Diderot, Paris, France
Hugues Fauconnier
University Paris Diderot, Paris, France
Rachid Guerraoui
Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
Anne-Marie Kermarrec
INRIA Rennes-Bretagne Atlantique, Rennes, France
Eric Ruppert
York University, Toronto, ON, Canada
Hung Tran-The
University Paris Diderot, Paris, France
2011 Article
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 74
· Downloads (cumulative): 167
· Citation Count: 4
Published in:
· Proceeding
PODC '11
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Pages 21-30
ACM
New York, NY
, USA
©2011
table of contents
ISBN: 978-1-4503-0719-2
doi>
10.1145/1993806.1993810
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
PODC '13
Share:
|
Tags:
agreement
algorithms
byzantine failures
consensus
distributed programming
identifiers
lower bounds
reliability
synchrony
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder