{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:22:05Z","timestamp":1777965725799,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T00:00:00Z","timestamp":1626825600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the National Natural Science Foundation of China (NSFC)","award":["No.: 61702255 and 61672275"],"award-info":[{"award-number":["No.: 61702255 and 61672275"]}]},{"name":"the Ministry of Science and Technology of China","award":["No.: 2018YFB1003202"],"award-info":[{"award-number":["No.: 2018YFB1003202"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,21]]},"DOI":"10.1145\/3465084.3467920","type":"proceedings-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T21:09:28Z","timestamp":1627074568000},"page":"139-149","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Tight Trade-off in Contention Resolution without Collision Detection"],"prefix":"10.1145","author":[{"given":"Haimin","family":"Chen","sequence":"first","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yonggang","family":"Jiang","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chaodong","family":"Zheng","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400239"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057295"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2018.07.001"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400759"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1074023"},{"key":"e_1_3_2_2_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 , Vol. 66 , 1 (2018). Michael Bender, Jeremy Fineman, Seth Gilbert, and Maxwell Young. 2018. Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness. J. ACM, Vol. 66, 1 (2018).","journal-title":"J. ACM"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897655"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384305"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1979.1094298"},{"key":"e_1_3_2_2_10_1","volume-title":"2nd Symposium on Simplicity in Algorithms (SOSA '19)","author":"Chang Yi-Jun","year":"2018","unstructured":"Yi-Jun Chang , Wenyu Jin , and Seth Pettie . 2018 . 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. 2018. 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_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_29"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2071379.2071384"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087831"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582749"},{"key":"e_1_3_2_2_15_1","volume-title":"Concentration of measure for the analysis of randomized algorithms","author":"Dubhashi Devdatt","unstructured":"Devdatt Dubhashi and Alessandro Panconesi . 2009. Concentration of measure for the analysis of randomized algorithms . Cambridge University Press . Devdatt Dubhashi and Alessandro Panconesi. 2009. Concentration of measure for the analysis of randomized algorithms. Cambridge University Press."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28422"},{"key":"e_1_3_2_2_17_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_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2019.00054"},{"key":"e_1_3_2_2_19_1","first-page":"395","article-title":"Ethernet","volume":"19","author":"Metcalfe Robert","year":"1976","unstructured":"Robert Metcalfe and David Boggs . 1976 . Ethernet : Distributed Packet Switching for Local Computer Networks. Commun. ACM , Vol. 19 , 7 (1976), 395 -- 404 . Robert Metcalfe and David Boggs. 1976. Ethernet: Distributed Packet Switching for Local Computer Networks. Commun. ACM, Vol. 19, 7 (1976), 395--404.","journal-title":"Distributed Packet Switching for Local Computer Networks. Commun. ACM"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225129"},{"key":"e_1_3_2_2_21_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_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15763-9_17"},{"key":"e_1_3_2_2_23_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_2_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215032"}],"event":{"name":"PODC '21: ACM Symposium on Principles of Distributed Computing","location":"Virtual Event Italy","acronym":"PODC '21","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467920","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465084.3467920","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:25Z","timestamp":1750191505000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467920"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,21]]},"references-count":24,"alternative-id":["10.1145\/3465084.3467920","10.1145\/3465084"],"URL":"https:\/\/doi.org\/10.1145\/3465084.3467920","relation":{},"subject":[],"published":{"date-parts":[[2021,7,21]]},"assertion":[{"value":"2021-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}