Succinct representations of ordinal trees

DOI10.1007/978-3-642-40273-9_20MaRDI QIDQ2848982zbMATHOpenAlexFDO

Authors Rajeev Raman, S. Srinivasa Rao

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)

Recommendations

• Succinct Ordinal Trees Based on Tree Covering
• Succinct ordinal trees based on tree covering
• Universal Succinct Representations of Trees?
• Fully-functional succinct trees
• Ultra-succinct representation of ordered trees

Cites work

• scientific article; zbMATH DE number 2038723 (Why is no real title available?)
• scientific article; zbMATH DE number 871936 (Why is no real title available?)
• A Uniform Approach Towards Succinct Representation of Trees
• A simple optimal representation for balanced parentheses
• Automata, Languages and Programming
• Balanced parentheses strike back
• Compressing and indexing labeled trees, with applications
• Engineering the LOUDS Succinct Tree Representation
• Finding level-ancestors in trees
• Fully-functional succinct trees
• On the Size of Succinct Indices
• Orderly Spanning Trees with Applications
• Random access to grammar-compressed strings and trees
• Representing dynamic binary trees succinctly
• Representing trees of higher degree
• Self-adjusting binary search trees
• Space efficient suffix trees
• Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
• Succinct indexes for strings, binary relations and multilabeled trees
• Succinct ordinal trees based on tree covering
• Succinct ordinal trees with level-ancestor queries
• Succinct representation of balanced parentheses and static trees
• Succinct representation of dynamic trees
• TREE COMPRESSION AND OPTIMIZATION WITH APPLICATIONS
• The cell probe complexity of succinct data structures
• Ultra-succinct representation of ordered trees with applications
• Universal Succinct Representations of Trees?

Cited in

(24)

• Succinct representation of labeled trees
• Faster repetition-aware compressed suffix trees based on block trees
• Ultra-succinct representation of ordered trees with applications
• On succinct representations of binary trees
• Balanced parentheses strike back
• Succinct posets
• Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs
• Succinct ordinal trees with level-ancestor queries
• A Framework for Succinct Labeled Ordinal Trees over Large Alphabets
• Universal Succinct Representations of Trees?
• Succinct Ordinal Trees Based on Tree Covering
• Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits
• Succinct data structures\ \dots potential for symbolic computation?
• Random access to high-order entropy compressed text
• Succinct ordinal trees based on tree covering
• Constructing small tree grammars and small circuits for formulas
• Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs
• Succinct posets
• Faster repetition-aware compressed suffix trees based on block trees
• A framework for succinct labeled ordinal trees over large alphabets
• A Uniform Approach Towards Succinct Representation of Trees
• New Computational Paradigms
• Succinct representations of trees
• Parallel construction of succinct trees

Describes a project that uses

Uses Software

• SDSL
• succinct
• GitHub

This page was built for publication: Succinct representations of ordinal trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848982)