A simple optimal representation for balanced parentheses (Q859854): Difference between revisions

@@ Property / cites work @@
+Representing trees of higher degree
@@ Property / cites work: Representing trees of higher degree / rank @@
+Normal rank
@@ Property / cites work @@
+Q3024774
@@ Property / cites work: Q3024774 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4875211
@@ Property / cites work: Q4875211 / rank @@
+Normal rank
@@ Property / cites work @@
+An experimental study of a compressed index
@@ Property / cites work: An experimental study of a compressed index / rank @@
+Normal rank
@@ Property / cites work @@
+Storing a Sparse Table with             <i>0</i>             (1) Worst Case Access Time
+Normal rank
@@ Property / cites work @@
+Q5501236
@@ Property / cites work: Q5501236 / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic Dictionaries
@@ Property / cites work: Deterministic Dictionaries / rank @@
+Normal rank
@@ Property / cites work @@
+Q4449187
@@ Property / cites work: Q4449187 / rank @@
+Normal rank
@@ Property / cites work @@
+Space Efficient Suffix Trees
@@ Property / cites work: Space Efficient Suffix Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct Representation of Balanced Parentheses and Static Trees
+Normal rank
@@ Property / cites work @@
+Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
+Normal rank
@@ Property / cites work @@
+Q4828936
@@ Property / cites work: Q4828936 / rank @@
+Normal rank