Dmitry Gavinsky
Visiting Senior Research Fellow
cqtdmit@nus.edu.sg
Miklos Santha

Publications

  • D. Gavinsky. (2019). Quantum versus classical simultaneity in communication complexity. IEEE Transactions on Information Theory
  • D. Gavinsky, R. Jain, H. Klauck, S.Kundu, T. Lee, M. Santha, S. Sanyal, Jevgenijs Vihrovs. (2017). Quadratically Tight Relations for Randomized Query Complexity. CSR
  • A. Anshu, D. Gavinsky, R. Jain, S.Kundu, T. Lee, P. Mukhopadhyay, M. Santha, S. Sanyal. (2017). A Composition Theorem for Randomized Query Complexity. FSTTCS 2017
  • D. Gavinsky. (2016). Entangled simultaneity versus classical interactivity in communication complexity. Proceedings of ACM STOC
  • D. Gavinsky, Pavel Pudlak. (2016). On the Joint Entropy of d-Wise-Independent Variables. Commentationes Mathematicae Universitatis Carolinae 57 333-343
  • Ralph C. Bottesch, D. Gavinsky, H. Klauck. (2015). Equality, Revisited. International Symposium MFCS 2 127-138
  • Ralph C. Bottesch, D. Gavinsky, H. Klauck. (2015). Correlation in Hard Distributions in Communication Complexity. RANDOM 544-572
  • Swagato Sanyal, M. Santha, T. Lee, D. Gavinsky. A composition theorem for randomized query complexity via max conflict complexity. Automata, Languages, and Programming