Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
Parallel algorithmic techniques for combinatorial computation
Annual review of computer science: vol. 3, 1988
SIAM Journal on Computing
Optimal separations between concurrent-write parallel machines
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
New Simulations between CRCW PRAMs
FCT '89 Proceedings of the International Conference on Fundamentals of Computation Theory
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Constant-time parallel integer sorting
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Methods for message routing in parallel machines
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Load balancing requires &OHgr;(log*n) expected time
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Partially effective randomization in simulations between arbitrary and common PRAMs
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |