姚期智 - 清华大学 - 交叉信息研究院

个人简介

教育背景 1967年，台湾大学，物理学学士学位 1972年，哈佛大学，物理学博士学位 1975年，伊利诺伊大学，计算机科学博士学位工作经历麻省理工学院数学系，助理教授 (1975年9月至1976年8月) 斯坦福大学计算机系，助理教授 (1976年9月至1981年8月) 加州大学伯克利分校计算机，教授 (1981年9月至1982年9月) 斯坦福大学计算机系，教授 (1982年10月至1986年6月) 普林斯顿大学计算机系，William and Edna Macaleer讲座教授 (1986年7月至2004年6月) 清华大学高等研究中心，教授 (2004年9月至今) 香港中文大学，博文讲座教授 (2005年1月至今) 清华大学交叉信息研究院，院长 (2011年1月至今) 获奖情况 1987年波里亚奖（George Polya Prize） 1991年古根海姆基金会研究学者奖（Guggenheim Fellowship） 1995年美国计算机协会会士（Fellow, Association for Computing Machinery） 1996年高德纳奖（Donald E. Knuth Prize） 1998年美国国家科学院院士（Member, US National Academy of Sciences） 2000年美国人文科学院院士（Fellow, American Academy of Arts and Sciences） 2000年图灵奖（A.M. Turing Award） 2000年台湾中央研究院院士（Member, Academia Sinica） 2003年潘文渊研究考察奖（Pan Wen-Yuan Research Award） 2003年香港城市大学理学荣誉博士（Doctor of Science, Honoris Causa, City University of Hong Kong） 2003年美国科学发展促进会会士（Fellow, American Association for the Advancement of Science） 2004年香港科技大学工学荣誉博士（Doctor of Engineering, Honoris Causa, Hong Kong University of Science and Technology） 2004年中国科学院外籍院士（Foreign Member, Chinese Academy of Sciences） 2004年伊利诺伊大学工程学院特殊贡献校友奖（Alumni Award for Distinguished Service, College of Engineering, University of Illinois） 2006年香港中文大学理学荣誉博士（Doctor of Science, Honoris Causa, the Chinese University of Hong Kong） 2009年滑铁卢大学理学荣誉博士 (Doctor of Mathematics, Honoris Causa, University of Waterloo) 2010年国际密码协会会士 (International Association for Cryptologic Research Fellow (IACR)) 2012年澳门大学理学荣誉博士(Doctor of Science, Honoris Causa, University of Macau) 2014年香港理工大学荣誉博士(Doctor of Science, Honoris Causa, the Hong Kong Polytechnic University) 2016年中国科学院院士（Member, Chinese Academy of Sciences） 2019年澳门科技大学荣誉博士(Doctor of Science, Honoris Causa, Macau University of Science and Technology) 2021年京都奖( Kyoto Prize)

近期论文

查看导师新发文章（温馨提示：请注意重名现象，建议点开原文通过作者单位确认）

