Communication Complexity for Parallel Divide-and-Conquer (1991)

Cached

Download Links

by I-chen Wu , H. T. Kung
Venue:In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science
Citations:29 - 2 self

Document Versions

Communication Complexity for Parallel Divide-and-Conquer –I-chen Wu, H. T. Kung — 1991 — In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science