Dmitry Gavinsky
Publications
- D. Gavinsky, T. Lee, M. Santha, Swagato Sanyal, D. Gavinsky, T. Lee. (2022). A composition theorem for randomized query complexity via max conflict complexity. Theory of Computing 18
- D. Gavinsky, Pavel Pudlák, D. Gavinsky. (2020). Santha-Vazirani sources, deterministic condensers and very strong extractors. Theory of Computing Systems
- D. Gavinsky, D. Gavinsky. (2020). Bare quantum simultaneity versus classical interactivity in communication complexity. ACM STOC
- D. Gavinsky, D. Gavinsky. (2020). Entangled simultaneity versus classical interactivity in communication complexity. IEEE Trans. Inf.
- D. Gavinsky, R. Jain, T. Lee, M. Santha, Swagato Sanyal, Jevgenijs Vihrovs, D. Gavinsky, H. Klauck, S.Kundu, T. Lee. (2020). Quadratically Tight Relations for Randomized Query Complexity. Theory of Computing Systems 64 101-119
- D. Gavinsky, D. Gavinsky. (2019). Quantum versus classical simultaneity in communication complexity. IEEE Trans. Inf. 10 6466-6483
- D. Gavinsky, D. Gavinsky. (2019). Quantum versus classical simultaneity in communication complexity. IEEE Trans. Inf.
- D. Gavinsky, D. Gavinsky, R. Jain, H. Klauck, S.Kundu, T. Lee, T. Lee, M. Santha, S. Sanyal, Jevgenijs Vihrovs. (2017). Quadratically Tight Relations for Randomized Query Complexity. CSR
- A. Anshu, A. Anshu, D. Gavinsky, D. Gavinsky, R. Jain, S.Kundu, T. Lee, T. Lee, P. Mukhopadhyay, M. Santha, S. Sanyal. (2017). A Composition Theorem for Randomized Query Complexity. FSTTCS
- D. Gavinsky, D. Gavinsky. (2016). Entangled simultaneity versus classical interactivity in communication complexity. Proceedings of ACM STOC
- D. Gavinsky, 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, D. Gavinsky, H. Klauck. (2015). Equality, Revisited. International Symposium MFCS 2 127-138
- Ralph C. Bottesch, D. Gavinsky, D. Gavinsky, H. Klauck. (2015). Correlation in Hard Distributions in Communication Complexity. RANDOM 544-572
