{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T11:08:39Z","timestamp":1744888119223,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385353"},{"type":"electronic","value":"9783642385360"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38536-0_4","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T01:03:04Z","timestamp":1370221384000},"page":"36-48","source":"Crossref","is-referenced-by-count":2,"title":["Alphabetic Minimax Trees in Linear Time"],"prefix":"10.1007","author":[{"given":"Pawe\u0142","family":"Gawrychowski","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"24","key":"4_CR1","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1016\/j.ipl.2010.08.016","volume":"110","author":"C. Bartoschek","year":"2010","unstructured":"Bartoschek, C., Held, S., Ma\u00dfberg, J., Rautenbach, D., Vygen, J.: The repeater tree construction problem. Inf. Process. Lett.\u00a0110(24), 1079\u20131083 (2010)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M. Blum","year":"1973","unstructured":"Blum, M., Floyd, R., Pratt, V., Rivest, R., Tarjan, R.: Time bounds for selection. Journal of Computer and System Sciences\u00a07(4), 448\u2013461 (1973)","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1137\/0215013","volume":"15","author":"D. Coppersmith","year":"1986","unstructured":"Coppersmith, D., Klawe, M., Pippenger, N.: Alphabetic Minimax Trees of Degree at Most t. SIAM Journal on Computing\u00a015, 189 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Parker Jr., D.S.: Combinatorial Merging and Huffman\u2019s Algorithm. IEEE Transactions on Computers, 365\u2013367 (1979)","DOI":"10.1109\/TC.1979.1675367"},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"321","DOI":"10.3233\/FI-2009-204","volume":"97","author":"T. Gagie","year":"2009","unstructured":"Gagie, T.: A new algorithm for building alphabetic minimax trees. Fundam. Inf.\u00a097, 321\u2013329 (2009), http:\/\/portal.acm.org\/citation.cfm?id=1735991.1735995","journal-title":"Fundam. Inf."},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-642-10217-2_28","volume-title":"Combinatorial Algorithms","author":"P. Gawrychowski","year":"2009","unstructured":"Gawrychowski, P., Gagie, T.: Minimax trees in linear time with applications. In: Fiala, J., Kratochv\u00edl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol.\u00a05874, pp. 278\u2013288. Springer, Heidelberg (2009)"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1109\/TC.1976.1674574","volume":"25","author":"M.C. Golumbic","year":"1976","unstructured":"Golumbic, M.C.: Combinatorial merging. IEEE Trans. Comput.\u00a025, 1164\u20131167 (1976), http:\/\/dx.doi.org\/10.1109\/TC.1976.1674574","journal-title":"IEEE Trans. Comput."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/2422.322412","volume":"31","author":"H.J. Hoover","year":"1984","unstructured":"Hoover, H.J., Klawe, M.M., Pippenger, N.J.: Bounding fan-out in logical networks. J. ACM\u00a031, 13\u201318 (1984), http:\/\/doi.acm.org\/10.1145\/2422.322412","journal-title":"J. ACM"},{"issue":"2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1137\/0137015","volume":"37","author":"T. Hu","year":"1979","unstructured":"Hu, T., Kleitman, D., Tamaki, J.: Binary trees optimum under various criteria. SIAM Journal on Applied Mathematics\u00a037(2), 246\u2013256 (1979)","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"4","key":"4_CR10","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1137\/0121057","volume":"21","author":"T. Hu","year":"1971","unstructured":"Hu, T., Tucker, A.: Optimal computer search trees and variable-length alphabetical codes. SIAM Journal on Applied Mathematics\u00a021(4), 514\u2013532 (1971)","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"9","key":"4_CR11","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. Proceedings of the IRE\u00a040(9), 1098\u20131101 (1952)","journal-title":"Proceedings of the IRE"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1137\/0214039","volume":"14","author":"D. Kirkpatrick","year":"1985","unstructured":"Kirkpatrick, D., Klawe, M.: Alphabetic minimax trees. SIAM Journal on Computing\u00a014, 514 (1985)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"4_CR13","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. J. Algorithms\u00a028(1), 1\u201320 (1998)","journal-title":"J. Algorithms"},{"key":"4_CR14","unstructured":"van Leeuwen, J.: On the construction of Huffman trees? In: ICALP, pp. 382\u2013410 (1976)"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1109\/18.79913","volume":"37","author":"R. Yeung","year":"2002","unstructured":"Yeung, R.: Alphabetic codes revisited. IEEE Transactions on Information Theory\u00a037(3), 564\u2013572 (2002)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38536-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T15:09:14Z","timestamp":1595862554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38536-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385353","9783642385360"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38536-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}