| Publication | Date of Publication | Type |
|---|
| PAC=PAExact and other equivalent models in learning | 2026-05-29 | Paper |
A composition theorem for randomized query complexity via max-conflict complexity
(available as arXiv preprint) | 2022-07-21 | Paper |
Bare Quantum Simultaneity Versus Classical Interactivity in Communication Complexity
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
The layer complexity of Arthur-Merlin-like communication
Theory of Computing | 2021-10-25 | Paper |
The communication complexity of the inevitable intersection problem
Chicago Journal of Theoretical Computer Science | 2021-05-14 | Paper |
Bare Quantum simultaneity versus classical interactivity in communication complexity
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
A composition theorem for randomized query complexity
(available as arXiv preprint) | 2020-11-25 | Paper |
Entangled Simultaneity Versus Classical Interactivity in Communication Complexity
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Santha-Vazirani sources, deterministic condensers and very strong extractors
Theory of Computing Systems | 2020-08-26 | Paper |
Quantum Versus Classical Simultaneity in Communication Complexity
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Entangled simultaneity versus classical interactivity in communication complexity
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Correlation in Hard Distributions in Communication Complexity
(available as arXiv preprint) | 2017-08-31 | Paper |
Partition expanders
Theory of Computing Systems | 2017-07-17 | Paper |
Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation
SIAM Journal on Computing | 2017-03-10 | Paper |
Partition expanders
(available as arXiv preprint) | 2017-03-03 | Paper |
On the joint entropy of d-wise-independent variables.
Commentationes Mathematicae Universitatis Carolinae | 2017-01-13 | Paper |
A tail bound for read-k families of functions
Random Structures & Algorithms | 2015-10-12 | Paper |
Equality, revisited
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Bounded-error quantum state identification and exponential separations in communication complexity
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
En route to the log-rank conjecture: new reductions and equivalent formulations
Automata, Languages, and Programming | 2014-07-01 | Paper |
On the role of shared randomness in simultaneous communication
Automata, Languages, and Programming | 2014-07-01 | Paper |
Simultaneous communication protocols with quantum and classical messages
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
Quantum predictive learning and communication complexity with single input
Quantum Information & Computation | 2012-09-05 | Paper |
Quantum Algorithm for the Boolean Hidden Shift Problem
Lecture Notes in Computer Science | 2011-08-17 | Paper |
A separation of NP and conp in multiparty communication complexity
Theory of Computing | 2011-05-24 | Paper |
Bounded-error quantum state identification and exponential separations in communication complexity
SIAM Journal on Computing | 2010-03-17 | Paper |
Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography
SIAM Journal on Computing | 2009-11-06 | Paper |
| Entanglement-resistant two-prover interactive proof systems and non-adaptive PIR's | 2009-10-12 | Paper |
Quantum Algorithms for Evaluating Min-Max Trees
Theory of Quantum Computation, Communication, and Cryptography | 2009-01-13 | Paper |
| scientific article; zbMATH DE number 5485520 (Why is no real title available?) | 2009-01-05 | Paper |
| On the role of shared entanglement | 2008-11-24 | Paper |
| Quantum solution to the hidden subgroup problem for poly-near-Hamiltonian groups | 2008-09-03 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2005-06-13 | Paper |
10.1162/153244304322765667
CrossRef Listing of Deleted DOIs | 2004-11-01 | Paper |
10.1162/153244303321897708
CrossRef Listing of Deleted DOIs | 2004-10-28 | Paper |
| scientific article; zbMATH DE number 1966609 (Why is no real title available?) | 2003-08-18 | Paper |
| scientific article; zbMATH DE number 1804120 (Why is no real title available?) | 2002-09-22 | Paper |
