{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:54Z","timestamp":1725663774793},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578116"},{"type":"electronic","value":"9783540483373"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57811-0_18","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:24:23Z","timestamp":1330244663000},"page":"213-222","source":"Crossref","is-referenced-by-count":0,"title":["Lower bounds for merging on the hypercube"],"prefix":"10.1007","author":[{"given":"Christine","family":"R\u00fcb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"18_CR1","first-page":"339","volume":"319","author":"A. Aggarwal","year":"1988","unstructured":"A. Aggarwal, M.-D. A. Huang, Network complexity of sorting and graph problems and simulating CRCW PRAMs by interconnection networks, AWOC, LNCS 319, pp. 339\u2013350, 1988","journal-title":"AWOC, LNCS"},{"key":"18_CR2","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0218014","volume":"18","author":"G. Bilardi","year":"1989","unstructured":"G. Bilardi, A. Nicolau, Adaptive bitonic sorting: An optimal parallel algorithm for shared-memory machines, SIAM J. Comput. 18, pp. 216\u2013228, 1989.","journal-title":"SIAM J. Comput."},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","volume":"17","author":"R. Cole","year":"1988","unstructured":"R. Cole, Parallel merge sort, SIAM J. Comput. 17, 770\u2013785, 1988.","journal-title":"SIAM J. Comput."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"R. Cypher, G. Plaxton, Deterministic sorting in nearly logarithmic time on the hypercube and related computers, 20th STOC, pp. 193\u2013203, 1990","DOI":"10.1145\/100216.100240"},{"key":"18_CR5","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0196-6774(92)90016-6","volume":"13","author":"R. Cypher","year":"1992","unstructured":"R. Cypher, J.L.C. Sanz, Cubesort: A parallel algorithm for sorting N data items with S-sorters, J. of Algorithms 13, pp. 211\u2013234, 1992","journal-title":"J. of Algorithms"},{"key":"18_CR6","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(89)90138-5","volume":"33","author":"T. Hagerup","year":"1989","unstructured":"T. Hagerup, Ch. R\u00fcb, Optimal merging and sorting on the EREW PRAM, Information Processing Letters 33, pp. 181\u2013185, 1989.","journal-title":"Information Processing Letters"},{"key":"18_CR7","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/TC.1983.1676138","volume":"C-32","author":"C. P. Kruskal","year":"1983","unstructured":"C.P. Kruskal, Searching, merging and sorting in parallel computation, IEEE Transactions on Computers, Vol. C-32, 942\u2013946, 1983.","journal-title":"IEEE Transactions on Computers"},{"key":"18_CR8","volume-title":"Introduction to parallel algorithms and architectures: Arrays, trees, hypercubes","author":"F. T. Leighton","year":"1992","unstructured":"F.T. Leighton, Introduction to parallel algorithms and architectures: Arrays, trees, hypercubes, Morgan Kaufmann Publishers, San Mate, California, 1992"},{"key":"18_CR9","first-page":"264","volume":"I","author":"T. Leighton","year":"1990","unstructured":"T. Leighton, C.G. Plaxton, A (fairly) simple circuit that (usually) sorts, 31st FOCS, Vol. I, pp. 264\u2013274, 1990","journal-title":"31st FOCS"},{"key":"18_CR10","volume-title":"North-Holland Mathematical Library,Vol. 16","author":"F. J. MacWilliams","year":"1978","unstructured":"F.J. MacWilliams, N.J. Sloane, The Theory of Error Correcting Codes, North-Holland Mathematical Library,Vol. 16, North-Holland, Amsterdam-New York-Oxford, 1978"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"P.B. Miltersen, M. Paterson, J. Tarui, The asymptotic complexity of merging networks, 33rd FOCS, pp. 236\u2013246, 1992","DOI":"10.1109\/SFCS.1992.267768"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"C.G. Plaxton, Load balancing, selection and sorting on the hypercube, SPAA, pp. 64\u201373, 1989","DOI":"10.1145\/72935.72943"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"C.G. Plaxton, A hypercubic sorting network with nearly logarithmic depth, 24th STOC, pp. 405\u2013416, 1992","DOI":"10.1145\/129712.129751"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57811-0_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:14:15Z","timestamp":1605629655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57811-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578116","9783540483373"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-57811-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}