{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:26Z","timestamp":1725664226952},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540600848"},{"type":"electronic","value":"9783540494256"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60084-1_79","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:37:57Z","timestamp":1330259877000},"page":"256-267","source":"Crossref","is-referenced-by-count":4,"title":["A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs"],"prefix":"10.1007","author":[{"given":"M. J.","family":"Golin","sequence":"first","affiliation":[]},{"given":"G\u00fcnter","family":"Rote","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"issue":"3","key":"22_CR1","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1145\/322203.322205","volume":"27","author":"D. Altenkamp","year":"1980","unstructured":"Doris Altenkamp and Kurt Mehlhorn, \u201cCodes: Unequal Probabilities, Unequal Letter Costs,\u201d J. Assoc. Comput. Mach.\n27 (3) (July 1980), 412\u2013427.","journal-title":"J. Assoc. Comput. Mach."},{"key":"22_CR2","volume-title":"Science and Information Theory","author":"L. Brouillon","year":"1956","unstructured":"L. Brouillon, Science and Information Theory, Academic Press, New York 1956."},{"key":"22_CR3","unstructured":"N. Cot, \u201cA linear-time ordering procedure with applications to variable length encoding,\u201d Proc. 8th Annual Princeton Conference on Information Sciences and Systems, (1974), pp. 460\u2013463."},{"key":"22_CR4","unstructured":"N. Cot, \u201cComplexity of the Variable-length Encoding Problem,\u201d Proceedings of the 6th Southeast Conference on Combinatorics, Graph Theory and Computing, (1975), pp. 211\u2013224."},{"key":"22_CR5","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/3-540-58201-0_102","volume":"820","author":"M. Golin","year":"1994","unstructured":"Mordecai Golin and Neal Young, \u201cPrefix Codes: Equiprobable Words, Unequal Letter Costs,\u201d Proceedings of the 21st International Colloquium on Automata, Languages and Programming (ICALP '94), (July 1994), Lecture Notes in Computer Science 820, pp. 605\u2013617.","journal-title":"Lecture Notes in Computer Science"},{"key":"22_CR6","volume-title":"Inequalities","author":"G. H. Hardy","year":"1967","unstructured":"G. H. Hardy, J. E. Littlewood, and G. Polya, Inequalities, Cambridge University Press, Cambridge 1967."},{"issue":"3","key":"22_CR7","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1145\/65950.65955","volume":"36","author":"S. Kapoor","year":"1989","unstructured":"Sanjiv Kapoor and Edward Reingold, \u201cOptimum Lopsided Binary Trees,\u201d Journal of the Association for Computing Machinery\n36 (3) (July 1989), 573\u2013590.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"22_CR8","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/TIT.1961.1057615","volume":"IT-7","author":"R. Karp","year":"1961","unstructured":"R. Karp, \u201cMinimum-Redundancy Coding for the Discrete Noiseless Channel,\u201d IRE Transactions on Information Theory\nIT-7 (1961), 27\u201339.","journal-title":"IRE Transactions on Information Theory"},{"key":"22_CR9","unstructured":"Nils J. Nilsson, Principles of Artificial Intelligence, Tioga, Palo Alto 1980."},{"issue":"2","key":"22_CR10","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/321879.321883","volume":"22","author":"Y. Perl","year":"1975","unstructured":"Y. Perl, M. R. Garey, and S. Even, \u201cEfficient generation of optimal prefix code: Equiprobable words using unequal cost letters,\u201d Journal of the Association for Computing Machinery\n22 (2) (April 1975), 202\u2013214","journal-title":"Journal of the Association for Computing Machinery"},{"key":"22_CR11","volume-title":"Algorithms","author":"R. Sedgewick","year":"1988","unstructured":"Robert Sedgewick, Algorithms, 2nd ed., Addison-Wesley, Reading, Mass. (1988).","edition":"2nd ed."},{"issue":"3","key":"22_CR12","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1145\/321592.321601","volume":"17","author":"L. E. Stanfel","year":"1970","unstructured":"L. E. Stanfel, \u201cTree Structures for Optimal Searching,\u201d Journal of the Association for Computing Machinery\n17 (3) (July 1970), 508\u2013517.","journal-title":"Journal of the Association for Computing Machinery"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60084-1_79.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:31:24Z","timestamp":1619559084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60084-1_79"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540600848","9783540494256"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-60084-1_79","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}