{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T16:08:12Z","timestamp":1788278892002,"version":"build-2803163510"},"reference-count":203,"publisher":"Association for Computing Machinery (ACM)","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"abstract":"<jats:p>Contention resolution addresses the challenge of coordinating access by multiple processes to a shared resource such as memory, disk storage, or a communication channel. Originally spurred by challenges in database systems and bus networks, contention resolution has endured as an important abstraction for resource sharing, despite decades of technological change. Here, we survey the literature on resolving worst-case contention, where the number of processes and the time at which each process may start seeking access to the resource is dictated by an adversary. We also highlight the evolution of contention resolution, where new concerns\u2014such as security, quality of service, and energy efficiency\u2014are motivated by modern systems. These efforts have yielded insights into the limits of randomized and deterministic approaches, as well as the impact of different model assumptions such as global clock synchronization, knowledge of the number of processors, feedback from access attempts, and attacks on the availability of the shared resource.<\/jats:p>","DOI":"10.1145\/3733594","type":"journal-article","created":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T11:24:22Z","timestamp":1746012262000},"update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["A Survey on Adversarial Contention Resolution"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5206-1436","authenticated-orcid":false,"given":"Ioana","family":"Banicescu","sequence":"first","affiliation":[{"name":"Mississippi State University,  Mississippi State, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8531-0667","authenticated-orcid":false,"given":"Trisha","family":"Chakraborty","sequence":"additional","affiliation":[{"name":"Amazon Web Services,  Minneapolis, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3298-7412","authenticated-orcid":false,"given":"Seth","family":"Gilbert","sequence":"additional","affiliation":[{"name":"National University of Singapore,  Singapore Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5251-8595","authenticated-orcid":false,"given":"Maxwell","family":"Young","sequence":"additional","affiliation":[{"name":"Mississippi State University,  Mississippi State, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,4,30]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/5GWF.2019.8911626"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1478462.1478502"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1977.1093713"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057021"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400239"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2019.8935052"},{"key":"e_1_2_2_7_1","series-title":"Wiley Series in Discrete Mathematics and Optimization","volume-title":"The Probabilistic Method","author":"Spencer Alon","year":"2016","unstructured":"N.\u00a0Alon and J.H. Spencer. The Probabilistic Method. Wiley Series in Discrete Mathematics and Optimization. 2016."},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90015-W"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.03.034"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462256"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22212-2_9"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2018.07.001"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10877-8_15"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-016-9725-x"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.80120"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-021-00403-9"},{"key":"e_1_2_2_17_1","first-page":"194","volume-title":"Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","author":"C.","year":"2017","unstructured":"William\u00a0C. Anderton and Maxwell Young. Is our model for contention resolution wrong?: Confronting the cost of collisions. In Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 183\u2013194, 2017."},{"key":"e_1_2_2_18_1","volume-title":"Universal-stability results and performance bounds for greedy contention-resolution protocols. Journal of the ACM (JACM), 48(1):39\u201369","author":"Andrews Matthew","year":"2001","unstructured":"Matthew Andrews, Baruch Awerbuch, Antonio Fern\u00e1ndez, Tom Leighton, Zhiyong Liu, and Jon Kleinberg. Universal-stability results and performance bounds for greedy contention-resolution protocols. Journal of the ACM (JACM), 48(1):39\u201369, 2001."},{"key":"e_1_2_2_19_1","volume-title":"Interrupted service: Priest fed up with mobile phones ringing during mass installs jamming device to stop calls and texts coming through in church","author":"Annabel\u00a0Grossman Daily\u00a0Mail","year":"2014","unstructured":"Daily\u00a0Mail Annabel\u00a0Grossman. Interrupted service: Priest fed up with mobile phones ringing during mass installs jamming device to stop calls and texts coming through in church, 2014. https:\/\/www.dailymail.co.uk\/news\/article-2876243\/Priest-fed-mobile-phones-ringing-Mass-installs-jamming-device.html."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.06.020"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14031-0_41"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCWC47524.2020.9031175"},{"key":"e_1_2_2_23_1","first-page":"220","volume-title":"Peter Martini. Simulative Evaluation of Adaptive Jamming Detection in Wireless Multi-hop Networks. In Proceedings of the International Conference on Distributed Computing Systems Workshops","author":"Aschenbruck Nils","year":"2010","unstructured":"Nils Aschenbruck, Elmar Gerhards-Padilla, and Peter Martini. Simulative Evaluation of Adaptive Jamming Detection in Wireless Multi-hop Networks. In Proceedings of the International Conference on Distributed Computing Systems Workshops, pages 213\u2013220, 2010."},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400759"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2635818"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(92)90042-H"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.183"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087828"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1074023"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_13"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3662158.3662807"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch47"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276769"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2818936.2818949"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490148.3538573"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384305"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897655"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1158604"},{"key":"e_1_2_2_39_1","first-page":"354","volume-title":"Jens Schmitt. On the Relevance of Adversarial Queueing Theory in Practice. In Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS)","author":"Berger S.","year":"2014","unstructured":"Daniel\u00a0S. Berger, Martin Karsten, and Jens Schmitt. On the Relevance of Adversarial Queueing Theory in Practice. In Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), pages 343\u2013354, 2014."},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TENCON.2008.4766470"},{"key":"e_1_2_2_41_1","first-page":"258","volume-title":"Nitin Vaidya. Reliable Broadcast in Radio Networks: The Bounded Collision Case. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC)","author":"Bhandhari Vartika","year":"2006","unstructured":"Vartika Bhandhari, Jonathan Katz, Chiu-Yuen Koo, and Nitin Vaidya. Reliable Broadcast in Radio Networks: The Bounded Collision Case. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pages 258 \u2013 264, 2006."},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/4234.736171"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.840210"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208922"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33651-5_9"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3182396"},{"key":"e_1_2_2_47_1","volume-title":"Dynamic sharing of a multiple access channel. arXiv preprint arXiv:1001.3044","author":"Bienkowski Marcin","year":"2010","unstructured":"Marcin Bienkowski, Marek Klonowski, Miroslaw Korzeniowski, and Dariusz\u00a0R. Kowalski. Dynamic sharing of a multiple access channel. arXiv preprint arXiv:1001.3044, 2010."},{"key":"e_1_2_2_48_1","volume-title":"Adversarial queuing theory. Journal of the ACM (JACM), 48(1):13\u201338","author":"Borodin Allan","year":"2001","unstructured":"Allan Borodin, Jon Kleinberg, Prabhakar Raghavan, Madhu Sudan, and David\u00a0P Williamson. Adversarial queuing theory. Journal of the ACM (JACM), 48(1):13\u201338, 2001."},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.893874"},{"key":"e_1_2_2_50_1","volume-title":"Design and performance evaluation of an adaptive backoff mechanism","author":"Cali Frederico","year":"2000","unstructured":"Frederico Cali, Marco Conti, and Enrico Gregori. IEEE 802.11 protocol: Design and performance evaluation of an adaptive backoff mechanism. IEEE Journal on Selected Areas in Communications, 18(9):1774\u20131786, 2000."},{"key":"e_1_2_2_51_1","first-page":"82","volume-title":"Proceedings of the Advanced International Conference on Telecommunications","author":"Oktug Canberk","year":"2009","unstructured":"B.\u00a0Canberk and S.\u00a0Oktug. Self similarity analysis and modeling of VoIP traffic under wireless heterogeneous network environment. In Proceedings of the Advanced International Conference on Telecommunications, pages 76\u201382, 2009."},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1979.1094298"},{"key":"e_1_2_2_53_1","first-page":"2025","volume-title":"32nd International Colloquium On Structural Information and Communication Complexity (SIROCCO)","author":"Chakraborty Trisha","unstructured":"Trisha Chakraborty, Abir Islam, Valerie King, Daniel Rayborn, Jared Saia, and Maxwell Young. Bankrupting dos attackers. In Accepted to the 32nd International Colloquium On Structural Information and Communication Complexity (SIROCCO), page no pagination, 2025."},{"key":"e_1_2_2_54_1","first-page":"16","volume-title":"Proceedings of the Symposium on Simplicity in Algorithms (SOSA)","author":"Chang Yi-Jun","year":"2019","unstructured":"Yi-Jun Chang, Wenyu Jin, and Seth Pettie. Simple contention resolution via multiplicative weight updates. In Proceedings of the Symposium on Simplicity in Algorithms (SOSA), pages 16:1\u201316:16, 2019."},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055481"},{"key":"e_1_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341111"},{"key":"e_1_2_2_57_1","first-page":"149","volume-title":"Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC)","author":"Chen Haimin","unstructured":"Haimin Chen, Yonggang Jiang, and Chaodong Zheng. Tight trade-off in contention resolution without collision detection. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pages 139\u2013149. ACM, 2021."},{"key":"e_1_2_2_58_1","first-page":"16","volume-title":"Proceedings of the International Conference on Principles of Distributed Systems (OPODIS)","volume":"184","author":"Chen Haimin","year":"2020","unstructured":"Haimin Chen and Chaodong Zheng. Broadcasting competitively against adaptive adversary in multi-channel radio networks. In Proceedings of the International Conference on Principles of Distributed Systems (OPODIS), volume 184, pages 22:1\u201322:16, 2020."},{"key":"e_1_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0013-1_11"},{"key":"e_1_2_2_60_1","volume-title":"Scalable wake-up of multi-channel single-hop radio networks. Theoretical Computer Science, 615(C):23 \u2013","author":"Chlebus S.","year":"2016","unstructured":"Bogdan\u00a0S. Chlebus, Gianluca De\u00a0Marco, and Dariusz\u00a0R. Kowalski. Scalable wake-up of multi-channel single-hop radio networks. Theoretical Computer Science, 615(C):23 \u2013 44, February 2016."},{"key":"e_1_2_2_61_1","first-page":"870","volume-title":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Chlebus S.","year":"2000","unstructured":"Bogdan\u00a0S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, and Wojciech Rytter. Deterministic broadcasting in unknown radio networks. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 861\u2013870, 2000."},{"key":"e_1_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_29"},{"key":"e_1_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323190"},{"key":"e_1_2_2_64_1","first-page":"274","volume-title":"Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"S.","year":"2004","unstructured":"Bogdan\u00a0S. Chlebus and Dariusz\u00a0R. Kowalski. A better wake-up in radio networks. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 266\u2013274, 2004."},{"key":"e_1_2_2_65_1","first-page":"280","volume-title":"Proceedings of the International Symposium on Fundamentals of Computation Theory","author":"S.","year":"2005","unstructured":"Bogdan\u00a0S. Chlebus and Dariusz\u00a0R. Kowalski. Almost optimal explicit selectors. In Proceedings of the International Symposium on Fundamentals of Computation Theory, pages 270\u2013280, 2005."},{"key":"e_1_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146398"},{"key":"e_1_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76627-8_12"},{"key":"e_1_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-009-0086-4"},{"key":"e_1_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/2071379.2071384"},{"key":"e_1_2_2_70_1","volume-title":"Proceedings of the IEEE Vehicular Technology Conference, volume\u00a03","author":"Choi Nakjung","year":"2005","unstructured":"Nakjung Choi, Yongho Seok, Yanghee Choi, Sungmann Kim, and Hanwook Jung. P-DCF: Enhanced backoff scheme for the IEEE 802.11 DCF. In Proceedings of the IEEE Vehicular Technology Conference, volume\u00a03, 2005."},{"key":"e_1_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04693-4_11"},{"key":"e_1_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442726"},{"key":"e_1_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(02)00004-4"},{"key":"e_1_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00851-4"},{"key":"e_1_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/1641913.1641917"},{"key":"e_1_2_2_76_1","volume-title":"FCC 14-55: Notice of Apparent Liability for Forfeiture of Illegal Operation of Signal Jamming Device","author":"Federal\u00a0Communications Commission","year":"2014","unstructured":"Federal\u00a0Communications Commission. FCC 14-55: Notice of Apparent Liability for Forfeiture of Illegal Operation of Signal Jamming Device, 2014. https:\/\/apps.fcc.gov\/edocs_public\/attachmatch\/FCC-14-55A1.pdf."},{"key":"e_1_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.61109"},{"key":"e_1_2_2_78_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.61110"},{"key":"e_1_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04355-0_51"},{"key":"e_1_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484257"},{"key":"e_1_2_2_81_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.68"},{"key":"e_1_2_2_82_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087831"},{"key":"e_1_2_2_83_1","first-page":"222","volume-title":"Proceedings of the International Symposium on Distributed Computing (DISC)","author":"Dolev Shlomi","year":"2007","unstructured":"Shlomi Dolev, Seth Gilbert, Rachid Guerraoui, and Calvin Newport. Gossiping in a Multi-channel Radio Network: An Oblivious Approach to Coping with Malicious Interference. In Proceedings of the International Symposium on Distributed Computing (DISC), pages 208\u2013222, 2007."},{"key":"e_1_2_2_84_1","doi-asserted-by":"publisher","DOI":"10.1007\/11682462_42"},{"key":"e_1_2_2_85_1","volume-title":"Stability and optimal control of the packet switching broadcast channel. Journal of the ACM (JACM), 24(3):375\u2013386","author":"Fayolle Guy","year":"1977","unstructured":"Guy Fayolle, Erol Gelenbe, and Jacques Labetoulle. Stability and optimal control of the packet switching broadcast channel. Journal of the ACM (JACM), 24(3):375\u2013386, 1977."},{"key":"e_1_2_2_86_1","volume-title":"Computer Science Department","author":"Fayolle Guy","year":"1982","unstructured":"Guy Fayolle and Micha Hofri. On the capacity of a collision channel under stack-based collision resolution algorithm. Technical report, Computer Science Department, Technion, 1982."},{"key":"e_1_2_2_87_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916651"},{"key":"e_1_2_2_88_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1975.1092743"},{"key":"e_1_2_2_89_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9816-x"},{"key":"e_1_2_2_90_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24100-0_23"},{"key":"e_1_2_2_91_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933091"},{"key":"e_1_2_2_92_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933110"},{"key":"e_1_2_2_93_1","first-page":"18","volume-title":"Proceedings of the International Symposium on Distributed Computing (DISC)","volume":"121","author":"Garncarek Pawel","year":"2018","unstructured":"Pawel Garncarek, Tomasz Jurdzi\u0144ski, and Dariusz\u00a0R. Kowalski. Local queuing under contention. In Proceedings of the International Symposium on Distributed Computing (DISC), volume 121, pages 28:1\u201328:18, 2018."},{"key":"e_1_2_2_94_1","first-page":"16","volume-title":"Proceedings of the International Symposium on Distributed Computing (DISC)","author":"Garncarek Pawel","year":"2019","unstructured":"Pawel Garncarek, Tomasz Jurdzi\u0144ski, and Dariusz\u00a0R. Kowalski. Stable memoryless queuing under contention. In Proceedings of the International Symposium on Distributed Computing (DISC), pages 17:1\u201317:16, 2019."},{"key":"e_1_2_2_95_1","first-page":"121","volume-title":"Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"Gasieniec Leszek","year":"2000","unstructured":"Leszek Gasieniec, Andrzej Pelc, and David Peleg. The wakeup problem in synchronous broadcast systems. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 113\u2013121, 2000."},{"key":"e_1_2_2_96_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480100376022"},{"key":"e_1_2_2_97_1","doi-asserted-by":"publisher","DOI":"10.1145\/140901.140906"},{"key":"e_1_2_2_98_1","doi-asserted-by":"publisher","DOI":"10.1145\/1815396.1815409"},{"key":"e_1_2_2_99_1","first-page":"2257","volume-title":"Calvin Newport. Interference-Resilient Information Exchange. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM)","author":"Gilbert Seth","year":"2009","unstructured":"Seth Gilbert, Rachid Guerraoui, Dariusz\u00a0R. Kowalski, and Calvin Newport. Interference-Resilient Information Exchange. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM), pages 2249\u20132257, 2009."},{"key":"e_1_2_2_100_1","doi-asserted-by":"publisher","DOI":"10.1007\/11945529_16"},{"key":"e_1_2_2_101_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.10.008"},{"key":"e_1_2_2_102_1","first-page":"266","volume-title":"Maxwell Young. (Near) Optimal Resource-competitive Broadcast with Jamming. In Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","author":"Gilbert Seth","year":"2014","unstructured":"Seth Gilbert, Valerie King, Seth Pettie, Ely Porat, Jared Saia, and Maxwell Young. (Near) Optimal Resource-competitive Broadcast with Jamming. In Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 257\u2013266, 2014."},{"key":"e_1_2_2_103_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467911"},{"key":"e_1_2_2_104_1","first-page":"154","volume-title":"Gilbert and Maxwell Young. Making Evildoers Pay: Resource-Competitive Broadcast in Sensor Networks. In Proceedings of the Symposium on Principles of Distributed Computing (PODC)","author":"Seth","year":"2012","unstructured":"Seth Gilbert and Maxwell Young. Making Evildoers Pay: Resource-Competitive Broadcast in Sensor Networks. In Proceedings of the Symposium on Principles of Distributed Computing (PODC), pages 145\u2013154, 2012."},{"key":"e_1_2_2_105_1","volume-title":"Notes on contention resolution","author":"Goldberg Leslie\u00a0Ann","year":"2000","unstructured":"Leslie\u00a0Ann Goldberg. Notes on contention resolution. 2000."},{"key":"e_1_2_2_106_1","doi-asserted-by":"publisher","DOI":"10.1145\/23005.23006"},{"key":"e_1_2_2_107_1","first-page":"392","volume-title":"Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS)","author":"G.","year":"1983","unstructured":"Albert\u00a0G. Greenberg and Richard\u00a0E. Ladner. Estimating the multiplicities of conflicts in multiple access channels. In Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS), pages 383\u2013392, 1983."},{"key":"e_1_2_2_108_1","volume-title":"A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels. Journal of the ACM (JACM), 32(3):589\u2013596","author":"Greenberg G","year":"1985","unstructured":"Albert\u00a0G Greenberg and Schmuel Winograd. A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels. Journal of the ACM (JACM), 32(3):589\u2013596, 1985."},{"key":"e_1_2_2_109_1","first-page":"249","volume-title":"Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS)","author":"I.","year":"1985","unstructured":"Ronald\u00a0I. Greenberg and Charles\u00a0E. Leiserson. Randomized routing on fat-trees. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pages 241\u2013249, 1985."},{"key":"e_1_2_2_110_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2018.1700399"},{"key":"e_1_2_2_111_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792233828"},{"key":"e_1_2_2_112_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1978.1094204"},{"key":"e_1_2_2_113_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.1993.698569"},{"key":"e_1_2_2_114_1","first-page":"88","volume-title":"Modelling and Performance Evaluation Methodology","author":"Hofri Micha","unstructured":"Micha Hofri. Stack algorithms for collision-detecting channels and their analysis: A limited survey. In Modelling and Performance Evaluation Methodology, pages 69\u201388. 1984."},{"key":"e_1_2_2_115_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS51040.2020.00022"},{"key":"e_1_2_2_116_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.3047997"},{"key":"e_1_2_2_117_1","first-page":"704","volume-title":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Indyk Piotr","year":"2002","unstructured":"Piotr Indyk. Explicit constructions of selectors and related combinatorial structures, with applications. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), page 697\u2013704, 2002."},{"key":"e_1_2_2_118_1","first-page":"206","volume-title":"Proceedings of the International Workshop on Approximation and Online Algorithms (WAOA)","volume":"8952","author":"Jurdzi\u0144ski Tomasz","year":"2014","unstructured":"Tomasz Jurdzi\u0144ski, Dariusz\u00a0R. Kowalski, and Krzysztof Lorys. Online packet scheduling under adversarial jamming. In Proceedings of the International Workshop on Approximation and Online Algorithms (WAOA), volume 8952, pages 193\u2013206, 2014."},{"key":"e_1_2_2_119_1","volume-title":"Distributed deterministic broadcasting in wireless networks of weak devices under the SINR model. arXiv preprint arXiv:1210.1804","author":"Jurdzi\u0144ski Tomasz","year":"2012","unstructured":"Tomasz Jurdzi\u0144ski, Dariusz\u00a0R. Kowalski, and Grzegorz Stachowiak. Distributed deterministic broadcasting in wireless networks of weak devices under the SINR model. arXiv preprint arXiv:1210.1804, 2012."},{"key":"e_1_2_2_120_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39212-2_55"},{"key":"e_1_2_2_121_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45655-4_31"},{"key":"e_1_2_2_122_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-55751-8_25"},{"key":"e_1_2_2_123_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36136-7_47"},{"key":"e_1_2_2_124_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-005-1144-3"},{"key":"e_1_2_2_125_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767439"},{"key":"e_1_2_2_126_1","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.001.1900476"},{"issue":"3","key":"e_1_2_2_127_1","first-page":"379","article-title":"Stochastic models of computer communication systems. Journal of the Royal Statistical Society","volume":"47","author":"Kelly P.","year":"1985","unstructured":"Frank\u00a0P. Kelly. Stochastic models of computer communication systems. Journal of the Royal Statistical Society, Series B (Methodological), 47(3):379\u2013395, 1985.","journal-title":"Series B (Methodological)"},{"key":"e_1_2_2_128_1","first-page":"1568","volume-title":"The Annals of Probability","author":"P.","year":"1987","unstructured":"Frank\u00a0P. Kelly and Iain\u00a0M. MacPhee. The number of packets transmitted by collision detect random access schemes. The Annals of Probability, pages 1557\u20131568, 1987."},{"key":"e_1_2_2_129_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-017-0313-3"},{"key":"e_1_2_2_130_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993855"},{"key":"e_1_2_2_131_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057020"},{"key":"e_1_2_2_132_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073843"},{"key":"e_1_2_2_133_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.04.017"},{"key":"e_1_2_2_134_1","volume-title":"Kurose and Keith Ross. Computer Networking: A Top-Down Approach Featuring the Internet","author":"F.","year":"2002","unstructured":"James\u00a0F. Kurose and Keith Ross. Computer Networking: A Top-Down Approach Featuring the Internet. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2nd edition, 2002.","edition":"2"},{"key":"e_1_2_2_135_1","doi-asserted-by":"publisher","DOI":"10.1145\/164051.164059"},{"key":"e_1_2_2_136_1","volume-title":"SIAM journal on Computing, 27(3):702\u2013712","author":"Kushilevitz Eyal","year":"1998","unstructured":"Eyal Kushilevitz and Yishay Mansour. An \u03a9(Dlog\u2009(N\/D)) lower bound for broadcast in radio networks. SIAM journal on Computing, 27(3):702\u2013712, 1998."},{"key":"e_1_2_2_137_1","first-page":"6","volume-title":"Proceedings of the IEEE International Conference on Pervasive Computing and Communications","author":"Liu Hongbo","year":"2009","unstructured":"Hongbo Liu, X\u00a0Wenyuan, Yingying Chen, and Zhenhua Liu. Localizing jammers in wireless networks. In Proceedings of the IEEE International Conference on Pervasive Computing and Communications, pages 1\u20136, 2009."},{"key":"e_1_2_2_138_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.316"},{"key":"e_1_2_2_139_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2398435"},{"key":"e_1_2_2_140_1","first-page":"184","volume-title":"Integrated Approaches in Information Technology and Web Engineering: Advancing Organizational Knowledge Sharing, chapter\u00a012","author":"Manaseer S.","unstructured":"Saher\u00a0S. Manaseer, Mohamed Ould-Khaoua, and Lewis\u00a0M. Mackenzie. On the logarithmic backoff algorithm for MAC protocol in MANETs. In Integrated Approaches in Information Technology and Web Engineering: Advancing Organizational Knowledge Sharing, chapter\u00a012, pages 174\u2013184. IGI Global, 2009."},{"key":"e_1_2_2_141_1","first-page":"217","volume-title":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Marco Gianluca\u00a0De","year":"2008","unstructured":"Gianluca\u00a0De Marco. Distributed broadcast in unknown radio networks. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 208\u2013217, 2008."},{"key":"e_1_2_2_142_1","doi-asserted-by":"publisher","DOI":"10.1137\/080733826"},{"key":"e_1_2_2_143_1","first-page":"735","volume-title":"Proceedings of the International Conference on Distributed Computing Systems (ICDCS)","author":"Marco Gianluca\u00a0De","unstructured":"Gianluca\u00a0De Marco and Dariusz\u00a0R. Kowalski. Towards power-sensitive communication on a multiple-access channel. In Proceedings of the International Conference on Distributed Computing Systems (ICDCS), pages 728\u2013735. IEEE Computer Society, 2010."},{"key":"e_1_2_2_144_1","doi-asserted-by":"publisher","DOI":"10.1137\/140982763"},{"issue":"1","key":"e_1_2_2_145_1","first-page":"13","article-title":"Contention resolution in a non-synchronized multiple access channel","volume":"689","author":"Marco Gianluca\u00a0De","year":"2017","unstructured":"Gianluca\u00a0De Marco and Dariusz\u00a0R. Kowalski. Contention resolution in a non-synchronized multiple access channel. Theoretical Computer Science, 689:1 \u2013 13, 2017.","journal-title":"Theoretical Computer Science"},{"key":"e_1_2_2_146_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2019.00054"},{"key":"e_1_2_2_147_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.08.009"},{"key":"e_1_2_2_148_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICUFN57995.2023.10201198"},{"key":"e_1_2_2_149_1","first-page":"483","volume-title":"Proceedings of the ION 2015 Pacific PNT Meeting","author":"McMilin Emily","year":"2015","unstructured":"Emily McMilin, David\u00a0S De\u00a0Lorenzo, Thomas Lee, Per Enge, Dennis Akos, Stefano Caizzone, and Andriy Konovaltsev. GPS anti-jam: A simple method of single antenna null-steering for aerial applications. In Proceedings of the ION 2015 Pacific PNT Meeting, pages 470\u2013483, 2015."},{"key":"e_1_2_2_150_1","first-page":"14","volume-title":"Roger Wattenhofer. Speed Dating Despite Jammers. In Proceedings of the International Conference on Distributed Computing in Sensor Systems (DCOSS)","author":"Meier Dominic","year":"2009","unstructured":"Dominic Meier, Yvonne\u00a0Anne Pignolet, Stefan Schmid, and Roger Wattenhofer. Speed Dating Despite Jammers. In Proceedings of the International Conference on Distributed Computing in Sensor Systems (DCOSS), pages 1\u201314, 2009."},{"key":"e_1_2_2_151_1","doi-asserted-by":"publisher","DOI":"10.1145\/103727.103729"},{"key":"e_1_2_2_152_1","doi-asserted-by":"publisher","DOI":"10.1145\/360248.360253"},{"key":"e_1_2_2_153_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214072"},{"key":"e_1_2_2_154_1","doi-asserted-by":"publisher","DOI":"10.1145\/1634.2509"},{"key":"e_1_2_2_155_1","doi-asserted-by":"publisher","DOI":"10.1145\/1452335.1452338"},{"key":"e_1_2_2_156_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.23"},{"key":"e_1_2_2_157_1","volume-title":"Journal of Computer and System Sciences","author":"Moses\u00a0Jr K","year":"2020","unstructured":"William\u00a0K Moses\u00a0Jr and Shailesh Vaya. Deterministic protocols in the sinr model without knowledge of coordinates. Journal of Computer and System Sciences, 2020."},{"key":"e_1_2_2_158_1","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2009.090404"},{"key":"e_1_2_2_159_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2002.1003864"},{"key":"e_1_2_2_160_1","volume-title":"FCC fines Marriott $600,000 for Wi-Fi blocking","author":"Nancy\u00a0Trejos A\u00a0Today","year":"2014","unstructured":"USA\u00a0Today Nancy\u00a0Trejos. FCC fines Marriott $600,000 for Wi-Fi blocking, 2014. https:\/\/www.usatoday.com\/story\/money\/business\/2014\/10\/03\/marriott-fcc-nashville-fined-wifi-blocking\/16648695\/."},{"key":"e_1_2_2_161_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.314"},{"key":"e_1_2_2_162_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45174-8_18"},{"key":"e_1_2_2_163_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45174-8_18"},{"key":"e_1_2_2_164_1","volume-title":"Angry priest installs phone jamming device in church to stop calls","author":"News Pulse","year":"2014","unstructured":"Pulse News. Angry priest installs phone jamming device in church to stop calls, 2014. https:\/\/www.pulse.ng\/communities\/religion\/enough-is-enough-angry-priest-installs-phone-jamming-device-in-church-to-stop-calls\/xq02ts1."},{"key":"e_1_2_2_165_1","doi-asserted-by":"publisher","DOI":"10.5555\/1072150.1072157"},{"key":"e_1_2_2_166_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848224"},{"key":"e_1_2_2_167_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-017-0307-1"},{"key":"e_1_2_2_168_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.392383"},{"key":"e_1_2_2_169_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2022.3159185"},{"key":"e_1_2_2_170_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPSN.2005.1440950"},{"key":"e_1_2_2_171_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMSNETS.2014.6734883"},{"key":"e_1_2_2_172_1","doi-asserted-by":"publisher","DOI":"10.5555\/1888781.1888804"},{"key":"e_1_2_2_173_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2011.8"},{"key":"e_1_2_2_174_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332488"},{"key":"e_1_2_2_175_1","first-page":"1002","volume-title":"Encyclopedia of Algorithms","author":"W.","unstructured":"Andr\u00e9a\u00a0W. Richa and Christian Scheideler. Jamming-resistant MAC protocols for wireless networks. In Encyclopedia of Algorithms, pages 999\u20131002. 2016."},{"key":"e_1_2_2_176_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-012-0180-x"},{"key":"e_1_2_2_177_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2210241"},{"key":"e_1_2_2_178_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1983.1103155"},{"key":"e_1_2_2_179_1","first-page":"6","volume-title":"Proceedings of the Australasian Telecommunication Networks and Applications Conference (ATNAC)","author":"I.","year":"2009","unstructured":"Nurul\u00a0I. Sarkar and Kevin\u00a0W. Sowerby. The effect of traffic distribution and transport protocol on WLAN performance. In Proceedings of the Australasian Telecommunication Networks and Applications Conference (ATNAC), pages 1\u20136, 2009."},{"key":"e_1_2_2_180_1","first-page":"248","volume-title":"Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"N.","year":"2005","unstructured":"William\u00a0N. Scherer and Michael\u00a0L. Scott. Advanced contention management for dynamic software transactional memory. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 240\u2013248, 2005."},{"key":"e_1_2_2_181_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2006.1639417"},{"key":"e_1_2_2_182_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIPRO.2014.6859627"},{"key":"e_1_2_2_183_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.icte.2017.03.004"},{"key":"e_1_2_2_184_1","volume-title":"Lawyer: Man accused of jamming calls on Red Line \u2018disturbed by people talking around him","author":"Steve\u00a0Schmadeke Chicago\u00a0Tribune","year":"2016","unstructured":"Chicago\u00a0Tribune Steve\u00a0Schmadeke. Lawyer: Man accused of jamming calls on Red Line \u2018disturbed by people talking around him\u2019, 2016. http:\/\/www.chicagotribune.com\/news\/local\/breaking\/ct-cell-phone-jamming-red-line-20160309-story.html."},{"key":"e_1_2_2_185_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.1984.1092023"},{"key":"e_1_2_2_186_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2295242"},{"key":"e_1_2_2_187_1","volume-title":"Springer Berlin Heidelberg","author":"Teymori Shahram","year":"2005","unstructured":"Shahram Teymori and Weihua Zhuang. Queue Analysis for Wireless Packet Data Traffic, pages 217\u2013227. Springer Berlin Heidelberg, Berlin, Heidelberg, 2005."},{"issue":"2","key":"e_1_2_2_188_1","first-page":"69","article-title":"Resolution of a conflict of known multiplicity","volume":"16","author":"Tsybakov Boris","year":"1980","unstructured":"Boris Tsybakov. Resolution of a conflict of known multiplicity. Problemy Peredachi Informatsii, 16(2):69\u201382, 1980.","journal-title":"Problemy Peredachi Informatsii"},{"key":"e_1_2_2_189_1","volume-title":"Free synchronous packet access in a broadcast channel with feedback. Problemy peredachi informatsii, 14(4):32\u201359","author":"Tsybakov Boris\u00a0Solomonovich","year":"1978","unstructured":"Boris\u00a0Solomonovich Tsybakov and Viktor\u00a0Alexandrovich Mikhailov. Free synchronous packet access in a broadcast channel with feedback. Problemy peredachi informatsii, 14(4):32\u201359, 1978."},{"key":"e_1_2_2_190_1","volume-title":"Ergodicity of a slotted ALOHA system. Problemy peredachi informatsii, 15(4):73\u201387","author":"Tsybakov Boris\u00a0Solomonovich","year":"1979","unstructured":"Boris\u00a0Solomonovich Tsybakov and Viktor\u00a0Alexandrovich Mikhailov. Ergodicity of a slotted ALOHA system. Problemy peredachi informatsii, 15(4):73\u201387, 1979."},{"issue":"4","key":"e_1_2_2_191_1","first-page":"259","article-title":"Free synchronous packet access in a broadcast channel with feedback","volume":"14","author":"Tsybakov Boris\u00a0Solomonovich","year":"1979","unstructured":"Boris\u00a0Solomonovich Tsybakov and Viktor\u00a0Alexandrovich Mikhailov. Free synchronous packet access in a broadcast channel with feedback. Problems of Information Transmission, 14(4):259\u2013280, 1979.","journal-title":"Problems of Information Transmission"},{"key":"e_1_2_2_192_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2015.11.008"},{"key":"e_1_2_2_193_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-91081-5_30"},{"key":"e_1_2_2_194_1","doi-asserted-by":"publisher","DOI":"10.1109\/SAHCN.2006.288433"},{"key":"e_1_2_2_195_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215032"},{"key":"e_1_2_2_196_1","doi-asserted-by":"publisher","DOI":"10.1109\/4236.968834"},{"key":"e_1_2_2_197_1","first-page":"1366","volume-title":"Proceedings of the IEEE Conference on Computer Communications (INFOCOM)","author":"E.","year":"1991","unstructured":"Will\u00a0E. Wilson and Daniel\u00a0V. Leland. High time-resolution measurement and analysis of LAN traffic: Implications for LAN interconnection. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM), pages 1360\u20131366, 1991."},{"key":"e_1_2_2_198_1","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.2003.1253275"},{"key":"e_1_2_2_199_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062689.1062697"},{"key":"e_1_2_2_200_1","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2011.041311.00156"},{"key":"e_1_2_2_201_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.879329"},{"key":"e_1_2_2_202_1","doi-asserted-by":"publisher","DOI":"10.1109\/APUSNCURSINRSM.2018.8608862"},{"key":"e_1_2_2_203_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.01.026"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3733594","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T23:40:47Z","timestamp":1746056447000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3733594"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,30]]},"references-count":203,"alternative-id":["10.1145\/3733594"],"URL":"https:\/\/doi.org\/10.1145\/3733594","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,30]]},"assertion":[{"value":"2024-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-04-09","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-04-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"3733594"}}