A simple storage scheme for strings achieving entropy bounds (Q870846): Difference between revisions

@@ Property / OpenAlex ID @@
+W4240576586
@@ Property / OpenAlex ID: W4240576586 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934653
@@ Property / cites work: Q2934653 / rank @@
+Normal rank
@@ Property / cites work @@
+Boosting textual compression in optimal linear time
+Normal rank
@@ Property / cites work @@
+Indexing compressed text
@@ Property / cites work: Indexing compressed text / rank @@
+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 @@
+Q4471381
@@ Property / cites work: Q4471381 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934640
@@ Property / cites work: Q2934640 / 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 @@
+Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
+Normal rank
@@ Property / cites work @@
+New text indexing functionalities of the compressed suffix arrays
+Normal rank
@@ Property / cites work @@
+Squeezing succinct data structures into entropy bounds
+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