{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:56:49Z","timestamp":1781031409187,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":34,"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\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2221980"],"award-info":[{"award-number":["CCF-2221980"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2446604"],"award-info":[{"award-number":["CCF-2446604"]}],"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":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800797","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"823-834","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Contention Resolution, with and without a Global Clock"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-9273-3460","authenticated-orcid":false,"given":"Zixi","family":"Cai","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-2023-9924","authenticated-orcid":false,"given":"Kuowen","family":"Chen","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-5973-0865","authenticated-orcid":false,"given":"Shengquan","family":"Du","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3525-8314","authenticated-orcid":false,"given":"Tsvi","family":"Kopelowitz","sequence":"additional","affiliation":[{"name":"Bar-Ilan University, Ramat Gan, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0495-3904","authenticated-orcid":false,"given":"Seth","family":"Pettie","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-3497-7450","authenticated-orcid":false,"given":"Ben","family":"Plosk","sequence":"additional","affiliation":[{"name":"Bar-Ilan University, Ramat Gan, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Ullman","author":"Aho Alfred V.","year":"1974","unstructured":"Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. 1974. The design and analysis of computer algorithms. Addison-Wesley, Reading, MA."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057295"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00453-013-9816-X"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2004.1303230"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1074023"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_13"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3662158.3662807"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276769"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384305"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1158604"},{"key":"e_1_3_2_1_11_1","unstructured":"Zixi Cai Kuowen Chen Shengquan Du Tsvi Kopelowitz Seth Pettie and Ben Plosk. 2026. Contention Resolution With and Without a Global Clock. arxiv:2602.12070. arxiv:2602.12070"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056093"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.4230\/OASICS.SOSA.2019.16"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_29"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.384040"},{"key":"e_1_3_2_1_16_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","unstructured":"Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2022. Introduction to Algorithms, 4th ed.. MIT Press.","edition":"4"},{"key":"e_1_3_2_1_17_1","volume-title":"Vazirani","author":"Dasgupta Sanjoy","year":"2006","unstructured":"Sanjoy Dasgupta, Christos H. Papadimitriou, and Umesh V. Vazirani. 2006. Algorithms. McGraw-Hill."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/140982763"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.DISC.2022.17"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2209.14140"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087831"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055349"},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings AFOSR Workshop on Communications Theory Applications","author":"Gallager Robert G.","year":"1978","unstructured":"Robert G. Gallager. 1978. Conflict resolution in random access broadcast networks. In Proceedings AFOSR Workshop on Communications Theory Applications, Provincetown, MA, Sept 17\u201320. 74\u201376."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.JCSS.2025.103638"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/355541.355567"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/23005.23006"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02401833"},{"key":"e_1_3_2_1_28_1","first-page":"63","article-title":"Conflict Resolution in a Multiple Access Channel","volume":"25","author":"Khasin L. S.","year":"1989","unstructured":"L. S. Khasin. 1989. Conflict Resolution in a Multiple Access Channel. Probl. Peredachi Inf. (Problems Inform. Transmission), 25, 4 (1989), 63\u201368.","journal-title":"Probl. Peredachi Inf. (Problems Inform. Transmission)"},{"key":"e_1_3_2_1_29_1","volume-title":"Algorithm Design","author":"Kleinberg Jon","unstructured":"Jon Kleinberg and \u00c9va Tardos. 2005. Algorithm Design. Addison-Wesley, Boston, MA."},{"key":"e_1_3_2_1_30_1","volume-title":"April-June","author":"Knuth Donald E.","year":"1976","unstructured":"Donald E. Knuth. 1976. Big Omicron and Big Omega and Big Theta. SIGACT News, April-June (1976), 18\u201324."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057020"},{"key":"e_1_3_2_1_32_1","first-page":"90","article-title":"Upper bound for the capacity of a random multiple access system","volume":"17","author":"Mikhailov V. A.","year":"1981","unstructured":"V. A. Mikhailov and B. S. Tsybakov. 1981. Upper bound for the capacity of a random multiple access system. Problemy Peredachi Informatsii, 17, 1 (1981), 90\u201395.","journal-title":"Problemy Peredachi Informatsii"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1985.1096261"},{"key":"e_1_3_2_1_34_1","first-page":"32","article-title":"Slotted multiaccess packet broadcasting feedback channel","volume":"14","author":"Tsybakov B. S.","year":"1978","unstructured":"B. S. Tsybakov and V. A. Mikhailov. 1978. Slotted multiaccess packet broadcasting feedback channel. Problemy Peredachi Informatsii, 14, 4 (1978), 32\u201359.","journal-title":"Problemy Peredachi Informatsii"}],"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.3800797","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800797","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:57:26Z","timestamp":1781027846000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800797"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":34,"alternative-id":["10.1145\/3798129.3800797","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800797","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"}}]}}