Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Shang-Hua Teng
2010 – today
- 2013
[j61]Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava, Shang-Hua Teng: Spectral sparsification of graphs: theory and algorithms. Commun. ACM 56(8): 87-94 (2013)- [j60]Daniel A. Spielman, Shang-Hua Teng: A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning. SIAM J. Comput. 42(1): 1-26 (2013)
- [c92]Xingwu Liu, Shang-Hua Teng: Perturbation Analysis of Maximum-Weighted Bipartite Matchings with Low Rank Data. COCOON 2013: 705-712
- [c91]Maria-Florina Balcan, Christian Borgs, Mark Braverman, Jennifer T. Chayes, Shang-Hua Teng: Finding Endogenously Formed Communities. SODA 2013: 767-783
- [c90]Xi Chen, Xiaorui Sun, Shang-Hua Teng: Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems. STOC 2013: 271-280
- 2012
- [j59]Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia: Active Clustering of Biological Sequences. Journal of Machine Learning Research 13: 203-225 (2012)
- [j58]Wei Chen, Christian Sommer, Shang-Hua Teng, Yajun Wang: A compact routing scheme and approximate distance oracle for power-law graphs. ACM Transactions on Algorithms 9(1): 4 (2012)
- [c89]Weiyu Zhang, Stella X. Yu, Shang-Hua Teng: Power SVM: Generalization with exemplar classification uncertainty. CVPR 2012: 2144-2151
- [c88]Christian Borgs, Michael Brautbar, Jennifer T. Chayes, Shang-Hua Teng: A Sublinear Time Algorithm for PageRank Computations. WAW 2012: 41-53
- [i37]Maria-Florina Balcan, Christian Borgs, Mark Braverman, Jennifer T. Chayes, Shang-Hua Teng: I Like Her more than You: Self-determined Communities. CoRR abs/1201.4899 (2012)
- [i36]Christian Borgs, Michael Brautbar, Jennifer T. Chayes, Shang-Hua Teng: Sublinear Time Algorithm for PageRank Computations and Related Applications. CoRR abs/1202.2771 (2012)
- 2011
- [j57]John Dunagan, Daniel A. Spielman, Shang-Hua Teng: Smoothed analysis of condition numbers and complexity implications for linear programming. Math. Program. 126(2): 315-350 (2011)
- [j56]Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang: Optimal Cache-Oblivious Mesh Layouts. Theory Comput. Syst. 48(2): 269-296 (2011)
- [j55]Daniel A. Spielman, Shang-Hua Teng: Spectral Sparsification of Graphs. SIAM J. Comput. 40(4): 981-1025 (2011)
- [j54]Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng: Competitive routing over time. Theor. Comput. Sci. 412(39): 5420-5432 (2011)
- [j53]Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhang, Jiajie Zhu: Bounded budget betweenness centrality game for strategic network formations. Theor. Comput. Sci. 412(52): 7147-7168 (2011)
- [c87]Zornitsa Kozareva, Konstantin Voevodski, Shang-Hua Teng: Class Label Enhancement via Related Instances. EMNLP 2011: 118-128
- [c86]
- [c85]Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia: Min-sum Clustering of Protein Sequences with Limited Distance Information. SIMBAD 2011: 192-206
- [c84]Paul Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, Shang-Hua Teng: Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs. STOC 2011: 273-282
- [i35]Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia: Clustering Protein Sequences Given the Approximation Stability of the Min-Sum Objective Function. CoRR abs/1101.3620 (2011)
- [i34]Rumi Ghosh, Kristina Lerman, Tawan Surachawala, Konstantin Voevodski, Shang-Hua Teng: Non-Conservative Diffusion and its Application to Social Network Analysis. CoRR abs/1102.4639 (2011)
- 2010
- [j52]Xi Chen, Xiaoming Sun, Shang-Hua Teng: Quantum Separation of Local Search and Fixed Point Computation. Algorithmica 56(3): 364-382 (2010)
- [j51]Mohammad Taghi Hajiaghayi, Shang-Hua Teng: Foreword to special issue on SODA 2008. ACM Transactions on Algorithms 6(4) (2010)
- [c83]Alexandra Kolla, Yury Makarychev, Amin Saberi, Shang-Hua Teng: Subgraph sparsification and nearly optimal ultrasparsifiers. STOC 2010: 57-66
- [c82]
- [c81]Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia: Efficient Clustering with Limited Distance Information. UAI 2010: 632-640
- [i33]Jonathan A. Kelner, James R. Lee, Gregory N. Price, Shang-Hua Teng: Metric uniformization and spectral bounds for graphs. CoRR abs/1008.3594 (2010)
- [i32]Xi Chen, Shang-Hua Teng: A Complexity View of Markets with Social Influence. CoRR abs/1009.0309 (2010)
- [i31]Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia: Efficient Clustering with Limited Distance Information. CoRR abs/1009.5168 (2010)
- [i30]Paul Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, Shang-Hua Teng: Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs. CoRR abs/1010.2921 (2010)
2000 – 2009
- 2009
- [j50]Konstantin Voevodski, Shang-Hua Teng, Yu Xia: Finding local communities in protein networks. BMC Bioinformatics 10: 297 (2009)
- [j49]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)
- [j48]Xi Chen, Xiaotie Deng, Shang-Hua Teng: Settling the complexity of computing two-player Nash equilibria. J. ACM 56(3) (2009)
- [j47]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)
- [j46]Xi Chen, Li-Sha Huang, Shang-Hua Teng: Market equilibria with hybrid linear-Leontief utilities. Theor. Comput. Sci. 410(17): 1573-1580 (2009)
- [j45]Yingchao Zhao, Wei Chen, Shang-Hua Teng: The isolation game: A game of distances. Theor. Comput. Sci. 410(47-49): 4905-4919 (2009)
- [c80]
- [c79]Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhang, Jiajie Zhu: Bounded Budget Betweenness Centrality Game for Strategic Network Formations. ESA 2009: 227-238
- [c78]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
- [c77]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
- [c76]Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng: Reducibility among Fractional Stability Problems. FOCS 2009: 283-292
- [c75]Adam Tauman Kalai, Alex Samorodnitsky, Shang-Hua Teng: Learning and Smoothed Analysis. FOCS 2009: 395-404
- [c74]
- [c73]Jonathan A. Kelner, James R. Lee, Gregory N. Price, Shang-Hua Teng: Higher Eigenvalues of Graphs. FOCS 2009: 735-744
- [c72]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
- [c71]Wei Chen, Christian Sommer, Shang-Hua Teng, Yajun Wang: Compact Routing in Power-Law Graphs. DISC 2009: 379-391
- [c70]Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng: Competitive Routing over Time. WINE 2009: 18-29
- [i29]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)
- [i28]Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng: Reducibility Among Fractional Stability Problems. CoRR abs/0904.1435 (2009)
- [i27]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)
- [i26]Alexandra Kolla, Yury Makarychev, Amin Saberi, Shang-Hua Teng: Subgraph Sparsification and Nearly Optimal Ultrasparsifiers. CoRR abs/0912.1623 (2009)
- [i25]Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng: Reducibility Among Fractional Stability Problems. Electronic Colloquium on Computational Complexity (ECCC) 16: 41 (2009)
- 2008
- [j44]Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng: Local Computation of PageRank Contributions. Internet Mathematics 5(1): 23-45 (2008)
- [j43]Kyle W. Burke, Shang-Hua Teng: Atropos: A PSPACE-Complete Sperner Triangle Game. Internet Mathematics 5(4): 477-492 (2008)
- [j42]Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng: Lower-Stretch Spanning Trees. SIAM J. Comput. 38(2): 608-628 (2008)
- [c69]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
- [c68]Xi Chen, Xiaoming Sun, Shang-Hua Teng: Quantum Separation of Local Search and Fixed Point Computation. COCOON 2008: 170-179
- [c67]Yingchao Zhao, Wei Chen, Shang-Hua Teng: The Isolation Game: A Game of Distances. ISAAC 2008: 148-158
- [c66]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
- [c65]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
- [e4]Shang-Hua Teng (Ed.): Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008. SIAM 2008
- [r1]Feifei Li, Marios Hadjieleftheriou, George Kollios, Dihan Cheng, Shang-Hua Teng: Trip Planning Queries in Road Network Databases. Encyclopedia of GIS 2008: 1176-1181
- [i24]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)
- [i23]
- [i22]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)
- [i21]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)
- [i20]Adam Tauman Kalai, Shang-Hua Teng: Decision trees are PAC-learnable from most product distributions: a smoothed analysis. CoRR abs/0812.0933 (2008)
- 2007
- [j41]Shang-Hua Teng, Frances F. Yao: k-Nearest-Neighbor Clustering and Percolation Theory. Algorithmica 49(3): 192-211 (2007)
- [j40]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)
- [c64]Shang-Hua Teng: Game and Market Equilibria: Computation, Approximation, and Smoothed Analysis. AAIM 2007: 424
- [c63]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
- [c62]Li-Sha Huang, Shang-Hua Teng: On the Approximation and Smoothed Complexity of Leontief Market Equilibria. FAW 2007: 96-107
- [c61]
- [c60]Xi Chen, Shang-Hua Teng, Paul Valiant: The approximation complexity of win-lose games. SODA 2007: 159-168
- [c59]Yingchao Zhao, Shang-Hua Teng: Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces. TAMC 2007: 554-565
- [c58]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
- [c57]
- [e3]Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking (Eds.): Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007. Dagstuhl Seminar Proceedings 07391, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
- [i19]Xi Chen, Xiaotie Deng, Shang-Hua Teng: Settling the Complexity of Computing Two-Player Nash Equilibria. CoRR abs/0704.1678 (2007)
- [i18]Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang: Optimal Cache-Oblivious Mesh Layouts. CoRR abs/0705.1033 (2007)
- [i17]Nikolaos Laoutaris, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng: A bounded-degree network formation game. CoRR abs/cs/0701071 (2007)
- [i16]Xi Chen, Shang-Hua Teng: Paths Beyond Local Search: A Nearly Tight Bound for Randomized Fixed-Point Computation. CoRR abs/cs/0702088 (2007)
- [i15]
- 2006
- [j39]Arvind Sankar, Daniel A. Spielman, Shang-Hua Teng: Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices. SIAM J. Matrix Analysis Applications 28(2): 446-476 (2006)
- [j38]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)
- [c56]
- [c55]Xi Chen, Xiaotie Deng, Shang-Hua Teng: Computing Nash Equilibria: Approximation and Smoothed Complexity. FOCS 2006: 603-612
- [c54]
- [c53]
- [c52]Xi Chen, Li-Sha Huang, Shang-Hua Teng: Market Equilibria with Hybrid Linear-Leontief Utilities. WINE 2006: 274-285
- [i14]Xi Chen, Xiaotie Deng, Shang-Hua Teng: Computing Nash Equilibria: Approximation and Smoothed Complexity. CoRR abs/cs/0602043 (2006)
- [i13]Li-Sha Huang, Shang-Hua Teng: On the Approximation and Smoothed Complexity of Leontief Market Equilibria. CoRR abs/cs/0602090 (2006)
- [i12]Daniel A. Spielman, Shang-Hua Teng: Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems. CoRR abs/cs/0607105 (2006)
- [i11]Xi Chen, Xiaotie Deng, Shang-Hua Teng: Computing Nash Equilibria: Approximation and Smoothed Complexity. Electronic Colloquium on Computational Complexity (ECCC) 13(023) (2006)
- [i10]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
- [c51]
- [c50]Feifei Li, Dihan Cheng, Marios Hadjieleftheriou, George Kollios, Shang-Hua Teng: On Trip Planning Queries in Spatial Databases. SSTD 2005: 273-290
- [c49]Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng: Lower-stretch spanning trees. STOC 2005: 494-503
- 2004
- [j37]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)
- [c48]Daniel A. Spielman, Shang-Hua Teng, Alper Üngör: Parallel Delaunay Refinement with Off-Centers. Euro-Par 2004: 812-819
- [c47]Daniel A. Spielman, Shang-Hua Teng, Alper Üngör: Time complexity of practical parallel steiner point insertion algorithms. SPAA 2004: 267-268
- [c46]Daniel A. Spielman, Shang-Hua Teng: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. STOC 2004: 81-90
- [i9]Michael Elkin, Daniel A. Spielman, Shang-Hua Teng: Lower-Stretch Spanning Trees. CoRR cs.DS/0411064 (2004)
- 2003
- [j36]Daniel A. Spielman, Shang-Hua Teng: Smoothed analysis of termination of linear programming algorithms. Math. Program. 97(1-2): 375-404 (2003)
- [c45]Daniel A. Spielman, Shang-Hua Teng: Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time 0(m1.31). FOCS 2003: 416-427
- [c44]Daniel A. Spielman, Shang-Hua Teng: Smoothed Analysis (Motivation and Discrete Models). WADS 2003: 256-270
- [i8]Daniel A. Spielman, Shang-Hua Teng: Smoothed Analysis of Interior-Point Algorithms: Termination. CoRR cs.DS/0301019 (2003)
- [i7]John Dunagan, Daniel A. Spielman, Shang-Hua Teng: Smoothed Analysis of Interior-Point Algorithms: Condition Number. CoRR cs.DS/0302011 (2003)
- [i6]Daniel A. Spielman, Shang-Hua Teng: Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time O(m1.31). CoRR cs.DS/0310036 (2003)
- [i5]Daniel A. Spielman, Shang-Hua Teng: Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems. CoRR cs.DS/0310051 (2003)
- [i4]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
- [j35]
- [j34]Andreas Stathopoulos, Shang-Hua Teng: Recovering Mesh Geometry from a Stiffness Matrix. Numerical Algorithms 30(3-4): 303-322 (2002)
- [c43]Daniel A. Spielman, Shang-Hua Teng, Alper Üngör: Parallel Delaunay Refinement: Algorithms And Analyses. IMR 2002: 205-217
- [i3]Daniel A. Spielman, Shang-Hua Teng, Alper Üngör: Parallel Delaunay Refinement: Algorithms and Analyses. CoRR cs.CG/0207063 (2002)
- 2001
- [j33]Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng: Min-max-boundary domain decomposition. Theor. Comput. Sci. 261(2): 253-266 (2001)
- [c42]
- [c41]Daniel A. Spielman, Shang-Hua Teng: Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. STOC 2001: 296-305
- [i2]Daniel A. Spielman, Shang-Hua Teng: Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time. CoRR cs.DS/0111050 (2001)
- 2000
- [j32]Nina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng: Regression Depth and Center Points. Discrete & Computational Geometry 23(3): 305-323 (2000)
- [j31]
- [j30]Shang-Hua Teng, Chi Wai Wong: Unstructured Mesh Generation: Theory, Practice, and Perspectives. Int. J. Comput. Geometry Appl. 10(3): 227-266 (2000)
- [j29]Siu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng: Sliver exudation. J. ACM 47(5): 883-904 (2000)
- [c40]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
- [e2]D. T. Lee, Shang-Hua Teng (Eds.): Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings. Lecture Notes in Computer Science 1969, Springer 2000, ISBN 3-540-41255-7
1990 – 1999
- 1999
- [j28]Xiang-Yang Li, Shang-Hua Teng, Alper Üngör: Simultaneous Refinement and Coarsening for Adaptive Meshing. Eng. Comput. (Lond.) 15(3): 280-291 (1999)
- [j27]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)
- [j26]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-598 (1999)
- [j25]
- [j24]Gary L. Miller, Dafna Talmor, Shang-Hua Teng: Optimal Coarsening of Unstructured Meshes. J. Algorithms 31(1): 29-65 (1999)
- [j23]Xiang-Yang Li, Shang-Hua Teng: Practical Human-Machine Identification over Insecure Channels. J. Comb. Optim. 3(4): 347-361 (1999)
- [j22]Gary L. Miller, Shang-Hua Teng: The Dynamic Parallel Complexity of Computational Circuits. SIAM J. Comput. 28(5): 1664-1688 (1999)
- [j21]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)
- [c39]Siu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng: Sliver Exudation. Symposium on Computational Geometry 1999: 1-13
- [c38]Shang-Hua Teng, Qi Lu: Efficient Large-Scale Access Control for Internet/Intranet Information Systems. HICSS 1999
- [c37]Shang-Hua Teng, Qi Lu, Matthias Eichstaedt, Daniel Alexander Ford, Tobin J. Lehman: Collaborative Web Crawling: Information Gathering/Processing over Internet. HICSS 1999
- [c36]
- [c35]Xiang-Yang Li, Shang-Hua Teng, Alper Üngör: Biting Ellipses to Generate Anisotropic Mesh. IMR 1999: 97-108
- 1998
- [j20]
- [j19]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)
- [j18]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)
- [c34]Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng: Min-Max-Boundary Domain Decomposition. COCOON 1998: 137-146
- [c33]Xiang-Yang Li, Shang-Hua Teng, Alper Üngör: Simultaneous Refinement and Coarsening: Adaptive Meshing with Moving Boundaries. IMR 1998: 201-210
- [c32]Matthias Eichstaedt, Qi Lu, Shang-Hua Teng: Parallel Profile Matching for Large Scale Webcasting. IRREGULAR 1998: 17-28
- [c31]Xiang-Yang Li, Shang-Hua Teng: Dynamic Load Balancing for Parallel Adaptive Mesh Refinement. IRREGULAR 1998: 144-155
- [e1]Afonso Ferreira, José D. P. Rolim, Horst D. Simon, Shang-Hua Teng (Eds.): Solving Irregularly Structured Problems in Parallel, 5th International Symposium, IRREGULAR '98, Berkeley, California, USA, August 9-11, 1998, Proceedings. Lecture Notes in Computer Science 1457, Springer 1998, ISBN 3-540-64809-7
- [i1]Nina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng: Regression Depth and Center Points. CoRR cs.CG/9809037 (1998)
- 1997
- [j17]Gary L. Miller, Shang-Hua Teng: Tree-Based Parallel Algorithm Design. Algorithmica 19(4): 369-389 (1997)
- [j16]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)
- [j15]Keith D. Gremban, Gary L. Miller, Shang-Hua Teng: Moments of Inertia and Graph Separators. J. Comb. Optim. 1(1): 79-104 (1997)
- [j14]Shang-Hua Teng, F. Frances Yao: Approximating Shortest Superstrings. SIAM J. Comput. 26(2): 410-417 (1997)
- [c30]
- [c29]Feng Cao, Ding-Zhu Du, Shang-Hua Teng: Fault-tolerant Properties of Pyramid Network. PDPTA 1997: 1690-1693
- [c28]Y. Charlie Hu, S. Lennart Johnsson, Shang-Hua Teng: High Performance FORTRAN for Highly Unstructured Problems. PPOPP 1997: 13-24
- [c27]Y. Charlie Hu, S. Lennart Johnsson, Shang-Hua Teng: A Data-Parallel Adaptive N-body Method. PPSC 1997
- [c26]Y. Charlie Hu, Shang-Hua Teng, S. Lennart Johnsson: A Data-Parallel Implementation of the Geometric Partitioning Algorithm. PPSC 1997
- [c25]Gary L. Miller, Dafna Talmor, Shang-Hua Teng: Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes. SODA 1997: 538-547
- 1996
- [j13]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)
- [c24]
- [c23]Daniel A. Spielman, Shang-Hua Teng: Disk Packings and Planar Separators. Symposium on Computational Geometry 1996: 349-358
- [c22]Daniel A. Spielman, Shang-Hua Teng: Spectral Partitioning Works: Planar Graphs and Finite Element Meshes. FOCS 1996: 96-105
- 1995
- [j12]Ming-Yang Kao, Shang-Hua Teng, Kentaro Toyama: An Optimal Parallel Algorithm for Planar Cycle Separators. Algorithmica 14(5): 398-408 (1995)
- [j11]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)
- [j10]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)
- [j9]Shang-Hua Teng: Independent Sets Versus Perfect Matchings. Theor. Comput. Sci. 145(1&2): 381-390 (1995)
- [j8]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)
- [c21]John R. Gilbert, Gary L. Miller, Shang-Hua Teng: Geometric mesh partitioning: implementation and experiments. IPPS 1995: 418-427
- [c20]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
- 1994
- [j7]Alan M. Frieze, Shang-Hua Teng: On the Complexity of Computing the Diameter of a Polytope. Computational Complexity 4: 207-219 (1994)
- [j6]Shang-Hua Teng: Functional Inversion and Communication Complexity. J. Cryptology 7(3): 153-170 (1994)
- [j5]Anja Feldmann, Jiri Sgall, Shang-Hua Teng: Dynamic Scheduling on Parallel Machines. Theor. Comput. Sci. 130(1): 49-72 (1994)
- [c19]Ming-Yang Kao, Shang-Hua Teng: Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs. ISAAC 1994: 451-459
- [c18]Keith D. Gremban, Gary L. Miller, Shang-Hua Teng: Moments of Inertia and Graph Separators. SODA 1994: 452-461
- 1993
- [c17]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
- [c16]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
- [c15]
- [c14]Siddhartha Chatterjee, John R. Gilbert, Robert Schreiber, Shang-Hua Teng: Automatic Array Alignment in Data-Parallel Programs. POPL 1993: 16-28
- [c13]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
- [c12]Anja Feldmann, Ming-Yang Kao, Jiri Sgall, Shang-Hua Teng: Optimal online scheduling of parallel jobs with dependencies. STOC 1993: 642-651
- [c11]Marshall W. Bern, David Eppstein, Shang-Hua Teng: Parallel Construction of Quadtrees and Quality Triangulations. WADS 1993: 188-199
- [c10]Ming-Yang Kao, Shang-Hua Teng, Kentaro Toyama: Improved Parallel Depth-First Search in Undirected Planar Graphs. WADS 1993: 409-420
- 1992
- [c9]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
- [c8]Alan M. Frieze, Gary L. Miller, Shang-Hua Teng: Separator Based Parallel Divide and Conquer in Computational Geometry. SPAA 1992: 420-429
- 1991
- [c7]
- [c6]Anja Feldmann, Jiri Sgall, Shang-Hua Teng: Dynamic Scheduling on Parallel Machines. FOCS 1991: 111-120
- [c5]Gary L. Miller, Shang-Hua Teng, Stephen A. Vavasis: A Unified Geometric Approach to Graph Separators. FOCS 1991: 538-547
- 1990
- [j4]Shang-Hua Teng: Space Efficient Processor Identity Protocol. Inf. Process. Lett. 34(3): 147-154 (1990)
- [j3]Ming-Deh A. Huang, Shang-Hua Teng: Security, Verifiability, and Universality in Distributed Computing. J. Algorithms 11(3): 492-521 (1990)
- [j2]Shang-Hua Teng: Adaptive Parallel Algorithms for Integral Knapsack Problems. J. Parallel Distrib. Comput. 8(4): 400-406 (1990)
1980 – 1989
- 1989
- [c4]Mikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng: Constructing Trees in Parallel. SPAA 1989: 421-431
- 1988
- [c3]Ming-Deh A. Huang, Shang-Hua Teng: A Universal Problem in Secure and Verifiable Distributed Computation. CRYPTO 1988: 336-352
- [c2]Ming-Deh A. Huang, Shang-Hua Teng: Secure and Verifiable Schemes for Election and General Distributed Computing Problems. PODC 1988: 182-196
- 1987
- [j1]Shang-Hua Teng, Bin Wang: Parallel Algorithms for Message Decomposition. J. Parallel Distrib. Comput. 4(3): 231-249 (1987)
- [c1]Gary L. Miller, Shang-Hua Teng: Dynamic Parallel Complexity of Computational Circuits. STOC 1987: 254-263
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:24 CEST by the dblp team