Exact time bounds for computing boolean functions on PRAMs without simultaneous writes
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Converting high probability into nearly-constant time—with applications to parallel hashing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Exact lower time bounds for computing Boolean functions on CREW PRAMs
Journal of Computer and System Sciences
Lower bounds for randomized exclusive write PRAMs
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Lower Bounds for Randomized Exclusive Write PRAMs
Theory of Computing Systems
Hi-index | 0.02 |