Multi-level logic synthesis using communication complexity
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
The linear-array conjecture in communication complexity is false
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The communication complexity of pointer chasing: applications of entropy and sampling
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
IEEE Annals of the History of Computing - Special issue on Central and Eastern Europe
On quantum and probabilistic communication: Las Vegas and one-way protocols
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Interaction in quantum communication and the complexity of set disjointness
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Polynomial Time Testability of Circuits Generated by Input Decomposition
IEEE Transactions on Computers
The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Multiparty communication complexity and very hard functions
Information and Computation
Tight lower bounds for query processing on streaming and external memory data
Theoretical Computer Science
Computational Complexity
IEEE Transactions on Information Theory
Tight lower bounds for query processing on streaming and external memory data
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The complexity of querying external memory and streaming data
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
| Hi-index | 0.06 |