 | 2010 |
|---|
| 157 |       | Xi Chen,
Xiaoming Sun,
Shang-Hua Teng:
Quantum Separation of Local Search and Fixed Point Computation.
Algorithmica 56(3): 364-382 (2010) |
| 2009 |
|---|
| 156 | | Maria-Florina Balcan,
Heiko Röglin,
Shang-Hua Teng:
Agnostic Clustering.
ALT 2009: 384-398 |
| 155 | | Wei Chen,
Christian Sommer,
Shang-Hua Teng,
Yajun Wang:
Compact Routing in Power-Law Graphs.
DISC 2009: 379-391 |
| 154 | | Xiaohui Bei,
Wei Chen,
Shang-Hua Teng,
Jialin Zhang,
Jiajie Zhu:
Bounded Budget Betweenness Centrality Game for Strategic Network Formations.
ESA 2009: 227-238 |
| 153 | | Wei Chen,
Shang-Hua Teng,
Yajun Wang,
Yuan Zhou:
On the alpha-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games.
FAW 2009: 63-73 |
| 152 | | Xi Chen,
Decheng Dai,
Ye Du,
Shang-Hua Teng:
Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities.
FOCS 2009: 273-282 |
| 151 | | Shiva Kintali,
Laura J. Poplawski,
Rajmohan Rajaraman,
Ravi Sundaram,
Shang-Hua Teng:
Reducibility among Fractional Stability Problems.
FOCS 2009: 283-292 |
| 150 | | Adam Tauman Kalai,
Alex Samorodnitsky,
Shang-Hua Teng:
Learning and Smoothed Analysis.
FOCS 2009: 395-404 |
| 149 | | Heiko Röglin,
Shang-Hua Teng:
Smoothed Analysis of Multiobjective Optimization.
FOCS 2009: 681-690 |
| 148 | | Jonathan A. Kelner,
James R. Lee,
Gregory N. Price,
Shang-Hua Teng:
Higher Eigenvalues of Graphs.
FOCS 2009: 735-744 |
| 147 | | Xi Chen,
Shang-Hua Teng:
Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria.
ISAAC 2009: 647-656 |
| 146 | | Martin Hoefer,
Vahab S. Mirrokni,
Heiko Röglin,
Shang-Hua Teng:
Competitive Routing over Time.
WINE 2009: 18-29 |
| 145 | | Xi Chen,
Decheng Dai,
Ye Du,
Shang-Hua Teng:
Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities
CoRR abs/0904.0644: (2009) |
| 144 | | Shiva Kintali,
Laura J. Poplawski,
Rajmohan Rajaraman,
Ravi Sundaram,
Shang-Hua Teng:
Reducibility Among Fractional Stability Problems
CoRR abs/0904.1435: (2009) |
| 143 | | Xi Chen,
Shang-Hua Teng:
Spending is not Easier than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria
CoRR abs/0907.4130: (2009) |
| 142 | | Daniel A. Spielman,
Shang-Hua Teng:
Smoothed analysis: an attempt to explain the behavior of algorithms in practice.
Commun. ACM 52(10): 76-84 (2009) |
| 141 | | Xi Chen,
Xiaotie Deng,
Shang-Hua Teng:
Settling the complexity of computing two-player Nash equilibria.
J. ACM 56(3): (2009) |
| 140 | | Yingchao Zhao,
Shang-Hua Teng:
Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces.
Theor. Comput. Sci. 410(11): 1081-1092 (2009) |
| 139 | | Xi Chen,
Li-Sha Huang,
Shang-Hua Teng:
Market equilibria with hybrid linear-Leontief utilities.
Theor. Comput. Sci. 410(17): 1573-1580 (2009) |
| 138 | | Yingchao Zhao,
Wei Chen,
Shang-Hua Teng:
The isolation game: A game of distances.
Theor. Comput. Sci. 410(47-49): 4905-4919 (2009) |
| 2008 |
|---|
| 137 |  | Shang-Hua Teng:
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008
SIAM 2008 |
| 136 | | Reid Andersen,
Christian Borgs,
Jennifer T. Chayes,
John E. Hopcroft,
Kamal Jain,
Vahab S. Mirrokni,
Shang-Hua Teng:
Robust PageRank and locally computable spam detection features.
AIRWeb 2008: 69-76 |
| 135 | | Xi Chen,
Xiaoming Sun,
Shang-Hua Teng:
Quantum Separation of Local Search and Fixed Point Computation.
COCOON 2008: 170-179 |
| 134 | | Yingchao Zhao,
Wei Chen,
Shang-Hua Teng:
The Isolation Game: A Game of Distances.
ISAAC 2008: 148-158 |
| 133 | | Reid Andersen,
Christian Borgs,
Jennifer T. Chayes,
John E. Hopcroft,
Vahab S. Mirrokni,
Shang-Hua Teng:
On the Stability of Web Crawling and Web Search.
ISAAC 2008: 680-691 |
| 132 | | Nikolaos Laoutaris,
Laura J. Poplawski,
Rajmohan Rajaraman,
Ravi Sundaram,
Shang-Hua Teng:
Bounded budget connection (BBC) games or how to make friends and influence people, on a budget.
PODC 2008: 165-174 |
| 131 | | Feifei Li,
Marios Hadjieleftheriou,
George Kollios,
Dihan Cheng,
Shang-Hua Teng:
Trip Planning Queries in Road Network Databases.
Encyclopedia of GIS 2008: 1176-1181 |
| 130 | | Nikolaos Laoutaris,
Laura J. Poplawski,
Rajmohan Rajaraman,
Ravi Sundaram,
Shang-Hua Teng:
Bounded Budget Connection (BBC) Games or How to make friends and influence people, on a budget
CoRR abs/0806.1727: (2008) |
| 129 | | Daniel A. Spielman,
Shang-Hua Teng:
Spectral Sparsification of Graphs
CoRR abs/0808.4134: (2008) |
| 128 | | Daniel A. Spielman,
Shang-Hua Teng:
A Local Clustering Algorithm for Massive Graphs and its Application to Nearly-Linear Time Graph Partitioning
CoRR abs/0809.3232: (2008) |
| 127 | | Laura J. Poplawski,
Rajmohan Rajaraman,
Ravi Sundaram,
Shang-Hua Teng:
Preference Games and Personalized Equilibria, with Applications to Fractional BGP
CoRR abs/0812.0598: (2008) |
| 126 | | Adam Tauman Kalai,
Shang-Hua Teng:
Decision trees are PAC-learnable from most product distributions: a smoothed analysis
CoRR abs/0812.0933: (2008) |
| 125 | | Michael Elkin,
Yuval Emek,
Daniel A. Spielman,
Shang-Hua Teng:
Lower-Stretch Spanning Trees.
SIAM J. Comput. 38(2): 608-628 (2008) |
| 2007 |
|---|
| 124 | | Martin Dietzfelbinger,
Shang-Hua Teng,
Eli Upfal,
Berthold Vöcking:
Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 |
| 123 | | Shang-Hua Teng:
Game and Market Equilibria: Computation, Approximation, and Smoothed Analysis.
AAIM 2007: 424 |
| 122 | | Li-Sha Huang,
Shang-Hua Teng:
On the Approximation and Smoothed Complexity of Leontief Market Equilibria.
FAW 2007: 96-107 |
| 121 | | Xi Chen,
Shang-Hua Teng:
Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation.
FOCS 2007: 124-134 |
| 120 | | Martin Dietzfelbinger,
Shang-Hua Teng,
Eli Upfal,
Berthold Vöcking:
07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms.
Probabilistic Methods in the Design and Analysis of Algorithms 2007 |
| 119 | | Xi Chen,
Shang-Hua Teng,
Paul Valiant:
The approximation complexity of win-lose games.
SODA 2007: 159-168 |
| 118 | | Yingchao Zhao,
Shang-Hua Teng:
Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces.
TAMC 2007: 554-565 |
| 117 | | Reid Andersen,
Christian Borgs,
Jennifer T. Chayes,
John E. Hopcroft,
Vahab S. Mirrokni,
Shang-Hua Teng:
Local Computation of PageRank Contributions.
WAW 2007: 150-165 |
| 116 | | Kyle W. Burke,
Shang-Hua Teng:
A PSPACE-complete Sperner Triangle Game.
WINE 2007: 445-456 |
| 115 | | Shang-Hua Teng,
Frances F. Yao:
k-Nearest-Neighbor Clustering and Percolation Theory.
Algorithmica 49(3): 192-211 (2007) |
| 114 | | Xi Chen,
Xiaotie Deng,
Shang-Hua Teng:
Settling the Complexity of Computing Two-Player Nash Equilibria
CoRR abs/0704.1678: (2007) |
| 113 | | Michael A. Bender,
Bradley C. Kuszmaul,
Shang-Hua Teng,
Kebin Wang:
Optimal Cache-Oblivious Mesh Layouts
CoRR abs/0705.1033: (2007) |
| 112 | | Nikolaos Laoutaris,
Rajmohan Rajaraman,
Ravi Sundaram,
Shang-Hua Teng:
A bounded-degree network formation game
CoRR abs/cs/0701071: (2007) |
| 111 | | Xi Chen,
Shang-Hua Teng:
Paths Beyond Local Search: A Nearly Tight Bound for Randomized Fixed-Point Computation
CoRR abs/cs/0702088: (2007) |
| 110 | | Kyle W. Burke,
Shang-Hua Teng:
Games on the Sperner Triangle
CoRR abs/cs/0702153: (2007) |
| 109 | | Daniel A. Spielman,
Shang-Hua Teng,
Alper Üngör:
Parallel Delaunay Refinement: Algorithms and Analyses.
Int. J. Comput. Geometry Appl. 17(1): 1-30 (2007) |
| 2006 |
|---|
| 108 | | Kebin Wang,
Shang-Hua Teng:
Geometric Separator for d-Dimensional Ball Graphs.
CCCG 2006 |
| 107 | | Xi Chen,
Xiaotie Deng,
Shang-Hua Teng:
Computing Nash Equilibria: Approximation and Smoothed Complexity.
FOCS 2006: 603-612 |
| 106 | | Xi Chen,
Xiaotie Deng,
Shang-Hua Teng:
Sparse Games Are Hard.
WINE 2006: 262-273 |
| 105 | | Pinyan Lu,
Shang-Hua Teng,
Changyuan Yu:
Truthful Auctions with Optimal Profit.
WINE 2006: 27-36 |
| 104 | | Xi Chen,
Li-Sha Huang,
Shang-Hua Teng:
Market Equilibria with Hybrid Linear-Leontief Utilities.
WINE 2006: 274-285 |
| 103 | | Jin Huang,
Xiaohan Shi,
Xinguo Liu,
Kun Zhou,
Li-Yi Wei,
Shang-Hua Teng,
Hujun Bao,
Baining Guo,
Heung-Yeung Shum:
Subspace gradient domain mesh deformation.
ACM Trans. Graph. 25(3): 1126-1134 (2006) |
| 102 | | Xi Chen,
Xiaotie Deng,
Shang-Hua Teng:
Computing Nash Equilibria: Approximation and Smoothed Complexity
CoRR abs/cs/0602043: (2006) |
| 101 | | Li-Sha Huang,
Shang-Hua Teng:
On the Approximation and Smoothed Complexity of Leontief Market Equilibria
CoRR abs/cs/0602090: (2006) |
| 100 | | Daniel A. Spielman,
Shang-Hua Teng:
Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
CoRR abs/cs/0607105: (2006) |
| 99 | | Xi Chen,
Xiaotie Deng,
Shang-Hua Teng:
Computing Nash Equilibria: Approximation and Smoothed Complexity.
Electronic Colloquium on Computational Complexity (ECCC) 13(023): (2006) |
| 98 | | Li-Sha Huang,
Shang-Hua Teng:
On the Approximation and Smoothed Complexity of Leontief Market Equilibria.
Electronic Colloquium on Computational Complexity (ECCC) 13(031): (2006) |
| 2005 |
|---|
| 97 | | Shang-Hua Teng:
Smoothed Analysis of Algorithms and Heuristics.
COCOON 2005: 10-11 |
| 96 | | Feifei Li,
Dihan Cheng,
Marios Hadjieleftheriou,
George Kollios,
Shang-Hua Teng:
On Trip Planning Queries in Spatial Databases.
SSTD 2005: 273-290 |
| 95 | | Michael Elkin,
Yuval Emek,
Daniel A. Spielman,
Shang-Hua Teng:
Lower-stretch spanning trees.
STOC 2005: 494-503 |
| 2004 |
|---|
| 94 | | Daniel A. Spielman,
Shang-Hua Teng,
Alper Üngör:
Parallel Delaunay Refinement with Off-Centers.
Euro-Par 2004: 812-819 |
| 93 | | Daniel A. Spielman,
Shang-Hua Teng,
Alper Üngör:
Time complexity of practical parallel steiner point insertion algorithms.
SPAA 2004: 267-268 |
| 92 | | Daniel A. Spielman,
Shang-Hua Teng:
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems.
STOC 2004: 81-90 |
| 91 | | Michael Elkin,
Daniel A. Spielman,
Shang-Hua Teng:
Lower-Stretch Spanning Trees
CoRR cs.DS/0411064: (2004) |
| 90 | | Daniel A. Spielman,
Shang-Hua Teng:
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time.
J. ACM 51(3): 385-463 (2004) |
| 2003 |
|---|
| 89 | | Daniel A. Spielman,
Shang-Hua Teng:
Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time 0(m1.31).
FOCS 2003: 416-427 |
| 88 | | Daniel A. Spielman,
Shang-Hua Teng:
Smoothed Analysis (Motivation and Discrete Models).
WADS 2003: 256-270 |
| 87 | | Daniel A. Spielman,
Shang-Hua Teng:
Smoothed Analysis of Interior-Point Algorithms: Termination
CoRR cs.DS/0301019: (2003) |
| 86 | | John Dunagan,
Daniel A. Spielman,
Shang-Hua Teng:
Smoothed Analysis of Interior-Point Algorithms: Condition Number
CoRR cs.DS/0302011: (2003) |
| 85 | | Daniel A. Spielman,
Shang-Hua Teng:
Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time O(m1.31)
CoRR cs.DS/0310036: (2003) |
| 84 | | Daniel A. Spielman,
Shang-Hua Teng:
Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems
CoRR cs.DS/0310051: (2003) |
| 83 | | Arvind Sankar,
Daniel A. Spielman,
Shang-Hua Teng:
Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
CoRR cs.NA/0310022: (2003) |
| 2002 |
|---|
| 82 | | Daniel A. Spielman,
Shang-Hua Teng,
Alper Üngör:
Parallel Delaunay Refinement: Algorithms And Analyses.
IMR 2002: 205-217 |
| 81 | | Daniel A. Spielman,
Shang-Hua Teng,
Alper Üngör:
Parallel Delaunay Refinement: Algorithms and Analyses
CoRR cs.CG/0207063: (2002) |
| 80 | | Shang-Hua Teng:
Guest Editor's Foreward.
Theory Comput. Syst. 35(3): 249 (2002) |
| 2001 |
|---|
| 79 | | Xiang-Yang Li,
Shang-Hua Teng:
Generating well-shaped Delaunay meshed in 3D.
SODA 2001: 28-37 |
| 78 | | Daniel A. Spielman,
Shang-Hua Teng:
Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time.
STOC 2001: 296-305 |
| 77 | | Daniel A. Spielman,
Shang-Hua Teng:
Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time
CoRR cs.DS/0111050: (2001) |
| 76 | | Marcos A. Kiwi,
Daniel A. Spielman,
Shang-Hua Teng:
Min-max-boundary domain decomposition.
Theor. Comput. Sci. 261(2): 253-266 (2001) |
| 2000 |
|---|
| 75 | | D. T. Lee,
Shang-Hua Teng:
Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings
Springer 2000 |
| 74 | | Herbert Edelsbrunner,
Xiang-Yang Li,
Gary L. Miller,
Andreas Stathopoulos,
Dafna Talmor,
Shang-Hua Teng,
Alper Üngör,
Noel Walkington:
Smoothing and cleaning up slivers.
STOC 2000: 273-277 |
| 73 | | Nina Amenta,
Marshall W. Bern,
David Eppstein,
Shang-Hua Teng:
Regression Depth and Center Points.
Discrete & Computational Geometry 23(3): 305-323 (2000) |
| 72 | | Shang-Hua Teng:
Guest Editor's Foreword.
Int. J. Comput. Geometry Appl. 10(3): 225 (2000) |
| 71 | | Shang-Hua Teng,
Chi Wai Wong:
Unstructured Mesh Generation: Theory, Practice, and Perspectives.
Int. J. Comput. Geometry Appl. 10(3): 227-266 (2000) |
| 70 | | Siu-Wing Cheng,
Tamal K. Dey,
Herbert Edelsbrunner,
Michael A. Facello,
Shang-Hua Teng:
Sliver exudation.
J. ACM 47(5): 883-904 (2000) |
| 1999 |
|---|
| 69 | | Shang-Hua Teng,
Qi Lu,
Matthias Eichstaedt,
Daniel Alexander Ford,
Tobin J. Lehman:
Collaborative Web Crawling: Information Gathering/Processing over Internet.
HICSS 1999 |
| 68 | | Shang-Hua Teng,
Qi Lu:
Efficient Large-Scale Access Control for Internet/Intranet Information Systems.
HICSS 1999 |
| 67 | | Xiang-Yang Li,
Shang-Hua Teng,
Alper Üngör:
Biting Spheres in 3D.
IMR 1999: 85-95 |
| 66 | | Xiang-Yang Li,
Shang-Hua Teng,
Alper Üngör:
Biting Ellipses to Generate Anisotropic Mesh.
IMR 1999: 97-108 |
| 65 | | Siu-Wing Cheng,
Tamal K. Dey,
Herbert Edelsbrunner,
Michael A. Facello,
Shang-Hua Teng:
Sliver Exudation.
Symposium on Computational Geometry 1999: 1-13 |
| 64 | | Xiang-Yang Li,
Shang-Hua Teng,
Alper Üngör:
Simultaneous Refinement and Coarsening for Adaptive Meshing.
Eng. Comput. (Lond.) 15(3): 280-291 (1999) |
| 63 | | Feng Cao,
Ding-Zhu Du,
D. Frank Hsu,
Shang-Hua Teng:
Fault Tolerance Properties of Pyramid Networks.
IEEE Trans. Computers 48(1): 88-93 (1999) |
| 62 | | Marshall W. Bern,
David Eppstein,
Shang-Hua Teng:
Parallel Construction of Quadtrees and Quality Triangulations.
Int. J. Comput. Geometry Appl. 9(6): 517-532 (1999) |
| 61 | | Gary L. Miller,
Dafna Talmor,
Shang-Hua Teng:
Data Generation for Geometric Algorithms on Non-Uniform Distributions.
Int. J. Comput. Geometry Appl. 9(6): 577- (1999) |
| 60 | | Shang-Hua Teng:
Low Energy and Mutually Distant Sampling.
J. Algorithms 30(1): 52-67 (1999) |
| 59 | | Gary L. Miller,
Dafna Talmor,
Shang-Hua Teng:
Optimal Coarsening of Unstructured Meshes.
J. Algorithms 31(1): 29-65 (1999) |
| 58 | | Xiang-Yang Li,
Shang-Hua Teng:
Practical Human-Machine Identification over Insecure Channels.
J. Comb. Optim. 3(4): 347-361 (1999) |
| 57 | | Gary L. Miller,
Shang-Hua Teng:
The Dynamic Parallel Complexity of Computational Circuits.
SIAM J. Comput. 28(5): 1664-1688 (1999) |
| 1998 |
|---|
| 56 | | Afonso Ferreira,
José D. P. Rolim,
Horst D. Simon,
Shang-Hua Teng:
Solving Irregularly Structured Problems in Parallel, 5th International Symposium, IRREGULAR '98, Berkeley, California, USA, August 9-11, 1998, Proceedings
Springer 1998 |
| 55 | | Marcos A. Kiwi,
Daniel A. Spielman,
Shang-Hua Teng:
Min-Max-Boundary Domain Decomposition.
COCOON 1998: 137-146 |
| 54 | | Xiang-Yang Li,
Shang-Hua Teng,
Alper Üngör:
Simultaneous Refinement and Coarsening: Adaptive Meshing with Moving Boundaries.
IMR 1998: 201-210 |
| 53 | | Xiang-Yang Li,
Shang-Hua Teng:
Dynamic Load Balancing for Parallel Adaptive Mesh Refinement.
IRREGULAR 1998: 144-155 |
| 52 | | Matthias Eichstaedt,
Qi Lu,
Shang-Hua Teng:
Parallel Profile Matching for Large Scale Webcasting.
IRREGULAR 1998: 17-28 |
| 51 | | Nina Amenta,
Marshall W. Bern,
David Eppstein,
Shang-Hua Teng:
Regression Depth and Center Points
CoRR cs.CG/9809037: (1998) |
| 50 | | Shang-Hua Teng:
Combinatorial aspects of geometric graphs.
Comput. Geom. 9(4): 277-287 (1998) |
| 49 | | Anja Feldmann,
Ming-Yang Kao,
Jiri Sgall,
Shang-Hua Teng:
Optimal On-Line Scheduling of Parallel Jobs with Dependencies.
J. Comb. Optim. 1(4): 393-411 (1998) |
| 48 | | Ming-Yang Kao,
Neill Occhiogrosso,
Shang-Hua Teng:
Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs.
J. Comb. Optim. 2(4): 351-359 (1998) |
| 1997 |
|---|
| 47 | | Shang-Hua Teng:
Eigenvalues, Eigenvectors, and Graph Partitioning.
COCOON 1997: 515 |
| 46 | | Feng Cao,
Ding-Zhu Du,
Shang-Hua Teng:
Fault-tolerant Properties of Pyramid Network.
PDPTA 1997: 1690-1693 |
| 45 | | Y. Charlie Hu,
S. Lennart Johnsson,
Shang-Hua Teng:
High Performance FORTRAN for Highly Unstructured Problems.
PPOPP 1997: 13-24 |
| 44 | | Y. Charlie Hu,
S. Lennart Johnsson,
Shang-Hua Teng:
A Data-Parallel Adaptive N-body Method.
PPSC 1997 |
| 43 | | Y. Charlie Hu,
Shang-Hua Teng,
S. Lennart Johnsson:
A Data-Parallel Implementation of the Geometric Partitioning Algorithm.
PPSC 1997 |
| 42 | | Gary L. Miller,
Dafna Talmor,
Shang-Hua Teng:
Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes.
SODA 1997: 538-547 |
| 41 | | Gary L. Miller,
Shang-Hua Teng:
Tree-Based Parallel Algorithm Design.
Algorithmica 19(4): 369-389 (1997) |
| 40 | | Gary L. Miller,
Shang-Hua Teng,
William P. Thurston,
Stephen A. Vavasis:
Separators for sphere-packings and nearest neighbor graphs.
J. ACM 44(1): 1-29 (1997) |
| 39 | | Keith D. Gremban,
Gary L. Miller,
Shang-Hua Teng:
Moments of Inertia and Graph Separators.
J. Comb. Optim. 1(1): 79-104 (1997) |
| 38 | | Shang-Hua Teng,
F. Frances Yao:
Approximating Shortest Superstrings.
SIAM J. Comput. 26(2): 410-417 (1997) |
| 1996 |
|---|
| 37 | | Shang-Hua Teng:
Fast Separator Decomposition for Finite Element Meshes.
COCOON 1996: 189-198 |
| 36 | | Daniel A. Spielman,
Shang-Hua Teng:
Spectral Partitioning Works: Planar Graphs and Finite Element Meshes.
FOCS 1996: 96-105 |
| 35 | | Daniel A. Spielman,
Shang-Hua Teng:
Disk Packings and Planar Separators.
Symposium on Computational Geometry 1996: 349-358 |
| 34 | | Kenneth L. Clarkson,
David Eppstein,
Gary L. Miller,
Carl Sturtivant,
Shang-Hua Teng:
Approximating center points with iterative Radon points.
Int. J. Comput. Geometry Appl. 6(3): 357-377 (1996) |
| 1995 |
|---|
| 33 | | John R. Gilbert,
Gary L. Miller,
Shang-Hua Teng:
Geometric mesh partitioning: implementation and experiments.
IPPS 1995: 418-427 |
| 32 | | Gary L. Miller,
Dafna Talmor,
Shang-Hua Teng,
Noel Walkington:
A Delaunay based numerical method for three dimensions: generation, formulation, and partition.
STOC 1995: 683-692 |
| 31 | | Siddhartha Chatterjee,
John R. Gilbert,
Robert Schreiber,
Shang-Hua Teng:
Optimal Evaluation of Array Expressions on Massively Parallel Machines.
ACM Trans. Program. Lang. Syst. 17(1): 123-156 (1995) |
| 30 | | Ming-Yang Kao,
Shang-Hua Teng,
Kentaro Toyama:
An Optimal Parallel Algorithm for Planar Cycle Separators.
Algorithmica 14(5): 398-408 (1995) |
| 29 | | David Eppstein,
Gary L. Miller,
Shang-Hua Teng:
A Deterministic Linear Time Algorithm for Geometric Separators and its Applications.
Fundam. Inform. 22(4): 309-329 (1995) |
| 28 | | Siddhartha Chatterjee,
John R. Gilbert,
Fred J. E. Long,
Robert Schreiber,
Shang-Hua Teng:
Generating Local Address and Communication Sets for Data-Parallel Programs.
J. Parallel Distrib. Comput. 26(1): 72-84 (1995) |
| 27 | | Shang-Hua Teng:
Independent Sets Versus Perfect Matchings.
Theor. Comput. Sci. 145(1&2): 381-390 (1995) |
| 1994 |
|---|
| 26 | | Ming-Yang Kao,
Shang-Hua Teng:
Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs.
ISAAC 1994: 451-459 |
| 25 | | Keith D. Gremban,
Gary L. Miller,
Shang-Hua Teng:
Moments of Inertia and Graph Separators.
SODA 1994: 452-461 |
| 24 | | Alan M. Frieze,
Shang-Hua Teng:
On the Complexity of Computing the Diameter of a Polytope.
Computational Complexity 4: 207-219 (1994) |
| 23 | | Shang-Hua Teng:
Functional Inversion and Communication Complexity.
J. Cryptology 7(3): 153-170 (1994) |
| 22 | | Anja Feldmann,
Jiri Sgall,
Shang-Hua Teng:
Dynamic Scheduling on Parallel Machines.
Theor. Comput. Sci. 130(1): 49-72 (1994) |
| 1993 |
|---|
| 21 | | Shang-Hua Teng,
F. Frances Yao:
Approximating Shortest Superstrings
FOCS 1993: 158-165 |
| 20 | | Siddhartha Chatterjee,
John R. Gilbert,
Robert Schreiber,
Shang-Hua Teng:
Automatic Array Alignment in Data-Parallel Programs.
POPL 1993: 16-28 |
| 19 | | Siddhartha Chatterjee,
John R. Gilbert,
Fred J. E. Long,
Robert Schreiber,
Shang-Hua Teng:
Generating Local Address and Communication Sets for Data-Parallel Programs.
PPOPP 1993: 149-158 |
| 18 | | Anja Feldmann,
Ming-Yang Kao,
Jiri Sgall,
Shang-Hua Teng:
Optimal online scheduling of parallel jobs with dependencies.
STOC 1993: 642-651 |
| 17 | | Kenneth L. Clarkson,
David Eppstein,
Gary L. Miller,
Carl Sturtivant,
Shang-Hua Teng:
Approximating Center Points with Iterated Radon Points.
Symposium on Computational Geometry 1993: 91-98 |
| 16 | | David Eppstein,
Gary L. Miller,
Shang-Hua Teng:
A Deterministic Linear Time Algorithm for Geometric Separators and its Applications.
Symposium on Computational Geometry 1993: 99-108 |
| 15 | | Marshall W. Bern,
David Eppstein,
Shang-Hua Teng:
Parallel Construction of Quadtrees and Quality Triangulations.
WADS 1993: 188-199 |
| 14 | | Ming-Yang Kao,
Shang-Hua Teng,
Kentaro Toyama:
Improved Parallel Depth-First Search in Undirected Planar Graphs.
WADS 1993: 409-420 |
| 1992 |
|---|
| 13 | | Siddhartha Chatterjee,
John R. Gilbert,
Robert Schneider,
Shang-Hua Teng:
Optimal Evaluation of Array Expressions on Massively Parallel Machines (Extended Abstract).
SIGPLAN Workshop 1992: 68-71 |
| 12 | | Alan M. Frieze,
Gary L. Miller,
Shang-Hua Teng:
Separator Based Parallel Divide and Conquer in Computational Geometry.
SPAA 1992: 420-429 |
| 1991 |
|---|
| 11 | | Shang-Hua Teng:
Functional Inversion and Communication Complexity.
CRYPTO 1991: 232-241 |
| 10 | | Anja Feldmann,
Jiri Sgall,
Shang-Hua Teng:
Dynamic Scheduling on Parallel Machines
FOCS 1991: 111-120 |
| 9 | | Gary L. Miller,
Shang-Hua Teng,
Stephen A. Vavasis:
A Unified Geometric Approach to Graph Separators
FOCS 1991: 538-547 |
| 1990 |
|---|
| 8 | | Shang-Hua Teng:
Space Efficient Processor Identity Protocol.
Inf. Process. Lett. 34(3): 147-154 (1990) |
| 7 | | Ming-Deh A. Huang,
Shang-Hua Teng:
Security, Verifiability, and Universality in Distributed Computing.
J. Algorithms 11(3): 492-521 (1990) |
| 6 | | Shang-Hua Teng:
Adaptive Parallel Algorithms for Integral Knapsack Problems.
J. Parallel Distrib. Comput. 8(4): 400-406 (1990) |
| 1989 |
|---|
| 5 | | Mikhail J. Atallah,
S. Rao Kosaraju,
Lawrence L. Larmore,
Gary L. Miller,
Shang-Hua Teng:
Constructing Trees in Parallel.
SPAA 1989: 421-431 |
| 1988 |
|---|
| 4 | | Ming-Deh A. Huang,
Shang-Hua Teng:
A Universal Problem in Secure and Verifiable Distributed Computation.
CRYPTO 1988: 336-352 |
| 3 | | Ming-Deh A. Huang,
Shang-Hua Teng:
Secure and Verifiable Schemes for Election and General Distributed Computing Problems.
PODC 1988: 182-196 |
| 1987 |
|---|
| 2 | | Gary L. Miller,
Shang-Hua Teng:
Dynamic Parallel Complexity of Computational Circuits
STOC 1987: 254-263 |
| 1 | | Shang-Hua Teng,
Bin Wang:
Parallel Algorithms for Message Decomposition.
J. Parallel Distrib. Comput. 4(3): 231-249 (1987) |
