Shang-Hua Teng - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

2010

Quantum Separation of Local Search and Fixed Point ComputationXi Chen, Xiaoming Sun, Shang-Hua Teng. algorithmica, 56(3):364-382, 2010. [doi]

Foreword to special issue on SODA 2008Mohammad Taghi Hajiaghayi, Shang-Hua Teng. talg, 6(4), 2010. [doi]

Subgraph sparsification and nearly optimal ultrasparsifiersAlexandra Kolla, Yury Makarychev, Amin Saberi, Shang-Hua Teng. stoc 2010: 57-66 [doi]

2009

Agnostic ClusteringMaria-Florina Balcan, Heiko RÃ¶glin, Shang-Hua Teng. alt 2009: 384-398 [doi]

Bounded Budget Betweenness Centrality Game for Strategic Network FormationsXiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhang, Jiajie Zhu. esa 2009: 227-238 [doi]

Market equilibria with hybrid linear-Leontief utilitiesXi Chen, Li-Sha Huang, Shang-Hua Teng. TCS, 410(17):1573-1580, 2009. [doi]

Settling the complexity of computing two-player Nash equilibriaXi Chen, Xiaotie Deng, Shang-Hua Teng. JACM, 56(3), 2009. [doi]

Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu EquilibriaXi Chen, Shang-Hua Teng. isaac 2009: 647-656 [doi]

Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable UtilitiesXi Chen, Decheng Dai, Ye Du, Shang-Hua Teng. focs 2009: 273-282 [doi]

On the alpha-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation GamesWei Chen, Shang-Hua Teng, Yajun Wang, Yuan Zhou. faw 2009: 63-73 [doi]

Compact Routing in Power-Law GraphsWei Chen, Christian Sommer 0002, Shang-Hua Teng, Yajun Wang. wdag 2009: 379-391 [doi]

Competitive Routing over TimeMartin Hoefer, Vahab S. Mirrokni, Heiko RÃ¶glin, Shang-Hua Teng. wine 2009: 18-29 [doi]

Learning and Smoothed AnalysisAdam Tauman Kalai, Alex Samorodnitsky, Shang-Hua Teng. focs 2009: 395-404 [doi]

Higher Eigenvalues of GraphsJonathan A. Kelner, James R. Lee, Gregory N. Price, Shang-Hua Teng. focs 2009: 735-744 [doi]

Reducibility among Fractional Stability ProblemsShiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng. focs 2009: 283-292 [doi]

Reducibility Among Fractional Stability ProblemsShiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng. eccc, 16:41, 2009. [doi]

Smoothed Analysis of Multiobjective OptimizationHeiko RÃ¶glin, Shang-Hua Teng. focs 2009: 681-690 [doi]

Smoothed analysis: an attempt to explain the behavior of algorithms in practiceDaniel A. Spielman, Shang-Hua Teng. CACM, 52(10):76-84, 2009. [doi]

Finding local communities in protein networksKonstantin Voevodski, Shang-Hua Teng, Yu Xia. bmcbi, 10:297, 2009. [doi]

The isolation game: A game of distancesYingchao Zhao, Wei Chen, Shang-Hua Teng. TCS, 410(47-49):4905-4919, 2009. [doi]

Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spacesYingchao Zhao, Shang-Hua Teng. TCS, 410(11):1081-1092, 2009. [doi]

2008

Local Computation of PageRank ContributionsReid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng. im, 5(1):23-45, 2008. [doi]

Robust PageRank and locally computable spam detection featuresReid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Kamal Jain, Vahab S. Mirrokni, Shang-Hua Teng. airweb 2008: 69-76 [doi]

On the Stability of Web Crawling and Web SearchReid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng. isaac 2008: 680-691 [doi]

Atropos: A PSPACE-Complete Sperner Triangle GameKyle W. Burke, Shang-Hua Teng. im, 5(4):477-492, 2008. [doi]

Quantum Separation of Local Search and Fixed Point ComputationXi Chen, Xiaoming Sun, Shang-Hua Teng. cocoon 2008: 170-179 [doi]

Lower-Stretch Spanning TreesMichael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng. siamcomp, 38(2):608-628, 2008. [doi]

Bounded budget connection (BBC) games or how to make friends and influence people, on a budgetNikolaos Laoutaris, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng. podc 2008: 165-174 [doi]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008Shang-Hua Teng, editor, SIAM, 2008.

