{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T10:44:15Z","timestamp":1649069055565},"reference-count":8,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4702,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1016\/s0304-3975(99)00080-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:23:52Z","timestamp":1027599832000},"page":"227-238","source":"Crossref","is-referenced-by-count":8,"title":["A space-efficient Huffman decoding algorithm and its parallelism"],"prefix":"10.1016","volume":"246","author":[{"given":"Yih-Kai","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuo-Liang","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00080-8_BIB1","series-title":"Text Compression","author":"Bell","year":"1990"},{"key":"10.1016\/S0304-3975(99)00080-8_BIB2","doi-asserted-by":"crossref","unstructured":"S. Fortune, J. Wyllie, Parallelism in random access machines, in: Proc. ACM Symp. on Theory of Computing, 1978, pp. 114\u2013118.","DOI":"10.1145\/800133.804339"},{"key":"10.1016\/S0304-3975(99)00080-8_BIB3","doi-asserted-by":"crossref","first-page":"2576","DOI":"10.1109\/26.469442","article-title":"Memory efficient and high-speed search Huffman coding","volume":"43","author":"Hashemian","year":"1995","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/S0304-3975(99)00080-8_BIB4","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","article-title":"A method for the construction of minimum redundancy codes","volume":"40","author":"Huffman","year":"1952","journal-title":"Proc. IRE"},{"key":"10.1016\/S0304-3975(99)00080-8_BIB5","doi-asserted-by":"crossref","first-page":"1200","DOI":"10.1109\/26.634683","article-title":"On the implementation of minimum redundancy prefix codes","volume":"45","author":"Moffat","year":"1997","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/S0304-3975(99)00080-8_BIB6","series-title":"JPEG","author":"Pennebaker","year":"1993"},{"key":"10.1016\/S0304-3975(99)00080-8_BIB7","series-title":"Coding and Information Theory","author":"Roman","year":"1992"},{"key":"10.1016\/S0304-3975(99)00080-8_BIB8","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/76.388067","article-title":"A parallel decoder of programmable Huffman codes","volume":"5","author":"Wei","year":"1995","journal-title":"IEEE Trans. Circuits Systems Video Technol."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000808?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000808?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T23:20:47Z","timestamp":1556234447000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599000808"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":8,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["S0304397599000808"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00080-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}