Succinct representation of labeled trees (Q476876): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2014.10.006
@@ Property / DOI: 10.1016/j.tcs.2014.10.006 / rank @@
-Normal rank
@@ Property / cites work @@
+Adaptive searching in succinctly encoded binary relations and tree-structured documents
+Normal rank
@@ Property / cites work @@
+New Lower and Upper Bounds for Representing Sequences
+Normal rank
@@ Property / cites work @@
+Representing trees of higher degree
@@ Property / cites work: Representing trees of higher degree / rank @@
+Normal rank
@@ Property / cites work @@
+Orderly Spanning Trees with Applications
@@ Property / cites work: Orderly Spanning Trees with Applications / rank @@
+Normal rank
@@ Property / cites work @@
+A Uniform Approach Towards Succinct Representation of Trees
+Normal rank
@@ Property / cites work @@
+Compressing and indexing labeled trees, with applications
+Normal rank
@@ Property / cites work @@
+Succinct ordinal trees with level-ancestor queries
+Normal rank
@@ Property / cites work @@
+A Framework for Succinct Labeled Ordinal Trees over Large Alphabets
+Normal rank
@@ Property / cites work @@
+Succinct representations of permutations and functions
+Normal rank
@@ Property / cites work @@
+Succinct Representation of Balanced Parentheses and Static Trees
+Normal rank
@@ Property / cites work @@
+Fully Functional Static and Dynamic Succinct Trees
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2014.10.006
@@ Property / DOI: 10.1016/J.TCS.2014.10.006 / rank @@
+Normal rank