{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T04:24:07Z","timestamp":1752985447983,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100008048","name":"Nanjing University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008048","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.3538592","type":"proceedings-article","created":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T22:10:15Z","timestamp":1657491015000},"page":"107-118","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Robust and Optimal Contention Resolution without Collision Detection"],"prefix":"10.1145","author":[{"given":"Yonggang","family":"Jiang","sequence":"first","affiliation":[{"name":"Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"}]},{"given":"Chaodong","family":"Zheng","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}]}],"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\/3350755.3400239"},{"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.1016\/j.jcss.2018.07.001"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400759"},{"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","article-title":"Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness","volume":"66","author":"Bender Michael","year":"2018","unstructured":"Michael Bender , Jeremy Fineman , Seth Gilbert , and Maxwell Young . 2018 . Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness . J. ACM 66 , 1 (2018), 33 pages. Michael Bender, Jeremy Fineman, Seth Gilbert, and Maxwell Young. 2018. Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness. J. ACM 66, 1 (2018), 33 pages.","journal-title":"J. ACM"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384305"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897655"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1540666.1541119"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212774"},{"key":"e_1_3_2_1_11_1","volume-title":"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 2nd Symposium on Simplicity in Algorithms (SOSA '19) . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 16:1--16:16. Yi-Jun Chang, Wenyu Jin, and Seth Pettie. 2019. Simple Contention Resolution via Multiplicative Weight Updates. In 2nd Symposium on Simplicity in Algorithms (SOSA '19). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 16:1--16:16."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341111"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467920"},{"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\/3087801.3087831"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582749"},{"volume-title":"Proceedings of 2010 International Symposium on Distributed Computing (DISC '10)","author":"Gilbert Seth","key":"e_1_3_2_1_17_1","unstructured":"Seth Gilbert and Dariusz R. Kowalski . 2010. Trusted Computing for Fault-Prone Wireless Networks . In Proceedings of 2010 International Symposium on Distributed Computing (DISC '10) . Springer Berlin Heidelberg, 359--373. Seth Gilbert and Dariusz R. Kowalski. 2010. Trusted Computing for Fault-Prone Wireless Networks. In Proceedings of 2010 International Symposium on Distributed Computing (DISC '10). Springer Berlin Heidelberg, 359--373."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/355541.355567"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/44483.44488"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28422"},{"key":"e_1_3_2_1_21_1","volume-title":"Computer Networking: A Top-Down Approach","author":"Kurose James","year":"2017","unstructured":"James Kurose and Keith Ross . 2017 . Computer Networking: A Top-Down Approach , 7 th Edition. Pearson . James Kurose and Keith Ross. 2017. Computer Networking: A Top-Down Approach, 7th Edition. Pearson.","edition":"7"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2019.00054"},{"volume-title":"Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis","author":"Mitzenmacher Michael","key":"e_1_3_2_1_23_1","unstructured":"Michael Mitzenmacher and Eli Upfal . 2017. Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis . Cambridge University Press . Michael Mitzenmacher and Eli Upfal. 2017. Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis. Cambridge University Press."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993838"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPSN.2005.1440950"},{"key":"e_1_3_2_1_26_1","volume-title":"Database Management Systems","author":"Ramakrishnan Raghu","unstructured":"Raghu Ramakrishnan and Johannes Gehrke . 2002. Database Management Systems , 3 rd Edition. McGraw-Hill . Raghu Ramakrishnan and Johannes Gehrke. 2002. Database Management Systems, 3rd Edition. McGraw-Hill.","edition":"3"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15763-9_17"},{"key":"e_1_3_2_1_28_1","volume-title":"Modern Operating Systems","author":"Tanenbaum Andrew","unstructured":"Andrew Tanenbaum and Herbert Bos . 2014. Modern Operating Systems , 4 th Edition. Pearson . Andrew Tanenbaum and Herbert Bos. 2014. Modern Operating Systems, 4th Edition. Pearson.","edition":"4"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215032"}],"event":{"name":"SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures","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"],"location":"Philadelphia PA USA","acronym":"SPAA '22"},"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.3538592","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538592","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.3538592"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":29,"alternative-id":["10.1145\/3490148.3538592","10.1145\/3490148"],"URL":"https:\/\/doi.org\/10.1145\/3490148.3538592","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"}}]}}