LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations (Q3011862): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2172133688 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1009.5863 / 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: Lowest common ancestors in trees and directed acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing trees of higher degree / 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: Sorting and Selection in Posets / 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: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting shuffled monotone sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449187 / 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: 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 06:26, 4 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
    29 June 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references