Succinct representations of permutations and functions (Q441860): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987699222 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1108.1983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4778571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPRESSED REPRESENTATIONS OF PERMUTATIONS, AND APPLICATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3044351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing trees of higher degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding level-ancestors in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-wise independent permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Changing base without losing space / 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: A simple optimal representation for balanced parentheses / 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: Q4633874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank/select operations on large alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Ordinal Trees Based on Tree Covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cryptanalytic time-memory trade-off / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient representation of perm groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281568 / 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: Q4449187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of permutations admitting an \(m\)th root / 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
Property / cites work
 
Property / cites work: Q5417613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Log-logarithmic worst-case range queries are possible in space theta(N) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:34, 5 July 2024

scientific article
Language Label Description Also known as
English
Succinct representations of permutations and functions
scientific article

    Statements

    Succinct representations of permutations and functions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 August 2012
    0 references
    0 references
    succinct data structures
    0 references
    space redundancy
    0 references
    permutations
    0 references
    functions
    0 references
    benes network
    0 references
    succinct tree representations
    0 references
    level ancestor queries
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references