Shengyu Zhang Vis

*	2009
17	EE	Yury Lifshits, Shengyu Zhang: Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design. SODA 2009: 318-326
16	EE	Rahul Jain, Hartmut Klauck, Shengyu Zhang: Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas CoRR abs/0908.4453: (2009)
15	EE	Rahul Jain, Shengyu Zhang: New bounds on classical and quantum one-way communication complexity. Theor. Comput. Sci. 410(26): 2463-2477 (2009)
	2008
14	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
13	EE	Rahul Jain, Shengyu Zhang: New bounds on classical and quantum one-way communication complexity CoRR abs/0802.4101: (2008)
	2007
12	EE	Shengyu Zhang: Streaming Algorithms Measured in Terms of the Computed Quantity. COCOON 2007: 338-348
11	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
10	EE	Prashanth Hande, Shengyu Zhang, Mung Chiang: Distributed rate allocation for inelastic flows. IEEE/ACM Trans. Netw. 15(6): 1240-1253 (2007)
	2006
9	EE	Shengyu Zhang: New upper and lower bounds for randomized and quantum local search. STOC 2006: 634-643
8	EE	Shengyu Zhang: New upper and lower bounds for randomized and quantum Local Search CoRR abs/quant-ph/0603034: (2006)
7	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
6	EE	Shengyu Zhang: Promised and Distributed Quantum Search. COCOON 2005: 430-439
5	EE	Mung Chiang, Shengyu Zhang, Prashanth Hande: Distributed rate allocation for inelastic flows: optimization frameworks, optimality conditions, and optimal algorithms. INFOCOM 2005: 2679-2690
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

Coauthor Index

1	Andris Ambainis	[11]
2	Mung Chiang	[5] [10]
3	Andrew M. Childs	[11]
4	Sean Hallgren	[14]
5	Prashanth Hande	[5] [10]
6	Wei Huang	[7]
7	Rahul Jain	[13] [15] [16]
8	Hartmut Klauck	[16]
9	Alexandra Kolla	[14]
10	Yury Lifshits	[17]
11	Ben Reichardt	[11]
12	Pranab Sen	[14]
13	Yaoyun Shi	[7]
14	Robert Spalek	[11]
15	Xiaoming Sun	[1]
16	Andrew Chi-Chih Yao	[1]
17	Yufan Zhu	[7]

Colors in the list of coauthors