Succinct data structures for searchable partial sums with optimal worst-case performance (Q719256): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal bounds for the predecessor problem and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Membership in Constant Time and Almost-Minimum Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indexing compressed text / 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: Q4471381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank and select revisited and extended / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Representation of Balanced Parentheses and Static Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space Efficient Suffix Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low Redundancy in Static Dictionaries with Constant Query Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic Lower Bounds in the Cell-Probe Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4778577 / 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

Latest revision as of 12:47, 4 July 2024

scientific article
Language Label Description Also known as
English
Succinct data structures for searchable partial sums with optimal worst-case performance
scientific article

    Statements

    Succinct data structures for searchable partial sums with optimal worst-case performance (English)
    0 references
    0 references
    0 references
    0 references
    10 October 2011
    0 references
    0 references
    succinctness
    0 references
    succinct indexing scheme
    0 references
    0 references