|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 8 occurrences of 8 keywords
|
|
|
|
|
Results
Found 36 publication records. Showing 36 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Rahul Jain, Yaoyun Shi, Zhaohui Wei, Shengyu Zhang |
Correlation/Communication complexity of generating bipartite states  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Shengyu Zhang |
Quantum strategic game theory. |
ITCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Jain, Shengyu Zhang |
The influence lower bound via query elimination. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ming Lam Leung, Yang Li, Shengyu Zhang |
Tight bounds on the randomized communication complexity of symmetric XOR functions in one-way and SMP models. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Rahul Jain, Shengyu Zhang |
The Influence Lower Bound Via Query Elimination. |
Theory of Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Iordanis Kerenidis, Shengyu Zhang |
A quantum protocol for sampling correlated equilibria unconditionally and without a mediator |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Rahul Jain, Shengyu Zhang |
The influence lower bound via query elimination |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ming Lam Leung, Yang Li, Shengyu Zhang |
Tight bounds on the randomized communication complexity of symmetric XOR functions in one-way and SMP models |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Zhaohui Wei, Shengyu Zhang |
On characterizing quantum correlated equilibria |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Shengyu Zhang |
On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ming Lam Leung, Yang Li, Shengyu Zhang |
Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models. |
TAMC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shengyu Zhang |
Quantum Strategic Game Theory |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Troy Lee, Shengyu Zhang |
Composition theorems in communication complexity |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | 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. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Troy Lee, Shengyu Zhang |
Composition Theorems in Communication Complexity. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Jain, Hartmut Klauck, Shengyu Zhang |
Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas. |
COCOON |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang |
On the Power of a Unique Quantum Witness. |
ICS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Rahul Jain, Shengyu Zhang |
New bounds on classical and quantum one-way communication complexity. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Jain, Hartmut Klauck, Shengyu Zhang |
Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Shengyu Zhang |
Tight Bounds for Randomized and Quantum Local Search. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yury Lifshits, Shengyu Zhang |
Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shengyu Zhang |
On the Tightness of the Buhrman-Cleve-Wigderson Simulation. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Jain, Shengyu Zhang |
New bounds on classical and quantum one-way communication complexity |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Sean Hallgren, Alexandra Kolla, Pranab Sen, Shengyu Zhang |
Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Prashanth Hande, Shengyu Zhang, Mung Chiang |
Distributed rate allocation for inelastic flows. |
IEEE/ACM Trans. Netw. |
2007 |
DBLP DOI BibTeX RDF |
capacity provisioning, inelastic flow, network control by pricing, optimization, resource allocation, congestion control, network utility maximization |
| 1 | Shengyu Zhang |
Streaming Algorithms Measured in Terms of the Computed Quantity. |
COCOON |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu |
The communication complexity of the Hamming distance problem. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Shengyu Zhang |
New upper and lower bounds for randomized and quantum Local Search |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Shengyu Zhang |
New upper and lower bounds for randomized and quantum local search. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
query complexity (decision tree complexity), lower bound, local search, randomized algorithm, quantum algorithm |
| 1 | Shengyu Zhang |
(Almost) tight bounds for randomized and quantum Local Search on hypercubes and grids |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Shengyu Zhang |
On the power of Ambainis lower bounds. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mung Chiang, Shengyu Zhang, Prashanth Hande |
Distributed rate allocation for inelastic flows: optimization frameworks, optimality conditions, and optimal algorithms. |
INFOCOM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Shengyu Zhang |
Promised and Distributed Quantum Search. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Shengyu Zhang |
On the Power of Ambainis's Lower Bounds. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #36 of 36 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")