Shang-Hua Teng
- Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time
2001/11/19 by Daniel A. Spielman, Spielman, Daniel A., Shang‐Hua Teng +2 · 2 voices · 21 citations
Computer Science · Mathematics · #Advanced Optimization Algorithms Research #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #G.1.6 #Numerical Methods and Algorithms #Polynomial and algebraic computation #cs.DS
- Settling the complexity of computing two-player Nash equilibria
2009/05/01 by Xi Chen, Xiaotie Deng, Shang-Hua Teng +1 · 63 citations
Decision Sciences · Economics, Econometrics and Finance · #Game Theory and Applications #Game Theory and Voting Systems #Economic theories and models
- Lower-Stretch Spanning Trees
2004/11/17 by Michael Elkin, Elkin, Michael, Yuval Emek +5 · 3 citations
Computer Science · #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #G.2.2 #cs.DM #cs.DS
- Smoothed analysis of algorithms
2002/12/01 by Daniel A. Spielman, Shang-Hua Teng · 2 citations
Mathematics · #math.OC #msc:65Y20 #msc:68Q17 #msc:68Q25 #msc:90C05
- Geometric Mesh Partitioning: Implementation and Experiments
1998/11/01 by John R. Gilbert, Gary L. Miller, Shang-Hua Teng +1 · 1 citation
Computer Science · Engineering · #Computational Geometry and Mesh Generation #Digital Image Processing Techniques #VLSI and FPGA Design Techniques