Travelled to:
1 × France
1 × Greece
1 × Japan
1 × USA
1 × United Kingdom
Collaborated with:
S.Laplante F.Magniez M.Szegedy V.Lerays H.Krovi M.Ozols A.Nayak M.Santha L.Fontes R.Jain I.Kerenidis M.Laurière
Talks about:
quantum (3) communic (2) complex (2) walk (2) distribut (1) ineffici (1) detector (1) discrep (1) classic (1) search (1)
Person: Jérémie Roland
DBLP: Roland:J=eacute=r=eacute=mie
Contributed to:
Wrote 5 papers:
- ICALP-v1-2015-FontesJKLLR #communication #complexity
- Relative Discrepancy Does not Separate Information and Communication Complexity (LF, RJ, IK, SL, ML, JR), pp. 506–516.
- ICALP-v1-2012-LaplanteLR #bound #detection #quantum
- Classical and Quantum Partition Bound and Detector Inefficiency (SL, VL, JR), pp. 617–628.
- ICALP-v1-2010-KroviMOR #detection #quantum
- Finding Is as Easy as Detecting for Quantum Walks (HK, FM, MO, JR), pp. 540–551.
- ICALP-v1-2009-RolandS #communication #complexity
- Amortized Communication Complexity of Distributions (JR, MS), pp. 738–749.
- STOC-2007-MagniezNRS #quantum
- Search via quantum walk (FM, AN, JR, MS), pp. 575–584.