I agree that this site is using cookies. You can find further informations here.
X
Yao, Andrew
92  results:
Bookchapter (Online) X
Search for persons X
?
1

Read-once branching programs, rectangular proofs of the pig..:

, In: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing,
Razborov, Alexander ; Wigderson, Avi ; Yao, Andrew - p. 739-748 , 1997
Link: https://dl.acm.org/doi/1..
 
?
2

On Revenue Monotonicity in Combinatorial Auctions:

, In: Algorithmic Game Theory; Lecture Notes in Computer Science,
Yao, Andrew Chi-chih - p. 1-11 , 2018
Link: https://doi.org/10.1007/..
 
?
3

Dominant-Strategy versus Bayesian Multi-item Auctions : ..:

, In: Proceedings of the 2017 ACM Conference on Economics and Computation,
Yao, Andrew Chi-Chih - p. 3-20 , 2017
Link: https://dl.acm.org/doi/1..
 
?
4

An n-to-1 bidder reduction for multi-item auctions and its ..:

, In: Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms,
Yao, Andrew Chi-Chih - p. 92-109 , 2015
Link: https://dl.acm.org/doi/1..
 
?
5

Interdisciplinarity: A View from Theory of Computation:

, In: Federated Computing Research Conference,
Yao, Andrew Chi-Chih - p. 3 ff. , 2015
Link: https://dl.acm.org/doi/1..
 
?
6

OAKE : a new family of implicitly authenticated diffie-h..:

, In: Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security,
Yao, Andrew Chi-Chih ; Zhao, Yunlei - p. 1113-1128 , 2013
Link: https://dl.acm.org/doi/1..
 
?
7

The Turing Computational Model:

, In: ACM Turing Centenary Celebration,
Hartmanis, Juris ; Cook, Stephen ; Kahan, William.. - p. 1 ff. , 2012
Link: https://dl.acm.org/doi/1..
 
?
8

Graph entropy and quantum sorting problems:

, In: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing,
Yao, Andrew Chi-Chih - p. 112-117 , 2004
Link: https://dl.acm.org/doi/1..
 
?
9

On the power of quantum fingerprinting:

, In: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing,
Yao, Andrew Chi-Chih - p. 77-81 , 2003
Link: https://dl.acm.org/doi/1..
 
?
10

Some perspectives on computational complexity:

, In: Proceedings of the thirty-third annual ACM symposium on Theory of computing,
Yao, Andrew Chi-Chih - p. 600 ff. , 2001
Link: https://dl.acm.org/doi/1..
 
?
11

Quantum bit escrow:

, In: Proceedings of the thirty-second annual ACM symposium on Theory of computing,
Aharonov, Dorit ; Ta-Shma, Amnon ; Vazirani, Umesh V.. - p. 705-714 , 2000
Link: https://dl.acm.org/doi/1..
 
?
12

Security of quantum protocols against coherent measurements:

, In: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing,
Yao, Andrew Chi-Chih - p. 67-75 , 1995
Link: https://dl.acm.org/doi/1..
 
?
13

Decision tree complexity and Betti numbers:

, In: Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing,
Yao, Andrew Chi-Chih - p. 615-624 , 1994
Link: https://dl.acm.org/doi/1..
 
?
14

Lower bounds by probabilistic arguments:

, In: 24th Annual Symposium on Foundations of Computer Science (sfcs 1983),
Yao, Andrew C. - p. None , 1983
Link: https://doi.org/10.1109/..
 
?
15

Space-time tradeoff for answering range queries (Extended A..:

, In: Proceedings of the fourteenth annual ACM symposium on Theory of computing,
Yao, Andrew C. - p. 128-136 , 1982
Link: https://dl.acm.org/doi/1..
 
1-15