BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Denmark
1 × Japan
4 × USA
Collaborated with:
M.Coudron L.Mancinska U.V.Vazirani J.Kempe A.De A.Naor O.Regev
Talks about:
quantum (3) entangl (2) against (2) optim (2) grothendieck (1) noncommut (1) extractor (1) adversari (1) parallel (1) interact (1)

Person: Thomas Vidick

DBLP DBLP: Vidick:Thomas

Contributed to:

ICALP (1) 20152015
ICALP (1) 20142014
STOC 20132013
STOC 20122012
STOC 20112011
STOC 20102010

Wrote 6 papers:

ICALP-v1-2015-CoudronV #approximate #interactive #proving
Interactive Proofs with Approximately Commuting Provers (MC, TV), pp. 355–366.
ICALP-v1-2014-MancinskaV #bound #probability
Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability (LM, TV), pp. 835–846.
STOC-2013-NaorRV #commutative #difference #performance
Efficient rounding for the noncommutative grothendieck inequality (AN, OR, TV), pp. 71–80.
STOC-2012-VaziraniV #generative #quantum #random
Certifiable quantum dice: or, true random number generation secure against quantum adversaries (UVV, TV), pp. 61–76.
STOC-2011-KempeV #game studies #parallel
Parallel repetition of entangled games (JK, TV), pp. 353–362.
STOC-2010-DeV #quantum
Near-optimal extractors against quantum storage (AD, TV), pp. 161–170.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.