Faster optimal parallel prefix sums and list ranking
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1003255
- An Improved Parallel Prefix Sums Algorithm
- Optimal and efficient algorithms for summing and prefix summing on parallel machines
- Practical parallel list ranking
- Optimal parallel algorithms for Prefix Matching
- A generalized parallel prefix sums algorithm for arbitrary size arrays
- scientific article; zbMATH DE number 4064468
- Deterministic parallel list ranking
- A simple randomized parallel algorithm for list-ranking
Cites work
- An Efficient Parallel Biconnectivity Algorithm
- Deterministic coin tossing with applications to optimal parallel list ranking
- scientific article; zbMATH DE number 4064468 (Why is no real title available?)
- On efficient parallel strong orientation
- Parallel Prefix Computation
- Simulation of Parallel Random Access Machines by Circuits
- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
Cited in
(50)- Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
- Optimal computation of prefix sums on a binary tree of processors
- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
- An optimally efficient selection algorithm
- Finding a minimal cover for binary images: An optimal parallel algorithm
- Improved deterministic parallel integer sorting
- Optimal parallel 3-coloring algorithm for rooted trees and its applications
- On a compaction theorem of Ragde
- Optimal parallel time bounds for the maximum clique problem on intervals
- Parallel search algorithms for graphs and trees
- Efficient parallel recognition of some circular arc graphs. I
- Optimal circular arc representations: Properties, recognition, and construction
- Parallel construction and query of index data structures for pattern matching on square matrices
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
- Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space
- Finding level-ancestors in trees
- The parallel complexity of integer prefix summation
- Parallel maximum independent set in convex bipartite graphs
- Sorting strings and constructing digital search trees in parallel
- Efficient computation of implicit representations of sparse graphs
- Parallel prefix computation on extended multi-mesh network.
- An optimal parallel algorithm for planar cycle separators
- On the parallel computation of the biconnected and strongly connected co-components of graphs
- Parallel algorithms for Burrows-Wheeler compression and decompression
- A class of almost-optimal size-independent parallel prefix circuits
- An efficient PRAM algorithm for maximum-weight independent set on permutation graphs
- An optimal parallel algorithm for sorting multisets
- List Factoring and Relative Worst Order Analysis
- OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS
- Modular exponentiation via the explicit Chinese remainder theorem
- scientific article; zbMATH DE number 4064467 (Why is no real title available?)
- scientific article; zbMATH DE number 4064468 (Why is no real title available?)
- An optimal parallel algorithm to construct a deap
- ON THE POWER OF SOME PRAM MODELS
- scientific article; zbMATH DE number 1304056 (Why is no real title available?)
- scientific article; zbMATH DE number 1444289 (Why is no real title available?)
- Improved parallel depth-first search in undirected planar graphs
- Fast and optimal simulations between CRCW PRAMs
- Fast prefix adders for non-uniform input arrival times
- Optimal parallel algorithms on planar graphs
- Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees
- A generalized parallel prefix sums algorithm for arbitrary size arrays
- An Improved Parallel Prefix Sums Algorithm
- An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images
- Optimal and efficient algorithms for summing and prefix summing on parallel machines
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
- On parallel integer sorting
- Deterministic parallel list ranking
- A simple randomized parallel algorithm for list-ranking
- A sublogarithmic convex hull algorithm
This page was built for publication: Faster optimal parallel prefix sums and list ranking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1825647)
