Adversarial queueing theory

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Allan Borodin Department of Computer Science, University of Toronto, Toronto, Canada M5S 1A4
Jon Kleinberg Laboratory for Computer Science, MIT, Cambridge, MA
Prabhakar Raghavan IBM Almaden Research Center, 650 Harry Road, San Jose, CA
Madhu Sudan IBM T.J. Watson Research Center, Box 218, Yorktown Heights, NY
David P. Williamson IBM T.J. Watson Research Center, Box 218, Yorktown Heights, NY
Adversarial queueing theory Published by ACM 1996 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 11
· Downloads (cumulative): 427
· Citation Count: 49

Published in:
Cover Image
 
· Proceeding
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Pages 376-385
ACM New York, NY, USA ©1996
table of contents ISBN:0-89791-785-5 doi>10.1145/237814.237984

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