Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (Q758188): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel strong orientation of an undirected graph / 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: Finding Euler tours in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Evaluation of General Arithmetic Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimally efficient selection algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for some graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic coin tossing with applications to optimal parallel list ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster optimal parallel prefix sums and list ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Parallel 5-Colouring of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing connected components on parallel computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel ear decomposition search (EDS) and st-numbering in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast, Efficient Parallel Algorithms for Some Graph Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(logn) parallel connectivity algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Lowest Common Ancestors: Simplification and Parallelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parallel Algorithms for a Class of Graph Theoretic Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal parallel connectivity algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On efficient parallel strong orientation / rank
 
Normal rank

Revision as of 16:07, 21 June 2024

scientific article
Language Label Description Also known as
English
Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
scientific article

    Statements

    Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (English)
    0 references
    0 references
    0 references
    1991
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximate parallel scheduling
    0 references
    list ranking
    0 references
    logarithmic time parallel
    0 references
    PRAM
    0 references
    algorithm
    0 references
    0 references
    0 references
    0 references