SIAM Journal on Computing
On encoding and decoding with two-way head machines
Information and Computation
On-line versus off-line computation in dynamic text compression
Information Processing Letters
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
Data compression via textual substitution
Journal of the ACM (JACM)
Compression of Low Entropy Strings with Lempel--Ziv Algorithms
SIAM Journal on Computing
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Offline Dictionary-Based Compression
DCC '99 Proceedings of the Conference on Data Compression
Application of Lempel--Ziv factorization to the approximation of grammar-based compression
Theoretical Computer Science
Lower bounds for sorting with few random accesses to external memory
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
Lower bounds for randomized read/write stream algorithms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Machine models and lower bounds for query processing
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Theoretical Computer Science
Re-pair Achieves High-Order Entropy
DCC '08 Proceedings of the Data Compression Conference
On the Value of Multiple Read/Write Streams for Approximating Frequency Moments
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Lower bounds for processing data with few random accesses to external memory
Journal of the ACM (JACM)
Quasi-distinct Parsing and Optimal Compression Methods
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
On the Value of Multiple Read/Write Streams for Data Compression
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Self-indexed Text Compression Using Straight-Line Programs
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
LZ77-Like Compression with Fast Random Access
DCC '10 Proceedings of the 2010 Data Compression Conference
Lightweight data indexing and compression in external memory
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Grammar-based codes: a new class of universal lossless source codes
IEEE Transactions on Information Theory
Universal lossless compression via multilevel pattern matching
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Processing compressed texts: a tractability border
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Faster approximate pattern matching in compressed repetitive texts
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
On the value of multiple read/write streams for data compression
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.00 |
We show that, given a string s of length n, with constant memory and logarithmic passes over a constant number of streams we can build a context-free grammar that generates s and only s and whose size is within an ${\mathcal O}\left({\min \left( g \log g, \sqrt{n / \log n} \right)}\right)$-factor of the minimum g. This stands in contrast to our previous result that, with polylogarithmic memory and polylogarithmic passes over a single stream, we cannot build such a grammar whose size is within any polynomial of g.