Shang-Hua Teng
<templatestyles src="Module:Hatnote/styles.css"></templatestyles>
| Shang-Hua Teng | |
|---|---|
| Born | 1964 (age 59–60) 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),[1] Fulkerson Prize (2009) |
Shang-Hua Teng (Chinese: 滕尚华; pinyin: Téng Shàng-huá, born 1964)[2] 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.[3] 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".[4][5] In 2009, he received the Fulkerson Prize given by the American Mathematical Society and the Mathematical Programming Society.
Biography
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.
Teng is a Fellow of the Association for Computing Machinery (ACM)[6] as well as an Alfred P. Sloan fellow.
References
- ↑ Lua error in package.lua at line 80: module 'strict' not found.[dead link]
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found..
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ https://www.eatcs.org/index.php/component/content/article/1-news/2117-goedel-prize-2015
- ↑ http://fellows.acm.org/fellow_citation.cfm?id=4791257&srt=year&year=2009
External links
<templatestyles src="Asbox/styles.css"></templatestyles>
 |
This biographical article relating to a computer specialist is a stub. You can help Wikipedia by expanding it. |
- Articles with dead external links from October 2010
- Articles containing Chinese-language text
- 1964 births
- Living people
- American computer scientists
- Chinese computer scientists
- Boston University faculty
- Carnegie Mellon University alumni
- Chinese emigrants to the United States
- Educators from Beijing
- Gödel Prize laureates
- IBM employees
- Intel people
- Researchers in geometric algorithms
- Fellows of the Association for Computing Machinery
- Massachusetts Institute of Technology faculty
- Microsoft people
- Shanghai Jiao Tong University alumni
- Sloan Fellows
- University of Illinois at Urbana–Champaign faculty
- University of Minnesota faculty
- USC Viterbi School of Engineering alumni
- University of Southern California faculty
- Xerox people
- Computer specialist stubs
