Pseudorandom Generators for Read-Once ACC0.
D. Gavinsky, S. Lovett and S. Srinivasan. Accepted to the 27th Computational Complexity Conference (CCC), 2012
(conference version).
Classical Interaction Cannot Replace Quantum Nonlocality.
D. Gavinsky. arXiv:0901.0956 12th Workshop on Quantum Information Processing (QIP), 2009. Submitted to a journal.
Quantum Algorithms for Evaluating Min-Max Trees.
R. Cleve, D. Gavinsky and D. L. Yeung. arXiv:0710.5794 Proceedings of the 3rd Workshop on Theory of Quantum Computation, Communication and Cryptography (TQC), 2008. Lecture Notes in Computer Science, Volume 5106, Volume 5106 (special issue on TQC'08), pages 11-15, 2008.
On the Role of Shared Entanglement.
D. Gavinsky. quant-ph/0604052 7th Asian Conference on Quantum Information Science (AQIS), 2007. Quantum Information & Computation, Volume 8(1-2), pages 82-95, 2008.
On Boosting with Optimal Poly-Bounded Distributions.
N. Bshouty and D. Gavinsky. Proceedings of the 14th Conference on Computational Learning Theory (COLT), pages 490-506, 2001. Journal of Machine Learning Research, Volume 3 (special issue on COLT'01), pages 483-506, 2002.