{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:46:55Z","timestamp":1770994015808,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T00:00:00Z","timestamp":1657497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CNS-1938709, CCF-2106827"],"award-info":[{"award-number":["CNS-1938709, CCF-2106827"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,11]]},"DOI":"10.1145\/3490148.3538580","type":"proceedings-article","created":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T22:10:15Z","timestamp":1657491015000},"page":"411-417","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Bamboo Trimming Revisited"],"prefix":"10.1145","author":[{"given":"John","family":"Kuszmaul","sequence":"first","affiliation":[{"name":"Yale University, New Haven, CT, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777430"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1090"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/110836377"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-005-1190-x"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-002-0085-1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01940883"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPPS.1995.395946"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.40"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316342"},{"key":"e_1_3_2_1_10_1","first-page":"2059","volume-title":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021","author":"Bender M. A.","year":"2021","unstructured":"M. A. Bender and W. Kuszmaul, Randomized cup game algorithms against strong adversaries , in Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021 , D. Marx, ed., SIAM , 2021 , pp. 2059 -- 2077 . M. A. Bender andW. Kuszmaul, Randomized cup game algorithms against strong adversaries, in Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021, D. Marx, ed., SIAM, 2021, pp. 2059--2077."},{"key":"e_1_3_2_1_11_1","volume-title":"Theoretical Computer Science","author":"Bil\u00f2 D.","year":"2022","unstructured":"D. Bil\u00f2 , L. Gual\u00e0 , S. Leucci , G. Proietti , and G. Scornavacca , Cutting bamboo down to size , Theoretical Computer Science , ( 2022 ). D. Bil\u00f2, L. Gual\u00e0, S. Leucci, G. Proietti, and G. Scornavacca, Cutting bamboo down to size, Theoretical Computer Science, (2022)."},{"key":"e_1_3_2_1_12_1","unstructured":"F. Della Croce An enhanced pinwheel algorithm for the bamboo garden trimming problem arXiv preprint arXiv:2003.12460 (2020).  F. Della Croce An enhanced pinwheel algorithm for the bamboo garden trimming problem arXiv preprint arXiv:2003.12460 (2020)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28434"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/127787.127809"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.3390\/a12040074"},{"key":"e_1_3_2_1_16_1","first-page":"160","volume-title":"CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings, F. Cicalese, E. Porat, and U. Vaccaro, eds.","volume":"9133","author":"Fischer J.","year":"2015","unstructured":"J. Fischer and P. Gawrychowski , Alphabet-dependent string searching with wexponential search trees, in Combinatorial Pattern Matching - 26th Annual Symposium , CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings, F. Cicalese, E. Porat, and U. Vaccaro, eds. , vol. 9133 of Lecture Notes in Computer Science, Springer , 2015 , pp. 160 -- 171 . J. Fischer and P. Gawrychowski, Alphabet-dependent string searching with wexponential search trees, in Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings, F. Cicalese, E. Porat, and U. Vaccaro, eds., vol. 9133 of Lecture Notes in Computer Science, Springer, 2015, pp. 160--171."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-5316(93)90033-Q"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-51963-0_18"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753171.1753195"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03841-4_23"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2012.305"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.79"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.96"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451033"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1073982"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-008-9134-x"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/3118782.3119217"},{"key":"e_1_3_2_1_28_1","first-page":"1969","article-title":"Scheduling algorithms for multiprocessors in a hard real-time environment","author":"Liu C. L.","year":"1969","unstructured":"C. L. Liu , Scheduling algorithms for multiprocessors in a hard real-time environment , JPL Space Programs Summary , 1969 , ( 1969 ). C. L. Liu, Scheduling algorithms for multiprocessors in a hard real-time environment, JPL Space Programs Summary, 1969, (1969).","journal-title":"JPL Space Programs Summary"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/321738.321743"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/827271.829072"},{"key":"e_1_3_2_1_31_1","first-page":"618","volume-title":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12--14, 2003","author":"Mortensen C. W.","year":"2003","unstructured":"C. W. Mortensen , Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time , in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12--14, 2003 , Baltimore, Maryland, USA, ACM\/SIAM , 2003 , pp. 618 -- 627 . C. W. Mortensen, Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time, in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12--14, 2003, Baltimore, Maryland, USA, ACM\/SIAM, 2003, pp. 618--627."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1356999"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2021.07.001"}],"event":{"name":"SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Philadelphia PA USA","acronym":"SPAA '22","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"]},"container-title":["Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538580","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538580","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538580","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:10Z","timestamp":1750186930000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538580"}},"subtitle":["Simple Algorithms Can Do Well Too"],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":33,"alternative-id":["10.1145\/3490148.3538580","10.1145\/3490148"],"URL":"https:\/\/doi.org\/10.1145\/3490148.3538580","relation":{},"subject":[],"published":{"date-parts":[[2022,7,11]]},"assertion":[{"value":"2022-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}