{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T11:07:57Z","timestamp":1744888077211},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291183"},{"type":"electronic","value":"9783540319511"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561071_22","type":"book-chapter","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T08:46:24Z","timestamp":1128588384000},"page":"226-237","source":"Crossref","is-referenced-by-count":4,"title":["Optimal Integer Alphabetic Trees in Linear Time"],"prefix":"10.1007","author":[{"given":"T. C.","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence L.","family":"Larmore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. David","family":"Morgenthaler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D.A. Huffman","year":"1952","unstructured":"Huffman, D.A.: A method for the construction of minimum redundancy codes. Proceedings of the IRE\u00a040, 1098\u20131101 (1952)","journal-title":"Proceedings of the IRE"},{"key":"22_CR2","unstructured":"Abrahams, J.: Code and parse trees for lossless source encoding. In: Proceedings Compression and Complexity of Sequences, pp. 146\u2013171 (1997)"},{"key":"22_CR3","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. Bell System Technical Journal\u00a038, 933\u2013968 (1959)","journal-title":"Bell System Technical Journal"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF00264289","volume":"1","author":"D.E. Knuth","year":"1971","unstructured":"Knuth, D.E.: Optimum binary search tree. Acta Informatica\u00a01, 14\u201325 (1971)","journal-title":"Acta Informatica"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1137\/0121057","volume":"21","author":"T.C. Hu","year":"1971","unstructured":"Hu, T.C., Tucker, A.C.: Optimal computer search trees and variable-length alphabetic codes. SIAM Journal on Applied Mathematics\u00a021, 514\u2013532 (1971)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1137\/0206045","volume":"6","author":"A.M. Garsia","year":"1977","unstructured":"Garsia, A.M., Wachs, M.L.: A new algorithm for minimal binary search trees. SIAM Journal on Computing\u00a06, 622\u2013642 (1977)","journal-title":"SIAM Journal on Computing"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","first-page":"234","volume-title":"Combinatorics and Computer Science","author":"T.C. Hu","year":"1996","unstructured":"Hu, T.C., Morgenthaler, J.D.: Optimum alphabetic binary trees. In: Deza, M., Manoussakis, I., Euler, R. (eds.) CCS 1995. LNCS, vol.\u00a01120, pp. 234\u2013243. Springer, Heidelberg (1996)"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1137\/S0895480193256651","volume":"8","author":"M.M. Klawe","year":"1995","unstructured":"Klawe, M.M., Mumey, B.: Upper and lower bounds on constructing alphabetic binary trees. SIAM Journal on Discrete Mathematics\u00a08, 638\u2013651 (1995)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1998.0934","volume":"28","author":"L.L. Larmore","year":"1998","unstructured":"Larmore, L.L., Przytycka, T.M.: The optimal alphabetic tree problem revisited. Journal of Algorithms\u00a028, 1\u201320 (1998)","journal-title":"Journal of Algorithms"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1137\/0125012","volume":"25","author":"T.C. Hu","year":"1973","unstructured":"Hu, T.C.: A new proof of the T-C algorithm. SIAM Journal on Applied Mathematics\u00a025, 83\u201394 (1973)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"22_CR11","volume-title":"Combinatorial Algorithms","author":"T.C. Hu","year":"2002","unstructured":"Hu, T.C., Shing, M.T.: Combinatorial Algorithms, 2nd edn. Dover, New York (2002)","edition":"2"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0304-3975(96)00296-4","volume":"180","author":"M. Karpinski","year":"1997","unstructured":"Karpinski, M., Larmore, L.L., Rytter, W.: Correctness of constructing optimal alphabetic trees revisited. Theoretical Computer Science\u00a0180, 309\u2013324 (1997)","journal-title":"Theoretical Computer Science"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(92)90334-C","volume":"93","author":"P. Ramanan","year":"1992","unstructured":"Ramanan, P.: Testing the optimality of alphabetic trees. Theoretical Computer Science\u00a093, 279\u2013301 (1992)","journal-title":"Theoretical Computer Science"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: Proceedings of the 16th ACM Symposium on Theory of Computation, pp. 135\u2013143 (1984)","DOI":"10.1145\/800057.808675"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"H.N. Gabow","year":"1985","unstructured":"Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. Journal of Computer and System Sciences\u00a030, 209\u2013221 (1985)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561071_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:13:25Z","timestamp":1619493205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561071_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291183","9783540319511"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11561071_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}