Resultado da Busca
Andrew Chi-Chih Yao (Chinese: 姚期智; pinyin: Yáo Qīzhì; born December 24, 1946) is a Chinese computer scientist and computational theorist. He is currently a professor and the dean of Institute for Interdisciplinary Information Sciences (IIIS) at Tsinghua University. Yao used the minimax theorem to prove what is now known as ...
Andrew Chi-Chih Yao is a leading expert in algorithms, cryptography, quantum computing and artificial intelligence. He has won many awards and honors, including the A.M. Turing Award, the Kyoto Prize, and the National Academy of Sciences membership. He is the current dean of the Institute for Interdisciplinary Information Sciences at Tsinghua University and the William and Edna Macaleer Professor of Engineering and Applied Science at Princeton University.
Learn about the life and achievements of Andrew Chi-Chih Yao, a renowned computer scientist who made fundamental contributions to the theory of computation, cryptography, and secure computation. See his citations, research subjects, and annotated bibliography on the ACM website.
Andrew Yao (em chinês: Yao Chi-Chih, 姚期智, Yáo Qīzhì) (Xangai, 24 de dezembro de 1946) é um informático chinês. Foi agraciado com o Prêmio Turing de 2000, por suas pesquisas sobre teoria da computação, em especial a Complexidade computacional. Graduado em física pela Universidade Nacional de Taiwan.
Andrew Chi-Chih Yao is a computer scientist who created new theories and methods for computing and communication. He developed the concept of communication complexity, the Dolev-Yao model of security, and the Yao's test for pseudo-random number generation. He also influenced quantum computing and privacy protection. He received the 2021 Kyoto Prize in Advanced Technology for his pioneering contributions.
Andrew Chi-Chih Yao: On Solutions for the Maximum Revenue Multi-item Auction under Dominant-Strategy and Bayesian Implementations. CoRR abs/1607.03685 (2016)
1 de mai. de 2024 · Andrew Chi-Chih Yao is a Chinese American computer scientist and winner of the 2000 A.M. Turing Award, the highest honour in computer science, for his “fundamental contributions to the theory of computation [computational complexity], including the complexity-based theory of pseudorandom number.
