Succinct dynamic cardinal trees with constant time operations for small alphabet

DOI10.1007/978-3-642-20877-5_21zbMATH Open1331.68058OpenAlexW1829816872MaRDI QIDQ3010401FDOQ3010401

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

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

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Representing dynamic binary trees succinctly
• Compressed representations of sequences and full-text indexes
• Compressed indexes for dynamic text collections
• Title not available (Why is that?)
• An Improved Succinct Representation for Dynamic k-ary Trees
• Universal Succinct Representations of Trees?
• Title not available (Why is that?)
• Title not available (Why is that?)
• Succinct representation of dynamic trees
• Representing trees of higher degree
• Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
• Ultra-succinct representation of ordered trees
• Algorithms and Computation

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)