Every robust CRCW PRAM can efficiently simulate a PRIORITY PRAM
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Fast hashing on a PRAM—designing by expectation
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
An optical simulation of shared memory
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Partially effective randomization in simulations between arbitrary and common PRAMs
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |