SIGN IN
SIGN UP
Brief announcement: 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
2010 Article
Short paper
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 12
· Downloads (cumulative): 75
· Citation Count: 1
Published in:
· Proceeding
SPAA '10
Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures
Pages 74-75
ACM
New York, NY
, USA
©2010
table of contents
ISBN: 978-1-4503-0079-7
doi>
10.1145/1810479.1810494
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SPAA '13
Share:
|
Tags:
algorithms
authentication
byzantine agreement
consensus
fault tolerance
message-passing
reliability
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