{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:20Z","timestamp":1760202620725},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602200"},{"type":"electronic","value":"9783540447474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60220-8_79","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:52:54Z","timestamp":1330278774000},"page":"393-402","source":"Crossref","is-referenced-by-count":30,"title":["In-place calculation of minimum-redundancy codes"],"prefix":"10.1007","author":[{"given":"Alistair","family":"Moffat","sequence":"first","affiliation":[]},{"given":"Jyrki","family":"Katajainen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1002\/spe.4380231105","volume":"23","author":"J.L. Bentley","year":"1993","unstructured":"J.L. Bentley and M.D. McIlroy. Engineering a sorting function. Software\u2014Practice and Experience\n23 (1993) 1249\u20131265.","journal-title":"Software\u2014Practice and Experience"},{"key":"34_CR2","first-page":"581","volume-title":"Lecture Notes in Computer Science 577","author":"S. Carlsson","year":"1992","unstructured":"S. Carlsson, J. Katajainen, and J. Teuhola. In-place linear probing sort. Submitted. Preliminary version appeared in Proceedings of the 9th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 577, Springer-Verlag, Berlin\/Heidelberg, Germany (1992) 581\u2013587."},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1145\/77556.77566","volume":"33","author":"D. Hirschberg","year":"1990","unstructured":"D. Hirschberg and D. Lelewer. Efficient decoding of prefix codes. Communications of the ACM\n33 (1990) 449\u2013459.","journal-title":"Communications of the ACM"},{"key":"34_CR4","first-page":"1098","volume":"40","author":"D.A. Huffman","year":"1952","unstructured":"D.A. Huffman. A method for the construction of minimum-redundancy codes. Proceedings of the Inst. Radio Engineers\n40 (1952) 1098\u20131101.","journal-title":"Proceedings of the Inst. Radio Engineers"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"L.L. Larmore and T.M. Przytycka. Constructing Huffman trees in parallel. SIAM Journal on Computing. To appear.","DOI":"10.1137\/S0097539792233245"},{"key":"34_CR6","first-page":"382","volume-title":"On the construction of Huffman trees","author":"J. Leeuwen van","year":"1976","unstructured":"J. van Leeuwen. On the construction of Huffman trees. In Proceedings of the 3rd International Colloquium on Automata, Languages and Programming, Edinburgh University Press, Edinburgh, Scotland (1976) 382\u2013410."},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1145\/45072.45074","volume":"19","author":"D.A. Lelewer","year":"1987","unstructured":"D.A. Lelewer and D.S. Hirschberg. Data compression. Computing Surveys\n19 (1987) 261\u2013296.","journal-title":"Computing Surveys"},{"key":"34_CR8","first-page":"192","volume-title":"Space-efficient construction of optimal prefix codes","author":"A. Moffat","year":"1995","unstructured":"A. Moffat, A. Turpin, and J. Katajainen. Space-efficient construction of optimal prefix codes. Proceedings of the 5th IEEE Data Compression Conference, IEEE Computer Society Press, Los Alamitos, California (1995) 192\u2013201."},{"key":"34_CR9","volume-title":"Algorithms in C","author":"R. Sedgewick","year":"1990","unstructured":"R. Sedgewick. Algorithms in C. 2nd Edition, Addison-Wesley, Reading, Massachusetts (1990).","edition":"2nd Edition"},{"key":"34_CR10","volume-title":"Managing Gigabytes: Compressing and Indexing Documents and Images","author":"I.H. Witten","year":"1994","unstructured":"I.H. Witten, A. Moffat, and T.C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Van Nostrand Reinhold, New York, New York (1994)."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60220-8_79.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:33:49Z","timestamp":1619573629000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60220-8_79"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602200","9783540447474"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-60220-8_79","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}