The communication complexity of distributed computing and a parallel algorithm for polynomial roots

Authors:
Prasoon Tiwari
Affiliations:
-
Venue:
The communication complexity of distributed computing and a parallel algorithm for polynomial roots
Year:
1986

Citing 0
Cited 2

Tradeoffs between communication and space

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The computational complexity of universal hashing

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.01

Visualization

Abstract