On compressing permutations and adaptive sorting (Q391981): Difference between revisions

@@ Property / cites work @@
+Untangled monotonic chains and adaptive range search
+Normal rank
@@ Property / cites work @@
+Stronger Lempel-Ziv based compressed text indexing
+Normal rank
@@ Property / cites work @@
+From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures
+Normal rank
@@ Property / cites work @@
+LRM-trees: compressed indices, adaptive sorting, and compressed permutations
+Normal rank
@@ Property / cites work @@
+Alphabet Partitioning for Compressed Rank/Select and Applications
+Normal rank
@@ Property / cites work @@
+Succinct indexes for strings, binary relations and multilabeled trees
+Normal rank
@@ Property / cites work @@
+COMPRESSED REPRESENTATIONS OF PERMUTATIONS, AND APPLICATIONS
+Normal rank
@@ Property / cites work @@
+An almost optimal algorithm for unbounded searching
+Normal rank
@@ Property / cites work @@
+Q4023085
@@ Property / cites work: Q4023085 / rank @@
+Normal rank
@@ Property / cites work @@
+Compressed representations of sequences and full-text indexes
+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 @@
+Approximating minimum cocolorings.
@@ Property / cites work: Approximating minimum cocolorings. / rank @@
+Normal rank
@@ Property / cites work @@
+Trans-dichotomous algorithms for minimum spanning trees and shortest paths
+Normal rank
@@ Property / cites work @@
+On computing the length of longest increasing subsequences
+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 @@
+Rank/select operations on large alphabets
@@ Property / cites work: Rank/select operations on large alphabets / rank @@
+Normal rank
@@ Property / cites work @@
+On the Redundancy of Succinct Data Structures
@@ Property / cites work: On the Redundancy of Succinct Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471381
@@ Property / cites work: Q4471381 / rank @@
+Normal rank
@@ Property / cites work @@
+Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
+Normal rank
@@ Property / cites work @@
+A Method for the Construction of Minimum-Redundancy Codes
+Normal rank
@@ Property / cites work @@
+Q4951153
@@ Property / cites work: Q4951153 / 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 @@
+Rank and select revisited and extended
@@ Property / cites work: Rank and select revisited and extended / rank @@
+Normal rank
@@ Property / cites work @@
+Measures of Presortedness and Optimal Sorting Algorithms
+Normal rank
@@ Property / cites work @@
+Bounding the inefficiency of length-restricted prefix codes
+Normal rank
@@ Property / cites work @@
+Succinct representations of permutations and functions
+Normal rank
@@ Property / cites work @@
+Sorting and Searching in Multisets
@@ Property / cites work: Sorting and Searching in Multisets / 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 @@
+Approximate string matching with compressed indexes
+Normal rank
@@ Property / cites work @@
+New text indexing functionalities of the compressed suffix arrays
+Normal rank
@@ Property / cites work @@
+Q5417613
@@ Property / cites work: Q5417613 / rank @@
+Normal rank
@@ Property / cites work @@
+Self-adjusting binary search trees
@@ Property / cites work: Self-adjusting binary search trees / rank @@
+Normal rank
@@ Property / cites work @@
+Log-logarithmic worst-case range queries are possible in space theta(N)
+Normal rank