{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T14:42:49Z","timestamp":1750603369694},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319720494"},{"type":"electronic","value":"9783319720500"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-72050-0_1","type":"book-chapter","created":{"date-parts":[[2017,12,29]],"date-time":"2017-12-29T11:57:13Z","timestamp":1514548633000},"page":"3-14","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Leader Election in SINR Model with Arbitrary Power Control"],"prefix":"10.1007","author":[{"given":"Magn\u00fas M.","family":"Halld\u00f3rsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephan","family":"Holzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelia Anna","family":"Markatou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,30]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Abramson, N.: The ALOHA system: another alternative for computer communications. In: Proceedings of the Fall Joint Computer Conference, AFIPS 1970 (Fall), 17\u201319 November 1970, pp. 281\u2013285. ACM, New York (1970)","DOI":"10.1145\/1478462.1478502"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization. In: PODC, pp. 98\u2013108. ACM (1987)","DOI":"10.1145\/41840.41849"},{"issue":"11","key":"1_CR3","doi-asserted-by":"crossref","first-page":"5106","DOI":"10.1109\/TIT.2006.883617","volume":"52","author":"SA Borbash","year":"2006","unstructured":"Borbash, S.A., Ephremides, A.: Wireless link scheduling with power control and SINR constraints. IEEE Trans. Inf. Theory 52(11), 5106\u20135111 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1_CR4","doi-asserted-by":"crossref","first-page":"1240","DOI":"10.1109\/TCOM.1985.1096245","volume":"33","author":"I Chlamtac","year":"1985","unstructured":"Chlamtac, I., Kutten, S.: On broadcasting in radio networks-problem analysis and protocol design. IEEE Trans. Commun. 33(12), 1240\u20131246 (1985)","journal-title":"IEEE Trans. Commun."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Cruz, R.L., Santhanam, A.V.: Optimal routing, link scheduling and power control in multihop wireless networks. In: INFOCOM, vol. 1, pp. 702\u2013711 (2003)","DOI":"10.1109\/INFCOM.2003.1208720"},{"key":"1_CR6","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.tcs.2016.01.037","volume":"621","author":"D Dereniowski","year":"2016","unstructured":"Dereniowski, D., Pelc, A.: Topology recognition and leader election in colored networks. Theoret. Comput. Sci. 621, 92\u2013102 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Fineman, J.T., Gilbert, S., Kuhn, F., Newport, C.: Contention resolution on a fading channel. In: PODC, pp. 155\u2013164. ACM (2016)","DOI":"10.1145\/2933057.2933091"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Gallager, R.G.: A perspective on multiaccess channels. Technical report, DTIC Document (1985)","DOI":"10.21236\/ADA150183"},{"issue":"2","key":"1_CR9","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1109\/18.825799","volume":"46","author":"P Gupta","year":"2006","unstructured":"Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Trans. Inf. Theor. 46(2), 388\u2013404 (2006)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: The complexity of connectivity in wireless networks. In: INFOCOM (2006)","DOI":"10.1109\/INFOCOM.2006.23"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Newport, C.C.: Radio network lower bounds made easy. CoRR, abs\/1405.7300 (2014)","DOI":"10.1007\/978-3-662-45174-8_18"},{"issue":"2","key":"1_CR12","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."}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72050-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T17:21:09Z","timestamp":1570555269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72050-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319720494","9783319720500"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72050-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}