Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
One, two, three . . . infinity: lower bounds for parallel computation
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Properties of complexity measures for prams and wrams
Theoretical Computer Science
Limits on the power of concurrent-write parallel machines
Information and Computation
Optimal bounds for decision problems on the CRCW PRAM
Journal of the ACM (JACM)
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Parallel Retrieval of Scattered Information
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
One-Way Functions, Robustness, and the Non-Isomorphism of NP-Complete Sets
One-Way Functions, Robustness, and the Non-Isomorphism of NP-Complete Sets
Generic oracles and oracle classes
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
On the degree of Boolean functions as real polynomials
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Fast connected components algorithms for the EREW PRAM
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Optimal parallel string algorithms: sorting, merging and computing the minimum
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Optimal randomized parallel algorithms for computing the row maxima of a totally monotone matrix
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The QRQW PRAM: accounting for contention in parallel algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |