{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:57:45Z","timestamp":1781031465419,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":61,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800822","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"1104-1115","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Memory Reallocation with Polylogarithmic Overhead"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5264-1772","authenticated-orcid":false,"given":"Ce","family":"Jin","sequence":"first","affiliation":[{"name":"University of California at Berkeley, Berkeley, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00103"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579196"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02189086"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384234"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2021.194.3.5"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112367"},{"key":"e_1_3_2_1_7_1","unstructured":"Michael Bender Alexander Conway Mart\u00edn Farach-Colton Hanna Koml\u00f3s William Kuszmaul and Nicole Wein. 2025. Tight Bounds for Memory Allocation with and without Request Fragmentation. Manuscript"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755589"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00453-014-9930-4"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3070693"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ICALP.2022.19"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.CCC.2025.4"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649719"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.107"},{"key":"e_1_3_2_1_15_1","unstructured":"Bruno Cavalar Mika G\u00f6\u00f6s Artur Riazanov Anastasia Sofronova and Dmitry Sokolov. 2025. Monotone Circuit Complexity of Matching. arXiv preprint arXiv:2507.16105 arxiv:2507.16105."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00453-022-01000-3"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649727"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.171"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS61266.2024.00129"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718281"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978971.132"},{"key":"e_1_3_2_1_22_1","unstructured":"David Conlon Jacob Fox and Huy Tuan Pham. 2021. Subset sums completeness and colorings. arXiv preprint arXiv:2104.14766 arxiv:2104.14766."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.CCC.2025.36"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-35.1.85"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90119-Z"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3626183.3659965"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/256303.256309"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2021.194.2.2"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(93)90367-3"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.TCS.2007.02.047"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220072"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00037-013-0068-6"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1287\/OPRE.1030.0101"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.19086\/aic.24872"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649618"},{"key":"e_1_3_2_1_36_1","unstructured":"Ce Jin. 2026. Memory Reallocation with Polylogarithmic Overhead. arXiv preprint arXiv:2602.15417 arxiv:2602.15417."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00111"},{"key":"e_1_3_2_1_38_1","unstructured":"Wei Quan Lim Seth Gilbert and Wei Zhong Lim. 2015. Dynamic Reallocation Problems in Scheduling. arXiv preprint arXiv:1507.01981 arxiv:1507.01981."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ITCS.2022.104"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.CCC.2019.5"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316323"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/S089548019325647X"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00037-005-0195-9"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380844"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/22M1478112"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1090\/jams\/1028"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.CCC.2018.27"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.19086\/da"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1090\/bull\/1777"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1112\/jlms.70380"},{"key":"e_1_3_2_1_51_1","first-page":"798","article-title":"Lower bounds on the monotone complexity of some Boolean functions","volume":"281","author":"Razborov A. A.","year":"1985","unstructured":"A. A. Razborov. 1985. Lower bounds on the monotone complexity of some Boolean functions. Dokl. Akad. Nauk SSSR, 281, 4 (1985), 798\u2013801. issn:0002-3264","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/321650.321658"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/321832.321846"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1137\/110839059"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1287\/MOOR.1090.0381"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1006\/jnth.1994.1062"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.4064\/aa147-3-7"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-05-00502-3"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","unstructured":"E. Szemer\u00e9di and V. H. Vu. 2006. Finite and infinite arithmetic progressions in sumsets. Ann. of Math. (2) 163 1 (2006) 1\u201335. issn:0003-486X https:\/\/doi.org\/10.4007\/annals.2006.163.1 10.4007\/annals.2006.163.1","DOI":"10.4007\/annals.2006.163.1"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.CCC.2022.2"},{"key":"e_1_3_2_1_61_1","unstructured":"Terence Tao. 2020. The Sunflower lemma via Shannon entropy. What\u2019s New [Terrence Tao Blog] https:\/\/terrytao.wordpress.com\/2020\/07\/20\/the-sunflower-lemma-via-shannon-entropy\/"}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800822","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:02:28Z","timestamp":1781028148000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800822"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":61,"alternative-id":["10.1145\/3798129.3800822","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800822","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}