Achieving optimal backlog in multi-processor cup games-Reference-Cited by-同舟云学术

Achieving optimal backlog in multi-processor cup games

Published:2019-06-23 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Bender Michael A.¹,Farach-Colton Martín²,Kuszmaul William³

Affiliation:

1. Stony Brook University, USA

2. Rutgers University, USA

3. Massachusetts Institute of Technology, USA

Funder

National Science Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3313276.3316342

Reference43 articles.

1. Micah Adler Petra Berenbrink Tom Friedetzky Leslie Ann Goldberg Paul Goldberg and Mike Paterson. 2003. Micah Adler Petra Berenbrink Tom Friedetzky Leslie Ann Goldberg Paul Goldberg and Mike Paterson. 2003.

2. A proportionate fair scheduling rule with good worst-case performance

3. Noga Alon and Joel H Spencer. 2004. Noga Alon and Joel H Spencer. 2004.

4. The probabilistic method. John Wiley & Sons. The probabilistic method. John Wiley & Sons.

5. Improved Dynamic Dictionary Matching

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Perpetual maintenance of machines with different urgency requirements;Journal of Computer and System Sciences;2024-02

2. Fractional Bamboo Trimming and Distributed Windows Scheduling;Lecture Notes in Computer Science;2024

3. Strongly History-Independent Storage Allocation: New Upper and Lower Bounds;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. Balanced Allocations: The Heavily Loaded Case with Deletions;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

5. Bamboo Trimming Revisited;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11