{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:52Z","timestamp":1725663412679},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540555995"},{"type":"electronic","value":"9783540472506"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55599-4_79","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:16:28Z","timestamp":1330251388000},"page":"37-49","source":"Crossref","is-referenced-by-count":3,"title":["Space-efficient parallel merging"],"prefix":"10.1007","author":[{"given":"Jyrki","family":"Katajainen","sequence":"first","affiliation":[]},{"given":"Christos","family":"Levcopoulos","sequence":"additional","affiliation":[]},{"given":"Ola","family":"Petersson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,14]]},"reference":[{"key":"3_CR1","volume-title":"The Design and Analysis of Parallel Algorithms","author":"S.G. Akl","year":"1989","unstructured":"S.G. Akl. The Design and Analysis of Parallel Algorithms. Prentice-Hall, Englewood Cliffs, N.J., 1989."},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/0890-5401(89)90003-5","volume":"82","author":"R.J. Anderson","year":"1989","unstructured":"R.J. Anderson, E.W. Mayr, and M.K. Warmuth. Parallel approximation algorithms for bin packing. Inform. and Comput., 82:262\u2013277, 1989.","journal-title":"Inform. and Comput."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"K.E. Batcher. Sorting networks and their applications. In Proc. of AFIPS Spring Joint Computer Conf., pages 307\u2013314, 1968.","DOI":"10.1145\/1468075.1468121"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0218014","volume":"18","author":"G. Bilardi","year":"1989","unstructured":"G. Bilardi and A. Nicolau. Adaptive bitonic sorting: An optimal parallel algorithm for shared memory models. SIAM J. Comput, 18:216\u2013228, 1989.","journal-title":"SIAM J. Comput"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0022-0000(85)90008-X","volume":"30","author":"A. Borodin","year":"1985","unstructured":"A. Borodin and J.E. Hopcroft. Routing, sorting, and merging on parallel models of computation. J. Comput. System Sci., 30:130\u2013145, 1985.","journal-title":"J. Comput. System Sci."},{"key":"3_CR6","doi-asserted-by":"publisher","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":"3_CR7","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/0743-7315(89)90009-9","volume":"6","author":"E. Dekel","year":"1989","unstructured":"E. Dekel and I. Ozsvath. Parallel external merging. J. Parallel Distr. Comput., 6:623\u2013635, 1989.","journal-title":"J. Parallel Distr. Comput."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1146\/annurev.cs.03.060188.001313","volume":"3","author":"D. Eppstein","year":"1988","unstructured":"D. Eppstein and Z. Galil. Parallel algorithmic techniques for combinatorial computation. Annual Reviews in Computer Science, 3:233\u2013283, 1988.","journal-title":"Annual Reviews in Computer Science"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1109\/12.88483","volume":"40","author":"X. Guan","year":"1991","unstructured":"X. Guan and M.A. Langston. Time-space optimal parallel merging and sorting. IEEE Trans. Comput., 40:596\u2013602, 1991.","journal-title":"IEEE Trans. Comput."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(89)90138-5","volume":"33","author":"T. Hagerup","year":"1989","unstructured":"T. Hagerup and C. R\u00fcb. Optimal merging and sorting on the EREW PRAM. Inform. Process. Lett., 33:181\u2013185, 1989.","journal-title":"Inform. Process. Lett."},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1145\/42392.42403","volume":"31","author":"B.-C. Huang","year":"1988","unstructured":"B.-C. Huang and M.A. Langston. Practical in-place merging. Comm. ACM, 31:348\u2013352, 1988.","journal-title":"Comm. ACM"},{"key":"3_CR12","unstructured":"B.-C. Huang and M.A. Langston. Fast stable merging and sorting in constant extra space. In Proc. Internat. Conf. on Computing and Information, pages 71\u201380, 1989."},{"key":"3_CR13","volume-title":"Handbook of Theoretical Computer Science","author":"R.M. Karp","year":"1990","unstructured":"R.M. Karp and V. Ramachandran. A survey of parallel algorithms for shared memory machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. North-Holland, Amsterdam, The Netherlands, 1990."},{"key":"3_CR14","first-page":"1256","volume":"186","author":"M.A. Kronrod","year":"1969","unstructured":"M.A. Kronrod. An optimal ordering algorithm without a field of operation. Dokladi Akademia Nauk SSSR, 186:1256\u20131258, 1969.","journal-title":"Dokladi Akademia Nauk SSSR"},{"key":"3_CR15","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 Trans. Comput., C-32:942\u2013946, 1983.","journal-title":"IEEE Trans. Comput."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(90)90192-K","volume":"71","author":"C.P. Kruskal","year":"1990","unstructured":"C.P. Kruskal, L. Rudolph, and M. Snir. A complexity theory of efficient parallel algorithms. Theoret. Comput. Sci., 71:95\u2013132, 1990.","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0020-0190(84)90112-1","volume":"18","author":"H. Mannila","year":"1984","unstructured":"H. Mannila and E. Ukkonen. A simple linear-time algorithm for in situ merging. Inform. Process. Lett., 18:203\u2013208, 1984.","journal-title":"Inform. Process. Lett."},{"key":"3_CR18","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1109\/TC.1978.1675167","volume":"C-27","author":"F.P Preparata","year":"1978","unstructured":"F.P Preparata. New parallel-sorting schemes. IEEE Trans. Comput., C-27:669\u2013673, 1978.","journal-title":"IEEE Trans. Comput."},{"key":"3_CR19","volume-title":"Designing Efficient Algorithms for Parallel Computers","author":"M.J. Quinn","year":"1987","unstructured":"M.J. Quinn. Designing Efficient Algorithms for Parallel Computers. North-Holland, New York, 1987."},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/0196-6774(87)90050-2","volume":"8","author":"J. Salowe","year":"1987","unstructured":"J. Salowe and W. Steiger. Simplified stable merging tasks. J. Algorithms, 8:557\u2013571, 1987.","journal-title":"J. Algorithms"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0166-218X(90)90084-P","volume":"29","author":"B. Schieber","year":"1990","unstructured":"B. Schieber and U. Vishkin. Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm. Discrete Applied Math., 29:97\u2013111, 1990.","journal-title":"Discrete Applied Math."},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1145\/357114.357116","volume":"2","author":"J.T. Schwartz","year":"1980","unstructured":"J.T. Schwartz. Ultracomputers. ACM Trans. Program. Lang. Syst., 2:484\u2013521, 1980.","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","volume":"12","author":"Y. Shiloach","year":"1981","unstructured":"Y. Shiloach and U. Vishkin. Finding the maximum, merging, and sorting in a parallel computational model. J. Algorithms, 12:88\u2013102, 1981.","journal-title":"J. Algorithms"},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1137\/0214051","volume":"15","author":"M. Snir","year":"1985","unstructured":"M. Snir. On parallel searching. SIAM J. Comput., 15:688\u2013708, 1985.","journal-title":"SIAM J. Comput."},{"key":"3_CR25","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","volume":"C-20","author":"H.S. Stone","year":"1971","unstructured":"H.S. Stone. Parallel processing with the perfect shuffle. IEEE Trans. Comput., C-20:153\u2013161, 1971.","journal-title":"IEEE Trans. Comput."},{"key":"3_CR26","volume-title":"Handbook of Theoretical Computer Science","author":"L.G. Valiant","year":"1990","unstructured":"L.G. Valiant. General purpose parallel architectures. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. North-Holland, Amsterdam, The Netherlands, 1990."}],"container-title":["Lecture Notes in Computer Science","PARLE '92 Parallel Architectures and Languages Europe"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55599-4_79.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:32:43Z","timestamp":1619573563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55599-4_79"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540555995","9783540472506"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-55599-4_79","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}