{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T04:16:52Z","timestamp":1777954612290,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100006374","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172207"],"award-info":[{"award-number":["62172207"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"New Cornerstone Science Foundation"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,16]]},"DOI":"10.1145\/3694906.3743324","type":"proceedings-article","created":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T16:19:56Z","timestamp":1752682796000},"page":"284-298","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Listening Efficient Contention Resolution for Semi-batch Arrivals without Collision Detection"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-8776-6445","authenticated-orcid":false,"given":"Yuntian","family":"Xie","sequence":"first","affiliation":[{"name":"Nanjing University, Nanjing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-2618-687X","authenticated-orcid":false,"given":"Chaodong","family":"Zheng","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China, State Key Laboratory for Novel Software Technology and New Cornerstone Science Laboratory"}]}],"member":"320","published-online":{"date-parts":[[2025,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057295"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830910000796"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Ioana Banicescu Trisha Chakraborty Seth Gilbert and Maxwell Young. 2024. A Survey on Adversarial Contention Resolution. https:\/\/arxiv.org\/abs\/2403.03876","DOI":"10.1145\/3733594"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '05)","author":"Bender Michael A.","unstructured":"Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, and Charles E. Leiserson. 2005. Adversarial contention resolution for simple channels. In Proceedings of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '05). ACM, 325--332."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_13"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3662158.3662807"},{"key":"e_1_3_2_1_7_1","article-title":"Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness","volume":"66","author":"Bender Michael A.","year":"2018","unstructured":"Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, and Maxwell Young. 2018. Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness. J. ACM 66, 1 (2018), 6:1--6:33.","journal-title":"J. ACM"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384305"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897655"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 2nd Symposium on Simplicity in Algorithms (SOSA '19)","author":"Chang Yi-Jun","year":"2019","unstructured":"Yi-Jun Chang, Wenyu Jin, and Seth Pettie. 2019. Simple Contention Resolution via Multiplicative Weight Updates. In Proceedings of the 2nd Symposium on Simplicity in Algorithms (SOSA '19). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 16:1--16:16."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467920"},{"key":"e_1_3_2_1_12_1","unstructured":"Bogdan S. Chlebus. 2017. Randomized Communication in Radio Networks. https:\/\/arxiv.org\/abs\/1801.00074"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/140982763"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1568639"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/355541.355567"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/44483.44488"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490148.3538592"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2022.11.001"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087831"},{"key":"e_1_3_2_1_20_1","first-page":"395","article-title":"Ethernet","volume":"19","author":"Metcalfe Robert","year":"1976","unstructured":"Robert Metcalfe and David R. Boggs. 1976. Ethernet: Distributed Packet Switching for Local Computer Networks. Commun. ACM 19, 7 (1976), 395--404.","journal-title":"Distributed Packet Switching for Local Computer Networks. Commun. ACM"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993838"},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of the 4th International Symposium on Information Processing in Sensor Networks (IPSN '05)","author":"Polastre Joseph","unstructured":"Joseph Polastre, Robert Szewczyk, and David E. Culler. 2005. Telos: enabling ultra-low power wireless research. In Proceedings of the 4th International Symposium on Information Processing in Sensor Networks (IPSN '05). IEEE, 364--369."},{"key":"e_1_3_2_1_23_1","volume-title":"Database management systems (3 ed.)","author":"Ramakrishnan Raghu","unstructured":"Raghu Ramakrishnan and Johannes Gehrke. 2003. Database management systems (3 ed.). McGraw-Hill."},{"key":"e_1_3_2_1_24_1","volume-title":"Tanenbaum and Herbert Bos","author":"Andrew","year":"2015","unstructured":"Andrew S. Tanenbaum and Herbert Bos. 2015. Modern Operating Systems (4 ed.). Pearson."}],"event":{"name":"SPAA '25: 37th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Portland OR USA","acronym":"SPAA '25","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 37th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3694906.3743324","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T19:19:06Z","timestamp":1777922346000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3694906.3743324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,16]]},"references-count":24,"alternative-id":["10.1145\/3694906.3743324","10.1145\/3694906"],"URL":"https:\/\/doi.org\/10.1145\/3694906.3743324","relation":{},"subject":[],"published":{"date-parts":[[2025,7,16]]},"assertion":[{"value":"2025-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}