Ultra-succinct representation of ordered trees with applications (Q414928): 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 @@
+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 @@
+Universal Succinct Representations of Trees?
@@ Property / cites work: Universal Succinct Representations of Trees? / rank @@
+Normal rank
@@ Property / cites work @@
+Compressing and indexing labeled trees, with applications
+Normal rank
@@ Property / cites work @@
+Indexing compressed text
@@ Property / cites work: Indexing compressed text / rank @@
+Normal rank
@@ Property / cites work @@
+A simple storage scheme for strings achieving entropy bounds
+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 @@
+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 @@
+Algorithms on Strings, Trees and Sequences
@@ Property / cites work: Algorithms on Strings, Trees and Sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934640
@@ Property / cites work: Q2934640 / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced parentheses strike back
@@ Property / cites work: Balanced parentheses strike back / rank @@
+Normal rank
@@ Property / cites work @@
+A Space-Economical Suffix Tree Construction Algorithm
+Normal rank
@@ Property / cites work @@
+Succinct Representation of Balanced Parentheses and Static Trees
+Normal rank
@@ Property / cites work @@
+Space Efficient Suffix Trees
@@ Property / cites work: Space Efficient Suffix Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Low Redundancy in Static Dictionaries with Constant Query Time
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / 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 @@
+Time-space trade-offs for compressed suffix arrays.
+Normal rank
@@ Property / cites work @@
+Binary trees having a given number of nodes with 0, 1, and 2 children
+Normal rank
@@ Property / cites work @@
+New text indexing functionalities of the compressed suffix arrays
+Normal rank
@@ Property / cites work @@
+Compressed suffix trees with full functionality
@@ Property / cites work: Compressed suffix trees with full functionality / rank @@
+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
@@ Property / cites work @@
+Engineering a compressed suffix tree implementation
+Normal rank