{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T11:19:13Z","timestamp":1718623153350},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2006,3]]},"abstract":"<jats:p>In this paper, we consider a parallel algorithm for the patience sorting. The problem is not known to be in the class NC or P-complete. We propose two algorithms for the patience sorting of n distinct integers. The first algorithm runs in [Formula: see text] time using p processors on the EREW PRAM, where m is the number of decreasing subsequences in a solution of the patience sorting. The second algorithm runs in [Formula: see text] time using p processors on the EREW PRAM. If [Formula: see text] is satisfied, the second algorithm becomes cost optimal.<\/jats:p>","DOI":"10.1142\/s0129626406002459","type":"journal-article","created":{"date-parts":[[2006,3,24]],"date-time":"2006-03-24T11:18:03Z","timestamp":1143199083000},"page":"39-51","source":"Crossref","is-referenced-by-count":5,"title":["A Cost Optimal Parallel Algorithm for Patience Sorting"],"prefix":"10.1142","volume":"16","author":[{"given":"TAKAAKI","family":"NAKASHIMA","sequence":"first","affiliation":[{"name":"Tottori University of Environmental Studies, Wakabadai-Kita 1-1-1, Tottori, Tottori, 689-1111, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"AKIHIRO","family":"FUJIWARA","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Electronics, Kyushu Institute of Technology, Kawazu 680-4, Iizuka, Fukuoka, 820-8502, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho A. V.","year":"1974"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-99-00796-X"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00124-1"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1137\/0217049"},{"key":"rf7","volume-title":"Introduction to Algorithm","author":"Cormen T. H.","year":"2001"},{"key":"rf8","unstructured":"F.\u00a0Dehne, A.\u00a0Fabri and A.\u00a0Rau-Chaplin, ACM Symposium on Computational Geometry (1993)\u00a0pp. 298\u2013307."},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90103-X"},{"key":"rf11","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195085914.001.0001","volume-title":"Limits to Parallel Computation: P-Completeness Theory","author":"Greenlaw R.","year":"1995"},{"key":"rf12","series-title":"The Art of Computer Programming","volume-title":"Sorting and Searching","volume":"3","author":"Knuth D. E.","year":"1973"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322232"},{"key":"rf14","first-page":"216","volume":"9","author":"Mallows C. L.","journal-title":"Bulletin of the Institute of Mathematics and its Applications"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054199000332"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626406002459","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,25]],"date-time":"2021-07-25T04:41:12Z","timestamp":1627188072000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626406002459"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3]]},"references-count":12,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2006,3]]}},"alternative-id":["10.1142\/S0129626406002459"],"URL":"https:\/\/doi.org\/10.1142\/s0129626406002459","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,3]]}}}