On the validity of the direct sum conjecture
SIAM Journal on Computing
Information and Computation
Query-limited reducibilities
Information and Computation
On the extended direct sum conjecture
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Lower bounds for constant-depth circuits in the presence of help bits
Information Processing Letters
Terse, superterse, and verbose sets
Information and Computation
Quantifying the amount of verboseness
Information and Computation
Recursion theoretic properties of frequency computation and bounded queries
Information and Computation
Information and Computation
Amortized Communication Complexity
SIAM Journal on Computing
Frequency computation and bounded queries
Theoretical Computer Science
The Computational Power of a Family of Decision Forests
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Choosing, agreeing, and eliminating in communication complexity
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Choosing, Agreeing, and Eliminating in Communication Complexity
Computational Complexity
| Hi-index | 0.00 |