LRM-trees: compressed indices, adaptive sorting, and compressed permutations (Q1758161): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Alphabet Partitioning for Compressed Rank/Select and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPRESSED REPRESENTATIONS OF PERMUTATIONS, AND APPLICATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On compressing permutations and adaptive sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing trees of higher degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Star-Tree Parallel Data Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Space Efficient Two Dimensional Range Minimum Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4910720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Succinctness for Range Minimum Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster entropy-bounded compressed suffix trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cell probe complexity of succinct data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal lower bounds for rank and select indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for the Construction of Minimum-Redundancy Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning permutations into increasing and decreasing subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting shuffled monotone sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed representations of sequences and full-text indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Entropy-Compressed Rank/Select Dictionary / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for adaptive sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Squeezing succinct data structures into entropy bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417613 / rank
 
Normal rank

Latest revision as of 21:08, 5 July 2024

scientific article
Language Label Description Also known as
English
LRM-trees: compressed indices, adaptive sorting, and compressed permutations
scientific article

    Statements

    LRM-trees: compressed indices, adaptive sorting, and compressed permutations (English)
    0 references
    0 references
    0 references
    0 references
    8 November 2012
    0 references
    compressed data structures
    0 references
    range minimum queries
    0 references
    adaptive sorting algorithms
    0 references
    data structures for permutations
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references