Shang-hua teng

from Wikipedia, the free encyclopedia

Shang-Hua Teng ( Chinese  滕尚华 , Pinyin Téng Shànghuá ; * 1964 in Beijing , People's Republic of China ) is an American mathematician and computer scientist of Chinese origin.

Teng, son of a professor of civil engineering, studied electrical engineering and computer science at Jiaotong University Shanghai (bachelor's degree 1985) and computer science at the University of Southern California (USC) with a master's degree in 1988 with Leonard Adleman . In 1991 he received his PhD from Carnegie-Mellon University under Gary Lee Miller ( Points, Spheres and Separators: A Unified Geometric Approach to Graph Partitioning ).

He then worked at the Xerox PARC research center (1991/92), at the Ames Research Center at NASA and at Intel , and from 1992 to 1994 at the Massachusetts Institute of Technology (MIT) as a Moore instructor . In 1994 he became Assistant Professor of Computer Science at the University of Minnesota and in 1997 Associate Professor at the University of Illinois at Urbana-Champaign , where he became Professor in 2000. From 2002 he was a professor at Boston University , since 2006 visiting professor at Microsoft Research Asia (and was also at Microsoft Research in Redmond and New England) and since 2004 visiting professor at Tsinghua University. Since 1999 he has been a Research Affiliate Professor at MIT. From 1997 to 1999 he was at IBM at their Almaden Research Center. He has been a Senior Research Scientist at Akamai Technologies Inc. since 2002. In 2009 he became Professor at the Viterbi School of Engineering at the University of Southern California .

Teng deals with algorithms, graph theory, combinatorial scientific computing, combinatorial optimization, combinatorial game theory, scientific computing on parallel computers, computer-aided geometry (for example grid generation). In particular, he and Daniel Spielman developed the concept of the smoothed analysis of the efficiency of algorithms (Smoothed Analysis). Teng holds several US patents.

In 2008 and 2015 he received the Gödel Prize with Spielman and the Fulkerson Prize in 2009 . He was a Sloan Research Fellow from 1996 to 1998 and is a Fellow of the ACM .

Web links

Individual evidence

  1. Portrait on the occasion of the appointment at the USC, 2009 ( Memento of the original of July 23, 2009 in the Internet Archive ) Info: The archive link has been inserted automatically and has not yet been checked. Please check the original and archive link according to the instructions and then remove this notice. @1@ 2Template: Webachiv / IABot /
  2. Spielman, Teng Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time , Proceedings of the Thirty-Third Annual ACM Symposium on the Theory of Computing, ACM, 2001, pp. 296-305. Spielman, Teng Smoothed Analysis of Algorithms: Why The Simplex Algorithm Usually Takes Polynomial Time, Journal of the ACM, Volume 51, 2004, pp. 385-463