SIGN IN
SIGN UP
The wakeup problem
Full Text:
PDF
Buy this Article
Authors:
M. J. Fischer
Computer Science Department, Yale University, New Haven, CT
S. Moran
Computer Science Department, Technion, Haifa 32000, Israel
S. Rudich
Computer Science Department, Carnegie Mellon University, Pittsburgh, PA
G. Taubenfeld
Computer Science Department, Yale University, New Haven, CT
1990 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 8
· Downloads (cumulative): 414
· Citation Count: 8
Published in:
· Proceeding
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Pages 106-116
ACM
New York, NY
, USA
©1990
table of contents
ISBN:0-89791-361-2
doi>
10.1145/100216.100228
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
computations on discrete structures
parallelism and concurrency
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