Non-deterministic communication complexity with few witnesses
Journal of Computer and System Sciences
The linear-array problem in communication complexity resolved
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On relations between counting communication complexity classes
Journal of Computer and System Sciences
On Toda's Theorem in Structural Communication Complexity
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Complexity Lower Bounds using Linear Algebra
Foundations and Trends® in Theoretical Computer Science
Unbounded-error quantum query complexity
Theoretical Computer Science
Hi-index | 0.01 |