Succinct representations of ordinal trees
From MaRDI portal
Publication:2848982
DOI10.1007/978-3-642-40273-9_20zbMATH Open1394.68102OpenAlexW165200395MaRDI QIDQ2848982FDOQ2848982
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
Recommendations
Cites Work
- Representing dynamic binary trees succinctly
- Succinct representation of balanced parentheses and static trees
- Succinct ordinal trees with level-ancestor queries
- Compressing and indexing labeled trees, with applications
- Universal Succinct Representations of Trees?
- Ultra-succinct representation of ordered trees with applications
- Title not available (Why is that?)
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Balanced parentheses strike back
- Succinct representation of dynamic trees
- Title not available (Why is that?)
- Representing trees of higher degree
- Succinct indexes for strings, binary relations and multilabeled trees
- Self-adjusting binary search trees
- Finding level-ancestors in trees
- Encoding 2D range maximum queries
- Space efficient suffix trees
- Succinct ordinal trees based on tree covering
- Title not available (Why is that?)
- On the Size of Succinct Indices
- Automata, Languages and Programming
- Orderly Spanning Trees with Applications
- A Uniform Approach Towards Succinct Representation of Trees
- A simple optimal representation for balanced parentheses
- The cell probe complexity of succinct data structures
- Engineering the LOUDS Succinct Tree Representation
- Random Access to Grammar-Compressed Strings and Trees
- TREE COMPRESSION AND OPTIMIZATION WITH APPLICATIONS
Cited In (17)
- Ultra-succinct representation of ordered trees with applications
- Constructing small tree grammars and small circuits for formulas
- Faster repetition-aware compressed suffix trees based on block trees
- New Computational Paradigms
- Succinct representations of trees
- Succinct posets
- Succinct Ordinal Trees Based on Tree Covering
- Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs
- Parallel construction of succinct trees
- A Framework for Succinct Labeled Ordinal Trees over Large Alphabets
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits
- Random access to high-order entropy compressed text
- Faster repetition-aware compressed suffix trees based on block trees
- Universal Succinct Representations of Trees?
- On succinct representations of binary trees
- A Uniform Approach Towards Succinct Representation of Trees
- Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs
Uses Software
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)
