Succinct representations of permutations and functions (Q441860): Difference between revisions

@@ Property / arXiv ID @@
+.1983
@@ Property / arXiv ID: 1108.1983 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2754135
@@ Property / cites work: Q2754135 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4778571
@@ Property / cites work: Q4778571 / rank @@
+Normal rank
@@ Property / cites work @@
+COMPRESSED REPRESENTATIONS OF PERMUTATIONS, AND APPLICATIONS
+Normal rank
@@ Property / cites work @@
+Q3044351
@@ Property / cites work: Q3044351 / 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 @@
+Finding level-ancestors in trees
@@ Property / cites work: Finding level-ancestors in trees / rank @@
+Normal rank
@@ Property / cites work @@
+Min-wise independent permutations
@@ Property / cites work: Min-wise independent permutations / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4037405
@@ Property / cites work: Q4037405 / rank @@
+Normal rank
@@ Property / cites work @@
+Changing base without losing space
@@ Property / cites work: Changing base without losing space / rank @@
+Normal rank
@@ Property / cites work @@
+The cell probe complexity of succinct data structures
+Normal rank
@@ Property / cites work @@
+A simple optimal representation for balanced parentheses
+Normal rank
@@ Property / cites work @@
+Succinct ordinal trees with level-ancestor queries
+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 @@
+Q4633874
@@ Property / cites work: Q4633874 / 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 @@
+Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
+Normal rank
@@ Property / cites work @@
+Q2921650
@@ Property / cites work: Q2921650 / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct Ordinal Trees Based on Tree Covering
@@ Property / cites work: Succinct Ordinal Trees Based on Tree Covering / rank @@
+Normal rank
@@ Property / cites work @@
+A cryptanalytic time-memory trade-off
@@ Property / cites work: A cryptanalytic time-memory trade-off / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient representation of perm groups
@@ Property / cites work: Efficient representation of perm groups / rank @@
+Normal rank
@@ Property / cites work @@
+Q4002466
@@ Property / cites work: Q4002466 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4281568
@@ Property / cites work: Q4281568 / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct Representation of Balanced Parentheses and Static Trees
+Normal rank
@@ Property / cites work @@
+Q4449187
@@ Property / cites work: Q4449187 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417611
@@ Property / cites work: Q5417611 / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of permutations admitting an \(m\)th root
+Normal rank
@@ Property / cites work @@
+Q4778577
@@ Property / cites work: Q4778577 / 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 @@
+Q5417613
@@ Property / cites work: Q5417613 / rank @@
+Normal rank
@@ Property / cites work @@
+Log-logarithmic worst-case range queries are possible in space theta(N)
+Normal rank