Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet

DOI10.1007/978-3-642-20877-5_21zbMath1331.68058OpenAlexW1829816872MaRDI QIDQ3010401

Pooya Davoodi, S. Srinivasa Rao

Publication date: 1 July 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-20877-5_21

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (2)

Fully Functional Static and Dynamic Succinct Trees ⋮ Succinct dynamic cardinal trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Succinct representation of dynamic trees
• Representing trees of higher degree
• Compressed representations of sequences and full-text indexes
• Compressed indexes for dynamic text collections
• An Improved Succinct Representation for Dynamic k-ary Trees
• Universal Succinct Representations of Trees?
• Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
• Algorithms and Computation

This page was built for publication: Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet