Parallel construction of succinct trees (Q2410360): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fully Functional Static and Dynamic Succinct Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875211 / 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 uniform paradigm to succinctly encode various families of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Representations of Ordinal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel lightweight wavelet tree, suffix array and FM-index construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Trees in Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: The level ancestor problem simplified / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ultra-succinct representation of ordered trees with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced parentheses strike back / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed suffix trees with full functionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space Efficient Suffix Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representations of permutations and functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surpassing the information theoretic bound with fusion trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling multithreaded computations by work stealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prefix computations on symmetric multiprocessors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unifying look at data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wavelet Trees for All / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3361878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost-optimal parallel algorithms for constructing B-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays / rank
 
Normal rank

Latest revision as of 14:30, 14 July 2024

scientific article
Language Label Description Also known as
English
Parallel construction of succinct trees
scientific article

    Statements

    Parallel construction of succinct trees (English)
    0 references
    0 references
    0 references
    0 references
    17 October 2017
    0 references
    succinct data structure
    0 references
    succinct tree construction
    0 references
    multicore
    0 references
    parallel algorithm
    0 references

    Identifiers