Application of Lempel-Ziv factorization to the approximation of grammar-based compression. (Q1401326): Difference between revisions

@@ Property / cites work @@
+On the complexity of pattern matching for highly compressed two-dimensional texts.
+Normal rank
@@ Property / cites work @@
+Approximating the smallest grammar
@@ Property / cites work: Approximating the smallest grammar / rank @@
+Normal rank
@@ Property / cites work @@
+Q4849531
@@ Property / cites work: Q4849531 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234121
@@ Property / cites work: Q4234121 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4347161
@@ Property / cites work: Q4347161 / rank @@
+Normal rank
@@ Property / cites work @@
+Grammar-based codes: a new class of universal lossless source codes
+Normal rank
@@ Property / cites work @@
+Q4952646
@@ Property / cites work: Q4952646 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4828933
@@ Property / cites work: Q4828933 / rank @@
+Normal rank
@@ Property / cites work @@
+A universal algorithm for sequential data compression
+Normal rank
@@ Property / cites work @@
+Q4737684
@@ Property / cites work: Q4737684 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0304-3975(02)00777-6
+Normal rank
@@ Property / OpenAlex ID @@
+W1973608346
@@ Property / OpenAlex ID: W1973608346 / rank @@
+Normal rank