Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

* | 2008 | |
---|---|---|

19 | EE | Yaoyun Shi: Quantum Algorithm for the Parity Problem. Encyclopedia of Algorithms 2008 |

18 | EE | Yaoyun Shi, Zhiqiang Zhang: Communication Complexities of XOR functions CoRR abs/0808.1762: (2008) |

17 | EE | Yaoyun Shi, Yufan Zhu: Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement. SIAM J. Comput. 38(3): 753-766 (2008) |

16 | EE | Igor L. Markov, Yaoyun Shi: Simulating Quantum Computation by Contracting Tensor Networks. SIAM J. Comput. 38(3): 963-981 (2008) |

2007 | ||

15 | EE | Ye Du, Yaoyun Shi, Xin Zhao: Using Spam Farm to Boost PageRank. AIRWeb 2007 |

14 | EE | Igor L. Markov, Yaoyun Shi: Constant-degree graph expansions that preserve the treewidth CoRR abs/0707.3622: (2007) |

2006 | ||

13 | 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 | ||

12 | EE | Yaoyun Shi: Tensor norms and the classical communication complexity of nonlocal quantum measurement. STOC 2005: 460-467 |

11 | EE | Yaoyun Shi: Quantum and classical tradeoffs. Theor. Comput. Sci. 344(2-3): 335-345 (2005) |

2004 | ||

10 | EE | Yaoyun Shi: Quantum and Classical Tradeoffs Electronic Colloquium on Computational Complexity (ECCC)(023): (2004) |

9 | EE | Scott Aaronson, Yaoyun Shi: Quantum lower bounds for the collision and the element distinctness problems. J. ACM 51(4): 595-605 (2004) |

2002 | ||

8 | EE | Yaoyun Shi: Quantum Lower Bounds for the Collision and the Element Distinctness Problems. FOCS 2002: 513-519 |

7 | EE | Peter Høyer, Jan Neerbek, Yaoyun Shi: Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. Algorithmica 34(4): 429-448 (2002) |

6 | EE | Yaoyun Shi: Entropy lower bounds for quantum decision tree complexity. Inf. Process. Lett. 81(1): 23-27 (2002) |

2001 | ||

5 | 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 | |

4 | EE | Peter Høyer, Jan Neerbek, Yaoyun Shi: Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. ICALP 2001: 346-357 |

3 | EE | Amit Chakrabarti, Subhash Khot, Yaoyun Shi: Evasiveness of Subgraph Containment and Related Properties. STACS 2001: 110-120 |

2 | EE | Amit Chakrabarti, Subhash Khot, Yaoyun Shi: Evasiveness of Subgraph Containment and Related Properties. SIAM J. Comput. 31(3): 866-875 (2001) |

2000 | ||

1 | EE | 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) |

1 | Scott Aaronson | [9] |

2 | Amit Chakrabarti | [2] [3] [5] |

3 | Ye Du | [15] |

4 | Peter Høyer | [4] [7] |

5 | Wei Huang | [13] |

6 | Subhash Khot | [2] [3] |

7 | Igor L. Markov | [14] [16] |

8 | Jan Neerbek | [4] [7] |

9 | Anthony Wirth | [5] |

10 | Andrew Chi-Chih Yao | [5] |

11 | Shengyu Zhang | [13] |

12 | Zhiqiang Zhang | [18] |

13 | Xin Zhao | [15] |

14 | Yufan Zhu | [13] [17] |