{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T09:04:50Z","timestamp":1648976690993},"reference-count":4,"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":[[2004,3]]},"abstract":"<jats:p> We present an algorithm for parallel construction of Huffman codes in [Formula: see text] time with p processors, where p&gt;1, improving the previous result of Levcopoulos and Przytycka. We also show, that a greedy Huffman tree can be constructed in [Formula: see text] time with n processors. <\/jats:p>","DOI":"10.1142\/s012962640400174x","type":"journal-article","created":{"date-parts":[[2004,4,30]],"date-time":"2004-04-30T10:44:06Z","timestamp":1083321846000},"page":"99-105","source":"Crossref","is-referenced-by-count":0,"title":["WORK-EFFICIENT ALGORITHMS FOR THE CONSTRUCTION OF LENGTH-LIMITED HUFFMAN CODES"],"prefix":"10.1142","volume":"14","author":[{"given":"MAREK","family":"KARPINSKI","sequence":"first","affiliation":[{"name":"Dept. of Computer Science, University of Bonn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LAWRENCE","family":"LARMORE","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Nevada, Las Vegas, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YAKOV","family":"NEKRICH","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science, University of Bonn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01941687"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792233245"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626494000053"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012962640400174X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:28:45Z","timestamp":1565184525000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012962640400174X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":4,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2004,3]]}},"alternative-id":["10.1142\/S012962640400174X"],"URL":"https:\/\/doi.org\/10.1142\/s012962640400174x","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}