Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Zhang, Shengyu"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the complexity of trial and error
Xiaohui Bei
,
Ning Chen
,
Shengyu Zhang
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 31-40
New classes of quaternary cyclotomic sequence of length
2p^m
with high linear complexity
Pinhui Ke
,
Shengyuan Zhang
Information Processing Letters
112
(16), 2012, pp. 646-650
On the power of lower bound methods for one-way quantum communication complexity
Shengyu Zhang
Lecture Notes in Computer Science
6755
, 2011, pp. 49-60
Depth-independent lower bounds on the communication complexity of read-once Boolean formulas
Rahul Jain
,
Hartmut Klauck
,
Shengyu Zhang
Lecture Notes in Computer Science
6196
, 2010, pp. 54-59
Composition theorems in communication complexity
Troy Lee
,
Shengyu Zhang
Lecture Notes in Computer Science
6198
, 2010, pp. 475-489
New bounds on classical and quantum one-way communication complexity
Rahul Jain
,
Shengyu Zhang
Theoretical Computer Science
410
(26), 2009, pp. 2463-2477
On the tightness of the Buhrman-Cleve-Wigderson simulation
Shengyu Zhang
Lecture Notes in Computer Science
5878
, 2009, pp. 434-440
Tight bounds for randomized and quantum local search
Shengyu Zhang
SIAM Journal on Computing
39
(3), 2009, pp. 948-977
Making classical honest verifier zero knowledge protocols secure against quantum attacks
Sean Hallgren
,
Alexandra Kolla
,
Pranab Sen
,
Shengyu Zhang
Lecture Notes in Computer Science
5126
, 2008, pp. 592-603
Streaming algorithms measured in terms of the computed quantity
Shengyu Zhang
Lecture Notes in Computer Science
4598
, 2007, pp. 338-348
The communication complexity of the Hamming distance problem
Wei Huang
,
Yaoyun Shi
,
Shengyu Zhang
,
Yufan Zhu
Information Processing Letters
99
(4), 2006, pp. 149-153
New upper and lower bounds for randomized and quantum local search
Shengyu Zhang
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 634-643
Promised and distributed quantum search
Shengyu Zhang
Lecture Notes in Computer Science
3595
, 2005, pp. 430-439
On the power of Ambainis lower bounds
Shengyu Zhang
Theoretical Computer Science
339
(2-3), 2005, pp. 241-256
On the power of Ambainis's lower bounds
Shengyu Zhang
Lecture Notes in Computer Science
3142
, 2004, pp. 1238-1250
On the nonexistence of extremal self-dual codes
Shengyuan Zhang
Discrete Applied Mathematics
91
(1-3), 1999, pp. 277-286