Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Teng, Shang-Hua"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bounded Budget Connection (BBC) games or how to make friends and influence people, on a budget
Nikolaos Laoutaris
,
Laura Poplawski
,
Rajmohan Rajaraman
,
Ravi Sundaram
,
Shang-Hua Teng
Journal of Computer and System Sciences
80
(7), 2014, pp. 1266-1284
Multi-stage design for quasipolynomial-time isomorphism testing of Steiner 2-systems
Xi Chen
,
Xiaorui Sun
,
Shang-Hua Teng
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 271-280
Reducibility among fractional stability problems
Shiva Kintali
,
Laura J. Poplawski
,
Rajmohan Rajaraman
,
Ravi Sundaram
,
Shang-Hua Teng
SIAM Journal on Computing
42
(6), 2013, pp. 2063-2113
Perturbation analysis of maximum-weighted bipartite matchings with low rank data
Xingwu Liu
,
Shang-Hua Teng
Lecture Notes in Computer Science
7936
, 2013, pp. 705-712
A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning
Daniel A. Spielman
,
Shang-Hua Teng
SIAM Journal on Computing
42
(1), 2013, pp. 1-26
Bounded budget betweenness centrality game for strategic network formations
Xiaohui Bei
,
Wei Chen
,
Shang-Hua Teng
,
Jialin Zhang
,
Jiajie Zhu
Theoretical Computer Science
412
(52), 2011, pp. 7147-7168
Optimal cache-oblivious mesh layouts
Michael A. Bender
,
Bradley C. Kuszmaul
,
Shang-Hua Teng
,
Kebin Wang
Theory of Computing Systems
48
(2), 2011, pp. 269-296
Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
Paul Christiano
,
Jonathan A. Kelner
,
Aleksander Ma̧dry
,
Daniel A. Spielman
,
Shang-Hua Teng
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 273-281
Competitive routing over time
Martin Hoefer
,
Vahab S. Mirrokni
,
Heiko Röglin
,
Shang-Hua Teng
Theoretical Computer Science
412
(39), 2011, pp. 5420-5432
Spectral sparsification of graphs
Daniel A. Spielman
,
Shang-Hua Teng
SIAM Journal on Computing
40
(4), 2011, pp. 981-1025
Quantum separation of local search and fixed point computation
Xi Chen
,
Xiamoming Sun
,
Shang-Hua Teng
Algorithmica
56
(3), 2010, pp. 364-382
Subgraph sparsification and nearly optimal ultrasparsifiers
Alexandra Kolla
,
Yury Makarychev
,
Amin Saberi
,
Shang-Hua Teng
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 57-65
Bounded budget betweenness centrality game for strategic network formations
Xiaohui Bei
,
Wei Chen
,
Shang-Hua Teng
,
Jialin Zhang
,
Jiajie Zhu
Lecture Notes in Computer Science
5757
, 2009, pp. 227-238
Settling the complexity of computing two-player Nash equilibria
Xi Chen
,
Xiaotie Deng
,
Shang-Hua Teng
Journal of the ACM
56
(3), 2009, pp. 14: 1-57
Market equilibria with hybrid linear-Leontief utilities
Xi Chen
,
Li-Sha Huang
,
Shang-Hua Teng
Theoretical Computer Science
410
(17), 2009, pp. 1573-1580
Spending is not easier than trading: On the computational equivalence of Fisher and Arrow-Debreu equilibria
Xi Chen
,
Shang-Hua Teng
Lecture Notes in Computer Science
5878
, 2009, pp. 647-656
The isolation game: A game of distances
Yingchao Zhao
,
Wei Chen
,
Shang-hua Teng
Theoretical Computer Science
410
(47-49), 2009, pp. 4905-4919
Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces
Yingchao Zhao
,
Shang-hua Teng
Theoretical Computer Science
410
(11), 2009, pp. 1081-1092
On the stability of web crawling and web search
Reid Anderson
,
Christian Borgs
,
Jennifer Chayes
,
John Hopcroft
,
Vahab Mirrokni
,
Shang-Hua Teng
Lecture Notes in Computer Science
5369
, 2008, pp. 680-691
Quantum separation of local search and fixed point computation
Xi Chen
,
Xiaoming Sun
,
Shang-Hua Teng
Lecture Notes in Computer Science
5092
, 2008, pp. 170-179
Quantum separation of local search and fixed point computation
Xi Chen
,
Xiaoming Sun
,
Shang-Hua Teng
Lecture Notes in Computer Science
5092
, 2008, pp. 170-179
Lower-stretch spanning trees
Michael Elkin
,
Yuval Emek
,
Daniel A. Spielman
,
Shang-Hua Teng
SIAM Journal on Computing
38
(2), 2008, pp. 608-628
The isolation game: A game of distances
Yingchao Zhao
,
Wei Chen
,
Shang-Hua Teng
Lecture Notes in Computer Science
5369
, 2008, pp. 148-158
k
-nearest-neighbor clustering and percolation theory
Shang-Hua Teng
,
Frances F. Yao
Algorithmica
49
(3), 2007, pp. 192-211
Lower-stretch spanning trees
Michael Elkin
,
Yuval Emek
,
Daniel A. Spielman
,
Shang-Hua Teng
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 494-503
Seiten 1
2
3
4
5
>