| Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time DA Spielman, SH Teng Journal of the ACM (JACM) 51 (3), 385-463, 2004 | 1224 | 2004 |
| Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems DA Spielman, SH Teng Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004 | 1053 | 2004 |
| Metadata search results ranking system SB Edlund, ML Emens, R Kraft, J Myllymaki, S Teng US Patent 6,718,324, 2004 | 784 | 2004 |
| Settling the complexity of computing two-player Nash equilibria X Chen, X Deng, SH Teng Journal of the ACM (JACM) 56 (3), 1-57, 2009 | 665 | 2009 |
| Spectral sparsification of graphs DA Spielman, SH Teng SIAM Journal on Computing 40 (4), 981-1025, 2011 | 569 | 2011 |
| Spectral partitioning works: Planar graphs and finite element meshes DA Spielman, SH Teng Proceedings of 37th conference on foundations of computer science, 96-105, 1996 | 552 | 1996 |
| Metadata search results ranking system SB Edlund, ML Emens, R Kraft, J Myllymaki, S Teng US Patent 6,546,388, 2003 | 550 | 2003 |
| On trip planning queries in spatial databases F Li, D Cheng, M Hadjieleftheriou, G Kollios, SH Teng International symposium on spatial and temporal databases, 273-290, 2005 | 458 | 2005 |
| Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems DA Spielman, SH Teng SIAM Journal on Matrix Analysis and Applications 35 (3), 835-885, 2014 | 435 | 2014 |
| A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning DA Spielman, SH Teng SIAM Journal on computing 42 (1), 1-26, 2013 | 414 | 2013 |
| Internet based method for facilitating networking among persons with similar interests and for facilitating collaborative searching for information ML Emens, R Kraft, SH Teng, G Tewari, PCS Yim US Patent 6,745,178, 2004 | 407 | 2004 |
| Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs P Christiano, JA Kelner, A Madry, DA Spielman, SH Teng Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 405 | 2011 |
| Sliver exudation SW Cheng, TK Dey, H Edelsbrunner, MA Facello, SH Teng Journal of the ACM (JACM) 47 (5), 883-904, 2000 | 398 | 2000 |
| How good is recursive bisection? HD Simon, SH Teng SIAM Journal on Scientific Computing 18 (5), 1436-1445, 1997 | 352 | 1997 |
| Subspace gradient domain mesh deformation J Huang, X Shi, X Liu, K Zhou, LY Wei, SH Teng, H Bao, B Guo, HY Shum ACM SIGGRAPH 2006 Papers, 1126-1134, 2006 | 337 | 2006 |
| Separators for sphere-packings and nearest neighbor graphs GL Miller, SH Teng, W Thurston, SA Vavasis Journal of the ACM (JACM) 44 (1), 1-29, 1997 | 308 | 1997 |
| Geometric mesh partitioning: Implementation and experiments JR Gilbert, GL Miller, SH Teng SIAM Journal on Scientific Computing 19 (6), 2091-2110, 1998 | 305 | 1998 |
| Unified geometric approach to graph separators SH Teng, S Points 1991 Proceedings 32nd Annual Symposium of Foundations of Computer Science …, 1991 | 296 | 1991 |
| Spectral partitioning works: Planar graphs and finite element meshes DA Spielman, SH Teng Linear Algebra and its Applications 421 (2-3), 284-305, 2007 | 263 | 2007 |
| Lower-stretch spanning trees M Elkin, Y Emek, DA Spielman, SH Teng Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 257 | 2005 |
