dblp.uni-trier.dewww.uni-trier.de

Shang-Hua Teng Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
148EEMaria-Florina Balcan, Heiko Röglin, Shang-Hua Teng: Agnostic Clustering. ALT 2009: 384-398
147EEWei Chen, Christian Sommer, Shang-Hua Teng, Yajun Wang: Compact Routing in Power-Law Graphs. DISC 2009: 379-391
146EEXiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhang, Jiajie Zhu: Bounded Budget Betweenness Centrality Game for Strategic Network Formations. ESA 2009: 227-238
145EEWei 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
144EEXi 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)
143EEShiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng: Reducibility Among Fractional Stability Problems CoRR abs/0904.1435: (2009)
142EEXi 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)
141EEDaniel A. Spielman, Shang-Hua Teng: Smoothed analysis: an attempt to explain the behavior of algorithms in practice. Commun. ACM 52(10): 76-84 (2009)
140EEXi Chen, Xiaotie Deng, Shang-Hua Teng: Settling the complexity of computing two-player Nash equilibria. J. ACM 56(3): (2009)
139EEYingchao 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)
138EEXi Chen, Li-Sha Huang, Shang-Hua Teng: Market equilibria with hybrid linear-Leontief utilities. Theor. Comput. Sci. 410(17): 1573-1580 (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
136EEReid 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
135EEXi Chen, Xiaoming Sun, Shang-Hua Teng: Quantum Separation of Local Search and Fixed Point Computation. COCOON 2008: 170-179
134EEYingchao Zhao, Wei Chen, Shang-Hua Teng: The Isolation Game: A Game of Distances. ISAAC 2008: 148-158
133EEReid 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
132EENikolaos 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
131EEFeifei Li, Marios Hadjieleftheriou, George Kollios, Dihan Cheng, Shang-Hua Teng: Trip Planning Queries in Road Network Databases. Encyclopedia of GIS 2008: 1176-1181
130EENikolaos 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)
129EEDaniel A. Spielman, Shang-Hua Teng: Spectral Sparsification of Graphs CoRR abs/0808.4134: (2008)
128EEDaniel 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)
127EELaura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng: Preference Games and Personalized Equilibria, with Applications to Fractional BGP CoRR abs/0812.0598: (2008)
126EEAdam Tauman Kalai, Shang-Hua Teng: Decision trees are PAC-learnable from most product distributions: a smoothed analysis CoRR abs/0812.0933: (2008)
125EEMichael 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
123EEShang-Hua Teng: Game and Market Equilibria: Computation, Approximation, and Smoothed Analysis. AAIM 2007: 424
122EELi-Sha Huang, Shang-Hua Teng: On the Approximation and Smoothed Complexity of Leontief Market Equilibria. FAW 2007: 96-107
121EEXi Chen, Shang-Hua Teng: Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation. FOCS 2007: 124-134
120EEMartin 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
119EEXi Chen, Shang-Hua Teng, Paul Valiant: The approximation complexity of win-lose games. SODA 2007: 159-168
118EEYingchao Zhao, Shang-Hua Teng: Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces. TAMC 2007: 554-565
117EEReid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng: Local Computation of PageRank Contributions. WAW 2007: 150-165
116EEKyle W. Burke, Shang-Hua Teng: A PSPACE-complete Sperner Triangle Game. WINE 2007: 445-456
115EEShang-Hua Teng, Frances F. Yao: k-Nearest-Neighbor Clustering and Percolation Theory. Algorithmica 49(3): 192-211 (2007)
114EEXi Chen, Xiaotie Deng, Shang-Hua Teng: Settling the Complexity of Computing Two-Player Nash Equilibria CoRR abs/0704.1678: (2007)
113EEMichael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang: Optimal Cache-Oblivious Mesh Layouts CoRR abs/0705.1033: (2007)
112EENikolaos Laoutaris, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng: A bounded-degree network formation game CoRR abs/cs/0701071: (2007)
111EEXi Chen, Shang-Hua Teng: Paths Beyond Local Search: A Nearly Tight Bound for Randomized Fixed-Point Computation CoRR abs/cs/0702088: (2007)
110EEKyle W. Burke, Shang-Hua Teng: Games on the Sperner Triangle CoRR abs/cs/0702153: (2007)
109EEDaniel 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
108EEKebin Wang, Shang-Hua Teng: Geometric Separator for d-Dimensional Ball Graphs. CCCG 2006
107EEXi Chen, Xiaotie Deng, Shang-Hua Teng: Computing Nash Equilibria: Approximation and Smoothed Complexity. FOCS 2006: 603-612
106EEXi Chen, Xiaotie Deng, Shang-Hua Teng: Sparse Games Are Hard. WINE 2006: 262-273
105EEPinyan Lu, Shang-Hua Teng, Changyuan Yu: Truthful Auctions with Optimal Profit. WINE 2006: 27-36
104EEXi Chen, Li-Sha Huang, Shang-Hua Teng: Market Equilibria with Hybrid Linear-Leontief Utilities. WINE 2006: 274-285
103EEJin 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)
102EEXi Chen, Xiaotie Deng, Shang-Hua Teng: Computing Nash Equilibria: Approximation and Smoothed Complexity CoRR abs/cs/0602043: (2006)
101EELi-Sha Huang, Shang-Hua Teng: On the Approximation and Smoothed Complexity of Leontief Market Equilibria CoRR abs/cs/0602090: (2006)
100EEDaniel A. Spielman, Shang-Hua Teng: Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems CoRR abs/cs/0607105: (2006)
99EEXi Chen, Xiaotie Deng, Shang-Hua Teng: Computing Nash Equilibria: Approximation and Smoothed Complexity. Electronic Colloquium on Computational Complexity (ECCC) 13(023): (2006)
98EELi-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
97EEShang-Hua Teng: Smoothed Analysis of Algorithms and Heuristics. COCOON 2005: 10-11
96EEFeifei Li, Dihan Cheng, Marios Hadjieleftheriou, George Kollios, Shang-Hua Teng: On Trip Planning Queries in Spatial Databases. SSTD 2005: 273-290
95EEMichael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng: Lower-stretch spanning trees. STOC 2005: 494-503
2004
94EEDaniel A. Spielman, Shang-Hua Teng, Alper Üngör: Parallel Delaunay Refinement with Off-Centers. Euro-Par 2004: 812-819
93EEDaniel A. Spielman, Shang-Hua Teng, Alper Üngör: Time complexity of practical parallel steiner point insertion algorithms. SPAA 2004: 267-268
92EEDaniel A. Spielman, Shang-Hua Teng: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. STOC 2004: 81-90
91EEMichael Elkin, Daniel A. Spielman, Shang-Hua Teng: Lower-Stretch Spanning Trees CoRR cs.DS/0411064: (2004)
90EEDaniel 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
89EEDaniel A. Spielman, Shang-Hua Teng: Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time 0(m1.31). FOCS 2003: 416-427
88EEDaniel A. Spielman, Shang-Hua Teng: Smoothed Analysis (Motivation and Discrete Models). WADS 2003: 256-270
87EEDaniel A. Spielman, Shang-Hua Teng: Smoothed Analysis of Interior-Point Algorithms: Termination CoRR cs.DS/0301019: (2003)
86EEJohn Dunagan, Daniel A. Spielman, Shang-Hua Teng: Smoothed Analysis of Interior-Point Algorithms: Condition Number CoRR cs.DS/0302011: (2003)
85EEDaniel A. Spielman, Shang-Hua Teng: Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time O(m1.31) CoRR cs.DS/0310036: (2003)
84EEDaniel A. Spielman, Shang-Hua Teng: Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems CoRR cs.DS/0310051: (2003)
83EEArvind Sankar, Daniel A. Spielman, Shang-Hua Teng: Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices CoRR cs.NA/0310022: (2003)
2002
82EEDaniel A. Spielman, Shang-Hua Teng, Alper Üngör: Parallel Delaunay Refinement: Algorithms And Analyses. IMR 2002: 205-217
81EEDaniel A. Spielman, Shang-Hua Teng, Alper Üngör: Parallel Delaunay Refinement: Algorithms and Analyses CoRR cs.CG/0207063: (2002)
80EEShang-Hua Teng: Guest Editor's Foreward. Theory Comput. Syst. 35(3): 249 (2002)
2001
79EEXiang-Yang Li, Shang-Hua Teng: Generating well-shaped Delaunay meshed in 3D. SODA 2001: 28-37
78EEDaniel A. Spielman, Shang-Hua Teng: Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. STOC 2001: 296-305
77EEDaniel A. Spielman, Shang-Hua Teng: Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time CoRR cs.DS/0111050: (2001)
76EEMarcos 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
74EEHerbert 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
73EENina 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)
70EESiu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng: Sliver exudation. J. ACM 47(5): 883-904 (2000)
1999
69EEShang-Hua Teng, Qi Lu, Matthias Eichstaedt, Daniel Alexander Ford, Tobin J. Lehman: Collaborative Web Crawling: Information Gathering/Processing over Internet. HICSS 1999
68EEShang-Hua Teng, Qi Lu: Efficient Large-Scale Access Control for Internet/Intranet Information Systems. HICSS 1999
67EEXiang-Yang Li, Shang-Hua Teng, Alper Üngör: Biting Spheres in 3D. IMR 1999: 85-95
66EEXiang-Yang Li, Shang-Hua Teng, Alper Üngör: Biting Ellipses to Generate Anisotropic Mesh. IMR 1999: 97-108
65EESiu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng: Sliver Exudation. Symposium on Computational Geometry 1999: 1-13
64EEXiang-Yang Li, Shang-Hua Teng, Alper Üngör: Simultaneous Refinement and Coarsening for Adaptive Meshing. Eng. Comput. (Lond.) 15(3): 280-291 (1999)
63EEFeng 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
55EEMarcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng: Min-Max-Boundary Domain Decomposition. COCOON 1998: 137-146
54EEXiang-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
51EENina 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)
40EEGary 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
35EEDaniel 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
33EEJohn R. Gilbert, Gary L. Miller, Shang-Hua Teng: Geometric mesh partitioning: implementation and experiments. IPPS 1995: 418-427
32EEGary 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
31EESiddhartha 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)
27EEShang-Hua Teng: Independent Sets Versus Perfect Matchings. Theor. Comput. Sci. 145(1&2): 381-390 (1995)
1994
26EEMing-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
18EEAnja Feldmann, Ming-Yang Kao, Jiri Sgall, Shang-Hua Teng: Optimal online scheduling of parallel jobs with dependencies. STOC 1993: 642-651
17EEKenneth 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
16EEDavid 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
12EEAlan M. Frieze, Gary L. Miller, Shang-Hua Teng: Separator Based Parallel Divide and Conquer in Computational Geometry. SPAA 1992: 420-429
1991
11EEShang-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
5EEMikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng: Constructing Trees in Parallel. SPAA 1989: 421-431
1988
4EEMing-Deh A. Huang, Shang-Hua Teng: A Universal Problem in Secure and Verifiable Distributed Computation. CRYPTO 1988: 336-352
3EEMing-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)

