{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:39Z","timestamp":1760202519645},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540323013"},{"type":"electronic","value":"9783540322887"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11672142_6","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T03:27:54Z","timestamp":1141097274000},"page":"92-103","source":"Crossref","is-referenced-by-count":2,"title":["Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes"],"prefix":"10.1007","author":[{"given":"Ahmed","family":"Belal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amr","family":"Elmasry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0020-0190(93)90207-P","volume":"45","author":"M. Buro","year":"1993","unstructured":"Buro, M.: On the maximum length of Huffman codes. Information Processing Letters\u00a045, 219\u2013223 (1993)","journal-title":"Information Processing Letters"},{"key":"6_CR2","volume-title":"Introduction to algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to algorithms, 2nd edn. The MIT press, Cambridge (2001)","edition":"2"},{"key":"6_CR3","doi-asserted-by":"publisher","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. IRE\u00a040, 1098\u20131101 (1952)","journal-title":"Proc. IRE"},{"issue":"6","key":"6_CR4","doi-asserted-by":"publisher","first-page":"2185","DOI":"10.1109\/18.945242","volume":"47","author":"R. Milidiu","year":"2001","unstructured":"Milidiu, R., Pessoa, A., Laber, E.: Three space-economical algorithms for calculating minimum-redundancy prefix codes. IEEE Transactions on Information Theory\u00a047(6), 2185\u20132198 (2001)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0205001","volume":"5","author":"J.I. Munro","year":"1976","unstructured":"Munro, J.I., Spira, P.: Sorting and searching in multisets. SIAM Journal on Computing\u00a05(1), 1\u20138 (1976)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"1650","DOI":"10.1109\/18.681345","volume":"44","author":"A. Moffat","year":"1998","unstructured":"Moffat, A., Turbin, A.: Efficient construction of minimum-redundancy codes for large alphabets. IEEE Transactions on Information Theory\u00a044, 1650\u20131657 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"6_CR7","first-page":"194","volume":"6","author":"S. Sen","year":"1999","unstructured":"Sen, S., Gupta, N.: Distribution-sensitive algorithms. Nordic Journal of Computing\u00a06(2), 194\u2013211 (1999)","journal-title":"Nordic Journal of Computing"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Van Leeuwen, J.: On the construction of Huffman trees. In: 3rd International Colloquium for Automata, Languages and Programming, pp. 382\u2013410 (1976)","DOI":"10.1016\/0304-3975(76)90070-0"},{"issue":"8","key":"6_CR9","first-page":"891","volume":"25","author":"J. Zobel","year":"1995","unstructured":"Zobel, J., Moffat, A.: Adding compression to a full-text retrieval system. Software: Practice and Experience\u00a025(8), 891\u2013903 (1995)","journal-title":"Software: Practice and Experience"}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T12:31:30Z","timestamp":1683376290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11672142_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}