Succinct data structure for dynamic trees with faster queries

DOI10.1016/j.tcs.2019.02.005zbMath1423.68130arXiv1805.11255OpenAlexW2962842529MaRDI QIDQ2420610

Dekel Tsur

Publication date: 6 June 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.11255

zbMATH Keywords

succinct data structuresordinal trees, time complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (1)

Representation of ordered trees with a given degree distribution

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Succinct dynamic cardinal trees
• Ultra-succinct representation of ordered trees with applications
• Succinct representations of permutations and functions
• Succinct representation of labeled trees
• Succinct representation of dynamic trees
• Representing trees of higher degree
• A simple optimal representation for balanced parentheses
• A uniform paradigm to succinctly encode various families of trees
• Succinct Representation of Balanced Parentheses and Static Trees
• Fully Functional Static and Dynamic Succinct Trees
• Succinct ordinal trees with level-ancestor queries
• Succinct ordinal trees based on tree covering
• On the Size of Succinct Indices
• A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME
• Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree
• Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
• Engineering the LOUDS Succinct Tree Representation
• A Framework for Dynamizing Succinct Data Structures

This page was built for publication: Succinct data structure for dynamic trees with faster queries