| 2020 | STOC | Bare quantum simultaneity versus classical interactivity in communication complexity. | Dmitry Gavinsky |
| 2019 | ICALP | A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity. | Dmitry Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal |
| 2016 | STOC | Entangled simultaneity versus classical interactivity in communication complexity. | Dmitry Gavinsky |
| 2015 | MFCS | Equality, Revisited. | Ralph Bottesch, Dmitry Gavinsky, Hartmut Klauck |
| 2014 | ICALP | On the Role of Shared Randomness in Simultaneous Communication. | Mohammad Bavarian, Dmitry Gavinsky, Tsuyoshi Ito |
| 2014 | ICALP | En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations. | Dmitry Gavinsky, Shachar Lovett |
| 2014 | STOC | Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture. | Dmitry Gavinsky, Or Meir, Omri Weinstein, Avi Wigderson |
| 2014 | STACS | Partition Expanders. | Dmitry Gavinsky, Pavel Pudlk |
| 2011 | COCOON | Quantum Algorithm for the Boolean Hidden Shift Problem. | Dmitry Gavinsky, Martin Roetteler, Jrmie Roland |
| 2010 | COLT | Quantum Predictive Learning and Communication Complexity with Single Input. | Dmitry Gavinsky |
| 2008 | STOC | Classical interaction cannot replace a quantum message. | Dmitry Gavinsky |
| 2007 | STOC | Exponential separations for one-way quantum communication complexity, with applications to cryptography. | Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf |
| 2006 | STOC | Bounded-error quantum state identification and exponential separations in communication complexity. | Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf |
| 2004 | COLT | PExact = Exact Learning. | Dmitry Gavinsky, Avi Owshanko |
| 2002 | ALT | Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning. | Dmitry Gavinsky |
| 2002 | FOCS | PAC = PAExact and Other Equivalent Models in Learning. | Nader H. Bshouty, Dmitry Gavinsky |
| 2001 | COLT | On Boosting with Optimal Poly-Bounded Distributions. | Nader H. Bshouty, Dmitry Gavinsky |