{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:48:55Z","timestamp":1740098935018,"version":"3.37.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319674278"},{"type":"electronic","value":"9783319674285"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-67428-5_21","type":"book-chapter","created":{"date-parts":[[2017,9,4]],"date-time":"2017-09-04T21:22:24Z","timestamp":1504560144000},"page":"241-253","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Skeleton Huffman Trees"],"prefix":"10.1007","author":[{"given":"Shmuel T.","family":"Klein","sequence":"first","affiliation":[]},{"given":"Tamar C.","family":"Serebro","sequence":"additional","affiliation":[]},{"given":"Dana","family":"Shapira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,6]]},"reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-642-17514-5_27","volume-title":"Algorithms and Computation","author":"J Barbay","year":"2010","unstructured":"Barbay, J., Gagie, T., Navarro, G., Nekrich, Y.: Alphabet partitioning for compressed rank\/select and applications. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6507, pp. 315\u2013326. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-17514-5_27"},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.jda.2016.12.001","volume":"43","author":"G Baruch","year":"2017","unstructured":"Baruch, G., Klein, S.T., Shapira, D.: A space efficient direct access data structure. J. Discrete Algorithms 43, 26\u201337 (2017)","journal-title":"J. Discrete Algorithms"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Bergman, E., Klein, S.T.: Fast decoding of prefix encoded texts. In: 2005 Data Compression Conference (DCC 2005), Snowbird, UT, USA, 29\u201331 March 2005, pp. 143\u2013152 (2005)","DOI":"10.1109\/DCC.2005.39"},{"key":"21_CR4","unstructured":"Dub\u00e9, D.: Leaner skeleton trees for direct-access compressed files. In: Proceedings of IEEE International Symposium on Information Theory and its Applications (ISITA), Monterey, pp. 122\u2013130 (2016)"},{"issue":"4","key":"21_CR5","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1109\/TIT.1984.1056931","volume":"30","author":"TJ Ferguson","year":"1984","unstructured":"Ferguson, T.J., Rabinowitz, J.H.: Self-synchronizing Huffman codes. IEEE Trans. Inf. Theory 30(4), 687\u2013693 (1984)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"21_CR6","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1002\/j.1538-7305.1959.tb01583.x","volume":"38","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, E.N., Moore, E.F.: Variable-length binary encodings. Bell Syst. Tech. J. 38, 933\u2013968 (1959)","journal-title":"Bell Syst. Tech. J."},{"key":"21_CR7","unstructured":"Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: Proceedings of the 14th Annual SIAM\/ACM Symposium on Discrete Algorithms (SODA), pp. 841\u2013850 (2003)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Huffman, D.: A method for the construction of minimum redundancy codes. In: Proceedings of the IRE, pp. 1098\u20131101 (1952)","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space efficient static trees and graphs. In: Proceedings of Foundations of Computer Science (FOCS), pp. 549\u2013554 (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"key":"21_CR10","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1009910017828","volume":"3","author":"ST Klein","year":"2000","unstructured":"Klein, S.T.: Skeleton trees for the efficient decoding of Huffman encoded texts. J. Inf. Retrieval 3, 7\u201323 (2000). Special issue on Compression and Efficiency in Information Retrieval of the Kluwer","journal-title":"J. Inf. Retrieval"},{"key":"21_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316676226","volume-title":"Basic Concepts in Data Structures","author":"ST Klein","year":"2016","unstructured":"Klein, S.T.: Basic Concepts in Data Structures. Cambridge University Press, Cambridge (2016)"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-30850-5_26","volume-title":"Experimental Algorithms","author":"G Navarro","year":"2012","unstructured":"Navarro, G., Providel, E.: Fast, small, simple rank\/select on bitmaps. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 295\u2013306. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-30850-5_26"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Okanohara, D., Sadakane, K.: Practical entropy-compressed rank\/select dictionary. In: Proceedings of ALENEX. SIAM (2007)","DOI":"10.1137\/1.9781611972870.6"},{"issue":"4","key":"21_CR14","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/1290672.1290680","volume":"3","author":"R Raman","year":"2007","unstructured":"Raman, R., Raman, V., Satti, S.R.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Trans. Algorithms 3(4), 43 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"21_CR15","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1145\/363958.363991","volume":"7","author":"ES Schwartz","year":"1964","unstructured":"Schwartz, E.S., Kallick, B.: Generating a canonical prefix encoding. Commun. ACM 7, 166\u2013169 (1964)","journal-title":"Commun. ACM"},{"issue":"2","key":"21_CR16","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/j.ipm.2005.02.003","volume":"42","author":"D Shapira","year":"2006","unstructured":"Shapira, D., Daptardar, A.: Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts. Inf. Process. Manag. 42(2), 429\u2013439 (2006)","journal-title":"Inf. Process. Manag."},{"key":"21_CR17","unstructured":"Turpin, A., Moffat, A.: Fast file search using text compression. In: Australian Computer Science Conference, pp. 1\u20138 (1997)"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-94-017-2535-4_19","volume-title":"Parallel Text Processing","author":"J V\u00e9ronis","year":"2000","unstructured":"V\u00e9ronis, J., Langlais, P.: Evaluation of parallel text alignment systems: The arcade project. In: V\u00e9ronis, J. (ed.) Parallel Text Processing, vol. 13, pp. 369\u2013388. Springer, Dordrecht (2000). doi:\n10.1007\/978-94-017-2535-4_19"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67428-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,4]],"date-time":"2017-09-04T21:27:31Z","timestamp":1504560451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67428-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319674278","9783319674285"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67428-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}