{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:58:13Z","timestamp":1725551893759},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540311980"},{"type":"electronic","value":"9783540322177"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11611257_32","type":"book-chapter","created":{"date-parts":[[2006,1,5]],"date-time":"2006-01-05T16:37:18Z","timestamp":1136479038000},"page":"341-349","source":"Crossref","is-referenced-by-count":7,"title":["Merging and Merge-Sort in a Single Hop Radio Network"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Kik","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579338","volume":"3","author":"M. Ajtai","year":"1983","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: Sorting in c logn Parallel Steps. Combinatorica\u00a03, 1\u201319 (1983)","journal-title":"Combinatorica"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Batcher, K.E.: Sorting Networks and Their Applications. In: Proceedings of 32nd\u00a0AFIPS, pp. 307\u2013314 (1968)","DOI":"10.1145\/1468075.1468121"},{"issue":"4","key":"32_CR3","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M. Blum","year":"1973","unstructured":"Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., Tarjan, R.E.: Time Bounds for Selection. Journal of Computer System Sciences\u00a07(4), 448\u2013461 (1973)","journal-title":"Journal of Computer System Sciences"},{"key":"32_CR4","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms (1994)"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/571825.571833","volume-title":"ACM PODC 2002","author":"T. Jurdzi\u0144ski","year":"2002","unstructured":"Jurdzi\u0144ski, T., Kuty\u0142owski, M., Zatopia\u0144ski, J.: Efficient Algorithms for Leader Election in Radio Networks. In: ACM PODC 2002, pp. 51\u201357. ACM Press, New York (2002)"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-45655-4_31","volume-title":"Computing and Combinatorics","author":"T. Jurdzi\u0144ski","year":"2002","unstructured":"Jurdzi\u0144ski, T., Kuty\u0142owski, M., Zatopia\u0144ski, J.: Energy-Efficient Size Approximation for Radio Networks with No Collision Detection. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, pp. 279\u2013289. Springer, Heidelberg (2002)"},{"key":"32_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/978-3-540-45138-9_45","volume-title":"Mathematical Foundations of Computer Science 2003","author":"M. Kuty\u0142owski","year":"2003","unstructured":"Kuty\u0142owski, M., Letkiewicz, D.: Computing Average Value in Ad Hoc Networks. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 511\u2013520. Springer, Heidelberg (2003)"},{"key":"32_CR8","first-page":"263","volume-title":"ICPP 2000","author":"K. Nakano","year":"2000","unstructured":"Nakano, K., Olariu, S.: Efficient Initialization Protocols for Radio Networks with No Collision Detection. In: ICPP 2000, pp. 263\u2013270. IEEE Computer Society Press, New York (2000)"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1109\/71.819949","volume":"10","author":"K. Nakano","year":"1999","unstructured":"Nakano, K., Olariu, S.: Broadcast-Efficient Protocols for Mobile Radio Networks with Few Channels. IEEE Transactions on Parallel and Distributed Systems\u00a010, 1276\u20131289 (1999)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Singh, M., Prasanna, V.K.: Optimal Energy Balanced Algorithm for Selection in Single Hop Sensor Network. In: SNPA ICC (May 2003)","DOI":"10.1109\/SNPA.2003.1203352"},{"key":"32_CR11","unstructured":"Singh, M., Prasanna, V.K.: Energy-Optimal and Energy-Balanced Sorting in a Single-Hop Sensor Network. In: PERCOM (March 2003)"},{"key":"32_CR12","unstructured":"Compendium of Large-Scale Optimization Problems (DELIS, Subproject\u00a03), \n                    \n                      http:\/\/ru1.cti.gr\/delis-sp3\/"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2006: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11611257_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:09:32Z","timestamp":1619507372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11611257_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540311980","9783540322177"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11611257_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}