{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:34:41Z","timestamp":1758267281429,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540632207"},{"type":"electronic","value":"9783540692140"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63220-4_50","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:19:36Z","timestamp":1330298376000},"page":"65-75","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Space- and time-efficient decoding with canonical huffman trees"],"prefix":"10.1007","author":[{"given":"Shmuel T.","family":"Klein","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/78915.78917","volume":"8","author":"A. Bookstein","year":"1990","unstructured":"Bookstein A., Klein S.T., Compression, Information Theory and Grammars: A Unified Approach, ACM Trans. on Information Systems8 (1990) 27\u201349.","journal-title":"ACM Trans. on Information Systems"},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02243872","volume":"50","author":"A. Bookstein","year":"1993","unstructured":"Bookstein A., Klein S.T., Is Huffman coding dead?, Computing50 (1993) 279\u2013296.","journal-title":"Computing"},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1016\/0306-4573(92)90069-C","volume":"28","author":"A. Bookstein","year":"1992","unstructured":"Bookstein A., Klein S.T., Ziff D.A., A systematic approach to compressing a full text retrieval system, Information Processing & Management28 (1992) 795\u2013806.","journal-title":"Information Processing & Management"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Choueka Y., Klein S.T., Perl Y., Efficient Variants of Huffman Codes in High Level Languages, Proc. 8-th ACM-SIGIR Conf., Montreal (1985) 122\u2013130.","DOI":"10.1145\/253495.342777"},{"key":"6_CR5","first-page":"149","volume":"16","author":"A.S. Fraenkel","year":"1976","unstructured":"Fraenkel A.S., All about the Responsa Retrieval Project you always wanted to know but were afraid to ask, Expanded Summary, Jurimetrics J.16 (1976) 149\u2013156.","journal-title":"Jurimetrics J."},{"key":"6_CR6","series-title":"NATO ASI Series Vol F12","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/978-3-642-82456-2_12","volume-title":"Combinatorial Algorithms on Words","author":"A.S. Fraenkel","year":"1985","unstructured":"Fraenkel A.S., Klein S.T., Novel Compression of Sparse Bit-Strings, in Combinatorial Algorithms on Words, NATO ASI Series Vol F12, Springer Verlag, Berlin (1985) 169\u2013183."},{"key":"6_CR7","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1093\/comjnl\/33.4.296","volume":"33","author":"A.S. Fraenkel","year":"1990","unstructured":"Fraenkel A.S., Klein S.T., Bidirectional Huffman Coding, The Computer Journal33 (1990) 296\u2013307.","journal-title":"The Computer Journal"},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1093\/comjnl\/36.7.668","volume":"36","author":"A.S. Fraenkel","year":"1993","unstructured":"Fraenkel A.S., Klein S.T., Bounding the Depth of Search Trees, The Computer Journal36 (1993) 668\u2013678.","journal-title":"The Computer Journal"},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1109\/TIT.1984.1056931","volume":"IT-30","author":"T.J. Ferguson","year":"1984","unstructured":"Ferguson T.J., Rabinowitz J.H., Self-synchronizing Huffman codes, IEEE Trans. on Information Theory, IT-30 (1984) 687\u2013693.","journal-title":"IEEE Trans. on Information Theory"},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1002\/j.1538-7305.1959.tb01583.x","volume":"38","author":"E.N. Gilbert","year":"1959","unstructured":"Gilbert E.N., Moore E.F., Variable-length binary encodings, The Bell System Technical Journal38 (1959) 933\u2013968.","journal-title":"The Bell System Technical Journal"},{"key":"6_CR11","volume-title":"Information Retrieval, Computational and Theoretical Aspects","author":"H.S. Heaps","year":"1978","unstructured":"Heaps H.S., Information Retrieval, Computational and Theoretical Aspects, Academic Press, New York (1978)."},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D. Huffman","year":"1952","unstructured":"Huffman D., A method for the construction of minimum redundancy codes, Proc. of the IRE40 (1952) 1098\u20131101.","journal-title":"Proc. of the IRE"},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1145\/77556.77566","volume":"33","author":"D.S. Hirschberg","year":"1990","unstructured":"Hirschberg D.S., Lelewer D.A., Efficient decoding of prefix codes, Comm. of the ACM33 (1990) 449\u2013459.","journal-title":"Comm. of the ACM"},{"key":"6_CR14","first-page":"284","volume":"IT-11","author":"G.H.O. Katona","year":"1965","unstructured":"Katona G.H.O., Nemetz T.O.H., Huffman codes and self-information, IEEE Trans. on Inf. Th.IT-11 (1965) 284\u2013292.","journal-title":"IEEE Trans. on Inf. Th."},{"key":"6_CR15","volume-title":"Fundamental Algorithms","author":"D.E. Knuth","year":"1973","unstructured":"Knuth D.E., The Art of Computer Programming, VolI, Fundamental Algorithms, Addison-Wesley, Reading, MA (1973)."},{"key":"6_CR16","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/45072.45074","volume":"19","author":"D.A. Lelewer","year":"1987","unstructured":"Lelewer D.A., Hirschberg D.S., Data compression, ACM Computing Surveys19 (1987) 261\u2013296.","journal-title":"ACM Computing Surveys"},{"key":"6_CR17","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1109\/TIT.1982.1056452","volume":"IT-28","author":"G. Longo","year":"1982","unstructured":"Longo G., Galasso G., An application of informational divergence to Huffman codes, IEEE Trans. on Inf. Th.IT-28 (1982) 36\u201343.","journal-title":"IEEE Trans. on Inf. Th."},{"key":"6_CR18","first-page":"537","volume":"46","author":"A. Moffat","year":"1995","unstructured":"Moffat A., Bell T., In-situ generation of compressed inverted files, J. ASIS46 (1995) 537\u2013550.","journal-title":"J. ASIS"},{"key":"6_CR19","unstructured":"Moffat A., Turpin A., On the implementation of minimum redundancy prefix codes, Proc. Data Compression Conference DCC-96, Snowbird, Utah (1996) 182\u2013191."},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Moffat A., Turpin A., Katajainen J., Space-efficient construction of optimal prefix codes, Proc. Data Compression Conference DCC-95, Snowbird, Utah (1995) 192\u2013201.","DOI":"10.1109\/DCC.1995.515509"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Moffat A., Zobel J., Sharman N., Text compression for dynamic document databases, to appear in IEEE Transactions on Knowledge and Data Engineering. Preliminary version in Proc. Data Compression Conference DCC-94, Snowbird, Utah (1994) 126\u2013135.","DOI":"10.1109\/DCC.1994.305920"},{"key":"6_CR22","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1145\/363958.363991","volume":"7","author":"E.S. Schwartz","year":"1964","unstructured":"Schwartz E.S., Kallick B., Generating a canonical prefix encoding, Comm. of the ACM7 (1964) 166\u2013169.","journal-title":"Comm. of the ACM"},{"key":"6_CR23","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0020-0190(88)90146-9","volume":"26","author":"A. Sieminski","year":"1988","unstructured":"Sieminski, A., Fast decoding of the Huffman codes, Information Processing Letters26 (1988) 237\u2013241.","journal-title":"Information Processing Letters"},{"key":"6_CR24","volume-title":"Managing Gigabytes: Compressing and Indexing Documents and Images","author":"I.H. Witten","year":"1994","unstructured":"Witten I.H., Moffat A., Bell T.C., Managing Gigabytes: Compressing and Indexing Documents and Images, Van Nostrand Reinhold, New York (1994)."},{"key":"6_CR25","unstructured":"Zipf G.K., The Psycho-Biology of Language, Boston, Houghton (1935)."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63220-4_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:40:27Z","timestamp":1742600427000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63220-4_50"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540632207","9783540692140"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-63220-4_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}