P-complete problems in data compression (Q1325842): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(94)90106-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2071779672
@@ Property / OpenAlex ID: W2071779672 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient parallel algorithms to test square-freeness and factorize strings
+Normal rank
@@ Property / cites work @@
+Q3694726
@@ Property / cites work: Q3694726 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Finite Sequences
@@ Property / cites work: On the Complexity of Finite Sequences / rank @@
+Normal rank
@@ Property / cites work @@
+A universal algorithm for sequential data compression
+Normal rank
@@ Property / cites work @@
+Data compression via textual substitution
@@ Property / cites work: Data compression via textual substitution / rank @@
+Normal rank
@@ Property / cites work @@
+Compression of individual sequences via variable-rate coding
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1325842