Andrew C. Yao
Affiliations: | Princeton University, Princeton, NJ |
Area:
Computer ScienceGoogle:
"Andrew Yao"Children
Sign in to add trainee| Weiran Huang | grad student | Tsinghua University | |
| Shengyu Zhang | grad student | 2006 | Princeton |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Xiao M, Cai L, Yao AC. (2009) Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem Algorithmica. 59: 510-520 |
| Chung F, Graham R, Mao J, et al. (2007) Oblivious and Adaptive Strategies for the Majority and Plurality Problems Algorithmica. 48: 147-157 |
| Li M, Yao AC, Yao FF. (2006) Discrete and continuous min-energy schedules for variable voltage processors. Proceedings of the National Academy of Sciences of the United States of America. 103: 3983-7 |
| Xiaoming S, Yao AC. (2006) On the quantum query complexity of local search in two and three dimensions Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 429-438 |
| Razborov A, Wigderson A, Yao A. (2002) Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus Combinatorica. 22: 555-574 |
| Grigoriev D, Karpinski M, Yao AC. (1998) An exponential lower bound on the size of algebraic decision trees for max Computational Complexity. 7: 193-203 |
| Yao AC, Yao FF. (1997) Dictionary Look-Up with One Error Journal of Algorithms. 25: 194-202 |
| Grigoriev D, Singer M, Yao A. (1995) On Computing Algebraic Functions Using Logarithms and Exponentials Siam Journal On Computing. 24: 242-246 |
| Yao AC. (1995) Algebraic decision trees and Euler characteristics Theoretical Computer Science. 141: 133-150 |
| Håstad J, Razborov A, Yao A. (1995) On the shrinkage exponent for read-once formulae Theoretical Computer Science. 141: 269-282 |