{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:06:45Z","timestamp":1746058005119},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642140303"},{"type":"electronic","value":"9783642140310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14031-0_41","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T05:50:06Z","timestamp":1277704206000},"page":"378-388","source":"Crossref","is-referenced-by-count":7,"title":["Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks"],"prefix":"10.1007","author":[{"given":"Antonio Fern\u00e1ndez","family":"Anta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel A.","family":"Mosteiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","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: 17th Ann. ACM Symp. on Parallel Algorithms and Architectures, pp. 325\u2013332 (2005)","DOI":"10.1145\/1073970.1074023"},{"issue":"5","key":"41_CR2","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1109\/TIT.1979.1056093","volume":"IT-25","author":"J. Capetanakis","year":"1979","unstructured":"Capetanakis, J.: Tree algorithms for packet broadcast channels. IEEE Trans. Inf. Theory\u00a0IT-25(5), 505\u2013515 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"41_CR3","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.\u00a01, pp. 401\u2013456. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Clementi, A., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proc. of the 12th Ann. ACM-SIAM Symp. on Discrete Algorithms, pp. 709\u2013718 (2001)","DOI":"10.1145\/383962.384040"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Ger\u00e8b-Graus, M., Tsantilas, T.: Efficient optical communication in parallel computers. In: 4th Ann. ACM Symp. on Parallel Algorithms and Architectures, pp. 41\u201348 (1992)","DOI":"10.1145\/140901.140906"},{"key":"41_CR6","doi-asserted-by":"publisher","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. Journal of the ACM\u00a032, 589\u2013596 (1985)","journal-title":"Journal of the ACM"},{"key":"41_CR7","first-page":"345","volume":"5","author":"R.I. Greenberg","year":"1989","unstructured":"Greenberg, R.I., Leiserson, C.E.: Randomized routing on fat-trees. Advances in Computing Research\u00a05, 345\u2013374 (1989)","journal-title":"Advances in Computing Research"},{"key":"41_CR8","doi-asserted-by":"publisher","first-page":"1178","DOI":"10.1109\/TCOM.1978.1094204","volume":"COM-26","author":"J.F. Hayes","year":"1978","unstructured":"Hayes, J.F.: An adaptive technique for local distribution. IEEE Trans. Comm.\u00a0COM-26, 1178\u20131186 (1978)","journal-title":"IEEE Trans. Comm."},{"key":"41_CR9","unstructured":"Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: Proc. of the 13th Ann. ACM-SIAM Symp. on Discrete Algorithms, pp. 697\u2013704 (2002)"},{"key":"41_CR10","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\u00a031, 303\u2013306 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Kowalski, D.R.: On selection problem in radio networks. In: Proc. 24th Ann. ACM Symp. on Principles of Distributed Computing, pp. 158\u2013166 (2005)","DOI":"10.1145\/1073814.1073843"},{"issue":"3","key":"41_CR12","doi-asserted-by":"publisher","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 Journal on Computing\u00a027(3), 702\u2013712 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"41_CR13","doi-asserted-by":"publisher","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.\u00a052, 7\u201313 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"41_CR14","first-page":"32","volume":"14","author":"V. Mikhailov","year":"1978","unstructured":"Mikhailov, V., Tsybakov, B.S.: Free synchronous packet access in a broadcast channel with feedback. Problemy Peredachi Inform\u00a014(4), 32\u201359 (1978)","journal-title":"Problemy Peredachi Inform"},{"key":"41_CR15","volume-title":"Elementary Inequalities","author":"D.S. Mitrinovi\u0107","year":"1964","unstructured":"Mitrinovi\u0107, D.S.: Elementary Inequalities. P. Noordhoff Ltd., Groningen (1964)"},{"key":"41_CR16","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":"41_CR17","doi-asserted-by":"publisher","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 Journal on Computing\u00a015, 468\u2013477 (1986)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14031-0_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:46:45Z","timestamp":1606168005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14031-0_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642140303","9783642140310"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14031-0_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}