BACK TO INDEX
Publications of S.-H. Teng on CSC
|
Articles in journal or book chapters
|
-
M. Elkin,
Y. Emek,
D. A. Spielman,
and S.-H. Teng.
Lower-stretch spanning trees.
SIAM Journal on Computing,
38(2):608-628,
2008.
-
D. A. Spielman and S.-H. Teng.
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems.
In STOC'04: Proceedings of the 36th annual ACM symposium on Theory of computing,
New York, NY, USA,
pages 81-90,
2004.
ACM.
-
D. A. Spielman and S.-H. Teng.
Solving sparse, symmetric, diagonally dominant linear systems in time $\mathcal{O}(m^{1.31})$.
In 44th Annual IEEE Symposium on Foundations of Computer Science,
pages 416-427,
2003.
IEEE.
BACK TO INDEX
Last modified: Wed Jul 21 11:49:20 2010
Author: Bora Uçar.