LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations

DOI10.1007/978-3-642-21458-5_25zbMath1339.68048arXiv1009.5863MaRDI QIDQ3011862

Johannes Fischer, Jérémy Barbay, Gonzalo Navarro

Publication date: 29 June 2011

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

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

Mathematics Subject Classification ID

68P10: Searching and sorting

68P05: Data structures

68W32: Algorithms on strings

Related Items

Fully Functional Static and Dynamic Succinct Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Representing trees of higher degree
• Faster entropy-bounded compressed suffix trees
• Sorting shuffled monotone sequences
• The cell probe complexity of succinct data structures
• Optimal lower bounds for rank and select indexes
• Compressed representations of sequences and full-text indexes
• Sorting and Selection in Posets
• Optimal Succinctness for Range Minimum Queries
• Squeezing succinct data structures into entropy bounds
• On Space Efficient Two Dimensional Range Minimum Data Structures
• Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
• A Method for the Construction of Minimum-Redundancy Codes
• Lowest common ancestors in trees and directed acyclic graphs
• Algorithms and Computation