Andrew Yao

Andrew Yao
Name	Andrew Yao
Birth date	6 November 1946
Birth place	Shanghai, Republic of China
Nationality	Chinese-American
Fields	Theoretical computer science, computational complexity, cryptography, quantum computing
Alma mater	National Taiwan University; Harvard University
Doctoral advisor	Patrick C. Fischer
Notable students	Oded Goldreich; Moses Charikar; Xiaoyun Wang
Known for	Yao's principle; communication complexity; circuit complexity; pseudorandomness; secure computation
Awards	Turing Award; Knight Bachelor; Member of the National Academy of Sciences; Fellow of the Royal Society

Andrew Yao Andrew Yao is a Chinese-born theoretical computer scientist and educator widely recognized for foundational contributions to computational complexity theory, cryptography, and quantum computing. He has held faculty positions at Stanford University, the Massachusetts Institute of Technology, and the Institute for Advanced Study, and served as founding director of the Institute for Interdisciplinary Information Sciences at Tsinghua University. Yao's work bridges rigorous mathematical methods from probability theory, combinatorics, and game theory to tackle problems in algorithmic efficiency, secure computation, and circuit lower bounds.

Early life and education

Born in Shanghai in 1946, he grew up during the postwar period and completed undergraduate studies at National Taiwan University where he studied mathematics and early computing influences. He moved to the United States for graduate study and earned a Ph.D. in computer science from Harvard University under the supervision of Patrick C. Fischer. During his doctoral period he engaged with contemporaries at MIT, Bell Labs, and the burgeoning theoretical community including researchers from Princeton University and University of California, Berkeley.

Academic career

After his doctorate, he held faculty appointments at Stanford University and later at the Massachusetts Institute of Technology, interacting with scholars from Carnegie Mellon University, University of Illinois Urbana–Champaign, and Cornell University. He spent research leaves at the Institute for Advanced Study and collaborated with scientists affiliated with Microsoft Research, IBM Research, and the Chinese Academy of Sciences. In 2005 he returned to China to found the Institute for Interdisciplinary Information Sciences at Tsinghua University, promoting exchanges with institutions such as Peking University, Shanghai Jiao Tong University, and international partners including Princeton University and Stanford University.

Research contributions and notable results

His most cited result is the formulation of what is commonly called Yao's minimax principle, which connects randomized algorithms and distributional complexity by relating adversarial distributions to randomized decision trees; this principle influenced work at Bell Labs and in the study of randomized algorithms by researchers at MIT and UC Berkeley. He established seminal lower bounds in circuit complexity and introduced models and techniques used by theorists at Carnegie Mellon University, Princeton University, and Harvard University to separate complexity measures. In communication complexity he introduced the two-party model now standard in analyses by teams at Microsoft Research and Stanford University, producing lower bounds that underpin streaming and distributed protocols studied at ETH Zurich and EPFL.

Yao made major contributions to the theory of pseudorandomness and cryptography, formalizing notions of computational security that influenced work at RSA Security, D. E. Shaw & Co., and laboratories at IBM and Bell Labs. His secure computation formulations, including protocols for two-party computation, catalyzed subsequent constructions by researchers at Weizmann Institute of Science and Tel Aviv University and informed practical implementations in industry initiatives. In quantum computation he proposed frameworks for quantum communication complexity and quantum circuit lower bounds that intersect with research at Caltech, University of Oxford, and University of Waterloo.

Yao also advanced algorithmic game theory motifs linking complexity to strategic interaction; his interdisciplinary approach drew on collaborations with scholars from Princeton University and Harvard Business School and influenced applied work in algorithm design at Google and Amazon. Throughout his career he supervised doctoral students who later contributed to topics at Cornell University, Columbia University, and New York University.

Awards and honors

He received the Turing Award for fundamental contributions to theoretical computer science and computational theory, joining previous laureates from IBM and Bell Labs. He is an elected member of the National Academy of Sciences and a Fellow of the Royal Society, and has been honored by the American Academy of Arts and Sciences. He has been awarded honorary degrees and prizes by institutions including Tsinghua University, National Taiwan University, and international academies such as the Chinese Academy of Sciences. He was conferred national and international distinctions that align him with other leading scientists from Princeton University and Harvard University.

Personal life and legacy

He has maintained ties across academic communities in Taiwan, China, and the United States, fostering collaborations between Tsinghua University, Stanford University, and Harvard University. His legacy includes popularizing theoretical frameworks used by generations of researchers at MIT, Princeton University, and Carnegie Mellon University, and shaping curricula at departments across North America and Asia. Conferences, lecture series, and prizes named in his honor have been established by organizations such as ACM, IEEE, and major universities to recognize advances in theoretical computer science and related fields. His students and collaborators continue to lead research at institutions including Microsoft Research, Google Research, and national research academies.

Category:Theoretical computer scientists Category:Turing Award laureates Category:Fellows of the Royal Society