{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T20:59:47Z","timestamp":1762808387178,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,2,15]],"date-time":"2016-02-15T00:00:00Z","timestamp":1455494400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council (GB)","doi-asserted-by":"publisher","award":["EP\/G023018\/1"],"award-info":[{"award-number":["EP\/G023018\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004281","name":"Polish National Science Centre","doi-asserted-by":"crossref","award":["DEC-2012\/07\/B\/ST6\/01534, DEC-2013\/09\/B\/ST6\/01538"],"award-info":[{"award-number":["DEC-2012\/07\/B\/ST6\/01534, DEC-2013\/09\/B\/ST6\/01538"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s00446-016-0265-z","type":"journal-article","created":{"date-parts":[[2016,2,15]],"date-time":"2016-02-15T11:33:00Z","timestamp":1455535980000},"page":"341-359","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Randomized mutual exclusion on a multiple access channel"],"prefix":"10.1007","volume":"29","author":[{"given":"Marcin","family":"Bienkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Klonowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miroslaw","family":"Korzeniowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dariusz R.","family":"Kowalski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,15]]},"reference":[{"key":"265_CR1","doi-asserted-by":"crossref","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","author":"H Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. Wiley, New York (2004)"},{"key":"265_CR2","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers Inc, Burlington (1996)"},{"issue":"7","key":"265_CR3","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1109\/TPDS.2010.162","volume":"22","author":"J Czyzowicz","year":"2011","unstructured":"Czyzowicz, J., Gasieniec, L., Kowalski, D.R., Pelc, A.: Consensus and mutual exclusion in a multiple access channel. IEEE Trans. Parallel Distrib. Syst. 22(7), 1092\u20131104 (2011)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"265_CR4","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","volume":"45","author":"R Bar-Yehuda","year":"1992","unstructured":"Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization. J. Comput. Syst. Sci. 45(1), 104\u2013126 (1992)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"265_CR5","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1109\/TIT.1979.1056093","volume":"25","author":"J Capetanakis","year":"1979","unstructured":"Capetanakis, J.: Tree algorithms for packet broadcast channels. IEEE Trans. Inf. Theory 25(5), 505\u2013515 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 709-718 (2001)","key":"265_CR6","DOI":"10.1145\/383962.384040"},{"issue":"3","key":"265_CR7","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1145\/3828.214125","volume":"32","author":"AG Greenberg","year":"1985","unstructured":"Greenberg, A.G., Winograd, S.: A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels. J. ACM 32(3), 589\u2013596 (1985)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Jurdzinski, T., Kutylowski, M., Zatopianski, J.: Efficient algorithms for leader election in radio networks. In: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC), pp. 51-57 (2002)","key":"265_CR8","DOI":"10.1145\/571825.571833"},{"doi-asserted-by":"crossref","unstructured":"Kowalski, D.R.: On selection problem in radio networks. In: Proceedings of the 24th ACM Symposium on Principles of Distributed Computing (PODC), pp. 158-166 (2005)","key":"265_CR9","DOI":"10.1145\/1073814.1073843"},{"issue":"3","key":"265_CR10","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1137\/S0097539794279109","volume":"27","author":"E Kushilevitz","year":"1998","unstructured":"Kushilevitz, E., Mansour, Y.: An omega(D log (N\/D)) lower bound for broadcast in radio networks. SIAM J. Comput. 27(3), 702\u2013712 (1998)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Nakano, K., Olariu, S.: Uniform leader election protocols for radio networks. IEEE Trans. Parallel Distrib. Syst. 13(5), 516\u2013526 (2002)","key":"265_CR11","DOI":"10.1109\/TPDS.2002.1003864"},{"issue":"4","key":"265_CR12","first-page":"32","volume":"14","author":"BS Tsybakov","year":"1978","unstructured":"Tsybakov, B.S., Mikhailov, V.A.: Free synchronous packet access in a broadcast channel with feedback. Problemy Peredachi Informatsii 14(4), 32\u201359 (1978)","journal-title":"Problemy Peredachi Informatsii"},{"issue":"2","key":"265_CR13","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1137\/0215032","volume":"15","author":"DE Willard","year":"1986","unstructured":"Willard, D.E.: Log-logarithmic selection resolution protocols in a multiple access channel. SIAM J. Comput. 15(2), 468\u2013477 (1986)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., Gasieniec, L., Kowalski, D.R., Radzik, T.: On the wake-up problem in radio networks. In: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), pp. 347-359 (2005)","key":"265_CR14","DOI":"10.1007\/11523468_29"},{"issue":"2","key":"265_CR15","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/S0895480100376022","volume":"14","author":"L Gasieniec","year":"2001","unstructured":"Gasieniec, L., Pelc, A., Peleg, D.: The wakeup problem in synchronous broadcast systems. SIAM J. Discrete Math. 14(2), 207\u2013222 (2001)","journal-title":"SIAM J. Discrete Math."},{"doi-asserted-by":"crossref","unstructured":"Jurdzinski, T., Stachowiak, G.: Probabilistic algorithms for the wakeup problem in single-hop radio networks. In: Proceedings of the 13th International Symposium on Algorithms and Computation (ISAAC), pp. 535-549 (2002)","key":"265_CR16","DOI":"10.1007\/3-540-36136-7_47"},{"doi-asserted-by":"crossref","unstructured":"Jurdzinski, T., Stachowiak, G.: The cost of synchronizing multiple-access channels. In: Proceedings of the 34th ACM Symposium on Principles of Distributed Computing (PODC), pp. 421-430 (2015)","key":"265_CR17","DOI":"10.1145\/2767386.2767439"},{"issue":"2","key":"265_CR18","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1137\/S0097539700381851","volume":"33","author":"LA Goldberg","year":"2004","unstructured":"Goldberg, L.A., Jerrum, M., Kannan, S., Paterson, M.: A bound on the capacity of backoff and acknowledgment-based protocols. SIAM J. Comput. 33(2), 313\u2013331 (2004)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M., He, S., Kuszmaul, B.C., Leiserson, C.E.: Adversarial contention resolution for simple channels. In: Proceedings of the 16th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 325-332 (2005)","key":"265_CR19","DOI":"10.1145\/1073970.1074023"},{"issue":"1","key":"265_CR20","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/2071379.2071384","volume":"8","author":"BS Chlebus","year":"2012","unstructured":"Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Adversarial queuing on the multiple access channel. ACM Trans. Algorithms 8(1), 5 (2012)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"265_CR21","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/0020-0190(76)90071-5","volume":"5","author":"JL Bentley","year":"1976","unstructured":"Bentley, J.L., Yao, A.C.: An almost optimal algorithm for unbounded searching. Inf. Process. Lett. 5(3), 82\u201387 (1976)","journal-title":"Inf. Process. Lett."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0265-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-016-0265-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0265-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0265-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T13:17:00Z","timestamp":1589635020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-016-0265-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,15]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["265"],"URL":"https:\/\/doi.org\/10.1007\/s00446-016-0265-z","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2016,2,15]]}}}