Lower bounds on communication complexity
Information and Computation
Lower bounds on communication complexity in distributed computer networks
Journal of the ACM (JACM)
Rounds in communication complexity revisited
SIAM Journal on Computing
Fractional Covers and Communication Complexity
SIAM Journal on Discrete Mathematics
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
On notions of information transfer in VLSI circuits
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The linear-array problem in communication complexity resolved
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Exact communication costs for consensus and leader in a tree
Journal of Discrete Algorithms
| Hi-index | 0.00 |