Parallel computation for well-endowed rings and space-bounded probabilistic machines
Information and Control
The two-processor scheduling problem is in R-NC
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Are search and decision programs computationally equivalent?
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
An overview of computational complexity
Communications of the ACM
N-processors graphs distributively achieve perfect matchings in O(log2N) beats
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Efficient algorithms for finding maximum matching in graphs
ACM Computing Surveys (CSUR)
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Are search and decision programs computationally equivalent?
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Efficient Parallel Pseudo-Random Number Generation
CRYPTO '85 Advances in Cryptology
Distributed approximate matching
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Improved distributed approximate matching
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
A new parallel algorithm for the maximal independent set problem
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
The matching problem for bipartite graphs with polynomially bounded permanents is in NC
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |