{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T22:54:04Z","timestamp":1754261644715,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF (National Science Foundation)","award":["1651861, 2318620"],"award-info":[{"award-number":["1651861, 2318620"]}]},{"name":"David & Lucile Packard Foundation Fellowship.","award":[""],"award-info":[{"award-number":[""]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,10]]},"DOI":"10.1145\/3618260.3649720","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"1832-1840","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimal Online Discrepancy Minimization"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-9980-7836","authenticated-orcid":false,"given":"Janardhan","family":"Kulkarni","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-9735-989X","authenticated-orcid":false,"given":"Victor","family":"Reis","sequence":"additional","affiliation":[{"name":"Institute for Advanced Study, Princeton, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-8314-0963","authenticated-orcid":false,"given":"Thomas","family":"Rothvoss","sequence":"additional","affiliation":[{"name":"University of Washington, Seattle, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1006\/jagm.1998.0953"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/3406325.3450994"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1090\/surv"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.19086\/da.3108"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1002\/(SICI)1098-2418(199807)12:4<351::AID-RSA3>3.0.CO;2-S"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1002\/rsa.20373"},{"doi-asserted-by":"crossref","unstructured":"N. Bansal. 2010. Constructive Algorithms for Discrepancy Minimization. In FOCS. 3\u201310.","key":"e_1_3_2_1_7_1","DOI":"10.1109\/FOCS.2010.7"},{"volume-title":"Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach","author":"Bansal Nikhil","unstructured":"Nikhil Bansal, Moses Charikar, Ravishankar Krishnaswamy, and Shi Li. 2014. Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach. In SODA. SIAM, 55\u201371.","key":"e_1_3_2_1_8_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/3188745.3188850"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1137\/1.9781611976465.169"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.4230\/LIPIcs.ITCS.2022.13"},{"key":"e_1_3_2_1_12_1","volume-title":"Online Vector Balancing and Geometric Discrepancy. CoRR, abs\/1912.03350","author":"Bansal Nikhil","year":"2019","unstructured":"Nikhil Bansal, Haotian Jiang, Sahil Singla, and Makrand Sinha. 2019. Online Vector Balancing and Geometric Discrepancy. CoRR, abs\/1912.03350 (2019)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/3519935.3520077"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1002\/rsa.20955"},{"doi-asserted-by":"publisher","unstructured":"F. Barthe O. Gu\u00e9don S. Mendelson and A. Naor. 2005. A probabilistic approach to the geometry of the \u2113 _p^n -ball. Ann. Probab. 33 2 (2005) 03 480\u2013513. https:\/\/doi.org\/10.1214\/009117904000000874 10.1214\/009117904000000874","key":"e_1_3_2_1_15_1","DOI":"10.1214\/009117904000000874"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1016\/0166-218X(81)90022-6"},{"doi-asserted-by":"publisher","unstructured":"A. A. Borovkov and K. A. Borovkov. 2008. Asymptotic Analysis of Random Walks: Heavy-Tailed Distributions. Cambridge University Press. https:\/\/doi.org\/10.1017\/CBO9780511721397 10.1017\/CBO9780511721397","key":"e_1_3_2_1_17_1","DOI":"10.1017\/CBO9780511721397"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1017\/CBO9780511626371"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2016.28"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1002\/rsa.20763"},{"key":"e_1_3_2_1_21_1","volume-title":"Extended Abstracts","author":"Fiat Amos","year":"2015","unstructured":"Amos Fiat, Anna R Karlin, Elias Koutsoupias, Claire Mathieu, and Rotem Zach. 2017. Carpooling in Social Networks. In Extended Abstracts Summer 2015: Strategic Behavior in Combinatorial Structures; Quantitative Finance. Springer, 29\u201334."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1137\/1.9781611977073.57"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.4230\/LIPICS.FSTTCS.2020.23"},{"volume-title":"A Logarithmic Additive Integrality Gap for Bin Packing","author":"Hoberg Rebecca","unstructured":"Rebecca Hoberg and Thomas Rothvoss. 2017. A Logarithmic Additive Integrality Gap for Bin Packing. In SODA. SIAM, 2616\u20132625.","key":"e_1_3_2_1_24_1"},{"unstructured":"Haotian Jiang Janardhan Kulkarni and Sahil Singla. 2019. Online geometric discrepancy for stochastic arrivals with applications to envy minimization. arXiv preprint arXiv:1910.01073.","key":"e_1_3_2_1_25_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1214\/aop\/1024404522"},{"key":"e_1_3_2_1_27_1","volume-title":"Conference on Integer Programming and Combinatorial Optimization.","author":"Levy Avi","year":"2016","unstructured":"Avi Levy, Harishchandra Ramadas, and Thomas Rothvoss. 2016. Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method. In Conference on Integer Programming and Combinatorial Optimization."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.4230\/LIPICS.ITCS.2022.101"},{"doi-asserted-by":"crossref","unstructured":"S. Lovett and R. Meka. 2012. Constructive Discrepancy Minimization by Walking on the Edges. In FOCS. 61\u201367.","key":"e_1_3_2_1_29_1","DOI":"10.1109\/FOCS.2012.23"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1016\/j.jalgor.2004.05.001"},{"unstructured":"Aleksandar Nikolov. 2019. Personal communication.","key":"e_1_3_2_1_31_1"},{"doi-asserted-by":"crossref","unstructured":"Aleksandar Nikolov Kunal Talwar and Li Zhang. 2013. The geometry of differential privacy: the sparse and approximate cases. In STOC. ACM 351\u2013360.","key":"e_1_3_2_1_32_1","DOI":"10.1145\/2488608.2488652"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1002\/rsa.21113"},{"key":"e_1_3_2_1_34_1","volume-title":"On the subspaces of L_p (p>2) spanned by sequences of independent random variables. Israel Journal of Mathematics, 8","author":"Rosenthal Haskell P.","year":"1970","unstructured":"Haskell P. Rosenthal. 1970. On the subspaces of L_p (p>2) spanned by sequences of independent random variables. Israel Journal of Mathematics, 8 (1970)."},{"volume-title":"Approximating Bin Packing within O( olog OPT olog olog OPT) Bins","author":"Rothvo\u00df Thomas","unstructured":"Thomas Rothvo\u00df. 2013. Approximating Bin Packing within O( olog OPT olog olog OPT) Bins. In FOCS. IEEE Computer Society, 20\u201329.","key":"e_1_3_2_1_35_1"},{"volume-title":"Theory of linear and integer programming","author":"Schrijver Alexander","unstructured":"Alexander Schrijver. 1999. Theory of linear and integer programming. Wiley.","key":"e_1_3_2_1_36_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1016\/0095-8956(77)90057-0"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_38_1","DOI":"10.2307\/2000258"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_39_1","DOI":"10.1137\/1.9781611970074"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_40_1","DOI":"10.1017\/9781108231596"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_41_1","DOI":"10.1109\/SFCS.1977.24"}],"event":{"sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"STOC '24","name":"STOC '24: 56th Annual ACM Symposium on Theory of Computing","location":"Vancouver BC Canada"},"container-title":["Proceedings of the 56th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649720","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649720","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:52Z","timestamp":1750291432000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649720"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":41,"alternative-id":["10.1145\/3618260.3649720","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649720","relation":{},"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2024-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}