{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:12:29Z","timestamp":1725541949060},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642112652"},{"type":"electronic","value":"9783642112669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11266-9_35","type":"book-chapter","created":{"date-parts":[[2009,12,7]],"date-time":"2009-12-07T14:04:58Z","timestamp":1260194698000},"page":"419-427","source":"Crossref","is-referenced-by-count":5,"title":["Fast and Compact Prefix Codes"],"prefix":"10.1007","author":[{"given":"Travis","family":"Gagie","sequence":"first","affiliation":[]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[]},{"given":"Yakov","family":"Nekrich","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"35_CR1","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1006\/jcss.2001.1779","volume":"63","author":"M. Adler","year":"2001","unstructured":"Adler, M., Maggs, B.M.: Protocols for Asymmetric Communication Channels. Journal of Computer and System Sciences\u00a063(4), 573\u2013596 (2001)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"35_CR2","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1006\/jcss.2002.1822","volume":"65","author":"P. Beame","year":"2002","unstructured":"Beame, P., Fich, F.E.: Optimal Bounds for the Predecessor Problem and Related Problems. Journal of Computer and System Sciences\u00a065(1), 38\u201372 (2002)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"35_CR3","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/1240233.1240243","volume":"3","author":"P. Ferragina","year":"2007","unstructured":"Ferragina, P., Manzini, G., M\u00e4kinen, V., Navarro, G.: Compressed Representations of Sequences and Full-Text Indexes. ACM Transactions on Algorithms 3(2), Article\u00a020 (2007)","journal-title":"ACM Transactions on Algorithms"},{"issue":"3","key":"35_CR4","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M.L. Fredman","year":"1984","unstructured":"Fredman, M.L., Koml\u00f3s, J., Szemer\u00e9di, E.: Storing a Sparse Table with O1 Worst Case Access Time. Journal of the ACM\u00a031(3), 538\u2013544 (1984)","journal-title":"Journal of the ACM"},{"issue":"3","key":"35_CR5","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/0022-0000(93)90040-4","volume":"47","author":"M.L. Fredman","year":"1993","unstructured":"Fredman, M.L., Willard, D.E.: Surpassing the Information Theoretic Bound with Fusion Trees. Journal of Computer and System Sciences\u00a047(3), 424\u2013436 (1993)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"35_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.ipl.2005.10.006","volume":"97","author":"T. Gagie","year":"2006","unstructured":"Gagie, T.: Compressing Probability Distributions. Information Processing Letters\u00a097(4), 133\u2013137 (2006)","journal-title":"Information Processing Letters"},{"issue":"6","key":"35_CR7","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.ipl.2006.04.008","volume":"99","author":"T. Gagie","year":"2006","unstructured":"Gagie, T.: Large alphabets and incompressibility. Information Processing Letters\u00a099(6), 246\u2013251 (2006)","journal-title":"Information Processing Letters"},{"issue":"6","key":"35_CR8","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/j.ipl.2008.07.004","volume":"108","author":"T. Gagie","year":"2008","unstructured":"Gagie, T.: Dynamic asymmetric communication. Information Processing Letters\u00a0108(6), 352\u2013355 (2008)","journal-title":"Information Processing Letters"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Gagie, T., Nekrich, Y.: Worst-Case Optimal Adaptive Prefix Coding. In: Proceedings of the Algorithms and Data Structures Symposium (WADS), pp. 315\u2013326 (2009)","DOI":"10.1007\/978-3-642-03367-4_28"},{"key":"35_CR10","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\u2013967 (1959)","journal-title":"Bell System Technical Journal"},{"key":"35_CR11","unstructured":"Grossi, R., Gupta, A., Vitter, J.: High-Order Entropy-Compressed Text Indexes. In: Proceedings of the 14th\u00a0Symposium on Discrete Algorithms (SODA), pp. 841\u2013850 (2003)"},{"issue":"1","key":"35_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s00453-007-9140-4","volume":"55","author":"M. Karpinski","year":"2009","unstructured":"Karpinski, M., Nekrich, Y.: A Fast Algorithm for Adaptive Prefix Coding. Algorithmica\u00a055(1), 29\u201341 (2009)","journal-title":"Algorithmica"},{"issue":"3","key":"35_CR13","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1976.1055554","volume":"22","author":"G.O.H. Katona","year":"1976","unstructured":"Katona, G.O.H., Nemetz, T.O.H.: Huffman Codes and Self-Information. IEEE Transactions on Information Theory\u00a022(3), 337\u2013340 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"35_CR14","first-page":"315","volume":"3","author":"S.T. Klein","year":"2000","unstructured":"Klein, S.T.: Skeleton Trees for the Efficient Decoding of Huffman Encoded Texts. Information Retrieval\u00a03(4), 315\u2013328 (2000)","journal-title":"Information Retrieval"},{"issue":"4","key":"35_CR15","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s00453-001-0060-4","volume":"31","author":"R.L. Milidi\u00fa","year":"2001","unstructured":"Milidi\u00fa, R.L., Laber, E.S.: Bounding the Inefficiency of Length-Restricted Prefix Codes. Algorithmica\u00a031(4), 513\u2013529 (2001)","journal-title":"Algorithmica"},{"issue":"10","key":"35_CR16","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1109\/26.634683","volume":"45","author":"A. Moffat","year":"1997","unstructured":"Moffat, A., Turpin, A.: On the Implementation of Minimum-Redundancy Prefix Codes. IEEE Transactions on Communications\u00a045(10), 1200\u20131207 (1997)","journal-title":"IEEE Transactions on Communications"},{"issue":"3","key":"35_CR17","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/S0097539799364092","volume":"31","author":"J.I. Munro","year":"2001","unstructured":"Munro, J.I., Raman, V.: Succinct Representation of Balanced Parentheses and Static Trees. SIAM Journal on Computing\u00a031(3), 762\u2013776 (2001)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"35_CR18","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1109\/18.86980","volume":"37","author":"N. Nakatsu","year":"1991","unstructured":"Nakatsu, N.: Bounds on the Redundancy of Binary Alphabetical Codes. IEEE Transactions on Information Theory\u00a037(4), 1225\u20131229 (1991)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"35_CR19","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1145\/363958.363991","volume":"7","author":"E.S. Schwarz","year":"1964","unstructured":"Schwarz, E.S., Kallick, B.: Generating a Canonical Prefix Encoding. Communications of the ACM\u00a07(3), 166\u2013169 (1964)","journal-title":"Communications of the ACM"},{"key":"35_CR20","unstructured":"Sheinwald, D.: On Binary Alphabetic Codes. In: Proceedings of the Data Compression Conference (DCC), pp. 112\u2013121 (1992)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2010: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11266-9_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,10]],"date-time":"2019-03-10T23:03:59Z","timestamp":1552259039000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11266-9_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642112652","9783642112669"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11266-9_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}