报告人：Ming-Deh Huang，University of Southern California
时间：6.20（周一）上午 10:00-11:00
地点：邯郸校区逸夫楼 604 会议室
联系人：金玲飞 lfjin@fudan.edu.cn
Abstract:
In the first part of the talk we discuss the notion of pseudorandomness in complexity theory and cryptography. We then discuss expander graphs and their connection to randomness extraction. The second part of the talk focuses on algebraic construction of expander graphs and its connection to generating sets and character sums.
Bio:
Ming-Deh Huang received his Ph.D. from Princeton University in 1984. He spent a year at IBM Yorktown Research on an IBM Postdoctoral Fellowship in Mathematical Sciences, before joining University of Southern California (USC) as an assistant professor in 1985. He has been a full professor at USC since 1998. His research interests include: Algorithms and computational complexity, Algorithmic number theory, Cryptography, Quantum computation, and Algorithmic self-assembly.
