Professor Yao was born in Shanghai, China. He received a BS in Physics from National Taiwan University , a PhD in Physics from Harvard University, and a PhD in Computer Science from University of Illinois. His research interests include analysis of algorithms, computational complexity, cryptography and quantum computing. From 1975 onward, Professor Yao served on the faculty at MIT, Stanford, UC Berkeley, and during 1986 - 2004, as William and Edna Macaleer Professor of Engineering and Applied Science at Princeton University. In 2004, he left Princeton to become a Professor of Computer Science at Tsinghua Univeristy in Beijing. He is also a Distinguished Professor-at-Large at the Chinese University of Hong Kong. Professor Yao was recipient of the prestigious A.M. Turing Award in year 2000 for his contributions to the theory of computation, including communication complexity, pseudorandom number generation, and quantum computation. He has received numerous other honors and awards, including the George Polya Prize, the Donald E. Knuth Prize, and several honorary degrees. He is a member of the US National Academy of Sciences, the American Academy of Arts and Sciences, and the Chinese Academy of Sciences.
Peter Bro Miltersen received his PhD from Aarhus University in 1993. He is a Professor at the Department of Computer Science at University of Aarhus. The research of Professor Miltersen currently focuses on computational complexity theory and computational game theory. He has published more than fifty papers within the theory of computation and is best known for his contributions to the theory of cell probe complexity, the theory of pseudorandom generators and the compuational theory of stochastic games. Professor Miltersen has served in the program committees of more than thirty international conferences and workshops. He is associate editor of ACM Transactions of Computation Theory and is currently serving as steering committee chair of the IEEE Conference on Computational Complexity.