{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:13:33Z","timestamp":1648980813842},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1007\/bf02523238","type":"journal-article","created":{"date-parts":[[2006,11,7]],"date-time":"2006-11-07T23:39:46Z","timestamp":1162942786000},"page":"55-66","source":"Crossref","is-referenced-by-count":8,"title":["Fast integer merging on the EREW PRAM"],"prefix":"10.1007","volume":"17","author":[{"given":"T.","family":"Hagerup","sequence":"first","affiliation":[]},{"given":"M.","family":"Kuty\u0142owski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02523238_CR1","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1142\/S012962649400017X","volume":"4","author":"P. Beame","year":"1994","unstructured":"P. Beame, M. Kik, and M. Kuty\u0142owski, Information broadcasting by exclusive-read PRAMs,Parallel Process. Lett.,4 (1994), 159\u2013169.","journal-title":"Parallel Process. Lett."},{"key":"BF02523238_CR2","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1006\/inco.1993.1056","volume":"106","author":"O. Berkman","year":"1993","unstructured":"O. Berkman and U. Vishkin, On parallel integer merging,Inform. and Comput.,106 (1993), 266\u2013285.","journal-title":"Inform. and Comput."},{"key":"BF02523238_CR3","doi-asserted-by":"crossref","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 machines,SIAM J. Comput.,18 (1989), 216\u2013228.","journal-title":"SIAM J. Comput."},{"key":"BF02523238_CR4","doi-asserted-by":"crossref","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, merging, and sorting on parallel models of computation,J. Comput. System Sci.,30 (1985), 130\u2013145.","journal-title":"J. Comput. System Sci."},{"key":"BF02523238_CR5","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/S0019-9958(86)80023-7","volume":"70","author":"R. Cole","year":"1986","unstructured":"R. Cole and U. Vishkin, Deterministic coin tossing with applications to optimal parallel list ranking,Inform. and Control,70 (1986), 32\u201353.","journal-title":"Inform. and Control"},{"key":"BF02523238_CR6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/0215006","volume":"15","author":"S. Cook","year":"1986","unstructured":"S. Cook, C. Dwork, and R. Reischuk, Upper and lower time bounds for parallel random access machines without simultaneous writes,SIAM J. Comput.,15 (1986), 87\u201397.","journal-title":"SIAM J. Comput."},{"key":"BF02523238_CR7","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 and C. R\u00fcb, Optimal merging and sorting on the EREW PRAM,Inform. Process. Lett.,33 (1989), 181\u2013185.","journal-title":"Inform. Process. Lett."},{"key":"BF02523238_CR8","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1137\/0603047","volume":"3","author":"R. H\u00e4ggkvist","year":"1982","unstructured":"R. H\u00e4ggkvist and P. Hell, Sorting and merging in rounds,SIAM J. Algebraic Discrete Methods,3 (1982), 465\u2013473.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"BF02523238_CR9","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/TC.1983.1676138","volume":"32","author":"C. P. Kruskal","year":"1983","unstructured":"C. P. Kruskal, Searching, merging, and sorting in parallel computation,IEEE Trans. Comput.,32 (1983), 942\u2013946.","journal-title":"IEEE Trans. Comput."},{"key":"BF02523238_CR10","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, San Mateo, CA, 1992."},{"key":"BF02523238_CR11","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/321879.321882","volume":"22","author":"D. E. Muller","year":"1975","unstructured":"D. E. Muller and F. P. Preparata, Bounds to complexities of networks for sorting and for switching,J. Assoc. Comput. Mach.,22 (1975), 195\u2013201.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF02523238_CR12","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0218041","volume":"18","author":"S. Rajasekaran","year":"1989","unstructured":"S. Rajasekaran and J. H. Reif, Optimal and sublogarithmic time randomized parallel sorting algorithms,SIAM J. Comput.,18 (1989), 594\u2013607.","journal-title":"SIAM J. Comput."},{"key":"BF02523238_CR13","doi-asserted-by":"crossref","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 Appl. Math.,29 (1990), 97\u2013111.","journal-title":"Discrete Appl. Math."},{"key":"BF02523238_CR14","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1137\/0214051","volume":"14","author":"M. Snir","year":"1985","unstructured":"M. Snir, On parallel searching,SIAM J. Comput.,14 (1985), 688\u2013708.","journal-title":"SIAM J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02523238.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02523238\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02523238","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:39:41Z","timestamp":1558283981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02523238"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["BF02523238"],"URL":"https:\/\/doi.org\/10.1007\/bf02523238","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}