Succinct Representations of Ordinal Trees

DOI10.1007/978-3-642-40273-9_20zbMath1394.68102OpenAlexW165200395MaRDI QIDQ2848982

S. Srinivasa Rao, Rajeev Raman

Publication date: 13 September 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2381/29205

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (7)

On succinct representations of binary trees ⋮ Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs ⋮ Constructing small tree grammars and small circuits for formulas ⋮ Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits ⋮ Parallel construction of succinct trees ⋮ Faster repetition-aware compressed suffix trees based on block trees ⋮ Random Access to High-Order Entropy Compressed Text

Uses Software

• GitHub
• SDSL
• succinct

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ultra-succinct representation of ordered trees with applications
• Succinct representation of dynamic trees
• Representing trees of higher degree
• A simple optimal representation for balanced parentheses
• Encoding 2D range maximum queries
• Finding level-ancestors in trees
• The cell probe complexity of succinct data structures
• Space Efficient Suffix Trees
• Succinct Representation of Balanced Parentheses and Static Trees
• Succinct ordinal trees with level-ancestor queries
• Succinct indexes for strings, binary relations and multilabeled trees
• Succinct ordinal trees based on tree covering
• TREE COMPRESSION AND OPTIMIZATION WITH APPLICATIONS
• Compressing and indexing labeled trees, with applications
• A Uniform Approach Towards Succinct Representation of Trees
• On the Size of Succinct Indices
• Universal Succinct Representations of Trees?
• Self-adjusting binary search trees
• Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
• Balanced parentheses strike back
• Random Access to Grammar-Compressed Strings and Trees
• Engineering the LOUDS Succinct Tree Representation
• Orderly Spanning Trees with Applications
• Automata, Languages and Programming

This page was built for publication: Succinct Representations of Ordinal Trees