"Divergences of Massive Yang-Mills Theories: Higher Groups", S. L. Glashow, J. Iliopoulos, and Andrew Yao, Physical Review, D4 (1971), 1918- 1919. "Standing Pion Waves in Superdense Matter", R. F. Sawyer and A. C. Yao, Physical Review, D7 (1973), 1579-1586. "An O (|E| log log |V|) Algorithm for Finding Minimum Spanning Trees", Andrew Chi-Chih Yao, Information Processing Letters, 4 (1975), 21-23. "Analysis of the Subtractive Algorithms for Greatest Common Divisors", Andrew C. Yao and Donald E. Knuth, Proceedings of the National Academy of Sciences USA, 72 (1975), 4720-4722. "On Computing the Minima of Quadratic Forms", Andrew Chi-Chih Yao, Proceedings of Seventh ACM Symposium on Theory of Computing (STOC1975), Albuquerque, New Mexico, May 1975, 23-26. "The Complexity of Non-uniform Random Number Generation" D. Knuth and A. Yao, in Algorithms and Complexity: New Directions and Recent Results, edited by J. F. Traub, Academic Press, 1976, pp.357-428. "On the Evaluation of Powers", Andrew Chi-Chih Yao, SIAM J. on Computing, 5 (1976), 100-103.ccccc "Resource Constrained Scheduling as Generalized Bin Packing", M.R Garey, R.L Graham, D.S Johnson, and Andrew Chi-Chih Yao, J. of Combinatorial Theory, A21 (1976), 257-298. "Bounds on Merging Networks", Andrew Chi-Chih Yao and Foong Frances Yao, Journal of ACM, 23 (1976), 566-571. "Tiling with Incomparable Rectangles", Yao, Andrew C. C., E. M. Reingold, and W. Sanders, Journal of Recreational Mathematics, 8 (1976), 112-119. "A Combinatorial Optimization Problem Related to Data Set Allocation", Wong C. K. and Yao A. C.-C., Revue Francaise D'Automatique, Informatique, Recherche Operationnelle, Suppl. No. 5 (1976), 83-96. "On a Problem of Katona on Minimal Separation Systems", Andrew Chi-Chih Yao, Discrete Mathematics, 15 (1976), 193-199. "An Almost Optimal Algorithm for Unbounded Searching", Jon Louis Bentley and Andrew Chi-Chih Yao, Information Processing Letters, 5 (1976), 82-87. "On the Average Behavior of Set Merging Algorithms", Andrew Chi-Chih Yao, Proceedings of Eighth ACM Symposium on Theory of Computing (STOC1976), Hershey, Pennsylvania, May 1976, 192-195. "The Complexity of Searching an Ordered Random Table", Andrew C. Yao and F. Frances Yao, Proceedings of Seventeenth IEEE Symposium on Foundations of Computer Science (FOCS1976), Houston, Texas, October 1976, 222-227. "Probabilistic Computations: Toward a Unified Measure of Complexity", Andrew Chi-Chih Yao, Proceedings of Eighteenth IEEE Symposium on Foundations of Computer Science (FOCS1977), Providence, Rhode Island, October 1977, 222-227. "On the Loop Switching Addressing Problem", Andrew Chi-Chih Yao, SIAM J. on Computing, 7 (1978), 82-87. "On Random 2-3 Trees", Andrew Chi-Chih Yao, Acta Informatica, 9 (1978), 159-170. "K + 1 Heads are Better than K", Andrew C. Yao and Ronald L. Rivest, Journal of ACM, 25 (1978), 337-340. "Addition Chains with Multiplicative Cost", R. L. Graham, A. C.-C. Yao, and F. -F. Yao, Discrete Mathematics, 23 (1978), 115-119. "The Complexity of Pattern Matching for a Random String", Andrew Chi-Chih Yao, SIAM J. on Computing, 8 (1979), 368-387. "A Note on a Conjecture of Kam and Ullman Concerning Statistical Databases", Andrew C. Yao, Information Processing Letters, 9 (1979), 48-50. "Storing a Sparse Table", Robert Endre Tarjan, Andrew Chi-Chih Yao, Communications of ACM, 22 (1979), 606-611. " Some complexity questions related to distributive computing", Andrew Chi-Chih Yao, Proceedings of Eleventh ACM Symposium on Theory of Computing (STOC1979), Atlanta, Georgia, May 1979, 209-213. "External Hashing Schemes for Collections of Data Structures", R. J. Lipton, A. L. Rosenberg, and Andrew Chi-Chih Yao, Journal of ACM, 27 (1980), 81-95. "New Algorithms for Bin Packing", Andrew Chi-Chih Yao, Journal of ACM, 27 (1980), 207-227. "Information Bounds are Weak for the Shortest Distance Problem", R. L. Graham, Andrew Chi-Chih Yao, and F. F. Yao, Journal of ACM, 27, (1980), 428-444. "A Stochastic Model of Bin Packing", E. G. Coffman, Jr., Kimming So, Micha Hofri, K. So, and A. C. Yao, Information and Control, 44 (1980), 105-115. "An Analysis of Shellsort", Andrew Chi-Chih Yao, Journal of Algorithms, 1 (1980), 14-50. "On the Polyhedral Decision Problem", Andrew Chi-Chih Yao, and Ronald L. Rivest, SIAM J. on Computing, 9 (1980), 343-347. "Bounds on Selection Networks", Andrew Chi-Chih Yao, SIAM J. on Computing, 9 (1980), 566-582. "Some Monotonicity Properties of Partial Orders", R. L. Graham, A. C. Yao, and F. F. Yao, SIAM J. on Algebraic and Discrete Methods, 1 (1980), 251-258. "A Note on the Analysis of Extendible Hashing", Andrew C. Yao, Information Processing Letters, 11 (1980), 84-86. "Optimal Expected-Time Algorithm for Closest-point Problems", Jon Louis Bentley, Bruce W. Weide, and Andrew C. Yao, ACM Trans. on Math. Software, 6 (1980), 561-580. "Efficient Searching via Partial Ordering", A. Borodin, L. J. Guibas, N. A. Lynch, and A.C. Yao, Information Processing Letters, 12 (1981), 71-75. "An Analysis of a Memory Allocation Scheme for Implementing Stacks", Andrew C. Yao, SIAM J. on Computing, 10 (1981), 398-403. "Should Tables be Sorted?” Andrew Chi-Chih Yao, Journal of ACM, 28 (1981), 615-628. "A Lower Bound to Finding Convex Hulls", Andrew Chi-Chih Yao, Journal of ACM, 28 (1981), 780-787. "The Entropic Limitations on VLSI Computations", Andrew C. Yao, Proceedings of Thirteenth ACM Symposium on Theory of Computing (STOC1981), Milwaukee, Wisconsin, May 1981, 308-311. "Average-case Complexity of Selecting the k-th Best", Andrew C. Yao and F. Frances Yao, SIAM J. on Computing, 11 (1982), 428-447. "The Complexity of Finding Cycles in Periodic Functions", Robert Sedgewick, Thomas G. Szymanski, and Andrew C. Yao, SIAM J. on Computing, 11 (1982), 376-390. "On the Time-Space Tradeoff for Sorting with Linear Queries", Andrew Chi-Chih Yao, Theoretical Computer Science, 19 (1982), 203-218. "Lower Bounds to Algebraic Decision Trees", J. Michael Steele and Andrew C. Yao, Journal of Algorithms, 3 (1982), 1-8. "On Parallel Computation for the Knapsack Problem", Andrew Chi-Chih Yao, Journal of ACM, 29 (1982), 898-903. "On Constructing Minimum Spanning Trees in k-dimensional Spaces and Related Problems", Andrew Chi-Chih Yao, SIAM J. on Computing, 11 (1982), 721- 736. "Equal Justice for Unequal Shares of the Cake", M. Klawe and Andrew C. Yao, Congressus Numerantium, 36 (1982), 247-260.（in a book） "Rearrangeable Networks with Limited Depth", Nicholas Pippenger and Andrew C.-C. Yao, SIAM J. on Algebraic and Discrete Methods, 3 (1982), 411- 417. "Space-Time Tradeoff for Answering Range Queries", Andrew C. Yao, Proceedings of Fourteenth ACM Symposium on Theory of Computing (STOC 1982), San Francisco, California, May 1982, 128-136. "Theory and Applications of Trapdoor Functions", Andrew C. Yao, Proceedings of Twenty-third IEEE Symposium on Foundations of Computer Science (FOCS1982), Chicago, Illinois, November 1982, 80-91. "Protocols for Secure Computations", Andrew C. Yao, Proceedings of Twenty-third IEEE Symposium on Foundations of Computer Science (FOCS1982), Chicago, Illinois, November 1982, 160-164. "On the Security of Public Key Protocols", Danny Dolev and Andrew C. Yao, IEEE Trans. on Information Theory, 29 (1983), 198-208. "Strong Signature Schemes", Shafi Goldwasser, Silvio Micali, and Andy Yao, Proceedings of Fifteenth ACM Symposium on Theory of Computing (STOC1983), Boston, Massachusetts, April 1983, 431-439 "Lower Bounds by Probabilistic Arguments", Andrew C. Yao, Proceedings of Twenty-fourth IEEE Symposium on Foundations of Computer Science (FOCS1983), Tucson, Arizona, November 1983, 420-428. "Context-free Grammars and Random Number Generation", Andrew C. Yao, Proceedings of NATO Workshop on Combinatorial Algorithms on Words, Maratea, Italy, July 1984, edited by A. Apostolico and Z. Galil, Academic Press, 357-361. "On Fault-tolerant Networks for Sorting", Andrew C. Yao and F. Frances Yao, SIAM J. on Computing, 14 (1985), 120-128. "On the Expected Performance of Path Compression Algorithms", Andrew C. Yao, SIAM J. on Computing, 14 (1985), 129-133. "On Optimal Arrangements of Keys with Double Hashing", Andrew C. Yao, Journal of Algorithms, 6 (1985), 253-264. "Uniform Hashing is Optimal", Andrew C. Yao, Journal of the ACM, 32 (1985), 687-693. "On the Complexity of Maintaining Partial Sums", Andrew C. Yao, SIAM J. on Computing, 14 (1985), 253-264. "A General Approach to d-dimensional Geometric Queries", Andrew C. Yao and Frances F. Yao, Proceedings of Seventeenth ACM Symposium on Theory of Computing (STOC1985), Providence, Rhode Island, May 1985, 163-168. "Separating the Polynomial-time Hierarchy by Oracles", Andrew Chi-Chili Yao , Proceedings of Twenty-sixth IEEE Symposium on Foundations of Computer Science (FOCS1985), Eugene, Oregon, October 1985, 1-10. "How to Generate and Exchange Secrets", Andrew Chi-Chih Yao, Proceedings of Twenty-seventh IEEE Symposium on Foundations of Computer Science (FOCS1986), Toronto, Canada, October 1986, 162-167. "Monotone Bipartite Graph Properties are Evasive", Andrew Chi-Chih Yao, SIAM J. on Computing, 17 (1988), 517-520. "Computational Information Theory", Andrew Chi-Chih Yao, in Complexity in Information Theory, edited by Y. Abu-Mostafa, Springer-Verlag, 1988, 1-15. "Selecting the k Largest with Median Tests", Andrew Chi-Chih Yao, Algorithmica, 4 (1989), 293-300. "On the Complexity of Partial Order Productions", Andrew Chi-Chih Yao, SIAM J. on Computing, 18 (1989), 679-689. "On the Improbability of Reaching Byzantine Agreement", Ronald L. Graham and Andrew C. Yao, Proceedings of Twenty-First ACM Symposium on Theory of Computing (STOC1989), Seattle, Washington, May 1989, 467-478. "Circuits and Local Computations", Andrew Chi-Chih Yao, Proceedings of Twenty First ACM Symposium on Theory of Computing (STOC1989), Seattle, Washington, May 1989, 186-196. "Computing Boolean Functions with Unreliable Tests", Claire Kenyon, Andrew Chi-Chih Yao, International Journal of Foundations of Computer Science, 1 (1990), 1-10. "Coherent Functions and Program Checkers", Andrew Chi-Chih Yao, Proceedings of Twenty-second ACM Symposium on Theory of Computing (STOC1990), Baltimore, Maryland, May 1990, 84-94. "On ACC and Threshold Circuits", Andrew Chi-Chih Yao, Proceedings of Thirty-first IEEE Symposium on Foundations of Computer Science (FOCS1990), St. Louis, Missouri, October 1990, 619-627. "Lower Bounds to Randomized Algorithms for Graph Properties", Andrew Chi-Chih Yao, Journal of Computer and System Sciences, 42 (1991), 267-287. "Lower Bounds for Algebraic Computation Trees with Integer Inputs", Andrew Chi-Chih Yao, SIAM J. On Computing, 20 (1991), 655-668. "Program Checkers for Probability Generation", Sampath Kannan and Andrew Yao, Proceedings of Eighteenth International Colloquium on Automata, Languages and Programming, Madrid, Spain, July 1991, 163-173. "Linear Decision Trees: Volume Estimates and Topological Bounds", Anders Björner, László Lovász, and Andrew C.C. Yao, Proceedings of Twenty-fourth ACM Symposium on Theory of Computing (STOC1992), May 1992, 170-177. "A Circuit-Based Proof of Toda's Theorem", Ravi Kannan, H. Venkateswaran, V. Vinay, and Andrew C. Yao, Information and Computation, 104 (1993), 271-276. "Towards Uncheatable Benchmarks", Jin-yi Cai, Richard J. Lipton, Robert Sedgewick, and Andrew Chi-Chih Yao, Proceedings of Eighth IEEE Annual Structure in Complexity Conference, San Diego, California, May 1993, 2-11. "Quantum Circuit Complexity", Andrew Chi-Chih Yao, Proceedings of Thirty-fourth IEEE Symposium on Foundations of Computer Science (FOCS1993), Palo Alto, California, November 1993, 352-361. "A Randomized Algorithm for Maximum Finding with Parity Tests", Hing F. Ting and Andrew C. Yao, Information Processing Letters, 49 (1994), 39-43. "Near-Optimal Time-Space Tradeoff for Element Distinctness", Andrew Chi-Chih Yao, SIAM J. On Computing, 23 (1994), 966-975. "A Lower Bound for the Monotone Depth of Connectivity", Andrew Chi-Chih Yao, Proceedings of Thirty-fifth IEEE Symposium on Foundations of Computer Science (FOCS1994), Santa Fe, New Mexico, November 1994, 302-308. "On Computing Algebraic Functions Using Logarithms and Exponentials", Dima Grigoriev, Michael Singer, and Andrew Yao, SIAM J. on Computing, 24 (1995), 242-246. "Algebraic Decision Trees and Euler Characteristics", Andrew Chi-Chih Yao, Theoretical Computer Science, 141 (1995), 133-150. "On the Shrinkage Exponent for Read-Once Formulae", Johan Håstad, Alexander Razborov, and Andrew Yao, Theoretical Computer Science, 141 (1995), 269-282. "Minimean Optimal Key Arrangements in Hash Tables", Andrew Chi-Chih Yao, Algorithmica, 14 (1995), 409-428. "Security of Quantum Protocols Against Coherent Measurements", Andrew Chi-Chih Yao, Proceedings of Twenty-seventh ACM Symposium on Theory of Computing (STOC1995), Las Vegas, Nevada, May 1995, 67-75. "Decision Tree Complexity and Betti Numbers", Andrew Chi-Chih Yao, Journal of Computer and Systems Sciences, 55 (1997), 36-43. "Dictionary Look-Up with One Error", Andrew C. Yao and Frances F. Yao, Journal of Algorithms, 25 (1997), 194-202. "Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus", Alexander Razborov, Avi Wigderson, and Andrew Yao, Proceedings of Twenty-ninth ACM Symposium on Theory of Computing (STOC1997), May 1997, 739-784. "RAPID: Randomized Pharmacophore Identification for Drug Design", P.W. Finn, L.E. Kavraki, J.-C. Latombe, R. Motwani, C. Shelton, S. Venkatasubramanian, and A. Yao, Proceedings of 1997 ACM Symposium on Applied Computational Geometry, Nice, France, 1997, 324-333. "A Lower Bound on the Size of Algebraic Decision Trees for the MAX Problem", Dima Grigoriev, Marek Karpinski, and Andrew Yao, Computational Complexity, 7 (1998), 193-203. "Quantum Cryptography with Imperfect Apparatus", Dominic Mayers, and Andrew Yao, Proceedings of Thirty-ninth IEEE Symposium on Foundations of Computer Science (FOCS1998), October 1998, 503-509. "NQP C = co - C = P", Tomoyuki Yamakami and Andrew C. Yao, Information Processing Letters, 71 (1999), 63-69. "Quantum Bit Escrow", Dorit Aharonov, Amnon Ta-Shma, Umesh V. Vazirani, and Andrew C. Yao, Proceedings of Thirty-second ACM Symposium on Theory of Computing (STOC2000), May 2000, 705-714. "Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity", Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, and Andrew Yao, Proceedings of Forty-second IEEE Symposium on Foundations of Computer Science (FOCS2001), October 2001, 270-278. "Classical Physics and the Church-Turing Thesis", Andrew Chi-Chih Yao, Journal of ACM, 50 (2003), 100-105. "On the Power of Quantum Fingerprinting", Andrew Chi-Chih Yao, Proceedings of Thirty-fifth ACM Symposium on Theory of Computing (STOC2003), June 2003, 77-81. "Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?" Xiaoming Sun, Andrew C. Yao, and Shengyu Zhang, Proceedings of 19th IEEE Conference on Computational Complexity (CCC2004), Amherst, Massachusetts, June 2004, 286-293. "Graph Entropy and Quantum Sorting Problems", Andrew Chi-Chih Yao, Proceedings of Thirty-sixth ACM Symposium on Theory of Computing (STOC2004), June 2004, 112- 117. "Incentive Compatible Price Sequence in Dynamic Auctions", Ning Chen, Xiaotie Deng, Xiaoming Sun, and Andrew Chi-Chih Yao, Proceedings of Thirty-first International Colloquium on Automata, Languages and Programming, Turku, Finland, July 2004 (Lecture Notes in Computer Science # 3142, Springer), 320-331. "Fisher Equilibrium Price with a Class of Concave Utility Functions" Ning Chen, Xiaotie Deng, Xiaoming Sun, and Andrew Chi-Chih Yao, Proceedings of Twelfth Annual European Symposium on Algorithms, Bergen, Norway, September 2004 (Lecture Notes in Computer Science # 3221, Springer), 169-179. "Discrete and Continuous Min-energy Schedules for Variable Voltage Processors", Minming Li, Andrew C. Yao, and Frances F. Yao, Proceedings of the National Academy of Sciences USA, 103 (2006), 3983-3987. "On the Quantum Query Complexity of Local Search in Two and Three Dimensions", Xiaoming Sun and Andrew C. Yao, Proceedings of 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS2006), Berkeley, CA, October 2006, 429-438. "Oblivious and Adaptive Strategies for the Majority and Plurality Problems", Fan Chung, Ron Graham, Jia Mao, and Andrew Yao, Algorithmica, 48 (2007), 147-157. "Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-Prover Interactive Proof Systems", Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, and Andrew C.-C. Yao, Proceedings of 23rd IEEE Conference on Computational Complexity (CCC2008), Amherst, Massachusetts (2008), 187-198. "Graph Design for Secure Multiparty Computation over Non-Abelian Groups", Xiaoming Sun, Andrew Chi-Chih Yao, and Christophe Tartary, Proceedings of 2008 AsiaCrypt, 37-53. "A Note on Universal Composable Zero Knowledge in Common Reference String Model", Andrew C.C. Yao, Frances F. Yao, and Yunlei Zhao, Theoretical Computer Science (2009), 1099-1108. "A Note on the Feasibility of Generalized Universal Composability", Andrew C. C. Yao, Frances F. Yao, and Yunlei Zhao, Mathematical Structure in Computer Science (2009), 193-205. "Concurrent Knowledge Extraction in the Public-Key Model", Andrew C. Yao, Moti Yung, Yunlei Zhao, Proceedings of International Colloquium on Automata, Languages and Programming (ICALP), (Lecture Notes in Computer Science # 6198, Springer), July 2010, 702-714. "Deniable Internet Key Exchange", Andrew C. Yao, Frances F. Yao, Yunlei Zhao, and Bin Zhu, Proceedings of the 8th International Conference on Applied Cryptography and Network Security (ACNS), Beijing, China, June 2010, (Lecture Notes in Computer Science # 6123, Springer), 329-348. "Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem", Mingyu Xiao, Leizhen Cai, and Andrew C. Yao, Algorithmica 59 (2011), 510-520. "Graph Coloring Applied to Secure Computation in Non-Abelian Groups", Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Xiaoming Sun, Christophe Tartary, Huaxiong Wang, and Andrew Chi-Chih Yao, Journal of Cryptology, 25 (2012), 557-600. "Online/Offline Signatures for Low-Power Devices", Andrew Chi-Chih Yao and Yunlei Zhao, IEEE Transactions on Information Forensics and Security, 8 (2013), 283-294. "OAKE: A New Family of Implicitly Authenticated Diffie-Hellman Protocols", Andrew C. Yao and Yunlei Zhao, Proceedings of 2013 ACM Conference on Computer and Communications Security (CCS 2013), Berlin, Germany, November 2013, 1113-1128. "On Revenue Maximization for Selling Multiple Independently Distributed Items", Xinye Li and Andrew Chi-Chih Yao, Proceedings of the National Academy of Sciences USA, 110 (2013), 11232-11237. "Quantum Replication at the Heisenberg Limit", Giulio Chiribella, Yuxiang Yang, and Andrew Chi-Chih Yao, Nature Communications 4 (2013), 1768. "Privacy-Preserving Authenticated Key-Exchange over Internet", Andrew Chi-Chih Yao and Yunlei Zhao, IEEE Transactions on Information Forensics and Security 9(2014), 125-140. "An n-to-1 Bidder Reduction for Multi-item Auctions and its Applications", Andrew Chi-Chih Yao, Proceedings of 2015 ACM-SIAM Symposium on Discrete Algorithms (SODA15), San Diego, California, January 2015. "Dominant-Strategy versus Bayesian Multi-item Auctions Maximum Revenue Determination and Comparison", Andrew Chi-Chih Yao, Proceedings of EC'17 (The 18th ACM conference on Economics and Computation), June 2017 (an earlier version appeared on arXiv:1607.03685). "On Revenue Monotonicity in Combinatorial Auctions", Andrew Chi-Chih Yao, Proceedings of 11th International Symposium on Algorithmic Game Theory (SAGT2018), Beijing, China, September 2018, 1-11. "A Decentralized Blockchain with High Throughput and Fast Confirmation" Chenxin Li, Peilun Li, Dong Zhou, Zhe Yang, Ming Wu, Guang Yang, Wei Xu, Fan Long and Andrew Chi-Chih Yao In Proceedings of USENIX Annual Technical Conference (USENIX-ATC) 2020. “An Incentive Analysis of Some Bitcoin Fee Mechanisms”, Andrew Chi-Chih Yao, Proceedings of 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Saarbruecken, Germany, July 2020, pages 1:1-1:12.

个人简介

研究领域

近期论文