The SCEAS System
| |||||||

## Search the dblp DataBase
Yaoyun Shi:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, Andrew Chi-Chih Yao
**Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity.**[Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:270-278 [Conf] - Yaoyun Shi
**Quantum Lower Bounds for the Collision and the Element Distinctness Problems.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:513-519 [Conf] - Peter Høyer, Jan Neerbek, Yaoyun Shi
**Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness.**[Citation Graph (0, 0)][DBLP] ICALP, 2001, pp:346-357 [Conf] - Amit Chakrabarti, Subhash Khot, Yaoyun Shi
**Evasiveness of Subgraph Containment and Related Properties.**[Citation Graph (0, 0)][DBLP] STACS, 2001, pp:110-120 [Conf] - Yaoyun Shi
**Tensor norms and the classical communication complexity of nonlocal quantum measurement.**[Citation Graph (0, 0)][DBLP] STOC, 2005, pp:460-467 [Conf] - Peter Høyer, Jan Neerbek, Yaoyun Shi
**Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2002, v:34, n:4, pp:429-448 [Journal] - Yaoyun Shi
**Quantum and Classical Tradeoffs**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:023, pp:- [Journal] - Yaoyun Shi
**Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:75, n:1-2, pp:79-83 [Journal] - Yaoyun Shi
**Entropy lower bounds for quantum decision tree complexity.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:81, n:1, pp:23-27 [Journal] - Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu
**The communication complexity of the Hamming distance problem.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2006, v:99, n:4, pp:149-153 [Journal] - Scott Aaronson, Yaoyun Shi
**Quantum lower bounds for the collision and the element distinctness problems.**[Citation Graph (0, 0)][DBLP] J. ACM, 2004, v:51, n:4, pp:595-605 [Journal] - Amit Chakrabarti, Subhash Khot, Yaoyun Shi
**Evasiveness of Subgraph Containment and Related Properties.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2001, v:31, n:3, pp:866-875 [Journal] - Yaoyun Shi
**Quantum and classical tradeoffs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:344, n:2-3, pp:335-345 [Journal] - Ye Du, Yaoyun Shi, Xin Zhao
**Using Spam Farm to Boost PageRank.**[Citation Graph (0, 0)][DBLP] AIRWeb, 2007, pp:- [Conf] - Igor L. Markov, Yaoyun Shi
**Constant-degree graph expansions that preserve the treewidth**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] **Communication Complexities of XOR functions**[Citation Graph (, )][DBLP]**On the parity complexity measures of Boolean functions**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |