{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:17:08Z","timestamp":1726413428307},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,12,1]],"date-time":"2010-12-01T00:00:00Z","timestamp":1291161600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s00607-010-0124-x","type":"journal-article","created":{"date-parts":[[2010,11,30]],"date-time":"2010-11-30T00:07:45Z","timestamp":1291075665000},"page":"365-378","source":"Crossref","is-referenced-by-count":2,"title":["Integer merging on EREW PRAM"],"prefix":"10.1007","volume":"91","author":[{"given":"Hazem M.","family":"Bahig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,12,1]]},"reference":[{"key":"124_CR1","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":"124_CR2","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":"124_CR3","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. Discrete Appl Math 155(4): 442\u2013456","journal-title":"Discrete Appl Math"},{"key":"124_CR4","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"},{"issue":"1","key":"124_CR5","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 Comput Syst Sci 30(1): 130\u2013145","journal-title":"J Comput Syst Sci"},{"key":"124_CR6","volume-title":"Introduction to algorithms","author":"T Cormen","year":"1990","unstructured":"Cormen T, Leiserson C, Rivest R (1990) Introduction to algorithms. MIT Press, Cambridge\/Massachusetts"},{"issue":"2","key":"124_CR7","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"},{"key":"124_CR8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0255(90)90021-2","volume":"51","author":"N Deo","year":"1990","unstructured":"Deo N, Sarak D (1990) Parallel algorithms for merging and sorting. Inf Sci 51: 121\u2013131","journal-title":"Inf Sci"},{"issue":"6","key":"124_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":"124_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. Algorithmca 17: 55\u201366","journal-title":"Algorithmca"},{"issue":"4","key":"124_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(4): 181\u2013185","journal-title":"Inf Process Lett"},{"key":"124_CR12","first-page":"870","volume":"A","author":"R Karp","year":"1990","unstructured":"Karp R, Ramachandran V (1990) Parallel algorithms for shared-memory machines. Handb Theor Comput Sci A: 870\u2013941","journal-title":"Handb Theor Comput Sci"},{"issue":"4","key":"124_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":"124_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-Wesley, Reading"},{"issue":"10","key":"124_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":"124_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. Handb Theor Comput Sci 7: 95\u2013132","journal-title":"Handb Theor Comput Sci"},{"key":"124_CR17","volume-title":"Relational information systems","author":"T Merrett","year":"1984","unstructured":"Merrett T (1984) Relational information systems. Reston Publishing Co., Reston"},{"key":"124_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 Algorithm 2: 88\u2013102","journal-title":"J Algorithm"},{"key":"124_CR19","doi-asserted-by":"crossref","unstructured":"Taniar D, Rahayu W (1997) Parallel double sort-merge algorithm for object-oriented collection join queries. In: Proceedings of international conference on high performance computing HPC ASIA\u201997, IEEE Computer Society Press, Seoul, Korea, pp 122\u2013127","DOI":"10.1109\/HPC.1997.592134"},{"key":"124_CR20","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/348.318590","volume":"9","author":"P Valduriez","year":"1984","unstructured":"Valduriez P, Gardarin G (1984) Join and semijoin algorithms for multiprocessors database machines. ACM Trans Database Syst 9: 133\u2013161","journal-title":"ACM Trans Database Syst"},{"key":"124_CR21","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0167-8191(90)90040-G","volume":"15","author":"P Varman","year":"1990","unstructured":"Varman P, Iyer B, Haderle B, Dunn S (1990) Parallel merging: alogrithm and implementation results. Parallel Comput 15: 165\u2013177","journal-title":"Parallel Comput"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-010-0124-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-010-0124-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-010-0124-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T13:12:46Z","timestamp":1559826766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-010-0124-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,1]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["124"],"URL":"https:\/\/doi.org\/10.1007\/s00607-010-0124-x","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2010,12,1]]}}}