Succinct dynamic cardinal trees with constant time operations for small alphabet

DOI10.1007/978-3-642-20877-5_21MaRDI QIDQ3010401zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Succinct dynamic cardinal trees
• An Improved Succinct Representation for Dynamic k-ary Trees
• Fully functional static and dynamic succinct trees
• Universal Succinct Representations of Trees?
• Fully-functional succinct trees

Cites work

• scientific article; zbMATH DE number 2185599 (Why is no real title available?)
• scientific article; zbMATH DE number 2038723 (Why is no real title available?)
• scientific article; zbMATH DE number 1830754 (Why is no real title available?)
• Algorithms and Computation
• An Improved Succinct Representation for Dynamic k-ary Trees
• Compressed indexes for dynamic text collections
• Compressed representations of sequences and full-text indexes
• Representing dynamic binary trees succinctly
• Representing trees of higher degree
• Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
• Succinct representation of dynamic trees
• Ultra-succinct representation of ordered trees
• Universal Succinct Representations of Trees?

Cited in

(3)

• Succinct dynamic cardinal trees
• Fully functional static and dynamic succinct trees
• An Improved Succinct Representation for Dynamic k-ary Trees

This page was built for publication: Succinct dynamic cardinal trees with constant time operations for small alphabet

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