Optimal indexes for sparse bit vectors (Q472491): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-013-9767-2 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965268455 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1108.2157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct indexes for strings, binary relations and multilabeled trees / 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: Engineering the LOUDS Succinct Tree Representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Storage and Retrieval by Content and Address of Static Files / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressing and indexing labeled trees, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indexing compressed text / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple storage scheme for strings achieving entropy bounds / 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: Succinct ordinal trees with level-ancestor queries / 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: On the Size of Succinct Indices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Encoding of Succinct Data Structures / 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: Compressed data structures: Dictionaries and data-aware measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cryptanalytic time-memory trade-off / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Entropy-Compressed Rank/Select Dictionary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space trade-offs for predecessor search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct indexable dictionaries with applications to encoding <i>k</i> -ary trees, prefix sums and multisets / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-013-9767-2 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:34, 9 December 2024

scientific article
Language Label Description Also known as
English
Optimal indexes for sparse bit vectors
scientific article

    Statements

    Optimal indexes for sparse bit vectors (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 November 2014
    0 references
    succinct data structures
    0 references
    bit-vectors
    0 references
    rank and select
    0 references
    systematic encoding
    0 references
    information-theoretic lower bound
    0 references
    redundancy
    0 references

    Identifiers