- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| i8 |      | Thomas Vidick: Three-player entangled XOR games are NP-hard to approximate. CoRR abs/1302.1242 (2013) |
| 2012 | ||
| j5 | | Thomas Vidick: A concentration inequality for the overlap of a vector on a large set, with application to the communication complexity of the Gap-Hamming-Distance problem. Chicago J. Theor. Comput. Sci. 2012 (2012) |
| j4 | | Anindya De, Christopher Portmann, Thomas Vidick, Renato Renner: Trevisan's Extractor in the Presence of Quantum Side Information. SIAM J. Comput. 41(4): 915-940 (2012) |
| c8 | | Tsuyoshi Ito, Thomas Vidick: A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers. FOCS 2012: 243-252 |
| c7 | | Umesh V. Vazirani, Thomas Vidick: Certifiable quantum dice: or, true random number generation secure against quantum adversaries. STOC 2012: 61-76 |
| c6 | | Abel Molina, Thomas Vidick, John Watrous: Optimal Counterfeiting Attacks and Generalizations for Wiesner's Quantum Money. TQC 2012: 45-64 |
| i7 | | Tsuyoshi Ito, Thomas Vidick: A multi-prover interactive proof for NEXP sound against entangled provers. CoRR abs/1207.0550 (2012) |
| i6 | | Assaf Naor, Oded Regev, Thomas Vidick: Efficient rounding for the noncommutative Grothendieck inequality. CoRR abs/1210.7656 (2012) |
| i5 | | Tsuyoshi Ito, Thomas Vidick: A multi-prover interactive proof for NEXP sound against entangled provers. Electronic Colloquium on Computational Complexity (ECCC) 19: 85 (2012) |
| 2011 | ||
| j3 | | Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick: Entangled Games Are Hard to Approximate. SIAM J. Comput. 40(3): 848-877 (2011) |
| c5 | | |
| i4 | | Thomas Vidick: A concentration inequality for the overlap of a vector on a large set, With application to the communication complexity of the Gap-Hamming-Distance problem. Electronic Colloquium on Computational Complexity (ECCC) 18: 51 (2011) |
| 2010 | ||
| c4 | | Joshua Brody, Amit Chakrabarti, Oded Regev, Thomas Vidick, Ronald de Wolf: Better Gap-Hamming Lower Bounds via Better Round Elimination. APPROX-RANDOM 2010: 476-489 |
| c3 | | |
| 2009 | ||
| j2 | | Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick: Using Entanglement in Quantum Multi-Prover Interactive Proofs. Computational Complexity 18(2): 273-307 (2009) |
| i3 | | Joshua Brody, Amit Chakrabarti, Oded Regev, Thomas Vidick, Ronald de Wolf: Better Gap-Hamming Lower Bounds via Better Round Elimination. CoRR abs/0912.5276 (2009) |
| i2 | | Anindya De, Christopher Portmann, Thomas Vidick, Renato Renner: Trevisan's extractor in the presence of quantum side information. CoRR abs/0912.5514 (2009) |
| i1 | | Anindya De, Thomas Vidick: Near-optimal extractors against quantum storage. Electronic Colloquium on Computational Complexity (ECCC) 16: 133 (2009) |
| 2008 | ||
| j1 | | Phong Q. Nguyen, Thomas Vidick: Sieve algorithms for the shortest vector problem are practical. J. Mathematical Cryptology 2(2): 181-207 (2008) |
| c2 | | Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick: Using Entanglement in Quantum Multi-prover Interactive Proofs. IEEE Conference on Computational Complexity 2008: 211-222 |
| c1 | | Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick: Entangled Games are Hard to Approximate. FOCS 2008: 447-456 |
Colors in the list of coauthors
Last update Wed May 22 12:38:44 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page