A randomized parallel algorithm for planar graph isomorphism
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM (extended abstract)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
A comparison of parallel algorithms for connected components
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the 30th IEEE symposium on Foundations of computer science
Towards modeling the performance of a fast connected components algorithm on parallel machines
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
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
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A spectral method to separate disconnected and nearly-disconnected web graph components
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Parallel Hierarchical Clustering Algorithms
IEEE Transactions on Parallel and Distributed Systems
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
Journal of Parallel and Distributed Computing
Randomized minimum spanning tree algorithms using exponentially fewer random bits
ACM Transactions on Algorithms (TALG)
Algorithms and theory of computation handbook
Exact covariance thresholding into connected components for large-scale graphical lasso
The Journal of Machine Learning Research
| Hi-index | 0.00 |