Finding small simple cycle separators for 2-connected planar graphs
Journal of Computer and System Sciences
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Fast algorithms for shortest paths in planar graphs, with applications
SIAM Journal on Computing
Constructing a maximal independent set in parallel
SIAM Journal on Discrete Mathematics
High probability parallel transitive-closure algorithms
SIAM Journal on Computing
Probabilistic recurrence relations
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A unified geometric approach to graph separators
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A parallel randomized approximation scheme for shortest paths
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Removing randomness in parallel computation without a processor penalty
Journal of Computer and System Sciences
Efficient NC algorithms for set cover with applications to learning and geometry
Proceedings of the 30th IEEE symposium on Foundations of computer science
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
A parallel algorithm for finding a separator in planar graphs
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
A linear work, O(n1/6) time, parallel algorithm for solving planar Laplacians
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Hi-index | 0.00 |