| 2008 |
|---|
| 13 | EE | Sean Hallgren,
Alexandra Kolla,
Pranab Sen,
Shengyu Zhang:
Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks.
ICALP (2) 2008: 592-603 |
| 12 | EE | Rahul Jain,
Shengyu Zhang:
New bounds on classical and quantum one-way communication complexity
CoRR abs/0802.4101: (2008) |
| 2007 |
|---|
| 11 | EE | Shengyu Zhang:
Streaming Algorithms Measured in Terms of the Computed Quantity.
COCOON 2007: 338-348 |
| 10 | EE | Andris Ambainis,
Andrew M. Childs,
Ben Reichardt,
Robert Spalek,
Shengyu Zhang:
Any AND-OR Formula of Size N can be Evaluated in time N1/2+o(1) on a Quantum Computer.
FOCS 2007: 363-372 |
| 9 | EE | Prashanth Hande,
Shengyu Zhang,
Mung Chiang:
Distributed rate allocation for inelastic flows.
IEEE/ACM Trans. Netw. 15(6): 1240-1253 (2007) |
| 2006 |
|---|
| 8 | EE | Shengyu Zhang:
New upper and lower bounds for randomized and quantum local search.
STOC 2006: 634-643 |
| 7 | EE | Shengyu Zhang:
New upper and lower bounds for randomized and quantum Local Search
CoRR abs/quant-ph/0603034: (2006) |
| 6 | EE | Wei Huang,
Yaoyun Shi,
Shengyu Zhang,
Yufan Zhu:
The communication complexity of the Hamming distance problem.
Inf. Process. Lett. 99(4): 149-153 (2006) |
| 2005 |
|---|
| 5 | EE | Shengyu Zhang:
Promised and Distributed Quantum Search.
COCOON 2005: 430-439 |
| 4 | EE | Shengyu Zhang:
(Almost) tight bounds for randomized and quantum Local Search on hypercubes and grids
Electronic Colloquium on Computational Complexity (ECCC)(041): (2005) |
| 3 | EE | Shengyu Zhang:
On the power of Ambainis lower bounds.
Theor. Comput. Sci. 339(2-3): 241-256 (2005) |
| 2004 |
|---|
| 2 | EE | Shengyu Zhang:
On the Power of Ambainis's Lower Bounds.
ICALP 2004: 1238-1250 |
| 1 | EE | Xiaoming Sun,
Andrew Chi-Chih Yao,
Shengyu Zhang:
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
IEEE Conference on Computational Complexity 2004: 286-293 |
