Shang-Hua Teng | |
|---|---|
| Born | 1964 (age 60–61) China |
| Alma mater | Shanghai Jiao Tong University (BA,BS) University of Southern California (MS) Carnegie Mellon University (PhD) |
| Known for | smoothed analysis ofalgorithms |
| Awards | Gödel Prize (2008, 2015),[1][2]Fulkerson Prize (2009) |
| Scientific career | |
| Fields | Computer Science |
| Institutions | University of Southern California University of Illinois at Urbana-Champaign Boston University University of Minnesota Massachusetts Institute of Technology |
| Thesis | A Unified Geometric Approach to Graph Partitioning (1991) |
| Doctoral advisor | Gary Miller |
Shang-Hua Teng (Chinese:滕尚华;pinyin:Téng Shànghuá; born 1964)[3] is a Chinese-American computer scientist. He is the Seeley G. Mudd Professor of Computer Science and Mathematics at theUniversity of Southern California. Previously, he was the chairman of the Computer Science Department at theViterbi School of Engineering of the University of Southern California.[4][5]
Teng was born in China in 1964. His father, Dr. Teng Zhanhong, was a professor ofcivil engineering at theTaiyuan University of Technology. His mother, Li Guixin, was an administrator at the same university.[3]
Teng graduated with BA inelectrical engineering and BS incomputer science, both fromShanghai Jiao Tong University in 1985. He obtained MS in computer science from theUniversity of Southern California in 1988. Teng holds a Ph.D. in computer science fromCarnegie Mellon University (in 1991).
Prior to joining USC in 2009, Teng was a professor atBoston University. He has also taught atMIT, theUniversity of Minnesota, and theUniversity of Illinois at Urbana-Champaign. He has worked atXerox PARC,NASA Ames Research Center,Intel Corporation,IBM Almaden Research Center,Akamai Technologies,Microsoft Research Redmond,Microsoft Research New England and Microsoft Research Asia.
In 2008 Teng was awarded theGödel Prize for his joint work onsmoothed analysis ofalgorithms withDaniel Spielman.[1] They went to win the prize again in 2015 for their contribution on "nearly-linear-time Laplacian solvers".[2][6] In 2009, he received theFulkerson Prize given by theAmerican Mathematical Society and theMathematical Programming Society.
Teng is a Fellow of theAssociation for Computing Machinery (ACM)[7] as well as anAlfred P. Sloan Research Fellow. He was named aSIAM Fellow in the 2021 class of fellows, "for contributions to scalable algorithm design, mesh generation, and algorithmic game theory, and for pioneering smoothed analysis of linear programming".[8]
In 2003, Teng married Diana Irene Williams, then a Ph.D. student of history atHarvard University.[3] They have a daughter.
