|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 4 occurrences of 4 keywords
|
|
|
|
|
Results
Found 31 publication records. Showing 31 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 | Yaoyun Shi |
Quantum Simpsons Paradox and High Order Bell-Tsirelson Inequalities |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Igor L. Markov, Yaoyun Shi |
Constant-Degree Graph Expansions that Preserve Treewidth. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhiqiang Zhang, Yaoyun Shi |
On the parity complexity measures of Boolean functions. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ye Du, Rahul Sami, Yaoyun Shi |
Path auctions with multiple edge ownership. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Runyao Duan, Yaoyun Shi |
When is there a multipartite maximum entangled state? |
Quantum Information & Computation |
2010 |
DBLP BibTeX RDF |
|
| 1 | Zhiqiang Zhang, Yaoyun Shi |
On the parity complexity measures of Boolean functions |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Yaoyun Shi, Yufan Zhu |
Quantum communication complexity of block-composed functions. |
Quantum Information & Computation |
2009 |
DBLP BibTeX RDF |
|
| 1 | Zhiqiang Zhang, Yaoyun Shi |
Communication complexities of symmetric XOR functions. |
Quantum Information & Computation |
2009 |
DBLP BibTeX RDF |
|
| 1 | Yuan Feng, Yaoyun Shi |
Characterizing locally indistinguishable orthogonal product states. |
IEEE Transactions on Information Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yaoyun Shi, Zhiqiang Zhang |
Communication Complexities of XOR functions |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Yaoyun Shi, Yufan Zhu |
Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor L. Markov, Yaoyun Shi |
Simulating Quantum Computation by Contracting Tensor Networks. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yaoyun Shi |
Quantum Algorithm for the Parity Problem. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor L. Markov, Yaoyun Shi |
Constant-degree graph expansions that preserve the treewidth |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Ye Du, Yaoyun Shi, Xin Zhao |
Using Spam Farm to Boost PageRank. |
AIRWeb |
2007 |
DBLP 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 | Yaoyun Shi |
Quantum and classical tradeoffs. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Yaoyun Shi |
Tensor norms and the classical communication complexity of nonlocal quantum measurement. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
bell inequality, classical simulation, fourier sampling problem, quantum entanglement, tensor norms, communication complexity |
| 1 | Yaoyun Shi |
Quantum and Classical Tradeoffs |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Yaoyun Shi |
Quantum lower bounds for the collision and the element distinctness problems. |
J. ACM |
2004 |
DBLP DOI BibTeX RDF |
element distinctness, polynomial method, quantum lower bounds, quantum computing, Collision |
| 1 | Andris Ambainis, Yaoyun Shi |
Distributed construction of quantum fingerprints. |
Quantum Information & Computation |
2004 |
DBLP BibTeX RDF |
|
| 1 | Yaoyun Shi |
Both Toffoli and controlled-NOT need little help to do universal quantum computing. |
Quantum Information & Computation |
2003 |
DBLP BibTeX RDF |
|
| 1 | Yaoyun Shi |
Entropy lower bounds for quantum decision tree complexity. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Høyer, Jan Neerbek, Yaoyun Shi |
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Yaoyun Shi |
Quantum Lower Bounds for the Collision and the Element Distinctness Problems. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Chakrabarti, Subhash Khot, Yaoyun Shi |
Evasiveness of Subgraph Containment and Related Properties. |
SIAM J. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Høyer, Jan Neerbek, Yaoyun Shi |
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. |
ICALP |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Chakrabarti, Subhash Khot, Yaoyun Shi |
Evasiveness of Subgraph Containment and Related Properties. |
STACS |
2001 |
DBLP DOI BibTeX RDF |
Decision Tree Complexity, Monotone Graph Properties, Graph Property Testing, Evasiveness |
| 1 | Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, Andrew Chi-Chih Yao |
Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity. |
FOCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Yaoyun Shi |
Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables. |
Inf. Process. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #31 of 31 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")