Follow
Shanghua Teng
Title
Cited by
Cited by
Year
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
11862004
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
10272004
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
778*1996
Metadata search results ranking system
SB Edlund, ML Emens, R Kraft, J Myllymaki, S Teng
US Patent 6,718,324, 2004
7752004
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
6342009
Metadata search results ranking system
SB Edlund, ML Emens, R Kraft, J Myllymaki, S Teng
US Patent 6,546,388, 2003
5432003
Spectral sparsification of graphs
DA Spielman, SH Teng
SIAM Journal on Computing 40 (4), 981-1025, 2011
5412011
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
4462005
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
4202014
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
4082013
Sliver exudation
SW Cheng, TK Dey, H Edelsbrunner, MA Facello, SH Teng
Journal of the ACM (JACM) 47 (5), 883-904, 2000
4032000
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
4012004
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
3912011
How good is recursive bisection?
HD Simon, SH Teng
SIAM Journal on Scientific Computing 18 (5), 1436-1445, 1997
3471997
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
3021997
Geometric mesh partitioning: Implementation and experiments
JR Gilbert, GL Miller, SH Teng
SIAM Journal on Scientific Computing 19 (6), 2091-2110, 1998
2991998
Unified geometric approach to graph separators
SH Teng, S Points
Proc. 31st Ann. Symp. Foundations Comput. Sci, 538-547, 1991
2891991
Smoothed analysis: an attempt to explain the behavior of algorithms in practice
DA Spielman, SH Teng
Communications of the ACM 52 (10), 76-84, 2009
252*2009
Lower-stretch spanning trees
M Elkin, Y Emek, DA Spielman, SH Teng
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
2502005
Smoothed analysis of the condition numbers and growth factors of matrices
A Sankar, DA Spielman, SH Teng
SIAM Journal on Matrix Analysis and Applications 28 (2), 446-476, 2006
2402006
The system can't perform the operation now. Try again later.
Articles 1–20