{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T23:42:59Z","timestamp":1649202179964},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[1998,9]]},"abstract":"<jats:p> We show how to construct optimal binary search trees in O(n<jats:sup>1 - \u220a<\/jats:sup> log (n)) time with the total work O(n<jats:sup>2 + 2 \u220a<\/jats:sup>), for arbitrarily small constant [Formula: see text]. This is optimal within factor n<jats:sup>2 \u220a<\/jats:sup> with respect to the best known sequential algorithm given by Knuth, which needs only O(n<jats:sup>2<\/jats:sup>) time due to a monotonicity property of optimal binary search trees, see [6]. <\/jats:p>","DOI":"10.1142\/s0129626498000390","type":"journal-article","created":{"date-parts":[[2003,9,8]],"date-time":"2003-09-08T09:56:09Z","timestamp":1063014969000},"page":"387-397","source":"Crossref","is-referenced-by-count":0,"title":["On a Sublinear Time Parallel Construction of Optimal Binary Search Trees"],"prefix":"10.1142","volume":"08","author":[{"given":"Marek","family":"Karpinski","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Bonn, Roemerstrasse 164, D-53117 Bonn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[{"name":"Institute of Informatics, Warsaw University, and Department of Computer Science, Liverpool University, England"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626498000390","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:33:37Z","timestamp":1565184817000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626498000390"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":0,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1998,9]]}},"alternative-id":["10.1142\/S0129626498000390"],"URL":"https:\/\/doi.org\/10.1142\/s0129626498000390","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}