SIGACT News Online Algorithms Column 40
-
Published:2023-02-28
Issue:1
Volume:54
Page:90-104
-
ISSN:0163-5700
-
Container-title:ACM SIGACT News
-
language:en
-
Short-container-title:SIGACT News
Author:
Amouzandeh Aflatoun1, Schmitt Soren1, van Stee Rob1
Affiliation:
1. University of Siegen, Germany
Abstract
In this column, we will discuss some papers in online algorithms that appeared in 2022. As usual, we make no claim at complete coverage here, and have instead made a selection. If we have unaccountably missed your favorite paper and you would like to write about it or about any other topic in online algorithms, please don't hesitate to contact us!
Publisher
Association for Computing Machinery (ACM)
Subject
General Materials Science
Reference52 articles.
1. Kunal Agrawal , Michael A. Bender , Rathish Das , William Kuszmaul , Enoch Peserico , and Michele Scquizzato . Tight bounds for parallel paging and green paging. In D´aniel Marx, editor , Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021 , pages 3022 -- 3041 . SIAM, 2021 . Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, and Michele Scquizzato. Tight bounds for parallel paging and green paging. In D´aniel Marx, editor, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021, pages 3022--3041. SIAM, 2021. 2. Kunal Agrawal , Michael A. Bender , Rathish Das , William Kuszmaul , Enoch Peserico , and Michele Scquizzato . Online parallel paging with optimal makespan. In Kunal Agrawal and I-Ting Angelina Lee, editors , SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures , Philadelphia, PA, USA, July 11 - 14 , 2022 , pages 205 -- 216 . ACM, 2022. Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, and Michele Scquizzato. Online parallel paging with optimal makespan. In Kunal Agrawal and I-Ting Angelina Lee, editors, SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, pages 205--216. ACM, 2022. 3. Sara Ahmadian , Hossein Esfandiari , Vahab Mirrokni , and Binghui Peng . Robust load balancing with machine learned advice . In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 20 -- 34 . SIAM, 2022 . Sara Ahmadian, Hossein Esfandiari, Vahab Mirrokni, and Binghui Peng. Robust load balancing with machine learned advice. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 20--34. SIAM, 2022. 4. Fairness in Scheduling 5. Saeed Alaei . Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers. In Rafail Ostrovsky, editor , IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011 , Palm Springs, CA, USA, October 22--25 , 2011 , pages 512 -- 521 . IEEE Computer Society, 2011. Saeed Alaei. Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers. In Rafail Ostrovsky, editor, IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22--25, 2011, pages 512--521. IEEE Computer Society, 2011.
|
|