LRM-trees: compressed indices, adaptive sorting, and compressed permutations (Q1758161): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2012.08.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2175677593
@@ Property / OpenAlex ID: W2175677593 / rank @@
+Normal rank
@@ Property / cites work @@
+Alphabet Partitioning for Compressed Rank/Select and Applications
+Normal rank
@@ Property / cites work @@
+Q2934653
@@ Property / cites work: Q2934653 / rank @@
+Normal rank
@@ Property / cites work @@
+COMPRESSED REPRESENTATIONS OF PERMUTATIONS, AND APPLICATIONS
+Normal rank
@@ Property / cites work @@
+On compressing permutations and adaptive sorting
@@ Property / cites work: On compressing permutations and adaptive sorting / rank @@
+Normal rank
@@ Property / cites work @@
+Representing trees of higher degree
@@ Property / cites work: Representing trees of higher degree / rank @@
+Normal rank
@@ Property / cites work @@
+Recursive Star-Tree Parallel Data Structure
@@ Property / cites work: Recursive Star-Tree Parallel Data Structure / rank @@
+Normal rank
@@ Property / cites work @@
+On Space Efficient Two Dimensional Range Minimum Data Structures
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Q4910720
@@ Property / cites work: Q4910720 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Succinctness for Range Minimum Queries
@@ Property / cites work: Optimal Succinctness for Range Minimum Queries / rank @@
+Normal rank
@@ Property / cites work @@
+Faster entropy-bounded compressed suffix trees
@@ Property / cites work: Faster entropy-bounded compressed suffix trees / 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 @@
+Q4471381
@@ Property / cites work: Q4471381 / rank @@
+Normal rank
@@ Property / cites work @@
+A Method for the Construction of Minimum-Redundancy Codes
+Normal rank
@@ Property / cites work @@
+Q2934640
@@ Property / cites work: Q2934640 / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning permutations into increasing and decreasing subsequences
+Normal rank
@@ Property / cites work @@
+Q4349924
@@ Property / cites work: Q4349924 / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting shuffled monotone sequences
@@ Property / cites work: Sorting shuffled monotone sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Compressed representations of sequences and full-text indexes
+Normal rank
@@ Property / cites work @@
+Practical Entropy-Compressed Rank/Select Dictionary
+Normal rank
@@ Property / cites work @@
+A framework for adaptive sorting
@@ Property / cites work: A framework for adaptive sorting / 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 @@
+Squeezing succinct data structures into entropy bounds
+Normal rank
@@ Property / cites work @@
+Q5417613
@@ Property / cites work: Q5417613 / rank @@
+Normal rank