SIGN IN
SIGN UP
Easy impossibility proofs for distributed consensus problems
Full Text:
PDF
Buy this Article
Authors:
Michael J. Fischer
Yale University, New Haven, CT
Nancy A. Lynch
Mass. Inst. of Tech., Cambridge, MA
Michael Merritt
AT&T Bell Labs., Murray Hill, NJ and Mass. Inst. of Tech., Cambridge, MA
Published in:
· Proceeding
PODC '85
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Pages 59-70
ACM
New York, NY
, USA
©1985
table of contents
ISBN:0-89791-168-7
doi>
10.1145/323596.323602
1985 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 16
· Downloads (cumulative): 586
· Citation Count: 13
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:
design
distributed databases
distributed systems
measurement
performance
proof theory
theory
verification
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