Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM (Q1356881): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jcss.1997.1291 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2151440203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting in \(c \log n\) parallel steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Euler tours in parallel / 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: Efficient parallel algorithms for some graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Merge Sort / 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: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Symmetry-Breaking in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting on a parallel pointer machine with applications to set expression evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards optimal parallel bucket sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing connected components on parallel computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Algorithm for Computing Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Connected Components Algorithms for the EREW PRAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / 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: Parallel algorithms for the connected components and minimal spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-first search is inherently sequential / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(logn) parallel connectivity algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of simultaneous memory address access in models that forbid it / rank
 
Normal rank
Property / cites work
 
Property / cites work: On efficient parallel strong orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798668 / rank
 
Normal rank

Latest revision as of 15:51, 27 May 2024

scientific article
Language Label Description Also known as
English
Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM
scientific article

    Statements

    Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM (English)
    0 references
    0 references
    0 references
    16 June 1997
    0 references
    concurrent writing
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers