{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T02:22:10Z","timestamp":1774750930591,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,8,8]],"date-time":"2013-08-08T00:00:00Z","timestamp":1375920000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s00453-013-9816-x","type":"journal-article","created":{"date-parts":[[2013,8,7]],"date-time":"2013-08-07T12:08:39Z","timestamp":1375877319000},"page":"295-314","source":"Crossref","is-referenced-by-count":27,"title":["Unbounded Contention Resolution in Multiple-Access Channels"],"prefix":"10.1007","volume":"67","author":[{"given":"Antonio","family":"Fern\u00e1ndez\u00a0Anta","sequence":"first","affiliation":[]},{"given":"Miguel A.","family":"Mosteiro","sequence":"additional","affiliation":[]},{"given":"Jorge","family":"Ram\u00f3n Mu\u00f1oz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,8,8]]},"reference":[{"key":"9816_CR1","first-page":"146","volume-title":"Proceedings of the IEEE 29th International Conference on Computer Communications","author":"L. Anantharamu","year":"2010","unstructured":"Anantharamu, L., Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Deterministic broadcast on multiple access channels. In: Proceedings of the IEEE 29th International Conference on Computer Communications, pp. 146\u2013150 (2010)"},{"issue":"2","key":"9816_CR2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.3844\/jcssp.2010.205.209","volume":"6","author":"A. Balador","year":"2010","unstructured":"Balador, A., Movaghar, A., Jabbehdari, S.: History based contention window control in ieee 802.11 mac protocol in error prone channel. J. Comput. Sci. 6(2), 205\u2013209 (2010)","journal-title":"J. Comput. Sci."},{"key":"9816_CR3","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, 104\u2013126 (1992)","journal-title":"J. Comput. Syst. Sci."},{"key":"9816_CR4","first-page":"325","volume-title":"ACM 17th Annual Symposium on Parallel Algorithms and Architectures","author":"M.A. Bender","year":"2005","unstructured":"Bender, M.A., Farach-Colton, M., He, S., Kuszmaul, B.C., Leiserson, C.E.: Adversarial contention resolution for simple channels. In: ACM 17th Annual Symposium on Parallel Algorithms and Architectures, pp. 325\u2013332 (2005)"},{"issue":"5","key":"9816_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"},{"key":"9816_CR6","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/978-1-4615-0013-1_11","volume-title":"Handbook on Randomized Computing","author":"B.S. Chlebus","year":"2001","unstructured":"Chlebus, B.S.: Randomized communication in radio networks. In: Pardalos, P.M., Rajasekaran, S., Reif, J.H., Rolim, J.D.P. (eds.) Handbook on Randomized Computing, vol. 1, pp. 401\u2013456. Kluwer Academic, Norwell (2001)"},{"key":"9816_CR7","first-page":"709","volume-title":"Proceedings of the ACM-SIAM 12th Annual Symposium on Discrete Algorithms","author":"A. Clementi","year":"2001","unstructured":"Clementi, A., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proceedings of the ACM-SIAM 12th Annual Symposium on Discrete Algorithms, pp. 709\u2013718 (2001)"},{"key":"9816_CR8","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.tcs.2012.11.030","volume":"472","author":"M. Farach-Colton","year":"2013","unstructured":"Farach-Colton, M., Fern\u00e1ndez Anta, A., Mosteiro, M.A.: Optimal memory-aware sensor network gossiping. Theor. Comput. Sci. 472, 60\u201380 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"9816_CR9","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1142\/S1793830910000796","volume":"2","author":"A. Fern\u00e1ndez Anta","year":"2010","unstructured":"Fern\u00e1ndez Anta, A., Mosteiro, M.A.: Contention resolution in multiple-access channels: k-selection in radio networks. Discrete Math., Algorithms Appl. 2(4), 445\u2013456 (2010)","journal-title":"Discrete Math., Algorithms Appl."},{"key":"9816_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/978-3-642-24100-0_23","volume-title":"Proceedings of the 25th International Symposium on Distributed Computing","author":"A. Fern\u00e1ndez Anta","year":"2011","unstructured":"Fern\u00e1ndez Anta, A., Mosteiro, M.A., Ram\u00f3n Mu\u00f1oz, J.: Unbounded contention resolution in multiple-access channels. In: Proceedings of the 25th International Symposium on Distributed Computing. Lecture Notes in Computer Science, vol. 6950, pp. 225\u2013236. Springer, Berlin (2011)"},{"issue":"2","key":"9816_CR11","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/S0895480100376022","volume":"14","author":"L. G\u0105sieniec","year":"2001","unstructured":"G\u0105sieniec, 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."},{"key":"9816_CR12","first-page":"41","volume-title":"Proceedings of the ACM 4th Annual Symposium on Parallel Algorithms and Architectures","author":"M. Ger\u00e8b-Graus","year":"1992","unstructured":"Ger\u00e8b-Graus, M., Tsantilas, T.: Efficient optical communication in parallel computers. In: Proceedings of the ACM 4th Annual Symposium on Parallel Algorithms and Architectures, pp. 41\u201348 (1992)"},{"key":"9816_CR13","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1145\/3828.214125","volume":"32","author":"A. Greenberg","year":"1985","unstructured":"Greenberg, A., Winograd, S.: A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels. J. ACM 32, 589\u2013596 (1985)","journal-title":"J. ACM"},{"key":"9816_CR14","first-page":"345","volume":"5","author":"R.I. Greenberg","year":"1989","unstructured":"Greenberg, R.I., Leiserson, C.E.: Randomized routing on fat-trees. Adv. Comput. Res. 5, 345\u2013374 (1989)","journal-title":"Adv. Comput. Res."},{"issue":"9","key":"9816_CR15","doi-asserted-by":"crossref","first-page":"1557","DOI":"10.1109\/26.61397","volume":"38","author":"R. Gusella","year":"1990","unstructured":"Gusella, R.: A measurement study of diskless workstation traffic on an ethernet. IEEE Trans. Commun. 38(9), 1557\u20131568 (1990)","journal-title":"IEEE Trans. Commun."},{"key":"9816_CR16","doi-asserted-by":"crossref","first-page":"1178","DOI":"10.1109\/TCOM.1978.1094204","volume":"26","author":"J.F. Hayes","year":"1978","unstructured":"Hayes, J.F.: An adaptive technique for local distribution. IEEE Trans. Commun. 26, 1178\u20131186 (1978)","journal-title":"IEEE Trans. Commun."},{"key":"9816_CR17","first-page":"697","volume-title":"Proceedings of the ACM-SIAM 13th Annual Symposium on Discrete Algorithms","author":"P. Indyk","year":"2002","unstructured":"Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: Proceedings of the ACM-SIAM 13th Annual Symposium on Discrete Algorithms, pp. 697\u2013704 (2002)"},{"issue":"3","key":"9816_CR18","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s00224-005-1144-3","volume":"38","author":"T. Jurdzi\u0144ski","year":"2005","unstructured":"Jurdzi\u0144ski, T., Stachowiak, G.: Probabilistic algorithms for the wakeup problem in single-hop radio networks. Theory Comput. Syst. 38(3), 347\u2013367 (2005)","journal-title":"Theory Comput. Syst."},{"key":"9816_CR19","first-page":"303","volume":"31","author":"J. Koml\u00f2s","year":"1985","unstructured":"Koml\u00f2s, J., Greenberg, A.: An asymptotically nonadaptive algorithm for conflict resolution in multiple-access channels. IEEE Trans. Inf. Theory 31, 303\u2013306 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9816_CR20","first-page":"158","volume-title":"Proceedings of the ACM 24th Annual Symposium on Principles of Distributed Computing","author":"D.R. Kowalski","year":"2005","unstructured":"Kowalski, D.R.: On selection problem in radio networks. In: Proceedings of the ACM 24th Annual Symposium on Principles of Distributed Computing, pp. 158\u2013166 (2005)"},{"issue":"3","key":"9816_CR21","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1137\/S0097539794279109","volume":"27","author":"E. Kushilevitz","year":"1998","unstructured":"Kushilevitz, E., Mansour, Y.: An \u03a9(Dlog(N\/D)) lower bound for broadcast in radio networks. SIAM J. Comput. 27(3), 702\u2013712 (1998)","journal-title":"SIAM J. Comput."},{"key":"9816_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/90.282603","volume":"2","author":"W.E. Leland","year":"1994","unstructured":"Leland, W.E., Taqqu, M.S., Willinger, W., Wilson, D.V.: On the self-similar nature of ethernet traffic (extended version). IEEE\/ACM Trans. Netw. 2, 1\u201315 (1994)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9816_CR23","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(94)90133-3","volume":"52","author":"C.U. Martel","year":"1994","unstructured":"Martel, C.U.: Maximum finding on a multiple access broadcast network. Inf. Process. Lett. 52, 7\u201313 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"9816_CR24","first-page":"32","volume":"14","author":"V.A. Mikhailov","year":"1978","unstructured":"Mikhailov, V.A., Tsybakov, B.S.: Free synchronous packet access in a broadcast channel with feedback. Probl. Pereda. Inf. 14(4), 32\u201359 (1978)","journal-title":"Probl. Pereda. Inf."},{"key":"9816_CR25","volume-title":"Elementary Inequalities","author":"D.S. Mitrinovi\u0107","year":"1964","unstructured":"Mitrinovi\u0107, D.S.: Elementary Inequalities. Noordhoff, Groningen (1964)"},{"key":"9816_CR26","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M. Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"key":"9816_CR27","first-page":"63","volume-title":"Proceedings of the 6th International Symposium on Parallel Architectures, Algorithms and Networks","author":"K. Nakano","year":"2002","unstructured":"Nakano, K., Olariu, S.: A survey on leader election protocols for radio networks. In: Proceedings of the 6th International Symposium on Parallel Architectures, Algorithms and Networks, pp. 63\u201368 (2002)"},{"key":"9816_CR28","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1137\/0215032","volume":"15","author":"D.E. Willard","year":"1986","unstructured":"Willard, D.E.: Log-logarithmic selection resolution protocols in a multiple access channel. SIAM J. Comput. 15, 468\u2013477 (1986)","journal-title":"SIAM J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9816-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9816-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9816-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:12Z","timestamp":1559123112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9816-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,8]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["9816"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9816-x","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,8]]}}}