Polylog Space Compression, Pushdown Compression, and Lempel-Ziv Are Incomparable-Reference-Cited by-同舟云学术

Polylog Space Compression, Pushdown Compression, and Lempel-Ziv Are Incomparable

Published:2010-05-14 Issue:4 Volume:48 Page:731-766
ISSN:1432-4350
Container-title:Theory of Computing Systems
language:en
Short-container-title:Theory Comput Syst

Author:

Mayordomo Elvira,Moser Philippe,Perifel Sylvain

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00224-010-9267-6.pdf

Reference22 articles.

1. Albert, P., Mayordomo, E., Moser, P.: Bounded pushdown dimension vs Lempel Ziv information density. Tech. Rep. TR07-051, ECCC: Electronic Colloquium on Computational Complexity (2007)

2. Albert, P., Mayordomo, E., Moser, P., Perifel, S.: Pushdown compression. In: Proceedings of the 25th Symposium on Theoretical Aspects of Computer Science (STACS 2008), pp. 39–48 (2008)

3. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58, 137–147 (1999)

4. Lecture Notes in Computer Science;R. Alur,2006

5. Autebert, J., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Rozenberg, G., Salomaa, A. (eds.). Handbook of Formal Languages, vol. 1, pp. 111–174. Springer, Berlin (1997)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Pebble-depth;Theoretical Computer Science;2024-09

2. Pushdown and Lempel-Ziv depth;Information and Computation;2023-06

3. On the Difference Between Finite-State and Pushdown Depth;SOFSEM 2020: Theory and Practice of Computer Science;2020

4. Bounded Pushdown Dimension vs Lempel Ziv Information Density;Computability and Complexity;2016-12-01

5. Lightweight Data Indexing and Compression in External Memory;Algorithmica;2011-06-18