{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:22:06Z","timestamp":1777965726705,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T00:00:00Z","timestamp":1500940800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Polish National Science Centre","award":["DEC-2012\/06\/M\/ST6\/00459."],"award-info":[{"award-number":["DEC-2012\/06\/M\/ST6\/00459."]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,25]]},"DOI":"10.1145\/3087801.3087831","type":"proceedings-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T17:51:38Z","timestamp":1500573098000},"page":"391-400","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Asynchronous Shared Channel"],"prefix":"10.1145","author":[{"given":"Gianluca","family":"De Marco","sequence":"first","affiliation":[{"name":"University of Salerno, Fisciano, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grzegorz","family":"Stachowiak","sequence":"additional","affiliation":[{"name":"University of Wroclaw, Wroclaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9816-x"},{"key":"e_1_3_2_1_2_1","first-page":"325","volume-title":"17th Annual ACM Symposium on Parallel Algorithms (SPAA)","author":"Bender M.A.","year":"2005","unstructured":"M.A. Bender , M. Farach-Colton , S. He , B.C. Kuszmaul , and C.E. Leiserson , Adversarial contention resolution for simple channels, intextitProceedings , 17th Annual ACM Symposium on Parallel Algorithms (SPAA) , 2005 , pp. 325 - 332 . M.A. Bender, M. Farach-Colton, S. He, B.C. Kuszmaul, and C.E. Leiserson, Adversarial contention resolution for simple channels, intextitProceedings, 17th Annual ACM Symposium on Parallel Algorithms (SPAA), 2005, pp. 325 - 332."},{"key":"e_1_3_2_1_3_1","first-page":"499","volume-title":"Contention resolution with log-logstar channel accesses,intextitProceedings of the forty-eighth annual ACM symposium on Theory of Computing(STOC)","author":"Bender M. A.","year":"2016","unstructured":"M. A. Bender , T. Kopelowitz , S. Pettie , and M. Young , Contention resolution with log-logstar channel accesses,intextitProceedings of the forty-eighth annual ACM symposium on Theory of Computing(STOC) , 2016 , Cambridge, MA , USA , pp. 499 -- 508 . M. A. Bender, T. Kopelowitz, S. Pettie, and M. Young,Contention resolution with log-logstar channel accesses,intextitProceedings of the forty-eighth annual ACM symposium on Theory of Computing(STOC), 2016, Cambridge, MA, USA, pp. 499--508."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056093"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0013-1_11"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"B. S. Chlebus G. De Marco M. Talo Naming a Channel with Beeps \\textitFundamenta Informaticae 153 (3) pp. 199--219 2017.  B. S. Chlebus G. De Marco M. Talo Naming a Channel with Beeps \\textitFundamenta Informaticae 153 (3) pp. 199--219 2017.","DOI":"10.3233\/FI-2017-1537"},{"key":"e_1_3_2_1_7_1","first-page":"23","volume-title":"Scalable wake-up of multi-channel single-hop radio networks, \\textitTheoretical Computer Science","author":"Chlebus B. S.","year":"2016","unstructured":"B. S. Chlebus , G. De Marco , D. R. Kowalski , Scalable wake-up of multi-channel single-hop radio networks, \\textitTheoretical Computer Science , vol. 615 , pp. 23 -- 44 , 2016 . B. S. Chlebus, G. De Marco, D. R. Kowalski, Scalable wake-up of multi-channel single-hop radio networks, \\textitTheoretical Computer Science, vol. 615, pp. 23--44, 2016."},{"key":"e_1_3_2_1_8_1","volume-title":"18th International Conference on Principles of Distributed Systems (OPODIS 2014","author":"Chlebus B. S.","year":"2014","unstructured":"B. S. Chlebus , G. De Marco , D. R. Kowalski , Scalable Wake-up of Multi-chann el Single-Hop Radio Networks intextit Proceedings , 18th International Conference on Principles of Distributed Systems (OPODIS 2014 ), Cortina d'Ampezzo, Italy, December 16--19 , 2014 . B. S. Chlebus, G. De Marco, D. R. Kowalski, Scalable Wake-up of Multi-channel Single-Hop Radio Networks intextitProceedings, 18th International Conference on Principles of Distributed Systems (OPODIS 2014), Cortina d'Ampezzo, Italy, December 16--19, 2014."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2071379.2071384"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s446-002-8028-1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"M. Chrobak L. Gasieniec and D.R. Kowalski The wake-up problem in multihop radio networks \\textitSIAM Journal on Computing 36 (2007) 1453 - 1471.  M. Chrobak L. Gasieniec and D.R. Kowalski The wake-up problem in multihop radio networks \\textitSIAM Journal on Computing 36 (2007) 1453 - 1471.","DOI":"10.1137\/S0097539704442726"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_29"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(02)00004-4"},{"key":"e_1_3_2_1_14_1","first-page":"266","volume-title":"23rd ACM Symp. on Principles of Distributed Computing (PODC)","author":"Chlebus B.S.","year":"2004","unstructured":"B.S. Chlebus and D. Kowalski , A better wake-up in radio networks,intextitProceedings , 23rd ACM Symp. on Principles of Distributed Computing (PODC) , 2004 , 266 - 2274 . B.S. Chlebus and D. Kowalski,A better wake-up in radio networks,intextitProceedings, 23rd ACM Symp. on Principles of Distributed Computing (PODC), 2004, 266 - 274."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"A.E.F. Clementi A. Monti and R. Silvestri Distributed broadcast in radio networks of unknown topology \\textitTheoretical Computer Science 302 (2003) 337 - 364.  A.E.F. Clementi A. Monti and R. Silvestri Distributed broadcast in radio networks of unknown topology \\textitTheoretical Computer Science 302 (2003) 337 - 364.","DOI":"10.1016\/S0304-3975(02)00851-4"},{"key":"e_1_3_2_1_16_1","volume-title":"19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008","author":"Marco G. De","year":"2008","unstructured":"G. De Marco , Distributed Broadcast in Unknown Radio Networks , 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008 ), San Francisco, California, USA , January 2008 . G. De Marco,Distributed Broadcast in Unknown Radio Networks, 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), San Francisco, California, USA, January 2008."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/080733826"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.68"},{"key":"e_1_3_2_1_19_1","first-page":"97","volume-title":"Randomization vs Determinism and Adaptiveness vs Non-Adaptiveness, \\textitRandom Structures and Algorithms","author":"Marco G. De","year":"2013","unstructured":"G. De Marco , D. R. Kowalski , Searching for a Subset of Counterfeit Coins : Randomization vs Determinism and Adaptiveness vs Non-Adaptiveness, \\textitRandom Structures and Algorithms , vol. 42 (1), pp. 97 -- 109 , 2013 . G. De Marco, D. R. Kowalski,Searching for a Subset of Counterfeit Coins: Randomization vs Determinism and Adaptiveness vs Non-Adaptiveness, \\textitRandom Structures and Algorithms, vol. 42 (1), pp. 97--109, 2013."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2010.50"},{"issue":"3","key":"e_1_3_2_1_21_1","first-page":"868","article-title":"Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel,\\textitSIAM J","volume":"44","author":"Marco G. De","year":"2015","unstructured":"G. De Marco , and D. Kowalski , Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel,\\textitSIAM J . Comput. , 44 ( 3 ) 2015 , 868 - 888 . G. De Marco, and D. Kowalski,Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel,\\textitSIAM J. Comput., 44 (3) 2015, 868 - 888.","journal-title":"Comput."},{"key":"e_1_3_2_1_22_1","volume-title":"Contention Resolution in a Non-Synchronized\\\\ Multiple Access Channel\\textitTheoretical Computer Science","author":"Marco G. De","year":"2017","unstructured":"G. De Marco , and D. Kowalski , Contention Resolution in a Non-Synchronized\\\\ Multiple Access Channel\\textitTheoretical Computer Science , 2017 , to appear. G. De Marco, and D. Kowalski,Contention Resolution in a Non-Synchronized\\\\ Multiple Access Channel\\textitTheoretical Computer Science, 2017, to appear."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.08.009"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057022"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/355541.355567"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480100376022"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3828.214125"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/23005.23006"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.14"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1978.1094204"},{"key":"e_1_3_2_1_31_1","first-page":"697","volume-title":"13th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Indyk P.","year":"2002","unstructured":"P. Indyk , Explicit constructions of selectors and related combinatorial structures, with applications, intextitProceedings , 13th ACM-SIAM Symposium on Discrete Algorithms (SODA) , 2002 , pp. 697 - 704 . P. Indyk, Explicit constructions of selectors and related combinatorial structures, with applications, intextitProceedings, 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002, pp. 697 - 704."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-005-1144-3"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057020"},{"key":"e_1_3_2_1_34_1","first-page":"158","volume-title":"24th ACM Symposium on Principles of Distributed Computing (PODC)","author":"Kowalski D.","year":"2005","unstructured":"D. Kowalski , On selection problem in radio networks,intextitProceedings , 24th ACM Symposium on Principles of Distributed Computing (PODC) , 2005 , pp. 158 - 166 . D. Kowalski, On selection problem in radio networks,intextitProceedings, 24th ACM Symposium on Principles of Distributed Computing (PODC), 2005, pp. 158 - 166."},{"key":"e_1_3_2_1_35_1","volume-title":"CDC'84","author":"Kumar P.","year":"1984","unstructured":"P. Kumar and L. Merakos . Distributed control of broadcast channels with akcnowledgement feedback: Stability and performance . In CDC'84 , 1984 . P. Kumar and L. Merakos. Distributed control of broadcast channels with akcnowledgement feedback: Stability and performance. In CDC'84, 1984."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"R.M. Metcalfe and D.R. Boggs Ethernet: distributed packet switching for local computer networks \\textitCommunications of the ACM 19 (1976) 395 - 404.  R.M. Metcalfe and D.R. Boggs Ethernet: distributed packet switching for local computer networks \\textitCommunications of the ACM 19 (1976) 395 - 404.","DOI":"10.1145\/360248.360253"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795285333"},{"key":"e_1_3_2_1_38_1","series-title":"Transmission series 14 (1978) 259 - 280","volume-title":"Prob. Inf","author":"Tsybakov B.S.","year":"1977","unstructured":"B.S. Tsybakov and V.A. Mikhailov , Free synchronous packet access in a broadcast channel with feedback , Prob. Inf . Transmission series 14 (1978) 259 - 280 . (Translated from Russian original in Prob. Peredach. Inf ., 1977 .) B.S. Tsybakov and V.A. Mikhailov, Free synchronous packet access in a broadcast channel with feedback, Prob. Inf. Transmission series 14 (1978) 259 - 280. (Translated from Russian original in Prob. Peredach. Inf., 1977.)"}],"event":{"name":"PODC '17: ACM Symposium on Principles of Distributed Computing","location":"Washington DC USA","acronym":"PODC '17","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087801.3087831","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087801.3087831","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:07Z","timestamp":1750217407000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087801.3087831"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,25]]},"references-count":38,"alternative-id":["10.1145\/3087801.3087831","10.1145\/3087801"],"URL":"https:\/\/doi.org\/10.1145\/3087801.3087831","relation":{},"subject":[],"published":{"date-parts":[[2017,7,25]]},"assertion":[{"value":"2017-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}