The Isolation Game: A Game of DistancesYingchao Zhao, Wei Chen, Shang-Hua Teng. isaac 2008: 148-158 [doi]

2007

Local Computation of PageRank ContributionsReid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng. waw 2007: 150-165 [doi]

A PSPACE-complete Sperner Triangle GameKyle W. Burke, Shang-Hua Teng. wine 2007: 445-456 [doi]

The approximation complexity of win-lose gamesXi Chen, Shang-Hua Teng, Paul Valiant. soda 2007: 159-168 [doi]

Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point ComputationXi Chen, Shang-Hua Teng. focs 2007: 124-134 [doi]

07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of AlgorithmsMartin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking. dagstuhl 2007: [doi]

Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking, editors, Volume 07391 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2007.

On the Approximation and Smoothed Complexity of Leontief Market EquilibriaLi-Sha Huang, Shang-Hua Teng. faw 2007: 96-107 [doi]

Parallel Delaunay Refinement: Algorithms and AnalysesDaniel A. Spielman, Shang-Hua Teng, Alper Üngör. ijcga, 17(1):1-30, 2007. [doi]

::::k::::-Nearest-Neighbor Clustering and Percolation TheoryShang-Hua Teng, Frances F. Yao. algorithmica, 49(3):192-211, 2007. [doi]

Game and Market Equilibria: Computation, Approximation, and Smoothed AnalysisShang-Hua Teng. AAIM 2007: 424 [doi]

Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean SpacesYingchao Zhao, Shang-Hua Teng. tamc 2007: 554-565 [doi]

2006

Computing Nash Equilibria: Approximation and Smoothed ComplexityXi Chen, Xiaotie Deng, Shang-Hua Teng. focs 2006: 603-612 [doi]

Market Equilibria with Hybrid Linear-Leontief UtilitiesXi Chen, Li-Sha Huang, Shang-Hua Teng. wine 2006: 274-285 [doi]

Sparse Games Are HardXi Chen, Xiaotie Deng, Shang-Hua Teng. wine 2006: 262-273 [doi]

Computing Nash Equilibria: Approximation and Smoothed ComplexityXi Chen, Xiaotie Deng, Shang-Hua Teng. eccc, 13(023), 2006. [doi]

Subspace gradient domain mesh deformationJin Huang, Xiaohan Shi, Xinguo Liu, Kun Zhou, Li-Yi Wei, Shang-Hua Teng, Hujun Bao, Baining Guo, Heung-Yeung Shum. tog, 25(3):1126-1134, 2006. [doi]

On the Approximation and Smoothed Complexity of Leontief Market EquilibriaLi-Sha Huang, Shang-Hua Teng. eccc, 13(031), 2006. [doi]

Truthful Auctions with Optimal ProfitPinyan Lu, Shang-Hua Teng, Changyuan Yu. wine 2006: 27-36 [doi]

Smoothed Analysis of the Condition Numbers and Growth Factors of MatricesArvind Sankar, Daniel A. Spielman, Shang-Hua Teng. siammax, 28(2):446-476, 2006. [doi]

Geometric Separator for d-Dimensional Ball GraphsKebin Wang, Shang-Hua Teng. cccg 2006: [doi]

2005

Lower-stretch spanning treesMichael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng. stoc 2005: 494-503 [doi]

On Trip Planning Queries in Spatial DatabasesFeifei Li, Dihan Cheng, Marios Hadjieleftheriou, George Kollios, Shang-Hua Teng. ssd 2005: 273-290 [doi]

Smoothed Analysis of Algorithms and HeuristicsShang-Hua Teng. cocoon 2005: 10-11 [doi]

2004

2003

Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time 0(m:::1.31:::)Daniel A. Spielman, Shang-Hua Teng. focs 2003: 416-427 [doi]

Smoothed Analysis (Motivation and Discrete Models)Daniel A. Spielman, Shang-Hua Teng. wads 2003: 256-270 [doi]

2002

Parallel Delaunay Refinement: Algorithms And AnalysesDaniel A. Spielman, Shang-Hua Teng, Alper Üngör. pimrc 2002: 205-217 [doi]

Guest Editor s ForewardShang-Hua Teng. mst, 35(3):249, 2002. [doi]

2001

Min-max-boundary domain decompositionMarcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng. TCS, 261(2):253-266, 2001. [doi]

Generating well-shaped Delaunay meshed in 3DXiang-Yang Li, Shang-Hua Teng. soda 2001: 28-37 [doi]

Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial timeDaniel A. Spielman, Shang-Hua Teng. stoc 2001: 296-305 [doi]

