Andrew Yao
Turing Award-winning computer scientist and theoretical physicist.
Andrew Chi-Chih Yao, born December 24, 1946, is a Chinese computer scientist, theoretical physicist, and computational theorist. He currently serves as a professor and the dean of the Institute for Interdisciplinary Information Sciences (IIIS) at Tsinghua University. Yao is best known for Yao's principle, a result derived from the minimax theorem that applies to computational complexity.
Yao earned a bachelor's degree in physics from National Taiwan University, followed by a physics doctorate from Harvard University in 1972 and a second doctorate in computer science from the University of Illinois in 1975. He then taught mathematics and computer science at MIT, Stanford, and UC Berkeley. In 1986, he became the William and Edna Macaleer Professor of Engineering and Applied Science at Princeton University. He received the 2000 ACM Turing Award.
Originally a naturalized U.S. citizen who worked in the United States for many years, Yao renounced his U.S. citizenship in 2015 alongside Yang Chen-Ning and became an academician of the Chinese Academy of Sciences.
Yao was born in Shanghai on December 24, 1946, when it was part of the Republic of China. His family moved first to Hong Kong and then to Taiwan, where he was raised. After attending Taipei Municipal Chien Kuo High School, he graduated from National Taiwan University with a B.S. in physics in 1967. He then pursued graduate studies at Harvard, earning an M.A. in physics in 1969 and a Ph.D. in theoretical physics in 1972, with a dissertation titled "Internal Symmetries and Positivity" supervised by Nobel laureate Sheldon Glashow. In just two years, he completed a second Ph.D. in computer science from the University of Illinois at Urbana–Champaign in 1975, as a National Science Foundation fellow. That dissertation, "A Study of Concrete Computational Complexity," was supervised by Taiwanese computer scientist Chung Laung Liu.
His academic career included assistant professorships at MIT (1975–1976) and Stanford (1976–1981), a professorship at UC Berkeley (1981–1982), and a full professorship at Stanford (1982–1986). From 1986 to 2004, he held the William and Edna Macaleer Professorship at Princeton, focusing on algorithms and complexity. In 2004, he joined Tsinghua University as a professor at the Center for Advanced Study and director of the Institute for Theoretical Computer Science. Since 2010, he has been dean of the IIIS at Tsinghua, and he also initiated the Conference on Innovations in Theoretical Computer Science (ITCS) that year. He is additionally a Distinguished Professor-at-Large at the Chinese University of Hong Kong. In May 2024, he co-authored an expert consensus paper with Yoshua Bengio, Geoffrey Hinton, and others, warning that AI safety research is lagging and outlining governance mechanisms for policymakers ahead of the AI Seoul Summit.
Yao received the Knuth Prize in 1996 and the Turing Award in 2000 for fundamental contributions to pseudorandom number generation, cryptography, and communication complexity. He also won the Kyoto Prize in Advanced Technology in 2021 and was listed on the Asian Scientist 100 in 2022. He is a member of the U.S. National Academy of Sciences, a fellow of the American Academy of Arts and Sciences, the American Association for the Advancement of Science, and the Association for Computing Machinery, as well as an academician of the Chinese Academy of Sciences. His wife, Frances Yao, is also a theoretical computer scientist.
- field
- Computer science, theoretical physics
- nationality
- Chinese (formerly naturalized U.S. citizen)
- known_for
- Yao's principle, contributions to pseudorandom number generation, cryptography, communication complexity
Verified Timeline
Lore & Background
He earned a Ph.D.
Reader's Guide
Andrew Yao's significance lies in his foundational work in theoretical computer science, particularly through Yao's principle, which uses the minimax theorem to establish lower bounds in randomized algorithms. His contributions to pseudorandom number generation, cryptography, and communication complexity have shaped modern computing. The 2000 Turing Award recognized these achievements. Yao's career spans leading institutions in the U.S. and China, and his later renunciation of U.S. His legacy includes both technical breakthroughs and a prominent role in the global computer science community.
Did You Know?
- He used the minimax theorem to prove what is now known as Yao's principle.
note
The provided source text is a general alphabetical list of computer scientists (sections A–C) and contains no entry, mention, or fact about Andrew Yao. Because the instructions require every section to be grounded strictly in the supplied facts and to never invent specifics, I am unable to produce four substantive sections about Andrew Yao from this material.
Frequently Asked Questions
What is Yao's principle and why does it matter?
Yao's principle is a theorem that extends the minimax framework into computational complexity, giving a rigorous way to reason about the expected cost of randomized algorithms. It has become a standard tool for proving lower bounds in areas like communication complexity and cryptography.
What fields does Andrew Yao work in?
His primary domains are computer science and theoretical physics, with deep contributions spanning pseudorandom number generation, cryptographic protocol design, and communication complexity. His work bridges pure mathematics and practical computing theory.
What major award has Andrew Yao received?
He was the 2000 recipient of the ACM A.M. Turing Award, the highest honor in computer science, recognizing his lasting impact on the theoretical foundations of the field.
Why is Andrew Yao considered important to the field of computer science?
He established core theoretical tools—especially in randomness, cryptography, and the limits of information exchange—that underpin much of modern secure computing. His influence extends well beyond any single subfield, shaping how researchers approach fundamental questions about computation.
More in Computer Scientists And Programmers 1-23
Related in Computer Scientists And Programmers
Links follow this subject's own source article.
Spotted an error? Know more?
This is a living reference — every entry is fact-audited, and reader corrections feed straight into our audit queue. Suggest an edit · See this site's audit record
