Parallel construction of succinct trees

DOI10.1016/j.tcs.2017.07.025zbMath1380.68144OpenAlexW4229674772MaRDI QIDQ2410360

Meng He, Norbert Zeh, José Fuentes-Sepúlveda, Leo Ferres

Publication date: 17 October 2017

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.07.025

zbMATH Keywords

parallel algorithmmulticoresuccinct data structuresuccinct tree construction

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Data structures (68P05)

Related Items

Fast and compact planar embeddings

Uses Software

• SDSL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ultra-succinct representation of ordered trees with applications
• Succinct representations of permutations and functions
• The level ancestor problem simplified
• Surpassing the information theoretic bound with fusion trees
• Cost-optimal parallel algorithms for constructing B-trees
• Parallel lightweight wavelet tree, suffix array and FM-index construction
• A uniform paradigm to succinctly encode various families of trees
• Compressed suffix trees with full functionality
• Space Efficient Suffix Trees
• Fully Functional Static and Dynamic Succinct Trees
• Succinct Representations of Ordinal Trees
• Wavelet Trees for All
• Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
• Scheduling multithreaded computations by work stealing
• Succinct ordinal trees based on tree covering
• A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
• A unifying look at data structures
• Balanced parentheses strike back
• Succinct Trees in Practice
• Prefix computations on symmetric multiprocessors