Shanghua Teng

Shang-Hua Teng
Born	1964 (age 52–53) Beijing, China
Residence	United States of America
Nationality	American
Fields	Computer Science
Institutions	University of Southern California Boston University University of Minnesota Massachusetts Institute of Technology
Alma mater	Shanghai Jiao Tong University University of Southern California Carnegie Mellon
Thesis	A Unified Geometric Approach to Graph Partitioning (1991)
Doctoral advisor	Gary Miller
Known for	smoothed analysis of algorithms
Notable awards	Gödel Prize (2008,2015),Fulkerson Prize (2009)

Shang-Hua Teng (Chinese: 滕尚华; pinyin: Téng Shàng-huá, born 1964) is a Chinese-American computer scientist. He is the Seeley G. Mudd Professor of Computer Science and Mathematics at the University of Southern California. Previously, he was the chairman of the Computer Science Department at the Viterbi School of Engineering of the University of Southern California. In 2008 he was awarded the Gödel Prize for his joint work on smoothed analysis of algorithms with Daniel Spielman. They went to win the prize again in 2015 for their contribution on "nearly-linear-time Laplacian solvers". In 2009, he received the Fulkerson Prize given by the American Mathematical Society and the Mathematical Programming Society.

Teng graduated with BA in electrical engineering and BS in computer science, both from Shanghai Jiao Tong University in 1985. He obtained MS in computer science from the University of Southern California in 1988. Teng holds a Ph.D in computer science from Carnegie Mellon University (in 1991).

Prior to joining USC in 2009, Teng was a professor at Boston University. He has also taught at MIT, the University of Minnesota, and the University of Illinois at Urbana-Champaign. He has worked at Xerox PARC, NASA Ames Research Center, Intel Corporation, IBM Almaden Research Center, Akamai Technologies, Microsoft Research Redmond, Microsoft Research New England and Microsoft Research Asia.

...
Wikipedia