Data structures and network algorithms
Data structures and network algorithms
Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
IEEE Transactions on Computers
Parallel ear decomposition search (EDS) and st-numbering in graphs
Theoretical Computer Science
SIAM Journal on Computing
A bridging model for parallel computation
Communications of the ACM
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
Connected components in O(lg3/2|V|) parallel time for the CREW PRAM (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
An introduction to parallel algorithms
An introduction to parallel algorithms
A parallel algorithm for computing minimum spanning trees
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Fast connected components algorithms for the EREW PRAM
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM (JACM)
An efficient and fast parallel-connected component algorithm
Journal of the ACM (JACM)
Random sampling in graph optimization problems
Random sampling in graph optimization problems
Finding minimum spanning forests in logarithmic time and linear work using random sampling
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Can shared-memory model serve as a bridging model for parallel computation?
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Finding connected components in O(log n loglog n) time on the EREW PRAM
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A minimum spanning tree algorithm with inverse-Ackermann type complexity
Journal of the ACM (JACM)
Efficient parallel algorithms for some graph problems
Communications of the ACM
Computing connected components on parallel computers
Communications of the ACM
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
A Faster Deterministic Algorithm for Minimum Spanning Trees
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Finding Minimum Spanning Trees in O(m alpha(m,n)) Time
Finding Minimum Spanning Trees in O(m alpha(m,n)) Time
An optimal minimum spanning tree algorithm
Journal of the ACM (JACM)
Simpler and faster biconnectivity augmentation
Journal of Algorithms
A 2-approximation NC algorithm for connected vertex cover and tree cover
Information Processing Letters
Parallel algorithms for P4-comparability graphs
Journal of Algorithms
An NC algorithm for finding a maximal acyclic set in a graph
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
An O(log n log log n) space algorithm for undirected st-connectivity
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Journal of Parallel and Distributed Computing
On the parallel computation of the biconnected and strongly connected co-components of graphs
Discrete Applied Mathematics
Randomized minimum spanning tree algorithms using exponentially fewer random bits
ACM Transactions on Algorithms (TALG)
Fast minimum spanning tree for large graphs on the GPU
Proceedings of the Conference on High Performance Graphics 2009
The bridge-connectivity augmentation problem with a partition constraint
Theoretical Computer Science
Parametric control of captured mesh sequences for real-time animation
MIG'11 Proceedings of the 4th international conference on Motion in Games
Parametric animation of performance-captured mesh sequences
Computer Animation and Virtual Worlds
Research paper: The saga of minimum spanning trees
Computer Science Review
An adaptive parallel hierarchical clustering algorithm
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
| Hi-index | 0.02 |
This paper resolves a long-standing open problem on whether the concurrent write capability of parallel random access machine (PRAM) is essential for solving fundamental graph problems like connected components and minimum spanning trees in O(logn) time. Specifically, we present a new algorithm to solve these problems in O(logn) time using a linear number of processors on the exclusive-read exclusive-write PRAM. The logarithmic time bound is actually optimal since it is well known that even computing the “OR” of nbit requires &OHgr;(log n time on the exclusive-write PRAM. The efficiency achieved by the new algorithm is based on a new schedule which can exploit a high degree of parallelism.