{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:46Z","timestamp":1750220326994,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":98,"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:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["CCF-2118832, CCF-2106827, CSR-1763680, CCF-1716252, CNS-1938709, CCF-1725543"],"award-info":[{"award-number":["CCF-2118832, CCF-2106827, CSR-1763680, CCF-1716252, CNS-1938709, CCF-1725543"]}]},{"name":"Singapore MOE","award":["MOE2018-T2-1-160"],"award-info":[{"award-number":["MOE2018-T2-1-160"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,11]]},"DOI":"10.1145\/3490148.3538573","type":"proceedings-article","created":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T22:10:15Z","timestamp":1657491015000},"page":"119-130","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Contention Resolution for Coded Radio Networks"],"prefix":"10.1145","author":[{"given":"Michael A.","family":"Bender","sequence":"first","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}]},{"given":"Seth","family":"Gilbert","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"given":"Fabian","family":"Kuhn","sequence":"additional","affiliation":[{"name":"University of Freiburg, Freiburg, Germany"}]},{"given":"John","family":"Kuszmaul","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, CT, USA"}]},{"given":"Muriel","family":"M\u00e9dard","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"11","article-title":"IEEE Standard for Information Technology--Telecommunications and Information Exchange Between Systems Local and Metropolitan Area Networks -- Specific Requirements - Part 11","volume":"802","year":"2016","unstructured":"2016 . IEEE Standard for Information Technology--Telecommunications and Information Exchange Between Systems Local and Metropolitan Area Networks -- Specific Requirements - Part 11 : Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications. IEEE Std 802 . 11 -- 2016 (Revision of IEEE Std 802.11--2012) (2016), 1--3534. 2016. IEEE Standard for Information Technology--Telecommunications and Information Exchange Between Systems Local and Metropolitan Area Networks -- Specific Requirements - Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications. IEEE Std 802.11--2016 (Revision of IEEE Std 802.11--2012) (2016), 1--3534.","journal-title":"IEEE Std"},{"key":"e_1_3_2_1_2_1","first-page":"281","article-title":"The ALOHA System - Another Alternative for Computer Communications","volume":"37","author":"Abramson N.","year":"1970","unstructured":"N. Abramson . 1970 . The ALOHA System - Another Alternative for Computer Communications . In Proc. of AFIPS FJCC , Vol. 37. 281 -- 285 . N. Abramson. 1970. The ALOHA System - Another Alternative for Computer Communications. In Proc. of AFIPS FJCC, Vol. 37. 281--285.","journal-title":"Proc. of AFIPS FJCC"},{"volume-title":"The Aloha system","author":"Abramson N.","key":"e_1_3_2_1_3_1","unstructured":"N. Abramson . 1973. The Aloha system . In Computer-Communication Networks, N. Abramson and Frank Kuo (Eds.). Prentice-Hall , Englewood Cliffs , New Jersey, 501--518. N. Abramson. 1973. The Aloha system. In Computer-Communication Networks, N. Abramson and Frank Kuo (Eds.). Prentice-Hall, Englewood Cliffs, New Jersey, 501--518."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1977.1093713"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400239"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057295"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057295"},{"volume-title":"International Colloquium on Structural Information and Communication Complexity","author":"Anantharamu Lakshmi","key":"e_1_3_2_1_8_1","unstructured":"Lakshmi Anantharamu , Bogdan S Chlebus , Dariusz R Kowalski , and Mariusz A Rokicki . 2011. Medium access control for adversarial channels with jamming . In International Colloquium on Structural Information and Communication Complexity . Springer , 89--100. Lakshmi Anantharamu, Bogdan S Chlebus, Dariusz R Kowalski, and Mariusz A Rokicki. 2011. Medium access control for adversarial channels with jamming. In International Colloquium on Structural Information and Communication Complexity. Springer, 89--100."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2018.07.001"},{"volume-title":"Proceedings of the 13th International Conference on Principles of Distributed Systems (OPODIS). 174--188","author":"Anantharamu Lakshmi","key":"e_1_3_2_1_10_1","unstructured":"Lakshmi Anantharamu , Bogdan S. Chlebus , and Mariusz A. Rokicki . 2009. Adversarial Multiple Access Channel with Individual Injection Rates . In Proceedings of the 13th International Conference on Principles of Distributed Systems (OPODIS). 174--188 . Lakshmi Anantharamu, Bogdan S. Chlebus, and Mariusz A. Rokicki. 2009. Adversarial Multiple Access Channel with Individual Injection Rates. In Proceedings of the 13th International Conference on Principles of Distributed Systems (OPODIS). 174--188."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2005.1421925"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.06.020"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9816-x"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a006"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400759"},{"volume-title":"Proc. 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 325--332","author":"Bender Michael A.","key":"e_1_3_2_1_16_1","unstructured":"Michael A. Bender , Martin Farach-Colton , Simai He , Bradley C. Kuszmaul , and Charles E. Leiserson . 2005. Adversarial Contention Resolution for Simple Channels . In Proc. 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 325--332 . Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, and Charles E. Leiserson. 2005. Adversarial Contention Resolution for Simple Channels. In Proc. 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 325--332."},{"key":"e_1_3_2_1_17_1","volume-title":"14th Annual European Symposium, Zurich, Switzerland, September 11--13, 2006, Proceedings. 112--123","author":"Bender Michael A.","year":"2006","unstructured":"Michael A. Bender , Jeremy T. Fineman , and Seth Gilbert . 2006 . Contention Resolution with Heterogeneous Job Sizes. In Algorithms - ESA 2006 , 14th Annual European Symposium, Zurich, Switzerland, September 11--13, 2006, Proceedings. 112--123 . https:\/\/doi.org\/10.1007\/11841036_13 10.1007\/11841036_13 Michael A. Bender, Jeremy T. Fineman, and Seth Gilbert. 2006. Contention Resolution with Heterogeneous Job Sizes. In Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11--13, 2006, Proceedings. 112--123. https:\/\/doi.org\/10.1007\/11841036_13"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_13"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch47"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276769"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384305"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897655"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1158604"},{"key":"e_1_3_2_1_24_1","first-page":"3","article-title":"Performance Analysis of the IEEE 802.11 Distributed Coordination Function","volume":"18","author":"Bianchi Giuseppe","year":"2006","unstructured":"Giuseppe Bianchi . 2006 . Performance Analysis of the IEEE 802.11 Distributed Coordination Function . IEEE Journal on Selected Areas in Communications 18 , 3 (Sept. 2006), 535--547. Giuseppe Bianchi. 2006. Performance Analysis of the IEEE 802.11 Distributed Coordination Function. IEEE Journal on Selected Areas in Communications 18, 3 (Sept. 2006), 535--547.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"volume-title":"Proceedings of the APIPS National Computer Conference. 203--215","author":"Binder R.","key":"e_1_3_2_1_25_1","unstructured":"R. Binder , N. Abramson , F. Kuo , A. Okinaka , and D. Wax . 1975. ALOHA Packet Broadcasting: A Retrospect . In Proceedings of the APIPS National Computer Conference. 203--215 . R. Binder, N. Abramson, F. Kuo, A. Okinaka, and D. Wax. 1975. ALOHA Packet Broadcasting: A Retrospect. In Proceedings of the APIPS National Computer Conference. 203--215."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2007.348337"},{"key":"e_1_3_2_1_27_1","volume-title":"2nd Symposium on Simplicity in Algorithms (SOSA) (OASICS)","volume":"69","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) (OASICS) , Vol. 69 . 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) (OASICS), Vol. 69. 16:1--16:16."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467920"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0169-7552(89)90019-6"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1985.1096245"},{"key":"e_1_3_2_1_31_1","volume-title":"Gianluca De Marco, and Dariusz R. Kowalski","author":"Chlebus Bogdan S.","year":"2016","unstructured":"Bogdan S. Chlebus , Gianluca De Marco, and Dariusz R. Kowalski . 2016 . Scalable Wake-up of Multi-channel Single-hop Radio Networks. Theoretical Computer Science 615, C (Feb . 2016), 23--44. Bogdan S. Chlebus, Gianluca De Marco, and Dariusz R. Kowalski. 2016. Scalable Wake-up of Multi-channel Single-hop Radio Networks. Theoretical Computer Science 615, C (Feb. 2016), 23--44."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_29"},{"volume-title":"Proc. Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing (PODC). 92--101","author":"Chlebus Bogdan S.","key":"e_1_3_2_1_33_1","unstructured":"Bogdan S. Chlebus , Dariusz R. Kowalski , and Mariusz A. Rokicki . 2006. Adversarial queuing on the multiple-access channel . In Proc. Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing (PODC). 92--101 . Bogdan S. Chlebus, Dariusz R. Kowalski, and Mariusz A. Rokicki. 2006. Adversarial queuing on the multiple-access channel. In Proc. Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing (PODC). 92--101."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2071379.2071384"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442726"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS51616.2021.00100"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087831"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3018472"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73951-7_49"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-014-9905-5"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2274264"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933091"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-018-0323-9"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933091"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933110"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/140901.140906"},{"key":"e_1_3_2_1_47_1","unstructured":"Leslie Ann Goldberg. 2000. Notes on Contention Resolution. (2000). http: \/\/www.dcs.warwick.ac.uk\/~leslie\/contention.html  Leslie Ann Goldberg. 2000. Notes on Contention Resolution. (2000). http: \/\/www.dcs.warwick.ac.uk\/~leslie\/contention.html"},{"key":"e_1_3_2_1_48_1","volume-title":"27th International Colloquium (ICALP). 705--716","author":"Goldberg Leslie Ann","year":"2000","unstructured":"Leslie Ann Goldberg , Mark Jerrum , Sampath Kannan , and Mike Paterson . 2000 . A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols. In Automata, Languages and Programming , 27th International Colloquium (ICALP). 705--716 . https:\/\/doi.org\/10.1007\/3--540--45022-X_59 10.1007\/3--540--45022-X_59 Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, and Mike Paterson. 2000. A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols. In Automata, Languages and Programming, 27th International Colloquium (ICALP). 705--716. https:\/\/doi.org\/10.1007\/3--540--45022-X_59"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700381851"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700381851"},{"key":"e_1_3_2_1_51_1","volume-title":"Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers. 26, 4 (Aug","author":"Goldberg Leslie Ann","year":"1997","unstructured":"Leslie Ann Goldberg , Mark Jerrum , Tom Leighton , and Satish Rao . 1997. Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers. 26, 4 (Aug . 1997 ), 1100--1119. Leslie Ann Goldberg, Mark Jerrum, Tom Leighton, and Satish Rao. 1997. Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers. 26, 4 (Aug. 1997), 1100--1119."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1590"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/355541.355567"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/355541.355567"},{"key":"e_1_3_2_1_55_1","volume-title":"An Optical Simulation of Shared Memory. 28, 5 (Oct","author":"Goldberg Leslie Ann","year":"1999","unstructured":"Leslie Ann Goldberg , Yossi Matias , and Satish Rao . 1999. An Optical Simulation of Shared Memory. 28, 5 (Oct . 1999 ), 1829--1847. Leslie Ann Goldberg, Yossi Matias, and Satish Rao. 1999. An Optical Simulation of Shared Memory. 28, 5 (Oct. 1999), 1829--1847."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/44483.44488"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/44483.44488"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/23005.23006"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/3828.214125"},{"key":"e_1_3_2_1_61_1","volume-title":"Interference Cancellation: Better Receivers for a New Wireless MAC. In Hotnets.","author":"Halperin D.","year":"2007","unstructured":"D. Halperin , J. Ammer , T. Anderson , and D. Wetherall . 2007 . Interference Cancellation: Better Receivers for a New Wireless MAC. In Hotnets. D. Halperin, J. Ammer, T. Anderson, and D. Wetherall. 2007. Interference Cancellation: Better Receivers for a New Wireless MAC. In Hotnets."},{"key":"e_1_3_2_1_62_1","volume-title":"Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC), Alfred V. Aho (Ed.). 241--253","author":"H\u00e5stad Johan","year":"1987","unstructured":"Johan H\u00e5stad , Frank Thomson Leighton , and Brian Rogoff . 1987 . Analysis of Backoff Protocols for Multiple Access Channels (Extended Abstract) . In Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC), Alfred V. Aho (Ed.). 241--253 . Johan H\u00e5stad, Frank Thomson Leighton, and Brian Rogoff. 1987. Analysis of Backoff Protocols for Multiple Access Channels (Extended Abstract). In Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC), Alfred V. Aho (Ed.). 241--253."},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792233828"},{"key":"e_1_3_2_1_64_1","series-title":"SIAM J. Comput. 25, 4 (740--774)","volume-title":"Analysis of Backoff Protocols for Multiple Access Channels","author":"Hastad Johan","year":"1996","unstructured":"Johan Hastad , Tom Leighton , and Brian Rogoff . 740--774. Analysis of Backoff Protocols for Multiple Access Channels . SIAM J. Comput. 25, 4 (740--774) , 1996 . Johan Hastad, Tom Leighton, and Brian Rogoff. 740--774. Analysis of Backoff Protocols for Multiple Access Channels. SIAM J. Comput. 25, 4 (740--774), 1996."},{"volume-title":"Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing","author":"Leighton T.","key":"e_1_3_2_1_65_1","unstructured":"T. Leighton , and B. Rogoff . 1987. Analysis of Backoff Protocols for Multiple Access Channels . In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing ( New York, New York, USA) (STOC '87). Association for Computing Machinery, New York, NY, USA, 241--253. https: \/\/doi.org\/10.1145\/28395.28422 10.1145\/28395.28422 T. Leighton, and B. Rogoff. 1987. Analysis of Backoff Protocols for Multiple Access Channels. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing (New York, New York, USA) (STOC '87). Association for Computing Machinery, New York, NY, USA, 241--253. https: \/\/doi.org\/10.1145\/28395.28422"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36136-7_47"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-005-1144-3"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767439"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/1282380.1282425"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159942"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.923722"},{"key":"e_1_3_2_1_72_1","volume-title":"The number of packets transmitted by collision detect random access schemes. The Annals of Probability","author":"Kelly Frank P","year":"1987","unstructured":"Frank P Kelly and Iain M MacPhee . 1987. The number of packets transmitted by collision detect random access schemes. The Annals of Probability ( 1987 ), 1557--1568. Frank P Kelly and Iain M MacPhee. 1987. The number of packets transmitted by collision detect random access schemes. The Annals of Probability (1987), 1557--1568."},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073843"},{"key":"e_1_3_2_1_74_1","volume-title":"Kurose and Keith Ross","author":"James","year":"2002","unstructured":"James F. Kurose and Keith Ross . 2002 . Computer Networking : A Top-Down Approach Featuring the Internet (2nd ed.). Addison-Wesley Longman Publishing Co. , Inc., Boston, MA, USA. James F. Kurose and Keith Ross. 2002. Computer Networking: A Top-Down Approach Featuring the Internet (2nd ed.). Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA."},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1137\/140982763"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.05.014"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2019.00054"},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.08.009"},{"key":"e_1_3_2_1_79_1","first-page":"7","article-title":"Ethernet","volume":"19","author":"Metcalfe Robert M.","year":"1976","unstructured":"Robert M. Metcalfe and David R. Boggs . 1976 . Ethernet : Distributed Packet Switching for Local Computer Networks. Commun. ACM 19 , 7 (July 1976), 395-- 404. Robert M. Metcalfe and David R. Boggs. 1976. Ethernet: Distributed Packet Switching for Local Computer Networks. Commun. ACM 19, 7 (July 1976), 395-- 404.","journal-title":"Distributed Packet Switching for Local Computer Networks. Commun. ACM"},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1985.1096261"},{"key":"e_1_3_2_1_81_1","volume-title":"Sade: competitive MAC under adversarial SINR. Distributed Computing 31, 3 (01","author":"Ogierman Adrian","year":"2018","unstructured":"Adrian Ogierman , Andrea Richa , Christian Scheideler , Stefan Schmid , and Jin Zhang . 2018. Sade: competitive MAC under adversarial SINR. Distributed Computing 31, 3 (01 Jun 2018 ), 241--254. Adrian Ogierman, Andrea Richa, Christian Scheideler, Stefan Schmid, and Jin Zhang. 2018. Sade: competitive MAC under adversarial SINR. Distributed Computing 31, 3 (01 Jun 2018), 241--254."},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-017-0307-1"},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225129"},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795285333"},{"key":"e_1_3_2_1_85_1","volume-title":"Stochastic Contention Resolution With Short Delays. 28, 2 (April","author":"Raghavan Prabhakar","year":"1999","unstructured":"Prabhakar Raghavan and Eli Upfal . 1999. Stochastic Contention Resolution With Short Delays. 28, 2 (April 1999 ), 709--719. Prabhakar Raghavan and Eli Upfal. 1999. Stochastic Contention Resolution With Short Delays. 28, 2 (April 1999), 709--719."},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15763-9_17"},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2011.8"},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332488"},{"key":"e_1_3_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-012-0180-x"},{"key":"e_1_3_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2210241"},{"key":"e_1_3_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1145\/1024916.1024920"},{"key":"e_1_3_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1145\/359038.359044"},{"key":"e_1_3_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.6028\/jres.108.027"},{"key":"e_1_3_2_1_94_1","volume-title":"INFOCOM 2011. 30th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 10--15","author":"Tehrani Arash Saber","year":"2011","unstructured":"Arash Saber Tehrani , Alexandros G. Dimakis , and Michael J. Neely . 2011. SigSag: Iterative detection through soft message-passing . In INFOCOM 2011. 30th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 10--15 April 2011 , Shanghai, China. IEEE, 1017--1025. https:\/\/doi.org\/10.1109\/INFCOM. 2011.5934874 10.1109\/INFCOM.2011.5934874 Arash Saber Tehrani, Alexandros G. Dimakis, and Michael J. Neely. 2011. SigSag: Iterative detection through soft message-passing. In INFOCOM 2011. 30th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 10--15 April 2011, Shanghai, China. IEEE, 1017--1025. https:\/\/doi.org\/10.1109\/INFCOM.2011.5934874"},{"volume-title":"Fundamentals of Wireless Communication","author":"Tse David","key":"e_1_3_2_1_95_1","unstructured":"David Tse and Pramod Viswanath . 2005. Fundamentals of Wireless Communication . Cambridge University Press . David Tse and Pramod Viswanath. 2005. Fundamentals of Wireless Communication. Cambridge University Press."},{"key":"e_1_3_2_1_96_1","first-page":"64","article-title":"Upper Bound on the Capacity of a Random Multiple-Access System","volume":"23","author":"Tsybakov B. S.","year":"1987","unstructured":"B. S. Tsybakov and N. B. Likhanov . 1987 . Upper Bound on the Capacity of a Random Multiple-Access System . Problemy Peredachi Informatsii 23 , 3 (1987), 64 -- 78 . B. S. Tsybakov and N. B. Likhanov. 1987. Upper Bound on the Capacity of a Random Multiple-Access System. Problemy Peredachi Informatsii 23, 3 (1987), 64--78.","journal-title":"Problemy Peredachi Informatsii"},{"key":"e_1_3_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215032"},{"key":"e_1_3_2_1_98_1","first-page":"4","article-title":"Performance Analysis of Priority Schemes for IEEE 802.11 and IEEE 802.11e Wireless LANs. Wireless Communications","volume":"4","author":"Xiao Yang","year":"2005","unstructured":"Yang Xiao . 2005 . Performance Analysis of Priority Schemes for IEEE 802.11 and IEEE 802.11e Wireless LANs. Wireless Communications , IEEE Transactions on 4 , 4 (July 2005), 1506--1515. Yang Xiao. 2005. Performance Analysis of Priority Schemes for IEEE 802.11 and IEEE 802.11e Wireless LANs. Wireless Communications, IEEE Transactions on 4, 4 (July 2005), 1506--1515.","journal-title":"IEEE Transactions on"}],"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.3538573","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538573","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538573","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:08Z","timestamp":1750191128000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538573"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":98,"alternative-id":["10.1145\/3490148.3538573","10.1145\/3490148"],"URL":"https:\/\/doi.org\/10.1145\/3490148.3538573","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"}}]}}