{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T09:01:17Z","timestamp":1649062877018},"reference-count":6,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2003,2]]},"abstract":"<jats:p> The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal parallel merging algorithm is proposed under the EREW PRAM model. This algorithm has a run time of O( log <jats:sup>2<\/jats:sup> n) using O(n\/ log <jats:sup>2<\/jats:sup> n) processors. The cost-optimal merge in the strong sense is still an open problem. <\/jats:p>","DOI":"10.1142\/s0129054103001613","type":"journal-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T00:53:09Z","timestamp":1056502389000},"page":"99-106","source":"Crossref","is-referenced-by-count":0,"title":["ON COST-OPTIMAL MERGE OF TWO INTRANSITIVE SORTED SEQUENCES"],"prefix":"10.1142","volume":"14","author":[{"given":"JIE","family":"WU","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL 33431, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"STEPHEN","family":"OLARIU","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1137\/0403002"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1137\/0217049"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(83)90011-1"},{"key":"rf5","volume-title":"Selected Topics in Graph Theory","author":"Reid K. B.","year":"1979"},{"key":"rf6","first-page":"276","author":"Soroker D.","journal-title":"Journal of Algorithms"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00142-9"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054103001613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:26:38Z","timestamp":1565191598000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054103001613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":6,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2003,2]]}},"alternative-id":["10.1142\/S0129054103001613"],"URL":"https:\/\/doi.org\/10.1142\/s0129054103001613","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}