Coauthor Index

1Nina Amenta [51] [73]
2Reid Andersen [117] [133] [136]
3Mikhail J. Atallah [5]
4Maria-Florina Balcan (Maria-Florina Popa) [148]
5Hujun Bao [103]
6Xiaohui Bei [146]
7Michael A. Bender [113]
8Marshall W. Bern [15] [51] [62] [73]
9Christian Borgs [117] [133] [136]
10Kyle W. Burke [110] [116]
11Feng Cao [46] [63]
12Siddhartha Chatterjee [13] [19] [20] [28] [31]
13Jennifer T. Chayes [117] [133] [136]
14Wei Chen [134] [145] [146] [147]
15Xi Chen [99] [102] [104] [106] [107] [111] [114] [119] [121] [135] [138] [140] [142] [144]
16Dihan Cheng [96] [131]
17Siu-Wing Cheng [65] [70]
18Kenneth L. Clarkson [17] [34]
19Decheng Dai [144]
20Xiaotie Deng [99] [102] [106] [107] [114] [140]
21Tamal K. Dey [65] [70]
22Martin Dietzfelbinger [120] [124]
23Ding-Zhu Du [46] [63]
24Ye Du [144]
25John Dunagan [86]
26Herbert Edelsbrunner [65] [70] [74]
27Matthias Eichstaedt [52] [69]
28Michael Elkin [91] [95] [125]
29Yuval Emek [95] [125]
30David Eppstein [15] [16] [17] [29] [34] [51] [62] [73]
31Michael A. Facello [65] [70]
32Anja Feldmann [10] [18] [22] [49]
33Afonso Ferreira [56]
34Daniel Alexander Ford [69]
35Alan M. Frieze [12] [24]
36John R. Gilbert [13] [19] [20] [28] [31] [33]
37Keith D. Gremban [25] [39]
38Baining Guo [103]
39Marios Hadjieleftheriou [96] [131]
40John E. Hopcroft [117] [133] [136]
41D. Frank Hsu [63]
42Y. Charlie Hu [43] [44] [45]
43Jin Huang [103]
44Li-Sha Huang [98] [101] [104] [122] [138]
45Ming-Deh A. Huang [3] [4] [7]
46Kamal Jain [136]
47S. Lennart Johnsson [43] [44] [45]
48Adam Tauman Kalai (Adam Kalai) [126]
49Ming-Yang Kao [14] [18] [26] [30] [48] [49]
50Shiva Kintali (Shiva Prasad Kintali) [143]
51Marcos A. Kiwi [55] [76]
52George Kollios [96] [131]
53S. Rao Kosaraju [5]
54Bradley C. Kuszmaul [113]
55Nikolaos Laoutaris [112] [130] [132]
56Lawrence L. Larmore [5]
57D. T. Lee (Der-Tsai Lee) [75]
58Tobin J. Lehman [69]
59Feifei Li [96] [131]
60Xiang-Yang Li [53] [54] [58] [64] [66] [67] [74] [79]
61Xinguo Liu [103]
62Fred J. E. Long [19] [28]
63Pinyan Lu [105]
64Qi Lu [52] [68] [69]
65Gary L. Miller [2] [5] [9] [12] [16] [17] [25] [29] [32] [33] [34] [39] [40] [41] [42] [57] [59] [61] [74]
66Vahab S. Mirrokni (Seyed Vahab Mirrokni) [117] [133] [136]
67Neill Occhiogrosso [48]
68Laura J. Poplawski [127] [130] [132] [143]
69Rajmohan Rajaraman [112] [127] [130] [132] [143]
70Heiko Röglin [148]
71José D. P. Rolim [56]
72Arvind Sankar [83]
73Robert Schneider [13]
74Robert Schreiber [19] [20] [28] [31]
75Jiri Sgall [10] [18] [22] [49]
76Xiaohan Shi [103]
77Harry Shum (Heung-Yeung Shum) [103]
78Horst D. Simon [56]
79Christian Sommer [147]
80Daniel A. Spielman [35] [36] [55] [76] [77] [78] [81] [82] [83] [84] [85] [86] [87] [88] [89] [90] [91] [92] [93] [94] [95] [100] [109] [125] [128] [129] [141]
81Andreas Stathopoulos [74]
82Carl Sturtivant [17] [34]
83Xiaoming Sun [135]
84Ravi Sundaram [112] [127] [130] [132] [143]
85Dafna Talmor [32] [42] [59] [61] [74]
86William P. Thurston [40]
87Kentaro Toyama [14] [30]
88Alper Üngör [54] [64] [66] [67] [74] [81] [82] [93] [94] [109]
89Eli Upfal [120] [124]
90Paul Valiant [119]
91Stephen A. Vavasis [9] [40]
92Berthold Vöcking [120] [124]
93Noel Walkington [32] [74]
94Bin Wang [1]
95Kebin Wang [108] [113]
96Yajun Wang [145] [147]
97Li-Yi Wei [103]
98Chi Wai Wong [71]
99F. Frances Yao (Frances F. Yao, Foong Frances Yao) [21] [38] [115]
100Changyuan Yu [105]
101Jialin Zhang [146]
102Yingchao Zhao [118] [134] [139]
103Kun Zhou [103]
104Yuan Zhou [145]
105Jiajie Zhu [146]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)