Princeton University's Andrew Chi Chih Yao Wins the Association for Computing Machinery's (ACM) 2000 A. M. Turing Award.Business Editors/Education Writers SAN JOSE, Calif.--(BUSINESS WIRE)--March, 11 2001 Award Has Been Called The "Nobel Prize Of Computing" Award presented at 2001 ACM Awards Banquet in San Jose The Association for Computing Machinery See ACM. Association for Computing Machinery - Association for Computing today presented Andrew Chi-Chih Yao with the 2000 A.M. Turing Award, at the Annual ACM Awards Banquet. The A.M. Turing award has been called the "Nobel Prize" of Computing. Each year, the banquet celebrates the achievements and contributions of computer science and information technology luminaries. Frederick P. Brooks, Jr. was the winner of the award in 1999, for landmark contributions to computer architecture, operating systems, and software engineering. Dr. Yao received the award in recognition of his fundamental contributions to the theory of computation, including the complexity-based theory of pseudorandom number generation, cryptography, and communication complexity. Dr. Yao has helped shape the theory of computation. He established new paradigms and effective techniques in many areas, including computational geometry, constant-depth Boolean circuit complexity, analysis of data structures, and quantum communication. He initiated the field of communication complexity, which measures the minimum amount of interaction that two or more parties must have in order to jointly carry out some computation. Dr. Yao thus captured the essence of communication cost for distributed computation. Before Dr. Yao, the quality of a pseudorandom number generator A pseudorandom number generator (PRNG) is an algorithm to generate a sequence of numbers that approximate the properties of random numbers. The sequence is not truly random in that it is completely determined by a relatively small set of initial values, called the PRNG's was an empirical opinion. He gave the first convincing definition of a pseudorandom number generator, namely that its output sequences are not distinguishable from those of a truly random number generator A program routine that produces a random number. Random numbers are created easily in a computer, since there are many random events that take place such as the duration between keystrokes. by any polynomial-time test. Dr. Yao showed that any generator satisfying the specific "next-bit test" developed by Blum and Micali actually meets his general definition. He showed that the discovery of any one-way function would lead to such a pseudorandom number generator. This has great import for cryptography. Biographical Background: An alumnus of the National Taiwan University National Taiwan University (Traditional Chinese: 國立臺灣大學; Simplified Chinese: 国立台湾大学 , he earned a Ph.D. in Physics at Harvard, and a Ph.D. in Computer Science from the University of Illinois University of Illinois may refer to:
Dr. Yao is a fellow of the ACM, a member of the National Academy of Sciences, American Academy of Arts and Sciences, and Academia Sinica. He was recipient of the Guggenheim Fellowship, the SIAM George Polya Prize, and the ACM SIGACT-IEEE TCMFCS Donald E. Knuth Prize. Prior to his current position at Princeton as William and Edna Macaleer Professor of Engineering and Applied Science, Dr. Yao taught at MIT MIT - Massachusetts Institute of Technology , Stanford University, and the University of California, Berkeley The University of California, Berkeley is a public research university located in Berkeley, California, United States. Commonly referred to as UC Berkeley, Berkeley and Cal . He was also a consultant at IBM, DEC Systems Research Center The Systems Research Center (SRC) was a research laboratory created by Digital Equipment Corporation (DEC) in 1984, in Palo Alto, California. DEC SRC was founded by a group of computer scientists, led by Robert Taylor, who left the Computer Science Laboratory (CSL) of , and Xerox Palo Alto Research Center Palo Alto Research Center - XEROX PARC . Dr. Yao has been Managing Editor of the SIAM Journal on Computing The SIAM Journal on Computing is a research journal focussing on the mathematical and formal aspects of computer science. It is published by the Society for Industrial and Applied Mathematics (SIAM). External link
His professional activities include the American Association for the Advancement of Science American Association for the Advancement of Science (AAAS), private organization devoted to furthering the work of scientists and improving the effectiveness of science in the promotion of human welfare. , the American Mathematical Society The American Mathematical Society (AMS) is an association of professional mathematicians dedicated to the interests of mathematical research and scholarship, which it does with various publications and conferences as well as annual monetary awards to mathematicians. , the ACM, the IEEE, and the Society for Industrial and Applied Mathematics
The Society for Industrial and Applied Mathematics (SIAM) was founded by a small group of mathematicians from academia and industry who met in Philadelphia in 1951 to start an organization . He was co-organizer of the 1990-1991 NSF Discrete Mathematics and Theoretical Computer Science (DIMACS) Special Year in Complexity Theory, and Co-Director of DIMACS from 1994 to 1996. The A.M. Turing Award A prize of $25,000 accompanies ACM's most prestigious technical award. It is given to an individual selected for contributions of a technical nature made to the computing community. The contributions should be of lasting technical importance to the computer field. 2000 ACM Award Winners: A.M. Turing Award: Andrew Chi-Chih Yao Princeton University In recognition of his fundamental contributions to the theory of computation, including the complexity-based theory of pseudorandom number generation, cryptography, and communication complexity. Previous years' Turing Award Winners Outstanding Contribution to ACM: Hal Berghel, University of Nevada, Las Vegas “UNLV” redirects here. For other uses, see UNLV (disambiguation). The University of Nevada, Las Vegas (UNLV) is a public, coeducational university located in Las Vegas, Nevada, USA, known for its programs in History, Engineering, Environmental Studies, Hotel For significant and wide-ranging contributions on behalf of the ACM Membership and Publication Boards, ACM Technology Outreach Programs, and the ACM Distinguished Lectureship Series. Previous years' Outstanding Contribution Award Winners Distinguished Service Award: Peter Wegner, Professor Emeritus, Brown University For many years of generous service to ACM and the computing community, including outstanding and inspiring leadership in publications and in charting research directions for computer science. Previous years' Distinguished Service Award Winners Allen Newell Award: Lotfi Zadeh, University of California at Berkeley (body, education) University of California at Berkeley - (UCB) See also Berzerkley, BSD. http://berkeley.edu/. Note to British and Commonwealth readers: that's /berk'lee/, not /bark'lee/ as in British Received Pronunciation. For his seminal contributions to the theory and applications of fuzzy sets and fuzzy logic in basic sciences, information processing, decision and control. The Allen Newell Award is presented to an individual selected for career contributions that have breadth within computer science, or that bridge computer science and other disciplines. This endowed award is supported by the American Association for Artificial Intelligence, and by individual contributions. Previous years' Allen Newell Award Winners Karl V. Karlstrom Outstanding Educator Award: Yale Patt, University of Texas For great ability, dedication, and success in developing computer science education, and for outstanding achievements as a teacher. Previous years' Karl V. Karlstrom Award Winners Grace Murray Hopper Award Although many awards have added Grace Hopper's name to them since her death in 1992, the original Grace Murray Hopper Awards have been awarded by the Association for Computing Machinery (ACM) since 1971. : Lydia Kavraki, Rice University For her seminal work on the probabilistic roadmap approach which has caused a paradigm shift in the area of path planning, and has many applications in robotics, manufacturing, nanotechnology and computational biology. This is awarded to the outstanding young computer professional of the year...selected on the basis of a single recent major technical or service contribution. A prize of $5000 is supplied by the UNISYS Corporation. The candidate must have been 35 years of age or less at the time the qualifying contribution was made. Previous years' Grace Murray Hopper Award Winners Paris Kanellakis Theory and Practice Award: Narendra Karmarkar, Tata Institute, India For his theoretical work in devising an Interior Point method for linear programming that provably runs in polynomial time, and for his implementation work suggesting that Interior Point methods could be effective for linear programming in practice as well as theory. Together, these contributions inspired a renaissance in the theory and practice of linear programming, leading to orders of magnitude improvement in the effectiveness of widely-used commercial optimization code. The Paris Kanellakis Theory and Practice Award honors specific theoretical accomplishments that have had a significant and demonstrable effect on the practice of computing. This award is accompanied by a prize of $5,000 and is endowed by contributions from the Kanellakis family, with additional financial support provided by Brooks/Cole and Thomson Learning, ACM's Special Interest Group on Algorithms and Computational Theory (SIGACT), ACM's Special Interest Group on Design Automaton (SIGDA), ACM's Special Interest Group on Management of Data (SIGMOD), ACM's Special Interest Group on Programming Languages (SIGPLAN SIGPLAN Special Interest Group: Programming Languages (ACM) ), the ACM SIG Discretionary Fund, and individual contributions. Previous years' Paris Kanellakis Award The Paris Kanellakis Theory and Practice Award is granted yearly by the Association for Computing Machinery (ACM) to honor specific theoretical accomplishments that have had a significant and demonstrable effect on the practice of computing. Winners Doctoral Dissertation Award: Salil Vadhan, Harvard University For his dissertation "A Study of Statistical Zero-Knowledge Proofs," nominated by MIT. 2001 ACM Fellows The ACM Fellows serve as distinguished colleagues to whom the ACM and its members look for guidance and leadership as the world of information technology evolves. For a complete list of this year's ACM Fellows, please link here - ACM Fellows. ACM Founded in 1947, ACM (www.acm.org) is the world's first educational and scientific computing society. With more than 80,000 members worldwide, a dynamic series of authoritative publications, the ACM Digital Library, with one of the most respected online collections of computer science information, a wide range of special interest groups (SIGs), and an outstanding array of conferences, workshops and forums, ACM is a world-class resource for the entire technology field. |
|
||||||||||||
Printer friendly
Cite/link
Email
Feedback
Reader Opinion