From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures (Q2848970): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient fully-compressed sequence representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: LRM-trees: compressed indices, adaptive sorting, and compressed permutations / 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: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPRESSED REPRESENTATIONS OF PERMUTATIONS, AND APPLICATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alphabet-Independent Compressed Text Indexing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An almost optimal algorithm for unbounded searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting, trees, and measures of order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear merging and natural mergesort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal codeword sets and representations of the integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Probabilistic Results on Merging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Succinctness for Range Minimum 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: Optimal lower bounds for rank and select indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank/select operations on large alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting shuffled monotone sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measures of Presortedness and Optimal Sorting Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representations of permutations and functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting and Searching in Multisets / 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 <i>k</i> -ary trees, prefix sums and multisets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417613 / rank
 
Normal rank

Latest revision as of 21:33, 6 July 2024

scientific article
Language Label Description Also known as
English
From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures
scientific article

    Statements

    From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures (English)
    0 references
    0 references
    13 September 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    adaptive (analysis of) algorithms
    0 references
    compressed data structures
    0 references
    permutation
    0 references
    set union
    0 references
    sorting
    0 references
    unbounded search
    0 references
    0 references
    0 references
    0 references
    0 references