STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Exponential separation of quantum and classical communication complexity
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Quantum lower bounds by quantum arguments
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Space lower bounds for distance approximation in the data stream model
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Quantum communication and complexity
Theoretical Computer Science - Natural computing
Improved Quantum Communication Complexity Bounds for Disjointness and Equality
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Quantum lower bounds by quantum arguments
Journal of Computer and System Sciences - Special issue on STOC 2000
Bounds for Small-Error and Zero-Error Quantum Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Approximation of boolean functions by combinatorial rectangles
Theoretical Computer Science
An information statistics approach to data stream and communication complexity
Journal of Computer and System Sciences - Special issue on FOCS 2002
Towards proving strong direct product theorems
Computational Complexity
On the power of randomized multicounter machines
Theoretical Computer Science - Insightful theory
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
Exponential separation of quantum and classical online space complexity
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Separating AC0 from depth-2 majority circuits
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Lower bounds for randomized read/write stream algorithms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Classical interaction cannot replace a quantum message
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Algebrization: a new barrier in complexity theory
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Sketching information divergences
Machine Learning
Computational Complexity
Distributed computation of the mode
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Algebrization: A New Barrier in Complexity Theory
ACM Transactions on Computation Theory (TOCT)
Finding duplicates in a data stream
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
New bounds on classical and quantum one-way communication complexity
Theoretical Computer Science
On the Tightness of the Buhrman-Cleve-Wigderson Simulation
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
Pushdown automata and multicounter machines, a comparison of computation modes
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Sketching information divergences
COLT'07 Proceedings of the 20th annual conference on Learning theory
How to compress interactive communication
Proceedings of the forty-second ACM symposium on Theory of computing
A strong direct product theorem for disjointness
Proceedings of the forty-second ACM symposium on Theory of computing
On probabilistic pushdown automata
Information and Computation
Lower bounds for edit distance and product metrics via Poincaré-type inequalities
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Depth-independent lower bounds on the communication complexity of read-once Boolean formulas
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
SIAM Journal on Computing
Finding heavy distinct hitters in data streams
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Distributed verification and hardness of distributed approximation
Proceedings of the forty-third annual ACM symposium on Theory of computing
On the power of lower bound methods for one-way quantum communication complexity
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
The complexity of data aggregation in directed networks
DISC'11 Proceedings of the 25th international conference on Distributed computing
The Value of Multiple Read/Write Streams for Approximating Frequency Moments
ACM Transactions on Computation Theory (TOCT)
Unifying the Landscape of Cell-Probe Lower Bounds
SIAM Journal on Computing
Lower bounds for number-in-hand multiparty communication complexity, made easy
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Testing disjointness of private datasets
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
Testing computability by width-two OBDDs
Theoretical Computer Science
Quantum and classical communication-space tradeoffs from rectangle bounds
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Theoretical Computer Science
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Interactive information complexity
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The multiparty communication complexity of set disjointness
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The communication complexity of distributed task allocation
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
SIAM Journal on Computing
Extended formulations, nonnegative factorizations, and randomized communication protocols
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
From information to exact communication
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
An information complexity approach to extended formulations
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Superlinear advantage for exact quantum algorithms
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Communication lower bounds using directional derivatives
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 5.24 |