Deterministic parallel list ranking
From MaRDI portal
Publication:808699
DOI10.1007/BF01759076zbMATH Open0732.68045MaRDI QIDQ808699FDOQ808699
Gary L. Miller, Richard J. Anderson
Publication date: 1991
Published in: Algorithmica (Search for Journal in Brave)
Recommendations
Cites Work
- An Efficient Parallel Biconnectivity Algorithm
- Title not available (Why is that?)
- Faster optimal parallel prefix sums and list ranking
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
- Deterministic coin tossing with applications to optimal parallel list ranking
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
Cited In (29)
- Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees
- Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees
- Title not available (Why is that?)
- An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs
- A time-optimal solution for the path cover problem on cographs.
- A simple randomized parallel algorithm for list-ranking
- Title not available (Why is that?)
- More general parallel tree contraction: Register allocation and broadcasting in a tree
- More Efficient Parallel Integer Sorting
- List-ranking on interconnection networks.
- AN EFFICIENT EREW ALGORITHM FOR MINIMUM PATH COVER AND HAMILTONICITY ON COGRAPHS
- PARALLEL VERTEX COLOURING OF INTERVAL GRAPHS
- An optimal parallel algorithm for planar cycle separators
- A COST-OPTIMAL EREW BREADTH-FIRST ALGORITHM FOR ORDERED TREES, WITH APPLICATIONS∗
- Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM
- Improved parallel depth-first search in undirected planar graphs
- Title not available (Why is that?)
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
- Conservative algorithms for parallel and sequential integer sorting
- Faster optimal parallel prefix sums and list ranking
- Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
- Title not available (Why is that?)
- A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles
- Detecting the end of agreement between two long ranked lists
- List Factoring and Relative Worst Order Analysis
- Listing combinatorial objects in parallel
- An efficient parallel algorithm for building the separating tree
- Data independence of read, write, and control structures in PRAM computations
- Deterministic coin tossing with applications to optimal parallel list ranking
This page was built for publication: Deterministic parallel list ranking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808699)
