Balanced allocations: the heavily loaded case

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Petra Berenbrink Department of Mathematics and Computer Science, University of Paderborn, Germany
Artur Czumaj Department of Computer and Information Science, New Jersey, Institute of Technology
Angelika Steger Department of Computer Science, Technische Universität, München, Germany
Berthold Vöcking University of Massachusetts, Amherst
Balanced allocations: the heavily loaded case Published by ACM 2000 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 23
· Downloads (cumulative): 414
· Citation Count: 31

Published in:
Cover Image
 
· Proceeding
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Pages 745-754
ACM New York, NY, USA ©2000
table of contents ISBN:1-58113-184-4 doi>10.1145/335305.335411

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