论文信息 - A concentration inequality for the overlap of a vector on a large set , with application to communication complexity

A concentration inequality for the overlap of a vector on a large set , with application to communication complexity

• Massachusetts Institute of Technology (2012-present) Education Postdoctoral associate in the Computer Science and Artificial Intelligence Laboratory Supervisor: Scott Aaronson • University of California, Berkeley (2007-2011) Ph.D. in Computer Science, graduated Fall ’11 Advisor: Umesh Vazirani GPA: 3.97/4.0 • University Paris 7 (2006-2007) Masters in Computer Science Ranked 2nd, Grade 19/20 Master’s project: A study of Entanglement in Quantum Interactive Proof Systems. Advisor : Julia Kempe, LRI, Orsay • École Normale Supérieure, Paris (2002-2007) Magistère [B.Sc.]. Major in Computer Science, Minor in Mathematics Ranked 1st, Grade 19/20

Tsuyoshi Ito | Thomas Vidick

[1] Amit Chakrabarti,et al. An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance , 2012, SIAM J. Comput..

[2] Hartmut Klauck,et al. The Partition Bound for Classical Communication Complexity and Query Complexity , 2009, 2010 IEEE 25th Annual Conference on Computational Complexity.

[3] A. Razborov. Communication Complexity , 2011 .