Probabilistic communication complexity
Journal of Computer and System Sciences
Lower bounds on communication complexity in distributed computer networks
Journal of the ACM (JACM)
Unbiased bits from sources of weak randomness and probabilistic communication complexity
SIAM Journal on Computing - Special issue on cryptography
Relations between communication complexity classes
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Handbook of theoretical computer science (vol. B)
Private vs. common random bits in communication complexity
Information Processing Letters
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The linear-array conjecture in communication complexity is false
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Nondeterministic communication with a limited number of advice bits
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Communication complexity and parallel computing
Communication complexity and parallel computing
Communication complexity
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
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
Sorting and Searching (Eatcs Monographs on Theoretical Computer Science)
Sorting and Searching (Eatcs Monographs on Theoretical Computer Science)
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
Optimal fault-tolerant embedding of paths in twisted cubes
Journal of Parallel and Distributed Computing
Optimal Embeddings of Paths with Various Lengths in Twisted Cubes
IEEE Transactions on Parallel and Distributed Systems
Two absolute bounds for distributed bit complexity
Theoretical Computer Science
Edge-pancyclicity and path-embeddability of bijective connection graphs
Information Sciences: an International Journal
Bit complexity of breaking and achieving symmetry in chains and rings
Journal of the ACM (JACM)
Fault-tolerant embedding of paths in crossed cubes
Theoretical Computer Science
Multi-party finite computations
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Two absolute bounds for distributed bit complexity
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |