Author:
Badkobeh Golnaz,Gagie Travis,Inenaga Shunsuke,Kociumaka Tomasz,Kosolobov Dmitry,Puglisi Simon J.
Publisher
Springer International Publishing
Reference19 articles.
1. Supplementary materials for the present paper: C++ code for described experiments. https://bitbucket.org/dkosolobov/lzd-lzmw
2. Lecture Notes in Computer Science;D Belazzougui,2010
3. Lecture Notes in Computer Science;D Belazzougui,2015
4. Bille, P., Landau, G.M., Raman, R., Sadakane, K., Satti, S.R., Weimann, O.: Random access to grammar-compressed strings and trees. SIAM J. Comput. 44(3), 513–539 (2015)
5. Charikar, M., Lehman, E., Liu, D., Panigrahy, R., Prabhakaran, M., Sahai, A., Shelat, A.: The smallest grammar problem. IEEE Trans. Inf. Theor. 51(7), 2554–2576 (2005)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Computing LZ78-Derivates with Suffix Trees;2024 Data Compression Conference (DCC);2024-03-19
2. Survey of Grammar-Based Data Structure Compression;IEEE BITS the Information Theory Magazine;2022-11-01
3. Dynamic Path-decomposed Tries;ACM Journal of Experimental Algorithmics;2020-12-06
4. LZ-ABT: A Practical Algorithm for $$\alpha $$-Balanced Grammar Compression;Lecture Notes in Computer Science;2018