2000

Regression Depth and Center PointsNina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng. dcg, 23(3):305-323, 2000. [doi]

Sliver exudationSiu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng. JACM, 47(5):883-904, 2000. [doi]

Smoothing and cleaning up sliversHerbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua Teng, Alper Üngör, Noel Walkington. stoc 2000: 273-277 [doi]

Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, ProceedingsD. T. Lee, Shang-Hua Teng, editors, Volume 1969 of Lecture Notes in Computer Science, Springer, 2000.

Guest Editor s ForewordShang-Hua Teng. ijcga, 10(3):225, 2000.

Unstructured Mesh Generation: Theory, Practice, and PerspectivesShang-Hua Teng, Chi Wai Wong. ijcga, 10(3):227-266, 2000.

1999

Parallel Construction of Quadtrees and Quality TriangulationsMarshall W. Bern, David Eppstein, Shang-Hua Teng. ijcga, 9(6):517-532, 1999.

Fault Tolerance Properties of Pyramid NetworksFeng Cao, Ding-Zhu Du, D. Frank Hsu, Shang-Hua Teng. TC, 48(1):88-93, 1999. [doi]

Sliver ExudationSiu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng. compgeom 1999: 1-13 [doi]

Practical Human-Machine Identification over Insecure ChannelsXiang-Yang Li, Shang-Hua Teng. jco, 3(4):347-361, 1999.

Biting Ellipses to Generate Anisotropic MeshXiang-Yang Li, Shang-Hua Teng, Alper Üngör. pimrc 1999: 97-108 [doi]

Biting Spheres in 3DXiang-Yang Li, Shang-Hua Teng, Alper Üngör. pimrc 1999: 85-95 [doi]

Simultaneous Refinement and Coarsening for Adaptive MeshingXiang-Yang Li, Shang-Hua Teng, Alper Üngör. ewc, 15(3):280-291, 1999. [doi]

The Dynamic Parallel Complexity of Computational CircuitsGary L. Miller, Shang-Hua Teng. siamcomp, 28(5):1664-1688, 1999.

Optimal Coarsening of Unstructured MeshesGary L. Miller, Dafna Talmor, Shang-Hua Teng. jal, 31(1):29-65, 1999.

Data Generation for Geometric Algorithms on Non-Uniform DistributionsGary L. Miller, Dafna Talmor, Shang-Hua Teng. ijcga, 9(6):577, 1999.

Low Energy and Mutually Distant SamplingShang-Hua Teng. jal, 30(1):52-67, 1999.

Collaborative Web Crawling: Information Gathering/Processing over InternetShang-Hua Teng, Qi Lu, Matthias Eichstaedt, Daniel Alexander Ford, Tobin J. Lehman. hicss 1999: [doi]

Efficient Large-Scale Access Control for Internet/Intranet Information SystemsShang-Hua Teng, Qi Lu. hicss 1999: [doi]

1998

Parallel Profile Matching for Large Scale WebcastingMatthias Eichstaedt, Qi Lu, Shang-Hua Teng. irregular 1998: 17-28

Optimal On-Line Scheduling of Parallel Jobs with DependenciesAnja Feldmann, Ming-Yang Kao, Jiri Sgall, Shang-Hua Teng. jco, 1(4):393-411, 1998.

Solving Irregularly Structured Problems in Parallel, 5th International Symposium, IRREGULAR 98, Berkeley, California, USA, August 9-11, 1998, ProceedingsAfonso Ferreira, José D. P. Rolim, Horst D. Simon, Shang-Hua Teng, editors, Volume 1457 of Lecture Notes in Computer Science, Springer, 1998.

Simple and Efficient Graph Compression Schemes for Dense and Complement GraphsMing-Yang Kao, Neill Occhiogrosso, Shang-Hua Teng. jco, 2(4):351-359, 1998.

Min-Max-Boundary Domain DecompositionMarcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng. cocoon 1998: 137-146 [doi]

Simultaneous Refinement and Coarsening: Adaptive Meshing with Moving BoundariesXiang-Yang Li, Shang-Hua Teng, Alper Üngör. pimrc 1998: 201-210 [doi]

Dynamic Load Balancing for Parallel Adaptive Mesh RefinementXiang-Yang Li, Shang-Hua Teng. irregular 1998: 144-155

Combinatorial aspects of geometric graphsShang-Hua Teng. comgeo, 9(4):277-287, 1998.

1997

PreviousNext