Shang‐Hua Teng

Smoothed analysis of algorithms

Daniel A. Spielman, Shang‐Hua Teng · Journal of the ACM · 2004 · 838 citations

Computing, Computer Science, Algorithms +10

Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems

Daniel A. Spielman, Shang‐Hua Teng · 2004 · 799 citations

Computing, Computer Science, Mathematics +16

Settling the complexity of computing two-player Nash equilibria

Xi Chen, Xiaotie Deng, Shang‐Hua Teng · Journal of the ACM · 2009 · 579 citations

Computing, Computer Science, Mathematics +17

Spectral partitioning works: planar graphs and finite element meshes

Daniel A. Spielman, Shang‐Hua Teng · 1996 · 410 citations

Computing, Computer Science, Algorithms +12

Spectral Sparsification of Graphs

Daniel A. Spielman, Shang‐Hua Teng · SIAM Journal on Computing · 2011 · 402 citations

Computing, Computer Science, Mathematics +15