Travelled to:1 × Finland
1 × France
1 × Iceland
1 × Japan
1 × Switzerland
2 × USA
Collaborated with:∅ X.Bei N.Chen T.Lee S.Hallgren A.Kolla P.Sen
Talks about:quantum (3) complex (3) lower (3) bound (3) communic (2) power (2) constraint (1) protocol (1) knowledg (1) composit (1)
Person: Shengyu Zhang
DBLP: Zhang:Shengyu
Contributed to:
2015
201320112010200820062004Wrote 7 papers:
- ICALP-v1-2015-BeiCZ #constraints #linear #programming
- Solving Linear Programming with Constraints Unknown (XB, NC, SZ), pp. 129–142.
- STOC-2013-BeiCZ #complexity #fault #on the
- On the complexity of trial and error (XB, NC, SZ), pp. 31–40.
- ICALP-v1-2011-Zhang #bound #communication #complexity #on the #power of #quantum
- On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (SZ), pp. 49–60.
- ICALP-v1-2010-LeeZ #communication #complexity #composition #theorem
- Composition Theorems in Communication Complexity (TL, SZ), pp. 475–489.
- ICALP-C-2008-HallgrenKSZ #protocol #quantum #verification
- Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks (SH, AK, PS, SZ), pp. 592–603.
- STOC-2006-Zhang #bound #quantum #random
- New upper and lower bounds for randomized and quantum local search (SZ), pp. 634–643.
- ICALP-2004-Zhang #bound #on the #power of
- On the Power of Ambainis’s Lower Bounds (SZ), pp. 1238–1250.