- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c8 |      | Rahul Jain, Yaoyun Shi, Zhaohui Wei, Shengyu Zhang: Efficient protocols of generating bipartite classical distributions and quantum states. SODA 2013: 1503-1512 |
| 2012 | ||
| c7 | | Yaoyun Shi, Xiaodi Wu: Epsilon-Net Method for Optimizations over Separable States. ICALP (1) 2012: 798-809 |
| i6 | | Rahul Jain, Yaoyun Shi, Zhaohui Wei, Shengyu Zhang: Correlation/Communication complexity of generating bipartite states. CoRR abs/1203.1153 (2012) |
| i5 | | Yaoyun Shi: Quantum Simpsons Paradox and High Order Bell-Tsirelson Inequalities. CoRR abs/1203.2675 (2012) |
| 2011 | ||
| j18 | | Igor L. Markov, Yaoyun Shi: Constant-Degree Graph Expansions that Preserve Treewidth. Algorithmica 59(4): 461-470 (2011) |
| 2010 | ||
| j17 | | Runyao Duan, Yaoyun Shi: When is there a multipartite maximum entangled state? Quantum Information & Computation 10(11&12): 925-935 (2010) |
| j16 | | Ye Du, Rahul Sami, Yaoyun Shi: Path auctions with multiple edge ownership. Theor. Comput. Sci. 411(1): 293-300 (2010) |
| j15 | | Zhiqiang Zhang, Yaoyun Shi: On the parity complexity measures of Boolean functions. Theor. Comput. Sci. 411(26-28): 2612-2618 (2010) |
| i4 | | Zhiqiang Zhang, Yaoyun Shi: On the parity complexity measures of Boolean functions. CoRR abs/1004.0436 (2010) |
| 2009 | ||
| j14 | | Zhiqiang Zhang, Yaoyun Shi: Communication complexities of symmetric XOR functions. Quantum Information & Computation 9(3): 255-263 (2009) |
| j13 | | Yaoyun Shi, Yufan Zhu: Quantum communication complexity of block-composed functions. Quantum Information & Computation 9(5): 444-460 (2009) |
| j12 | | Yuan Feng, Yaoyun Shi: Characterizing locally indistinguishable orthogonal product states. IEEE Transactions on Information Theory 55(6): 2799-2806 (2009) |
| 2008 | ||
| j11 | | Yaoyun Shi, Yufan Zhu: Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement. SIAM J. Comput. 38(3): 753-766 (2008) |
| j10 | | Igor L. Markov, Yaoyun Shi: Simulating Quantum Computation by Contracting Tensor Networks. SIAM J. Comput. 38(3): 963-981 (2008) |
| r1 | | |
| i3 | | |
| 2007 | ||
| c6 | | |
| i2 | | Igor L. Markov, Yaoyun Shi: Constant-degree graph expansions that preserve the treewidth. CoRR abs/0707.3622 (2007) |
| 2006 | ||
| j9 | | 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 | ||
| j8 | | |
| c5 | | Yaoyun Shi: Tensor norms and the classical communication complexity of nonlocal quantum measurement. STOC 2005: 460-467 |
| 2004 | ||
| j7 | | Scott Aaronson, Yaoyun Shi: Quantum lower bounds for the collision and the element distinctness problems. J. ACM 51(4): 595-605 (2004) |
| j6 | | Andris Ambainis, Yaoyun Shi: Distributed construction of quantum fingerprints. Quantum Information & Computation 4(2): 146-151 (2004) |
| i1 | | Yaoyun Shi: Quantum and Classical Tradeoffs. Electronic Colloquium on Computational Complexity (ECCC)(023) (2004) |
| 2003 | ||
| j5 | | Yaoyun Shi: Both Toffoli and controlled-NOT need little help to do universal quantum computing. Quantum Information & Computation 3(1): 84-92 (2003) |
| 2002 | ||
| j4 | | Peter Høyer, Jan Neerbek, Yaoyun Shi: Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. Algorithmica 34(4): 429-448 (2002) |
| j3 | | Yaoyun Shi: Entropy lower bounds for quantum decision tree complexity. Inf. Process. Lett. 81(1): 23-27 (2002) |
| c4 | | Yaoyun Shi: Quantum Lower Bounds for the Collision and the Element Distinctness Problems. FOCS 2002: 513-519 |
| 2001 | ||
| j2 | | Amit Chakrabarti, Subhash Khot, Yaoyun Shi: Evasiveness of Subgraph Containment and Related Properties. SIAM J. Comput. 31(3): 866-875 (2001) |
| c3 | | Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, Andrew Chi-Chih Yao: Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity. FOCS 2001: 270-278 |
| c2 | | Peter Høyer, Jan Neerbek, Yaoyun Shi: Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. ICALP 2001: 346-357 |
| c1 | | Amit Chakrabarti, Subhash Khot, Yaoyun Shi: Evasiveness of Subgraph Containment and Related Properties. STACS 2001: 110-120 |
| 2000 | ||
| j1 | | Yaoyun Shi: Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables. Inf. Process. Lett. 75(1-2): 79-83 (2000) |
Colors in the list of coauthors
Last update Sat May 25 10:18:26 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page