ACM - Normas
Sungjin Im
Nathaniel Kell
Debmalya Panigrahi
Maryam Shadloo
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018
Improved Bound for the On-line Scheduling Problem
The Moser-Tardos Framework with Partial Resampling
fair allocation of multiple resource types, Proceedings of the 8th USENIX conference on Networked systems design and implementation, March 30-April 01, 2011, Boston, MA
allocating divisible items without payments, Proceedings of the fourteenth ACM conference on Electronic commerce, June 16-20, 2013, Philadelphia, Pennsylvania, USA [doi10
Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices
Tight Bounds for Online Vector Scheduling