SIGN IN
SIGN UP
The distributed firing squad problem
Full Text:
PDF
Buy this Article
Authors:
B A Coan
Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA
D Dolev
Computer Science Department, Hebrew University, Jerusalem, Israel
C Dwork
Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA
L Stockmeyer
Computer Science Department, IBM Research Laboratory, San Jose, CA
1985 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 10
· Downloads (cumulative): 373
· Citation Count: 7
Published in:
· Proceeding
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Pages 335-345
ACM
New York, NY
, USA
©1985
table of contents
ISBN:0-89791-151-2
doi>
10.1145/22145.22182
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithms
distributed applications
relations among complexity measures
reliability
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