{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:06:13Z","timestamp":1746263173715},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5890,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1016\/s0304-3975(96)00296-4","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"309-324","source":"Crossref","is-referenced-by-count":9,"title":["Correctness of constructing optimal alphabetic trees revisited"],"prefix":"10.1016","volume":"180","author":[{"given":"Marek","family":"Karpinski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence L.","family":"Larmore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00296-4_BIB1","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1137\/0206045","article-title":"A new algorithm for minimal binary search trees","volume":"6","author":"Garsia","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00296-4_BIB2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1137\/0125012","article-title":"A new proof of the T-C algorithm","volume":"25","author":"Hu","year":"1973","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0304-3975(96)00296-4_BIB3","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1137\/0121057","article-title":"Optimal computer search trees and variable length alphabetic codes","volume":"21","author":"Hu","year":"1971","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0304-3975(96)00296-4_BIB4","first-page":"1098","article-title":"A method for the constructing of minimum redundancy codes","volume":"40","author":"Huffman","year":"1952"},{"key":"10.1016\/S0304-3975(96)00296-4_BIB5","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0196-6774(88)90009-0","article-title":"A new proof of the Garsia-Wachs algorithm","volume":"9","author":"Kingston","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(96)00296-4_BIB6","series-title":"Proc. 4th ACM-SIAM Symp. on Discrete Algorithms","first-page":"185","article-title":"Upper and lower bounds on constructing alphabetic binary trees","author":"Klawe","year":"1993"},{"key":"10.1016\/S0304-3975(96)00296-4_BIB7","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF00264289","article-title":"Optimum binary search trees","volume":"1","author":"Knuth","year":"1971","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(96)00296-4_BIB8","series-title":"The An of Computer Programming","author":"Knuth","year":"1973"},{"key":"10.1016\/S0304-3975(96)00296-4_BIB9","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1145\/79147.79150","article-title":"A fast algorithm for optimal length-limited Huffman codes","volume":"37","author":"Larmore","year":"1990","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(96)00296-4_BIB10","series-title":"Proc. 21st Internat. Coll., ICALP'94","first-page":"251","article-title":"The optimal alphabetic tree problem revisited","volume":"Vol. 820","author":"Larmore","year":"1994"},{"key":"10.1016\/S0304-3975(96)00296-4_BIB11","series-title":"Proc. 5th ACM Symp. on Parallel Algorithms and Architectures","first-page":"214","article-title":"Parallel construction of optimal alphabetic trees","author":"Larmore","year":"1993"},{"key":"10.1016\/S0304-3975(96)00296-4_BIB12","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(92)90334-C","article-title":"Testing the optimality of alphabetic trees","volume":"93","author":"Ramanan","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00296-4_BIB13","series-title":"Proc. 12th ACM Symp. on Theory of Computing","first-page":"429","article-title":"Efficient dynamic programming using quadrangle inequalities","author":"Yao","year":"1980"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002964?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002964?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:56:58Z","timestamp":1555390618000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002964"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0304397596002964"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00296-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}