BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Greece
13 × USA
Collaborated with:
D.A.Spielman G.L.Miller S.Chatterjee J.R.Gilbert R.Schreiber D.Talmor N.Walkington X.Chen X.Sun Y.C.Hu S.L.Johnsson R.Ghosh K.Lerman X.Yan A.Kolla Y.Makarychev A.Saberi M.Elkin Y.Emek A.Feldmann M.Kao J.Sgall P.Christiano J.A.Kelner A.Madry F.J.E.Long H.Edelsbrunner X.Li A.Stathopoulos A.Üngör
Talks about:
parallel (4) algorithm (3) system (3) graph (3) time (3) sparsif (2) program (2) generat (2) smooth (2) partit (2)

Person: Shang-Hua Teng

DBLP DBLP: Teng:Shang=Hua

Contributed to:

KDD 20142014
STOC 20132013
STOC 20112011
STOC 20102010
STOC 20052005
STOC 20042004
STOC 20012001
STOC 20002000
PPoPP 19971997
STOC 19951995
POPL 19931993
PPoPP 19931993
STOC 19931993
STOC 19871987

Wrote 14 papers:

KDD-2014-GhoshTLY #community #difference #network
The interplay between dynamics and networks: centrality, communities, and cheeger inequality (RG, SHT, KL, XY), pp. 1406–1415.
STOC-2013-ChenST #design #morphism #multi #testing
Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems (XC, XS, SHT), pp. 271–280.
STOC-2011-ChristianoKMST #approximate #graph #performance
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs (PC, JAK, AM, DAS, SHT), pp. 273–282.
Subgraph sparsification and nearly optimal ultrasparsifiers (AK, YM, AS, SHT), pp. 57–66.
Lower-stretch spanning trees (ME, YE, DAS, SHT), pp. 494–503.
STOC-2004-SpielmanT #algorithm #clustering #graph #linear
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems (DAS, SHT), pp. 81–90.
STOC-2001-SpielmanT #algorithm #analysis #polynomial #why
Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time (DAS, SHT), pp. 296–305.
Smoothing and cleaning up slivers (HE, XYL, GLM, AS, DT, SHT, , NW), pp. 273–277.
PPoPP-1997-HuJT #fortran #performance #problem
High Performance FORTRAN for Highly Unstructured Problems (YCH, SLJ, SHT), pp. 13–24.
STOC-1995-MillerTTW #generative
A Delaunay based numerical method for three dimensions: generation, formulation, and partition (GLM, DT, SHT, NW), pp. 683–692.
POPL-1993-ChatterjeeGST #array #automation #source code
Automatic Array Alignment in Data-Parallel Programs (SC, JRG, RS, SHT), pp. 16–28.
PPoPP-1993-ChatterjeeGLST #communication #generative #set #source code
Generating Local Address and Communication Sets for Data-Parallel Programs (SC, JRG, FJEL, RS, SHT), pp. 149–158.
STOC-1993-FeldmannKST #dependence #online #parallel #scheduling
Optimal online scheduling of parallel jobs with dependencies (AF, MYK, JS, SHT), pp. 642–651.
STOC-1987-MillerT #complexity #parallel
Dynamic Parallel Complexity of Computational Circuits (GLM, SHT), pp. 254–263.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.