Random Access to High-Order Entropy Compressed Text (Q2848976): Difference between revisions

@@ Property / cites work @@
+Succinct indexes for strings, binary relations and multilabeled trees
+Normal rank
@@ Property / cites work @@
+Random Access to Grammar-Compressed Strings and Trees
+Normal rank
@@ Property / cites work @@
+The Smallest Grammar Problem
@@ Property / cites work: The Smallest Grammar Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A linear lower bound on index size for text retrieval
+Normal rank
@@ Property / cites work @@
+Changing base without losing space
@@ Property / cites work: Changing base without losing space / rank @@
+Normal rank
@@ Property / cites work @@
+A simple storage scheme for strings achieving entropy bounds
+Normal rank
@@ Property / cites work @@
+Robust universal complete codes for transmission and compression
+Normal rank
@@ Property / cites work @@
+Simple Random Access Compression
@@ Property / cites work: Simple Random Access Compression / rank @@
+Normal rank
@@ Property / cites work @@
+The cell probe complexity of succinct data structures
+Normal rank
@@ Property / cites work @@
+Optimal lower bounds for rank and select indexes
@@ Property / cites work: Optimal lower bounds for rank and select indexes / rank @@
+Normal rank
@@ Property / cites work @@
+Statistical Encoding of Succinct Data Structures
@@ Property / cites work: Statistical Encoding of Succinct Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+A quick tour on suffix arrays and compressed suffix arrays
+Normal rank
@@ Property / cites work @@
+Dynamic Compressed Strings with Random Access
@@ Property / cites work: Dynamic Compressed Strings with Random Access / rank @@
+Normal rank
@@ Property / cites work @@
+Compression, Indexing, and Retrieval for Massive String Data
+Normal rank
@@ Property / cites work @@
+CRAM: Compressed Random Access Memory
@@ Property / cites work: CRAM: Compressed Random Access Memory / rank @@
+Normal rank
@@ Property / cites work @@
+Compression of Low Entropy Strings with Lempel--Ziv Algorithms
+Normal rank
@@ Property / cites work @@
+Algorithmics on SLP-compressed strings: A survey
@@ Property / cites work: Algorithmics on SLP-compressed strings: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+An analysis of the Burrows—Wheeler transform
@@ Property / cites work: An analysis of the Burrows—Wheeler transform / rank @@
+Normal rank
@@ Property / cites work @@
+Compressed representations of sequences and full-text indexes
+Normal rank
@@ Property / cites work @@
+Fast Compressed Tries through Path Decompositions
@@ Property / cites work: Fast Compressed Tries through Path Decompositions / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417611
@@ Property / cites work: Q5417611 / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct indexable dictionaries with applications to encoding             <i>k</i>             -ary trees, prefix sums and multisets
+Normal rank
@@ Property / cites work @@
+Succinct Representations of Ordinal Trees
@@ Property / cites work: Succinct Representations of Ordinal Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
+Normal rank
@@ Property / cites work @@
+Squeezing succinct data structures into entropy bounds
+Normal rank
@@ Property / cites work @@
+Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings
+Normal rank
@@ Property / cites work @@
+Q4833659
@@ Property / cites work: Q4833659 / rank @@
+Normal rank
@@ Property / cites work @@
+Compression of individual sequences via variable-rate coding
+Normal rank