{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T11:59:58Z","timestamp":1648727998211},"reference-count":1,"publisher":"World Scientific Pub Co Pte Lt","issue":"03n04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2002,9]]},"abstract":"<jats:p> List ranking is considered for linear and circular arrays with P processing units. It was known that this problem can be solved with O(P) communication steps. In this paper we show that the optimal number of communication steps, P - 1 and P\/2, respectively, can be achieved. <\/jats:p>","DOI":"10.1142\/s0129626402001063","type":"journal-article","created":{"date-parts":[[2002,12,11]],"date-time":"2002-12-11T06:18:01Z","timestamp":1039587481000},"page":"375-383","source":"Crossref","is-referenced-by-count":0,"title":["OPTIMAL LIST RANKING ON ONE-DIMENSIONAL ARRAYS"],"prefix":"10.1142","volume":"12","author":[{"given":"JOP F.","family":"SIBEYN","sequence":"first","affiliation":[{"name":"Institut f\u00fcr Informatik, Martin-Luther Universit\u00e4t, Halle, Germany"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"p_3","first-page":"799","volume":"1123","author":"Sibeyn J.F.","year":"1996","journal-title":"LNCS"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626402001063","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:18:52Z","timestamp":1565093932000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626402001063"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":1,"journal-issue":{"issue":"03n04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2002,9]]}},"alternative-id":["10.1142\/S0129626402001063"],"URL":"https:\/\/doi.org\/10.1142\/s0129626402001063","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}