Efficient parallel algorithms for path problems in directed graphs
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Local reorientation, global order, and planar topology
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
High-probability parallel transitive closure algorithms
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
More time-work tradeoffs for parallel graph algorithms
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Time-work tradeoffs for parallel graph algorithms
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
A parallel randomized approximation scheme for shortest paths
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Efficient parallel algorithms for computing all pair shortest paths in directed graphs
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Time-work tradeoffs for parallel algorithms
Journal of the ACM (JACM)
Graph-theoretic methods in database theory
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On Identifying Strongly Connected Components in Parallel
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
A 2-approximation NC algorithm for connected vertex cover and tree cover
Information Processing Letters
Finding strongly connected components in distributed graphs
Journal of Parallel and Distributed Computing
On the parallel computation of the biconnected and strongly connected co-components of graphs
Discrete Applied Mathematics
Finding strongly connected components in parallel using O(log2n) reachability queries
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Parallel algorithms for finding SCCs in implicitly given graphs
FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
Parallel breadth-first search on distributed memory systems
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
Reasoning in multi-agent systems with random knowledge distribution
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
| Hi-index | 0.89 |