{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:48:49Z","timestamp":1725558529250},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406716"},{"type":"electronic","value":"9783540451389"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45138-9_9","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T18:41:48Z","timestamp":1277232108000},"page":"152-161","source":"Crossref","is-referenced-by-count":1,"title":["On Optimal Merging Networks"],"prefix":"10.1007","author":[{"given":"Kazuyuki","family":"Amano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Maruoka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0166-218X(94)00015-6","volume":"61","author":"M. Aigner","year":"1995","unstructured":"Aigner, M., Schwarzkopf, O.: Bounds of the Size of Merging Networks. Discrete Applied Mathematics\u00a061, 187\u2013194 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR2","first-page":"307","volume":"32","author":"K.E. Batcher","year":"1968","unstructured":"Batcher, K.E.: Sorting Networks and Their Applications. Proc. AFIPS 1968 SJCC\u00a032, 307\u2013314 (1968)","journal-title":"Proc. AFIPS 1968 SJCC"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1006\/inco.2001.2934","volume":"168","author":"S. Iwata","year":"2001","unstructured":"Iwata, S.: Lower Bounds for Merging Networks. Information and Computation\u00a0168, 187\u2013205 (2001)","journal-title":"Information and Computation"},{"key":"9_CR4","series-title":"Sorting and Searching","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming, 2nd edn. Sorting and Searching, vol.\u00a03. Addison-Wesley, Reading (1998)","edition":"2"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Leighton, T., Ma, Y., Suel, T.: On Probabilistic Networks for Selection, Merging, and Sorting. In: Proc. 7th Symp. Parallel Algorithms and Architectures, pp. 106\u2013118 (1995)","DOI":"10.1145\/215399.215429"},{"key":"9_CR6","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/227595.227693","volume":"43","author":"P.B. Miltersen","year":"1996","unstructured":"Miltersen, P.B., Paterson, M., Tarui, J.: The Asymptotic Complexity of Merging Networks. J. Assoc. Comput. Mach.\u00a043, 147\u2013165 (1996)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9_CR7","first-page":"137","volume":"E83-D","author":"K. Yamazaki","year":"2000","unstructured":"Yamazaki, K., Mizuno, H., Masuda, K., Iwata, S.: Minimum Number of Comparators in (6,6)-merging Network. IEICE Trans. Inform. Syst.\u00a0E83-D, 137\u2013141 (2000)","journal-title":"IEICE Trans. Inform. Syst."},{"key":"9_CR8","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1145\/321958.321976","volume":"23","author":"A.C. Yao","year":"1976","unstructured":"Yao, A.C., Yao, F.F.: Lower Bounds of Merging Networks. J. Assoc. Comput. Mach.\u00a023, 566\u2013571 (1976)","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45138-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T21:29:04Z","timestamp":1552598944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45138-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406716","9783540451389"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45138-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}