Adversarial contention resolution for simple channels

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Michael A. Bender SUNY Stony Brook, Stony Brook, NY
Martin Farach-Colton Rutgers University, Piscataway, NJ
Simai He SUNY Stony Brook, Stony Brook, NY
Bradley C. Kuszmaul MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA
Charles E. Leiserson MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA
Adversarial contention resolution for simple channels Published by ACM 2005 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 41
· Downloads (cumulative): 336
· Citation Count: 22

Published in:
Cover Image
 
· Proceeding
SPAA '05 Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Pages 325 - 332
ACM New York, NY, USA ©2005
table of contents ISBN:1-58113-986-1 doi>10.1145/1073970.1074023

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder