{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T00:28:56Z","timestamp":1649118536842},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,6,2]],"date-time":"2007-06-02T00:00:00Z","timestamp":1180742400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2008,1]]},"DOI":"10.1007\/s11227-007-0141-5","type":"journal-article","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T17:36:02Z","timestamp":1180719362000},"page":"99-104","source":"Crossref","is-referenced-by-count":2,"title":["Parallel merging with restriction"],"prefix":"10.1007","volume":"43","author":[{"given":"Hazem M.","family":"Bahig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,6,2]]},"reference":[{"key":"141_CR1","volume-title":"Parallel sorting algorithms","author":"S Akl","year":"1985","unstructured":"Akl S (1985) Parallel sorting algorithms. Academic Press, Orlando"},{"key":"141_CR2","volume-title":"Parallel computation: models and methods","author":"S Akl","year":"1997","unstructured":"Akl S (1997) Parallel computation: models and methods. Prentice Hall, Upper Saddle River"},{"key":"141_CR3","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1109\/TC.1987.5009478","volume":"36","author":"S Akl","year":"1987","unstructured":"Akl S, Santoro N (1987) Optimal parallel merging and sorting without memory conflicts. IEEE Trans Comput 36:1367\u20131369","journal-title":"IEEE Trans Comput"},{"issue":"4","key":"141_CR4","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1016\/j.dam.2006.07.005","volume":"155","author":"J Bang-Jensen","year":"2007","unstructured":"Bang-Jensen J, Huang J, Ibarra L (2007) Recognizing and representing proper interval graphs in parallel using merging and sorting. Discret Appl Math 155(4):442\u2013456","journal-title":"Discret Appl Math"},{"key":"141_CR5","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1006\/inco.1993.1056","volume":"106","author":"O Berkman","year":"1993","unstructured":"Berkman O, Vishkin U (1993) On parallel integer merging. Inf Comput 106:266\u2013285","journal-title":"Inf Comput"},{"key":"141_CR6","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(85)90008-X","volume":"30","author":"A Borodin","year":"1985","unstructured":"Borodin A, Hopcroft J (1985) Routing, merging, and sorting on parallel models of computation. J\u00a0Comput Syst Sci 30:130\u2013145","journal-title":"J\u00a0Comput Syst Sci"},{"key":"141_CR7","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"1990","unstructured":"Cormen TH, Leiserson CE, Rivest RL (1990) Introduction to algorithms. MIT, Cambridge"},{"issue":"2","key":"141_CR8","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0020-0190(94)00009-3","volume":"50","author":"N Deo","year":"1994","unstructured":"Deo N, Jain A, Medidi M (1994) An optimal parallel algorithm for merging using multiselection. Inf Process Lett 50(2):81\u201388","journal-title":"Inf Process Lett"},{"issue":"6","key":"141_CR9","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1016\/S0167-8191(00)00104-6","volume":"27","author":"A Gerbessiotis","year":"2001","unstructured":"Gerbessiotis A, Siniolakis C (2001) Merging on the BSP model. Parallel Comput 27(6):809\u2013822","journal-title":"Parallel Comput"},{"key":"141_CR10","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF02523238","volume":"17","author":"T Hagerup","year":"1997","unstructured":"Hagerup T, Kutylowski M (1997) Fast integer merging on the EREW PRAM. Algorithmica 17:55\u201366","journal-title":"Algorithmica"},{"key":"141_CR11","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(89)90138-5","volume":"33","author":"T Hagerup","year":"1989","unstructured":"Hagerup T, Rub C (1989) Optimal merging and sorting on the EREW PRAM. Inf Process Lett 33:181\u2013185","journal-title":"Inf Process Lett"},{"key":"141_CR12","doi-asserted-by":"crossref","unstructured":"Karp R, Ramachandran V (1990) Parallel algorithms for shared-memory machines. In: Van Leeuven J (ed) Handbook of theoretical computer science, vol\u00a0A: Algorithms and complexity. Elsevier, Amsterdam, pp 869\u2013941","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"issue":"4","key":"141_CR13","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/S0167-739X(03)00129-8","volume":"20","author":"C Katsinis","year":"2004","unstructured":"Katsinis C (2004) Merging, sorting and matrix operations on the SOME-Bus multiprocessor architecture. Futur Gener Comput Syst 20(4):643\u2013661","journal-title":"Futur Gener Comput Syst"},{"key":"141_CR14","volume-title":"The art of computer programming: sorting and searching","author":"D Knuth","year":"1973","unstructured":"Knuth D (1973) The art of computer programming: sorting and searching. Addison\u2013Wesley, Reading"},{"issue":"10","key":"141_CR15","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/TC.1983.1676138","volume":"32","author":"C Kruskal","year":"1983","unstructured":"Kruskal C (1983) Searching, merging, and sorting in parallel computation. IEEE Trans Comput 32(10):942\u2013946","journal-title":"IEEE Trans Comput"},{"key":"141_CR16","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(90)90192-K","volume":"7","author":"C Kruskal","year":"1990","unstructured":"Kruskal C, Rudolph L, Snir M (1990) A complexity theory of efficient parallel algorithms. Theor Comput Sci 7:95\u2013132","journal-title":"Theor Comput Sci"},{"key":"141_CR17","unstructured":"Nagaraja S, Pan Y, Badii M (2001) A parallel merging algorithm and its implementation with JAVA threads. In: The Mid-Atlantic student workshop on programming languages and systems, IBM Watson Research Centre, 27 April 2001"},{"key":"141_CR18","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","volume":"2","author":"Y Shiloach","year":"1981","unstructured":"Shiloach Y, Vishkin U (1981) Finding the maximum, merging, and sorting in a parallel computational models. J Algorithms 2:88\u2013102","journal-title":"J Algorithms"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-007-0141-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-007-0141-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-007-0141-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:23:56Z","timestamp":1559384636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-007-0141-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,2]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["141"],"URL":"https:\/\/doi.org\/10.1007\/s11227-007-0141-5","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,2]]}}}