Adapting parallel algorithms to the W-stream model, with applications to graph problems (Q410728): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The space complexity of approximating the frequency moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple randomized parallel algorithm for list-ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4224190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trading off space for passes in graph streaming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximate <i>L</i><sup>1</sup> -Difference Algorithm for Massive Data Streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast, small-space algorithms for approximate histogram maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Stream Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection and sorting with limited storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(logn) parallel connectivity algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: List-ranking on interconnection networks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-Probability Parallel Transitive-Closure Algorithms / rank
 
Normal rank

Latest revision as of 00:46, 5 July 2024

scientific article
Language Label Description Also known as
English
Adapting parallel algorithms to the W-stream model, with applications to graph problems
scientific article

    Statements

    Adapting parallel algorithms to the W-stream model, with applications to graph problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 April 2012
    0 references
    data streaming model
    0 references
    reductions to parallel algorithms
    0 references
    graph problems
    0 references

    Identifiers