{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:21:29Z","timestamp":1758273689254,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030500252"},{"type":"electronic","value":"9783030500269"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-50026-9_20","type":"book-chapter","created":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:02:43Z","timestamp":1592780563000},"page":"276-288","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Skeleton Huffman Trees Revisited"],"prefix":"10.1007","author":[{"given":"Dmitry","family":"Kosolobov","sequence":"first","affiliation":[]},{"given":"Oleg","family":"Merkurev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","unstructured":"Abrahams, J.: Code and parse trees for lossless source encoding. In: Proceedings of the Compression and Complexity of Sequences, pp. 145\u2013171. IEEE (1997). \nhttps:\/\/doi.org\/10.1109\/SEQUEN.1997.666911","DOI":"10.1109\/SEQUEN.1997.666911"},{"key":"20_CR2","doi-asserted-by":"publisher","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). \nhttps:\/\/doi.org\/10.1016\/j.jda.2016.12.001","journal-title":"J. Discrete Algorithms"},{"key":"20_CR3","unstructured":"Duda, J.: Asymmetric numeral systems. arXiv preprint \narXiv:0902.0271\n\n (2009)"},{"issue":"4","key":"20_CR4","doi-asserted-by":"publisher","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). \nhttps:\/\/doi.org\/10.1109\/TIT.1984.1056931","journal-title":"IEEE Trans. Inf. Theory"},{"key":"20_CR5","doi-asserted-by":"publisher","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proceedings of the Symposium on Foundations of Computer Science (FOCS), pp. 390\u2013398. IEEE (2000). \nhttps:\/\/doi.org\/10.1109\/SFCS.2000.892127","DOI":"10.1109\/SFCS.2000.892127"},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/0022-0000(93)90040-4","volume":"47","author":"ML Fredman","year":"1993","unstructured":"Fredman, M.L., Willard, D.E.: Surpassing the information theoretic bound with fusion trees. J. Comput. Syst. Sci. 47(3), 424\u2013436 (1993). \nhttps:\/\/doi.org\/10.1016\/0022-0000(93)90040-4","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"20_CR7","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1109\/TIT.1978.1055959","volume":"24","author":"RG Gallager","year":"1978","unstructured":"Gallager, R.G.: Variations on a theme by Huffman. IEEE Trans. Inf. Theory 24(6), 168\u2013174 (1978). \nhttps:\/\/doi.org\/10.1109\/TIT.1978.1055959","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"20_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0019-9958(80)90648-8","volume":"45","author":"SW Golomb","year":"1980","unstructured":"Golomb, S.W.: Sources which maximize the choice of a Huffman coding tree. Inf. Control 45(3), 263\u2013272 (1980). \nhttps:\/\/doi.org\/10.1016\/S0019-9958(80)90648-8","journal-title":"Inf. Control"},{"key":"20_CR9","unstructured":"Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: Proceedings of the Symposium on Discrete Algorithms (SODA), pp. 841\u2013850. SIAM (2003)"},{"issue":"9","key":"20_CR10","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"DA Huffman","year":"1952","unstructured":"Huffman, D.A.: A method for the construction of minimum-redundancy codes. Proc. Inst. Radio Eng. (IRE) 40(9), 1098\u20131101 (1952). \nhttps:\/\/doi.org\/10.1109\/JRPROC.1952.273898","journal-title":"Proc. Inst. Radio Eng. (IRE)"},{"issue":"1","key":"20_CR11","doi-asserted-by":"publisher","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. Inf. Retrieval 3(1), 7\u201323 (2000). \nhttps:\/\/doi.org\/10.1023\/A:1009910017828","journal-title":"Inf. Retrieval"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-319-67428-5_21","volume-title":"String Processing and Information Retrieval","author":"ST Klein","year":"2017","unstructured":"Klein, S.T., Serebro, T.C., Shapira, D.: Optimal skeleton Huffman trees. In: Fici, G., Sciortino, M., Venturini, R. (eds.) SPIRE 2017. LNCS, vol. 10508, pp. 241\u2013253. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-67428-5_21"},{"key":"20_CR13","unstructured":"Kraft, L.G.: A device for quantizing, grouping, and coding amplitude modulated pulses. Master\u2019s thesis, MIT, Cambridge, Massachusetts (1949)"},{"key":"20_CR14","unstructured":"van Leeuwen, J.: On the construction of Huffman trees. In: Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), pp. 382\u2013410. Edinburgh University Press (1976)"},{"key":"20_CR15","unstructured":"M\u00e4kinen, V., Navarro, G.: New search algorithms and time\/space tradeoffs for succinct suffix arrays. Technical report C-2004-20, University of Helsinki, Finland, April 2004"},{"issue":"4","key":"20_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3342555","volume":"52","author":"A Moffat","year":"2019","unstructured":"Moffat, A.: Huffman coding. ACM Comput. Surv. 52(4), 1\u201335 (2019). \nhttps:\/\/doi.org\/10.1145\/3342555","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"20_CR17","doi-asserted-by":"publisher","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). \nhttps:\/\/doi.org\/10.1016\/j.ipm.2005.02.003","journal-title":"Inf. Process. Manag."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50026-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:07:29Z","timestamp":1592780849000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50026-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030500252","9783030500269"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50026-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csr2020.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":">= 3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was cancelled as a live conference due to the corona pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}