 | 2012 |
| 38 |  | Dmitry Gavinsky,
Shachar Lovett,
Michael E. Saks,
Srikanth Srinivasan:
A Tail Bound for Read-k Families of Functions.
Electronic Colloquium on Computational Complexity (ECCC) 19: 51 (2012) |
| 2011 |
| 37 |  | Dmitry Gavinsky,
Martin Roetteler,
Jérémie Roland:
Quantum Algorithm for the Boolean Hidden Shift Problem.
COCOON 2011: 158-167 |
| 36 |  | Dmitry Gavinsky,
Martin Roetteler,
Jérémie Roland:
Quantum algorithm for the Boolean hidden shift problem
CoRR abs/1103.3017: (2011) |
| 35 |  | Dmitry Gavinsky:
Quantum Money with Classical Verification
CoRR abs/1109.0372: (2011) |
| 2010 |
| 34 |  | Dmitry Gavinsky:
Quantum Predictive Learning and Communication Complexity with Single Input.
COLT 2010: 207-217 |
| 33 |  | Dmitry Gavinsky,
Alexander A. Sherstov:
A Separation of NP and coNP in Multiparty Communication Complexity
CoRR abs/1004.0817: (2010) |
| 32 |  | Dmitry Gavinsky,
Tsuyoshi Ito:
Quantum Fingerprints that Keep Secrets
CoRR abs/1010.5342: (2010) |
| 31 |  | Dmitry Gavinsky,
Tsuyoshi Ito:
Quantum Fingerprints that Keep Secrets.
Electronic Colloquium on Computational Complexity (ECCC) 17: 165 (2010) |
| 30 |  | Dmitry Gavinsky,
Alexander A. Sherstov:
A Separation of NP and coNP in Multiparty Communication Complexity.
Electronic Colloquium on Computational Complexity (ECCC) 17: 60 (2010) |
| 29 |  | Dmitry Gavinsky,
Alexander A. Sherstov:
A Separation of NP and coNP in Multiparty Communication Complexity.
Theory of Computing 6(1): 227-245 (2010) |
| 2009 |
| 28 |  | Richard Cleve,
Dmitry Gavinsky,
Rahul Jain:
Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's.
Quantum Information & Computation 9(7): 648-656 (2009) |
| 27 |  | Dmitry Gavinsky,
Julia Kempe,
Oded Regev,
Ronald de Wolf:
Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity.
SIAM J. Comput. 39(1): 1-24 (2009) |
| 2008 |
| 26 |  | Dmitry Gavinsky,
Pavel Pudlák:
Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity.
IEEE Conference on Computational Complexity 2008: 332-339 |
| 25 |  | Dmitry Gavinsky:
Classical interaction cannot replace a quantum message.
STOC 2008: 95-102 |
| 24 |  | Richard Cleve,
Dmitry Gavinsky,
David L. Yonge-Mallo:
Quantum Algorithms for Evaluating Min-MaxTrees.
TQC 2008: 11-15 |
| 23 |  | Dmitry Gavinsky,
Oded Regev,
Ronald de Wolf:
Simultaneous Communication Protocols with Quantum and Classical Messages.
Chicago J. Theor. Comput. Sci. 2008: (2008) |
| 22 |  | Dmitry Gavinsky:
On the role of shared entanglement.
Quantum Information & Computation 8(1): 82-95 (2008) |
| 21 |  | Dmitry Gavinsky,
Julia Kempe,
Iordanis Kerenidis,
Ran Raz,
Ronald de Wolf:
Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography.
SIAM J. Comput. 38(5): 1695-1708 (2008) |
| 2007 |
| 20 |  | Dmitry Gavinsky,
Julia Kempe,
Iordanis Kerenidis,
Ran Raz,
Ronald de Wolf:
Exponential separations for one-way quantum communication complexity, with applications to cryptography.
STOC 2007: 516-525 |
| 19 |  | Dmitry Gavinsky:
Classical Interaction Cannot Replace a Quantum Message
CoRR abs/quant-ph/0703215: (2007) |
| 18 |  | Dmitry Gavinsky:
Classical Interaction Cannot Replace a Quantum Message.
Electronic Colloquium on Computational Complexity (ECCC) 14(058): (2007) |
| 17 |  | Dmitry Gavinsky,
Pavel Pudlák:
Exponential Separation of Quantum and Classical Non-Interactive Multi-Party Communication Complexity.
Electronic Colloquium on Computational Complexity (ECCC) 14(074): (2007) |
| 2006 |
| 16 |  | Dmitry Gavinsky,
Julia Kempe,
Ronald de Wolf:
Strengths and Weaknesses of Quantum Fingerprinting.
IEEE Conference on Computational Complexity 2006: 288-298 |
| 15 |  | Dmitry Gavinsky,
Julia Kempe,
Oded Regev,
Ronald de Wolf:
Bounded-error quantum state identification and exponential separations in communication complexity.
STOC 2006: 594-603 |
| 14 |  | Dmitry Gavinsky,
Julia Kempe,
Ronald de Wolf:
Strengths and Weaknesses of Quantum Fingerprinting
CoRR abs/quant-ph/0603173: (2006) |
| 13 |  | Dmitry Gavinsky:
On the Role of Shared Entanglement
CoRR abs/quant-ph/0604052: (2006) |
| 12 |  | Dmitry Gavinsky,
Julia Kempe,
Ronald de Wolf:
Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function
CoRR abs/quant-ph/0607174: (2006) |
| 11 |  | Dmitry Gavinsky,
Julia Kempe,
Ronald de Wolf:
Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function.
Electronic Colloquium on Computational Complexity (ECCC) 13(086): (2006) |
| 2005 |
| 10 |  | Dmitry Gavinsky:
A Note on Shared Randomness and Shared Entanglement in Communication
CoRR abs/quant-ph/0505088: (2005) |
| 9 |  | Dmitry Gavinsky,
Julia Kempe,
Oded Regev,
Ronald de Wolf:
Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity
CoRR abs/quant-ph/0511013: (2005) |
| 2004 |
| 8 |  | Dmitry Gavinsky,
Avi Owshanko:
PExact = Exact Learning.
COLT 2004: 200-209 |
| 7 |  | Dmitry Gavinsky,
Julia Kempe,
Ronald de Wolf:
Quantum Communication Cannot Simulate a Public Coin
CoRR quant-ph/0411051: (2004) |
| 6 |  | Dmitry Gavinsky:
Quantum solution to the hidden subgroup problem for poly-near-hamiltonian groups.
Quantum Information & Computation 4(3): 229-235 (2004) |
| 2003 |
| 5 |  | Dmitry Gavinsky:
Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning.
Journal of Machine Learning Research 4: 101-117 (2003) |
| 2002 |
| 4 |  | Dmitry Gavinsky:
Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning.
ALT 2002: 98-112 |
| 3 |  | Nader H. Bshouty,
Dmitry Gavinsky:
PAC = PAExact and Other Equivalent Models in Learning.
FOCS 2002: 167-176 |
| 2 |  | Nader H. Bshouty,
Dmitry Gavinsky:
On Boosting with Polynomially Bounded Distributions.
Journal of Machine Learning Research 3: 483-506 (2002) |
| 2001 |
| 1 |  | Nader H. Bshouty,
Dmitry Gavinsky:
On Boosting with Optimal Poly-Bounded Distributions.
COLT/EuroCOLT 2001: 490-506 |