LRM-trees: compressed indices, adaptive sorting, and compressed permutations
type: Item
instance of: scholarly article
title: LRM-trees: compressed indices, adaptive sorting, and compressed permutations
zbMATH Open document ID: 1252.68082
author: Jérémy Barbay
author: Johannes Fischer
author: Gonzalo Navarro
published in: Theoretical Computer Science
publication date: 2012-11-08T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6103620
zbMATH Keywords: compressed data structures
zbMATH Keywords: range minimum queries
zbMATH Keywords: adaptive sorting algorithms
zbMATH Keywords: data structures for permutations
Wikidata QID: Q61661658
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.08.010
OpenAlex ID: W2175677593
cites work: Alphabet Partitioning for Compressed Rank/Select and Applications
cites work: Q2934653
cites work: COMPRESSED REPRESENTATIONS OF PERMUTATIONS, AND APPLICATIONS
cites work: On compressing permutations and adaptive sorting
cites work: Representing trees of higher degree
cites work: Recursive Star-Tree Parallel Data Structure
cites work: On Space Efficient Two Dimensional Range Minimum Data Structures
cites work: Algorithms and Computation
cites work: Q4910720
cites work: Optimal Succinctness for Range Minimum Queries
cites work: Faster entropy-bounded compressed suffix trees
cites work: The cell probe complexity of succinct data structures
cites work: Optimal lower bounds for rank and select indexes
cites work: Q4471381
cites work: A Method for the Construction of Minimum-Redundancy Codes
cites work: Q2934640
cites work: Partitioning permutations into increasing and decreasing subsequences
cites work: Q4349924
cites work: Sorting shuffled monotone sequences
cites work: Compressed representations of sequences and full-text indexes
cites work: Practical Entropy-Compressed Rank/Select Dictionary
cites work: A framework for adaptive sorting
cites work: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
cites work: Squeezing succinct data structures into entropy bounds
cites work: Q5417613
DOI: 10.1016/J.TCS.2012.08.010
description: scientific article; zbMATH DE number 6103620