SIGN IN
SIGN UP
Compatible sequences and a slow Winkler percolation
Full Text:
Pdf
Buy this Article
Author:
Peter Gács
Boston University, Computer Science Department, 111 Cummington Street, Boston, MA
Published in:
· Proceeding
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
ACM
New York, NY
, USA
©2001
table of contents
ISBN:1-58113-349-9
doi>
10.1145/380752.380874
2001 Article
Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 8
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'12
Share:
|
Tags:
dependent percolation
distributed computing
measurement
performance
scheduling
scheduling
sequencing and scheduling
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