Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew Chi-Chih Yao
Andrew C. Yao – 姚期智
Person information
- unicode name: 姚期智
- affiliation: Tsinghua University, Institute for Theoretical Computer Science
- award (2000): Turing Award
- award (1996): Knuth Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j73]Andrew Chi-Chih Yao, Xia Yin, Yinqun Liu, Guoliang Li:
Perspectives from the second Global Forum on Development of Computer Science. Sci. China Inf. Sci. 65(7): 1-2 (2022)- [i25]Jing Xu, Jiaye Teng, Andrew Chi-Chih Yao:
Relaxing the Feature Covariance Assumption: Time-Variant Bounds for Benign Overfitting in Linear Regression. CoRR abs/2202.06054 (2022) - 2021
- [i24]Jing Xu, Sen Wang, Liwei Wang, Andrew Chi-Chih Yao:
FedCM: Federated Learning with Client-level Momentum. CoRR abs/2106.10874 (2021) - 2020
- [c79]Andrew Chi-Chih Yao:
An Incentive Analysis of Some Bitcoin Fee Designs (Invited Talk). ICALP 2020: 1:1-1:12 - [c78]Chenxing Li, Peilun Li, Dong Zhou, Zhe Yang, Ming Wu, Guang Yang, Wei Xu, Fan Long, Andrew Chi-Chih Yao:
A Decentralized Blockchain with High Throughput and Fast Confirmation. USENIX Annual Technical Conference 2020: 515-528 - [i23]Chenxing Li, Yang Yu, Andrew Chi-Chih Yao, Da Zhang, Xiliang Zhang:
An authenticated and secure accounting system for international emissions trading. CoRR abs/2011.13954 (2020)
2010 – 2019
- 2018
- [c77]Andrew Chi-Chih Yao:
On Revenue Monotonicity in Combinatorial Auctions. SAGT 2018: 1-11 - [i22]Chenxing Li, Peilun Li, Wei Xu, Fan Long, Andrew Chi-Chih Yao:
Scaling Nakamoto Consensus to Thousands of Transactions per Second. CoRR abs/1805.03870 (2018) - [i21]Andrew Chi-Chih Yao:
An Incentive Analysis of some Bitcoin Fee Designs. CoRR abs/1811.02351 (2018) - 2017
- [c76]Andrew Chi-Chih Yao:
Dominant-Strategy versus Bayesian Multi-item Auctions: Maximum Revenue Determination and Comparison. EC 2017: 3-20 - [i20]Andrew Chi-Chih Yao:
On Revenue Monotonicity in Combinatorial Auctions. CoRR abs/1709.03223 (2017) - 2016
- [j72]Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao:
Concurrent Knowledge Extraction in Public-Key Models. J. Cryptol. 29(1): 156-219 (2016) - [i19]Andrew Chi-Chih Yao:
On Solutions for the Maximum Revenue Multi-item Auction under Dominant-Strategy and Bayesian Implementations. CoRR abs/1607.03685 (2016) - 2015
- [c75]Andrew Chi-Chih Yao:
Interdisciplinarity: A View from Theory of Computation. FCRC 2015: 3 - [c74]Andrew Chi-Chih Yao:
An n-to-1 Bidder Reduction for Multi-item Auctions and its Applications. SODA 2015: 92-109 - 2014
- [j71]Andrew Chi-Chih Yao, Yunlei Zhao:
Privacy-Preserving Authenticated Key-Exchange Over Internet. IEEE Trans. Inf. Forensics Secur. 9(1): 125-140 (2014) - [i18]Andrew Chi-Chih Yao:
An n-to-1 Bidder Reduction for Multi-item Auctions and its Applications. CoRR abs/1406.3278 (2014) - 2013
- [j70]Xinye Li, Andrew Chi-Chih Yao:
On revenue maximization for selling multiple independently distributed items. Proc. Natl. Acad. Sci. USA 110(28): 11232-11237 (2013) - [j69]Andrew Chi-Chih Yao, Yunlei Zhao:
Online/Offline Signatures for Low-Power Devices. IEEE Trans. Inf. Forensics Secur. 8(2): 283-294 (2013) - [c73]Andrew Chi-Chih Yao, Yunlei Zhao:
OAKE: a new family of implicitly authenticated diffie-hellman protocols. CCS 2013: 1113-1128 - 2012
- [j68]Yvo Desmedt, Josef Pieprzyk
, Ron Steinfeld, Xiaoming Sun, Christophe Tartary, Huaxiong Wang, Andrew Chi-Chih Yao:
Graph Coloring Applied to Secure Computation in Non-Abelian Groups. J. Cryptol. 25(4): 557-600 (2012) - [c72]Juris Hartmanis, Stephen Cook, William Kahan, Richard Edwin Stearns, Andrew C. Yao:
The Turing Computational Model. ACM-TURING 2012: 8:1 - [c71]Andrew Chi-Chih Yao:
Quantum Computing: A Great Science in the Making. TAMC 2012: 28 - [c70]Andrew C. Yao, Yunlei Zhao:
Computationally-Fair Group and Identity-Based Key-Exchange. TAMC 2012: 237-247 - [i17]Andrew C. Yao, Yunlei Zhao:
Digital Signatures from Challenge-Divided Sigma-Protocols. IACR Cryptol. ePrint Arch. 2012: 1 (2012) - [i16]Andrew C. Yao, Yunlei Zhao:
Computationally-Fair Group and Identity-Based Key-Exchange. IACR Cryptol. ePrint Arch. 2012: 287 (2012) - 2011
- [j67]Mingyu Xiao, Leizhen Cai, Andrew Chi-Chih Yao:
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem. Algorithmica 59(4): 510-520 (2011) - [i15]Andrew C. Yao, Yunlei Zhao:
A New Family of Practical Non-Malleable Diffie-Hellman Protocols. CoRR abs/1105.1071 (2011) - [i14]Andrew C. Yao, Yunlei Zhao:
A New Family of Practical Non-Malleable Protocols. IACR Cryptol. ePrint Arch. 2011: 35 (2011) - 2010
- [c69]Andrew Chi-Chih Yao, Yunlei Zhao:
Deniable Internet Key Exchange. ACNS 2010: 329-348 - [c68]Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao:
Concurrent Knowledge Extraction in the Public-Key Model. ICALP (1) 2010: 702-714 - [e1]Andrew Chi-Chih Yao:
Innovations in Computer Science - ICS 2010, Tsinghua University, Beijing, China, January 5-7, 2010. Proceedings. Tsinghua University Press 2010, ISBN 978-7-302-21752-7 [contents] - [i13]Robert H. Deng, Yingjiu Li, Andrew C. Yao, Moti Yung, Yunlei Zhao:
A New Framework for RFID Privacy. IACR Cryptol. ePrint Arch. 2010: 59 (2010) - [i12]Andrew C. Yao, Moti Yung, Yunlei Zhao:
Concurrent Knowledge Extraction in the Public-Key Model. IACR Cryptol. ePrint Arch. 2010: 74 (2010) - [i11]Andrew C. Yao, Moti Yung, Yunlei Zhao:
Adaptive Concurrent Non-Malleability with Bare Public-Keys. IACR Cryptol. ePrint Arch. 2010: 107 (2010)
2000 – 2009
- 2009
- [j66]Xiaoming Sun, Andrew Chi-Chih Yao:
On the Quantum Query Complexity of Local Search in Two and Three Dimensions. Algorithmica 55(3): 576-600 (2009) - [j65]Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao:
A note on the feasibility of generalised universal composability. Math. Struct. Comput. Sci. 19(1): 193-205 (2009) - [j64]Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao:
A note on universal composable zero-knowledge in the common reference string model. Theor. Comput. Sci. 410(11): 1099-1108 (2009) - [c67]Andrew Chi-Chih Yao:
Communication Complexity and Its Applications. FAW 2009: 2 - [i10]Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao:
Concurrent Knowledge-Extraction in the Public-Key Model. CoRR abs/0908.2476 (2009) - [i9]Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao:
Adaptive Concurrent Non-Malleability with Bare Public-Keys. CoRR abs/0910.3282 (2009) - 2008
- [c66]Xiaoming Sun, Andrew Chi-Chih Yao, Christophe Tartary:
Graph Design for Secure Multiparty Computation over Non-Abelian Groups. ASIACRYPT 2008: 37-53 - [c65]Andrew Chi-Chih Yao:
Some Perspectives on Complexity-Based Cryptography. ASIACRYPT 2008: 54 - [c64]Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, Andrew Chi-Chih Yao:
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems. CCC 2008: 187-198 - [i8]Mingyu Xiao, Leizhen Cai, Andrew C. Yao:
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem. CoRR abs/0811.3723 (2008) - 2007
- [j63]Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao:
Oblivious and Adaptive Strategies for the Majority and Plurality Problems. Algorithmica 48(2): 147-157 (2007) - [c63]Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao:
A Note on Universal Composable Zero Knowledge in Common Reference String Model. TAMC 2007: 462-473 - [c62]Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao:
A Note on the Feasibility of Generalized Universal Composability. TAMC 2007: 474-485 - [i7]Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao, Bin B. Zhu:
Deniable Internet Key-Exchange. IACR Cryptol. ePrint Arch. 2007: 191 (2007) - 2006
- [j62]Minming Li, Andrew C. Yao, Frances F. Yao:
Discrete and continuous min-energy schedules for variable voltage processors. Proc. Natl. Acad. Sci. USA 103(11): 3983-3987 (2006) - [c61]Xiaoming Sun, Andrew Chi-Chih Yao:
On the Quantum Query Complexity of Local Search in Two and Three Dimensions. FOCS 2006: 429-438 - [c60]Andrew C. Yao:
Some perspectives on computational and communication complexity. ISIT 2006: x - [c59]Andrew Chi-Chih Yao:
Recent Progress in Quantum Computational Complexity. TAMC 2006: 89-89 - 2005
- [c58]Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao:
Oblivious and Adaptive Strategies for the Majority and Plurality Problems. COCOON 2005: 329-338 - [c57]Andrew Chi-Chih Yao:
On the Communication Complexity of Co-linearity Problems. MFCS 2005: 57 - 2004
- [j61]Dominic Mayers, Andrew Chi-Chih Yao:
Self testing quantum apparatus. Quantum Inf. Comput. 4(4): 273-286 (2004) - [c56]Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang:
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go? CCC 2004: 286-293 - [c55]Ning Chen, Xiaotie Deng, Xiaoming Sun, Andrew Chi-Chih Yao:
Fisher Equilibrium Price with a Class of Concave Utility Functions. ESA 2004: 169-179 - [c54]Ning Chen, Xiaotie Deng, Xiaoming Sun, Andrew Chi-Chih Yao:
Dynamic Price Sequence and Incentive Compatibility (Extended Abstract). ICALP 2004: 320-331 - [c53]Andrew Chi-Chih Yao:
Graph entropy and quantum sorting problems. STOC 2004: 112-117 - 2003
- [j60]Andrew Chi-Chih Yao:
Classical physics and the Church-Turing Thesis. J. ACM 50(1): 100-105 (2003) - [c52]Andrew Chi-Chih Yao:
Interactive Proofs for Quantum Computation. ISAAC 2003: 1 - [c51]Andrew Chi-Chih Yao:
On the power of quantum fingerprinting. STOC 2003: 77-81 - [i6]Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao:
Finding Favorites. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j59]Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao:
Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus. Comb. 22(4): 555-574 (2002) - [i5]Andrew Chi-Chih Yao:
Classical Physics and the Church-Turing Thesis. Electron. Colloquium Comput. Complex. TR02 (2002) - [i4]Andrew Chi-Chih Yao:
On the Power of Quantum Fingerprinting. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [c50]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 - [c49]Andrew Chi-Chih Yao:
Some perspective on computational complexity (abstract). STOC 2001: 600 - 2000
- [c48]Dorit Aharonov, Amnon Ta-Shma, Umesh V. Vazirani, Andrew Chi-Chih Yao:
Quantum bit escrow. STOC 2000: 705-714
1990 – 1999
- 1999
- [j58]Tomoyuki Yamakami, Andrew Chi-Chih Yao:
NQPC = co-C=P. Inf. Process. Lett. 71(2): 63-69 (1999) - 1998
- [j57]Dima Grigoriev, Marek Karpinski, Andrew Chi-Chih Yao:
An exponential lower bound on the size of algebraic decision trees for Max. Comput. Complex. 7(3): 193-203 (1998) - [j56]Paul W. Finn, Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Christian R. Shelton, Suresh Venkatasubramanian, Andrew Chi-Chih Yao:
RAPID: Randomized pharmacophore identification for drug design. Comput. Geom. 10(4): 263-272 (1998) - [c47]Dominic Mayers, Andrew Chi-Chih Yao:
Quantum Cryptography with Imperfect Apparatus. FOCS 1998: 503-509 - [i3]Tomoyuki Yamakami, Andrew Chi-Chih Yao:
NQPC = co-C=P. CoRR quant-ph/9812032 (1998) - [i2]Tomoyuki Yamakami, Andrew Chi-Chih Yao:
NQP = co-C=P. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [j55]Andrew Chi-Chih Yao, Frances F. Yao:
Dictionary Look-Up with One Error. J. Algorithms 25(1): 194-202 (1997) - [j54]Andrew Chi-Chih Yao:
Decision Tree Complexity and Betti Numbers. J. Comput. Syst. Sci. 55(1): 36-43 (1997) - [c46]Paul W. Finn, Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Christian R. Shelton, Suresh Venkatasubramanian, Andrew Chi-Chih Yao:
RAPID: Randomized Pharmacophore Identification for Drug Design. SCG 1997: 324-333 - [c45]Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao:
Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus. STOC 1997: 739-748 - 1996
- [c44]Andrew Chi-Chih Yao:
Hypergraphs and Decision Trees (Abstract). WG 1996: 1 - 1995
- [j53]Andrew Chi-Chih Yao:
Minimean Optimal Key Arrangements in Hash Tables. Algorithmica 14(5): 409-428 (1995) - [j52]Dima Grigoriev, Michael F. Singer, Andrew Chi-Chih Yao:
On Computing Algebraic Functions Using Logarithms and Exponentials. SIAM J. Comput. 24(2): 242-246 (1995) - [j51]Andrew Chi-Chih Yao:
Algebraic Decision Trees and Euler Characteristics. Theor. Comput. Sci. 141(1&2): 133-150 (1995) - [j50]Johan Håstad, Alexander A. Razborov, Andrew Chi-Chih Yao:
On the Shrinkage Exponent for Read-Once Formulae. Theor. Comput. Sci. 141(1&2): 269-282 (1995) - [c43]Andrew Chi-Chih Yao, F. Frances Yao:
Dictionary Loop-Up with Small Errors. CPM 1995: 387-394 - [c42]Andrew Chi-Chih Yao:
Security of quantum protocols against coherent measurements. STOC 1995: 67-75 - [i1]Dima Grigoriev, Marek Karpinski, Andrew Chi-Chih Yao:
An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [j49]Hing-Fung Ting, Andrew Chi-Chih Yao:
A Randomized Algorithm for Finding Maximum with O((log n)²) Polynomial Tests. Inf. Process. Lett. 49(1): 39-43 (1994) - [j48]Andrew Chi-Chih Yao:
Near-Optimal Time-Space Tradeoff for Element Distinctness. SIAM J. Comput. 23(5): 966-975 (1994) - [c41]Andrew Chi-Chih Yao:
A Lower Bound for the Monotone Depth of Connectivity. FOCS 1994: 302-308 - [c40]Andrew Chi-Chih Yao:
Decision tree complexity and Betti numbers. STOC 1994: 615-624 - 1993
- [j47]Ravi Kannan, H. Venkateswaran, V. Vinay, Andrew Chi-Chih Yao:
A Circuit-Based Proof of Toda's Theorem. Inf. Comput. 104(2): 271-276 (1993) - [c39]Jin-yi Cai, Richard J. Lipton, Robert Sedgewick, Andrew Chi-Chih Yao:
Towards Uncheatable benchmarks. SCT 1993: 2-11 - [c38]Andrew Chi-Chih Yao:
Quantum Circuit Complexity. FOCS 1993: 352-361 - [c37]Andrew Chi-Chih Yao:
Groups and Algebraic Complexity (Abstract). WADS 1993: 35 - 1992
- [c36]Andrew Chi-Chih Yao:
Algebraic Decision Trees and Euler Characteristics. FOCS 1992: 268-277 - [c35]Anders Björner, László Lovász, Andrew Chi-Chih Yao:
Linear Decision Trees: Volume Estimates and Topological Bounds. STOC 1992: 170-177 - 1991
- [j46]Andrew Chi-Chih Yao:
Lower Bounds to Randomized Algorithms for Graph Properties. J. Comput. Syst. Sci. 42(3): 267-287 (1991) - [j45]Andrew Chi-Chih Yao:
Lower Bounds for Algebraic Computation Trees with Integer Inputs. SIAM J. Comput. 20(4): 655-668 (1991) - [c34]Andrew Chi-Chih Yao:
Recent Progress in Circuit and Communication Complexity (Abstract). FCT 1991: 104 - [c33]Sampath Kannan, Andrew Chi-Chih Yao:
Program Checkers for Probability Generation. ICALP 1991: 163-173 - [c32]Andrew Chi-Chih Yao:
Weighted Random Assignments with Application to Hashing. ISA 1991: 42 - 1990
- [j44]Claire Kenyon, Andrew Chi-Chih Yao:
On Evaluating Boolean Functions with Unreliable Tests. Int. J. Found. Comput. Sci. 1(1): 1-10 (1990) - [c31]Andrew Chi-Chih Yao:
On ACC and Threshold Circuits. FOCS 1990: 619-627 - [c30]Andrew Chi-Chih Yao:
Coherent Functions and Program Checkers (Extended Abstract). STOC 1990: 84-94
1980 – 1989
- 1989
- [j43]Andrew Chi-Chih Yao:
On Selecting the k Largest with Median Tests. Algorithmica 4(2): 293-300 (1989) - [j42]Andrew Chi-Chih Yao:
On the Complexity of Partial Order Productions. SIAM J. Comput. 18(4): 679-689 (1989) - [c29]Andrew Chi-Chih Yao:
Lower Bounds for Algebraic Computation Trees with Integer Inputs. FOCS 1989: 308-313 - [c28]Andrew Chi-Chih Yao:
Circuits and Local Computation. STOC 1989: 186-196 - [c27]Ronald L. Graham, Andrew Chi-Chih Yao:
On the Improbability of Reaching Byzantine Agreements (Preliminary Version). STOC 1989: 467-478 - 1988
- [j41]Andrew Chi-Chih Yao:
Monotone Bipartite Graph Properties are Evasive. SIAM J. Comput. 17(3): 517-520 (1988) - [c26]Andrew Chi-Chih Yao:
Near-Optimal Time-Space Tradeoff for Element Distinctness. FOCS 1988: 91-97 - 1987
- [c25]Andrew Chi-Chih Yao:
Lower Bounds to Randomized Algorithms for Graph Properties (Extended Abstract). FOCS 1987: 393-400 - 1986
- [c24]Andrew Chi-Chih Yao:
How to Generate and Exchange Secrets (Extended Abstract). FOCS 1986: 162-167 - 1985
- [j40]Andrew Chi-Chih Yao:
Uniform Hashing Is Optimal. J. ACM 32(3): 687-693 (1985) - [j39]Andrew Chi-Chih Yao:
On Optimal Arrangements of Keys with Double Hashing. J. Algorithms 6(2): 253-264 (1985) - [j38]Andrew Chi-Chih Yao, F. Frances Yao:
On Fault-Tolerant Networks for Sorting. SIAM J. Comput. 14(1): 120-128 (1985) - [j37]Andrew Chi-Chih Yao:
On the Expected Performance of Path Compression Algorithms. SIAM J. Comput. 14(1): 129-133 (1985) - [j36]Andrew Chi-Chih Yao:
On the Complexity of Maintaining Partial Sums. SIAM J. Comput. 14(2): 277-288 (1985) - [c23]Andrew Chi-Chih Yao:
Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version). FOCS 1985: 1-10 - [c22]Andrew Chi-Chih Yao, F. Frances Yao:
A General Approach to d-Dimensional Geometric Queries (Extended Abstract). STOC 1985: 163-168 - 1983
- [j35]Danny Dolev, Andrew Chi-Chih Yao:
On the security of public key protocols. IEEE Trans. Inf. Theory 29(2): 198-207 (1983) - [c21]Andrew Chi-Chih Yao:
Lower Bounds by Probabilistic Arguments (Extended Abstract). FOCS 1983: 420-428 - [c20]Shafi Goldwasser, Silvio Micali, Andrew Chi-Chih Yao:
Strong Signature Schemes. STOC 1983: 431-439 - 1982
- [j34]Andrew Chi-Chih Yao:
On Parallel Computation for the Knapsack Problem. J. ACM 29(3): 898-903 (1982) - [j33]J. Michael Steele, Andrew Chi-Chih Yao:
Lower Bounds for Algebraic Decision Trees. J. Algorithms 3(1): 1-8 (1982) - [j32]Robert Sedgewick, Thomas G. Szymanski, Andrew Chi-Chih Yao:
The Complexity of Finding Cycles in Periodic Functions. SIAM J. Comput. 11(2): 376-390 (1982) - [j31]Andrew Chi-Chih Yao, F. Frances Yao:
On the Average-Case Complexity of Selecting the kth Best. SIAM J. Comput. 11(3): 428-447 (1982) - [j30]Andrew Chi-Chih Yao:
On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems. SIAM J. Comput. 11(4): 721-736 (1982) - [j29]