{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T05:42:36Z","timestamp":1776577356311,"version":"3.51.2"},"reference-count":43,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T00:00:00Z","timestamp":1773878400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2144410"],"award-info":[{"award-number":["CCF-2144410"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-2210300"],"award-info":[{"award-number":["CNS-2210300"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.tcs.2026.115907","type":"journal-article","created":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:40:18Z","timestamp":1774021218000},"page":"115907","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Softening the impact of collisions in contention resolution"],"prefix":"10.1016","volume":"1074","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-2842-5527","authenticated-orcid":false,"given":"Umesh","family":"Biswas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8531-0667","authenticated-orcid":false,"given":"Trisha","family":"Chakraborty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5251-8595","authenticated-orcid":false,"given":"Maxwell","family":"Young","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7503-0445","authenticated-orcid":false,"given":"Qian M.","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115907_bib0001","series-title":"Proceedings of the Fall Joint Computer Conference","first-page":"281","article-title":"The ALOHA system: another alternative for computer communications","author":"Abramson","year":"1970"},{"key":"10.1016\/j.tcs.2026.115907_bib0002","series-title":"Proceedings of the IEEE 18th International Symposium on Network Computing and Applications (NCA)","first-page":"1","article-title":"Broadcasting on adversarial multiple access channels","author":"Aldawsari","year":"2019"},{"key":"10.1016\/j.tcs.2026.115907_bib0003","series-title":"Proceedings IEEE INFOCOM","first-page":"1","article-title":"Deterministic broadcast on multiple access channels","author":"Anantharamu","year":"2010"},{"key":"10.1016\/j.tcs.2026.115907_bib0004","series-title":"Proceedings of the International Colloquium on Structural Information and Communication Complexity","first-page":"89","article-title":"Medium access control for adversarial channels with jamming","author":"Anantharamu","year":"2011"},{"key":"10.1016\/j.tcs.2026.115907_bib0005","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.jcss.2018.07.001","article-title":"Packet latency of deterministic broadcasting in adversarial multiple access channels","volume":"99","author":"Anantharamu","year":"2019","journal-title":"J Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2026.115907_bib0006","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s00446-021-00403-9","article-title":"Windowed backoff algorithms for WiFi: theory and performance under batched arrivals","volume":"34","author":"Anderton","year":"2021","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.tcs.2026.115907_bib0007","series-title":"Proceedings of the 27th ACM Symposium on Principles of Distributed Computing (PODC)","first-page":"45","article-title":"A jamming-resistant MAC protocol for single-hop wireless networks","author":"Awerbuch","year":"2008"},{"key":"10.1016\/j.tcs.2026.115907_bib0008","article-title":"A survey on adversarial contention resolution","volume":"57","author":"Banicescu","year":"2025","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.tcs.2026.115907_bib0009","series-title":"Proceedings of the ACM Symposium on Principles of Distributed Computing","first-page":"53","article-title":"Analyzing contention and backoff in asynchronous shared memory","author":"Ben-David","year":"2017"},{"key":"10.1016\/j.tcs.2026.115907_bib0010","series-title":"Proceedings of the 17Th SPAA","first-page":"325","article-title":"Adversarial contention resolution for simple channels","author":"Bender","year":"2005"},{"key":"10.1016\/j.tcs.2026.115907_bib0011","series-title":"Proceedings of the 14th ESA","first-page":"112","article-title":"Contention resolution with heterogeneous job sizes","author":"Bender","year":"2006"},{"key":"10.1016\/j.tcs.2026.115907_bib0012","series-title":"Proceedings of the 43rd ACM PODC","first-page":"231","article-title":"Fully energy-efficient randomized backoff: slow feedback loops yield fast contention resolution","author":"Bender","year":"2024"},{"key":"10.1016\/j.tcs.2026.115907_bib0013","series-title":"Proceedings of the 43rd ACM PODC","first-page":"231-242","article-title":"Fully energy-efficient randomized backoff: slow feedback loops yield fast contention resolution","author":"Bender","year":"2024"},{"key":"10.1016\/j.tcs.2026.115907_bib0014","doi-asserted-by":"crossref","first-page":"1335","DOI":"10.1137\/24M1670743","article-title":"Jamming-resistant backoff with polylogarithmic sending and listening cost","volume":"54","author":"Bender","year":"2025","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.115907_bib0015","series-title":"Proceedings of the SODA","first-page":"636","article-title":"How to scale exponential backoff: constant throughput, polylog access attempts, and robustness","author":"Bender","year":"2016"},{"key":"10.1016\/j.tcs.2026.115907_bib0016","series-title":"Proceedings of the 34th ACM SPAA","first-page":"119","article-title":"Contention resolution for coded radio networks","author":"Bender","year":"2022"},{"key":"10.1016\/j.tcs.2026.115907_bib0017","series-title":"Proceedings of the 52nd Annual ACM STOC","first-page":"105","article-title":"Contention resolution without collision detection","author":"Bender","year":"2020"},{"key":"10.1016\/j.tcs.2026.115907_bib0018","series-title":"Proceedings of the 48th STOC","first-page":"499","article-title":"Contention resolution with log-logstar channel accesses","author":"Bender","year":"2016"},{"key":"10.1016\/j.tcs.2026.115907_bib0019","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1109\/49.840210","article-title":"Performance analysis of the IEEE 802.11 distributed coordination function","volume":"18","author":"Bianchi","year":"2000","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"10.1016\/j.tcs.2026.115907_bib0020","series-title":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","first-page":"398","article-title":"Softening the impact of collisions in contention resolution","author":"Biswas","year":"2024"},{"key":"10.1016\/j.tcs.2026.115907_bib0021","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/363647.363659","article-title":"Adversarial queuing theory","volume":"48","author":"Borodin","year":"2001","journal-title":"J. ACM (JACM)"},{"key":"10.1016\/j.tcs.2026.115907_bib0022","series-title":"Proceedings of the SOSA","first-page":"16:1","article-title":"Simple contention resolution via multiplicative weight updates","author":"Chang","year":"2019"},{"key":"10.1016\/j.tcs.2026.115907_bib0023","series-title":"Proceedings of the ACM Symposium on Principles of Distributed Computing","first-page":"139","article-title":"Tight trade-off in contention resolution without collision detection","author":"Chen","year":"2021"},{"key":"10.1016\/j.tcs.2026.115907_bib0024","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/978-1-4615-0013-1_11","article-title":"Randomized communication in radio networks","volume":"1","author":"Chlebus","year":"2001","journal-title":"Handb. Randomized Comput."},{"key":"10.1016\/j.tcs.2026.115907_bib0025","series-title":"Proceedings of the SSS","first-page":"124","article-title":"Stability of the multiple-access channel under maximum broadcast loads","author":"Chlebus","year":"2007"},{"key":"10.1016\/j.tcs.2026.115907_bib0026","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s00446-009-0086-4","article-title":"Maximum throughput of multiple access channels in adversarial environments","volume":"22","author":"Chlebus","year":"2009","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.tcs.2026.115907_bib0027","series-title":"Proceedings of the ACM Symposium on Principles of Distributed Computing","first-page":"391","article-title":"Asynchronous shared channel","author":"De Marco","year":"2017"},{"key":"10.1016\/j.tcs.2026.115907_bib0028","series-title":"Concentration of Measure for the Analysis of Randomized Algorithms","author":"Dubhashi","year":"2009"},{"key":"10.1016\/j.tcs.2026.115907_bib0029","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1145\/268999.269000","article-title":"Contention in shared memory algorithms","volume":"44","author":"Dwork","year":"1997","journal-title":"J. ACM (JACM)"},{"key":"10.1016\/j.tcs.2026.115907_bib0030","series-title":"An Introduction to Probability Theory and Its Applications","volume":"1","author":"Feller","year":"1968"},{"key":"10.1016\/j.tcs.2026.115907_bib0031","series-title":"Proceedings of the ACM Symposium on Principles of Distributed Computing","first-page":"175","article-title":"Contention resolution on multiple channels with collision detection","author":"Fineman","year":"2016"},{"key":"10.1016\/j.tcs.2026.115907_bib0032","series-title":"Proceedings of the 4th Annual SPAA","first-page":"41","article-title":"Efficient optical communication in parallel computers","author":"Ger\u00e9b-Graus","year":"1992"},{"key":"10.1016\/j.tcs.2026.115907_bib0033","unstructured":"M. Goemans, 2015. Chernoff bounds, and some applications, https:\/\/math.mit.edu\/~goemans\/18310S15\/chernoff-notes.pdf (viewed May 2024)."},{"key":"10.1016\/j.tcs.2026.115907_bib0034","series-title":"Proceedings of the 26th Annual FOCS","first-page":"241","article-title":"Randomized routing on fat-trees","author":"Greenberg","year":"1985"},{"key":"10.1016\/j.tcs.2026.115907_bib0035","series-title":"Proceedings of the 8th Annual International Conference (COCOON)","first-page":"279","article-title":"Energy-efficient size approximation of radio networks with no collision detection","author":"Jurdzi\u0144ski","year":"2002"},{"key":"10.1016\/j.tcs.2026.115907_bib0036","series-title":"Markov Chains and Mixing Times","volume":"107","author":"Levin","year":"2017"},{"key":"10.1016\/j.tcs.2026.115907_bib0037","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1145\/360248.360253","article-title":"Ethernet: distributed packet switching for local computer networks","volume":"19","author":"Metcalfe","year":"1976","journal-title":"CACM"},{"key":"10.1016\/j.tcs.2026.115907_bib0038","series-title":"Proceedings of IEEE INFOCOM","first-page":"2751","article-title":"Competitive MAC under adversarial SINR","author":"Ogierman","year":"2014"},{"key":"10.1016\/j.tcs.2026.115907_bib0039","series-title":"2014 Sixth COMSNETS","first-page":"1","article-title":"An information theoretic point of view to contention resolution","author":"Ramaiyan","year":"2014"},{"key":"10.1016\/j.tcs.2026.115907_bib0040","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1109\/TNET.2012.2210241","article-title":"An efficient and fair MAC protocol robust to reactive interference","volume":"21","author":"Richa","year":"2013","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.tcs.2026.115907_bib0041","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s00446-012-0180-x","article-title":"Competitive throughput in multi-hop wireless networks despite adaptive jamming","volume":"26","author":"Richa","year":"2013","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.tcs.2026.115907_bib0042","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1137\/0215032","article-title":"Log-logarithmic selection resolution protocols in a multiple access channel","volume":"15","author":"Willard","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.115907_bib0043","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/COMST.2006.323440","article-title":"Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges","volume":"8","author":"Zhang","year":"2006","journal-title":"IEEE Commun. Surv. Tutorials"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001660?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001660?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T05:06:17Z","timestamp":1776575177000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526001660"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":43,"alternative-id":["S0304397526001660"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115907","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Softening the impact of collisions in contention resolution","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115907","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115907"}}