Parallel Algorithms for Message Decomposition. - Shang-Hua Teng; Bin Wang (J. Parallel Distributed Comput., 1987)

The construction of Huffman-equivalent prefix code in NC. - Shang-Hua Teng (SIGACT News, 1987)

A Universal Problem in Secure and Verifiable Distributed Computation. - Ming-Deh A. Huang; Shang-Hua Teng (CRYPTO, 1988)

Secure and Verifiable Schemes for Election and General Distributed Computing Problems. - Ming-Deh A. Huang; Shang-Hua Teng (PODC, 1988)

Constructing Trees in Parallel. - Mikhail J. Atallah; S. Rao Kosaraju; Lawrence L. Larmore; Gary L. Miller; Shang-Hua Teng (SPAA, 1989)

Space Efficient Processor Identity Protocol. - Shang-Hua Teng (Inf. Process. Lett., 1990)

Security, Verifiability, and Universality in Distributed Computing. - Ming-Deh A. Huang; Shang-Hua Teng (J. Algorithms, 1990)

Adaptive Parallel Algorithms for Integral Knapsack Problems. - Shang-Hua Teng (J. Parallel Distributed Comput., 1990)

A Unified Geometric Approach to Graph Separators - Gary L. Miller; Shang-Hua Teng; Stephen A. Vavasis (FOCS, 1991)

Optimal Evaluation of Array Expressions on Massively Parallel Machines (Extended Abstract). - Siddhartha Chatterjee; John R. Gilbert; Robert Schneider; Shang-Hua Teng (SIGPLAN Workshop, 1992)

Separator Based Parallel Divide and Conquer in Computational Geometry. - Alan M. Frieze; Gary L. Miller; Shang-Hua Teng (SPAA, 1992)

Approximating Center Points with Iterated Radon Points. - Kenneth L. Clarkson; David Eppstein; Gary L. Miller; Carl Sturtivant; Shang-Hua Teng (SCG, 1993)

Automatic Array Alignment in Data-Parallel Programs. - Siddhartha Chatterjee; John R. Gilbert; Robert Schreiber; Shang-Hua Teng (POPL, 1993)

Optimal online scheduling of parallel jobs with dependencies. - Anja Feldmann; Ming-Yang Kao; Jirí Sgall; Shang-Hua Teng (STOC, 1993)

Improved Parallel Depth-First Search in Undirected Planar Graphs. - Ming-Yang Kao; Shang-Hua Teng; Kentaro Toyama (WADS, 1993)

Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs. - Ming-Yang Kao; Shang-Hua Teng (ISAAC, 1994)

On the Complexity of Computing the Diameter of a Polytope. - Alan M. Frieze; Shang-Hua Teng (Comput. Complex., 1994)

Functional Inversion and Communication Complexity. - Shang-Hua Teng (J. Cryptol., 1994)

Dynamic Scheduling on Parallel Machines. - Anja Feldmann; Jirí Sgall; Shang-Hua Teng (Theor. Comput. Sci., 1994)

A Delaunay based numerical method for three dimensions: generation, formulation, and partition. - Gary L. Miller; Dafna Talmor; Shang-Hua Teng; Noel Walkington (STOC, 1995)

An Optimal Parallel Algorithm for Planar Cycle Separators. - Ming-Yang Kao; Shang-Hua Teng; Kentaro Toyama (Algorithmica, 1995)

A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. - David Eppstein; Gary L. Miller; Shang-Hua Teng (Fundam. Informaticae, 1995)

Generating Local Address and Communication Sets for Data-Parallel Programs. - Siddhartha Chatterjee; John R. Gilbert; Fred J. E. Long; Robert Schreiber; Shang-Hua Teng (J. Parallel Distributed Comput., 1995)

Independent Sets Versus Perfect Matchings. - Shang-Hua Teng (Theor. Comput. Sci., 1995)

Optimal Evaluation of Array Expressions on Massively Parallel Machines. - Siddhartha Chatterjee; John R. Gilbert; Robert Schreiber; Shang-Hua Teng (ACM Trans. Program. Lang. Syst., 1995)

Fast Separator Decomposition for Finite Element Meshes. - Shang-Hua Teng (COCOON, 1996)

Disk Packings and Planar Separators. - Daniel A. Spielman; Shang-Hua Teng (SCG, 1996)

Spectral Partitioning Works: Planar Graphs and Finite Element Meshes. - Daniel A. Spielman; Shang-Hua Teng (FOCS, 1996)

Approximating center points with iterative Radon points. - Kenneth L. Clarkson; David Eppstein; Gary L. Miller; Carl Sturtivant; Shang-Hua Teng (Int. J. Comput. Geom. Appl., 1996)

Eigenvalues, Eigenvectors, and Graph Partitioning. - Shang-Hua Teng (COCOON, 1997)

Fault-tolerant Properties of Pyramid Network. - Feng Cao; Ding-Zhu Du; Shang-Hua Teng (PDPTA, 1997)

High Performance FORTRAN for Highly Unstructured Problems. - Y. Charlie Hu; S. Lennart Johnsson; Shang-Hua Teng (PPoPP, 1997)

A Data-Parallel Adaptive N-body Method. - Y. Charlie Hu; S. Lennart Johnsson; Shang-Hua Teng (PP, 1997)

A Data-Parallel Implementation of the Geometric Partitioning Algorithm. - Y. Charlie Hu; Shang-Hua Teng; S. Lennart Johnsson (PP, 1997)

Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes. - Gary L. Miller; Dafna Talmor; Shang-Hua Teng (SODA, 1997)

Tree-Based Parallel Algorithm Design. - Gary L. Miller; Shang-Hua Teng (Algorithmica, 1997)

Separators for sphere-packings and nearest neighbor graphs. - Gary L. Miller; Shang-Hua Teng; William P. Thurston; Stephen A. Vavasis (J. ACM, 1997)

Moments of Inertia and Graph Separators. - Keith D. Gremban; Gary L. Miller; Shang-Hua Teng (J. Comb. Optim., 1997)

Approximating Shortest Superstrings. - Shang-Hua Teng; F. Frances Yao (SIAM J. Comput., 1997)

How Good is Recursive Bisection? - Horst D. Simon; Shang-Hua Teng (SIAM J. Sci. Comput., 1997)

Fast Nested Dissection for Finite Element Meshes. - Shang-Hua Teng (SIAM J. Matrix Anal. Appl., 1997)

Simultaneous Refinement and Coarsening: Adaptive Meshing with Moving Boundaries. - Xiang-Yang Li 001; Shang-Hua Teng; Alper Üngör (IMR, 1998)

Parallel Profile Matching for Large Scale Webcasting. - Matthias Eichstaedt; Qi Lu; Shang-Hua Teng (IRREGULAR, 1998)

Dynamic Load Balancing for Parallel Adaptive Mesh Refinement. - Xiang-Yang Li 001; Shang-Hua Teng (IRREGULAR, 1998)

Combinatorial aspects of geometric graphs. - Shang-Hua Teng (Comput. Geom., 1998)

Optimal On-Line Scheduling of Parallel Jobs with Dependencies. - Anja Feldmann; Ming-Yang Kao; Jirí Sgall; Shang-Hua Teng (J. Comb. Optim., 1998)

Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs. - Ming-Yang Kao; Neill Occhiogrosso; Shang-Hua Teng (J. Comb. Optim., 1998)

Geometric Mesh Partitioning: Implementation and Experiments. - John R. Gilbert; Gary L. Miller; Shang-Hua Teng (SIAM J. Sci. Comput., 1998)

Geometric Separators for Finite-Element Meshes. - Gary L. Miller; Shang-Hua Teng; William P. Thurston; Stephen A. Vavasis (SIAM J. Sci. Comput., 1998)

Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation. - Shang-Hua Teng (SIAM J. Sci. Comput., 1998)

Efficient Large-Scale Access Control for Internet/Intranet Information Systems. - Shang-Hua Teng; Qi Lu (HICSS, 1999)

Collaborative Web Crawling: Information Gathering/Processing over Internet. - Shang-Hua Teng; Qi Lu; Matthias Eichstaedt; Daniel Alexander Ford; Tobin J. Lehman (HICSS, 1999)

Biting Spheres in 3D. - Xiang-Yang Li 001; Shang-Hua Teng; Alper Üngör (IMR, 1999)

Biting Ellipses to Generate Anisotropic Mesh. - Xiang-Yang Li 001; Shang-Hua Teng; Alper Üngör (IMR, 1999)

Simultaneous Refinement and Coarsening for Adaptive Meshing. - Xiang-Yang Li 001; Shang-Hua Teng; Alper Üngör (Eng. Comput., 1999)

Parallel Construction of Quadtrees and Quality Triangulations. - Marshall W. Bern; David Eppstein; Shang-Hua Teng (Int. J. Comput. Geom. Appl., 1999)

Data Generation for Geometric Algorithms on Non-Uniform Distributions. - Gary L. Miller; Dafna Talmor; Shang-Hua Teng (Int. J. Comput. Geom. Appl., 1999)

Optimal Coarsening of Unstructured Meshes. - Gary L. Miller; Dafna Talmor; Shang-Hua Teng (J. Algorithms, 1999)

Low Energy and Mutually Distant Sampling. - Shang-Hua Teng (J. Algorithms, 1999)

Practical Human-Machine Identification over Insecure Channels. - Xiang-Yang Li 001; Shang-Hua Teng (J. Comb. Optim., 1999)

The Dynamic Parallel Complexity of Computational Circuits. - Gary L. Miller; Shang-Hua Teng (SIAM J. Comput., 1999)

Fault Tolerance Properties of Pyramid Networks. - Feng Cao; Ding-Zhu Du; D. Frank Hsu; Shang-Hua Teng (IEEE Trans. Computers, 1999)

Smoothing and cleaning up slivers. - Herbert Edelsbrunner; Xiang-Yang Li 001; Gary L. Miller; Andreas Stathopoulos; Dafna Talmor; Shang-Hua Teng; Alper Üngör; Noel Walkington (STOC, 2000)

Regression Depth and Center Points. - Nina Amenta; Marshall W. Bern; David Eppstein; Shang-Hua Teng (Discret. Comput. Geom., 2000)

Guest Editor's Foreword. - Shang-Hua Teng (Int. J. Comput. Geom. Appl., 2000)

Unstructured Mesh Generation: Theory, Practice, and Perspectives. - Shang-Hua Teng; Chi Wai Wong (Int. J. Comput. Geom. Appl., 2000)

Sliver exudation. - Siu-Wing Cheng; Tamal K. Dey; Herbert Edelsbrunner; Michael A. Facello; Shang-Hua Teng (J. ACM, 2000)

Generating well-shaped Delaunay meshed in 3D. - Xiang-Yang Li 001; Shang-Hua Teng (SODA, 2001)

Min-max-boundary domain decomposition. - Marcos A. Kiwi; Daniel A. Spielman; Shang-Hua Teng (Theor. Comput. Sci., 2001)

Guest Editor's Foreward. - Shang-Hua Teng (Theory Comput. Syst., 2002)

Recovering Mesh Geometry from a Stiffness Matrix. - Andreas Stathopoulos; Shang-Hua Teng (Numer. Algorithms, 2002)

Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time 0(m1.31). - Daniel A. Spielman; Shang-Hua Teng (FOCS, 2003)

Smoothed Analysis (Motivation and Discrete Models). - Daniel A. Spielman; Shang-Hua Teng (WADS, 2003)

Smoothed Analysis of Interior-Point Algorithms: Termination - Daniel A. Spielman; Shang-Hua Teng (CoRR, 2003)

Smoothed Analysis of Interior-Point Algorithms: Condition Number - John Dunagan; Daniel A. Spielman; Shang-Hua Teng (CoRR, 2003)

Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time O(m1.31) - Daniel A. Spielman; Shang-Hua Teng (CoRR, 2003)

Smoothed analysis of termination of linear programming algorithms. - Daniel A. Spielman; Shang-Hua Teng (Math. Program., 2003)

Parallel Delaunay Refinement with Off-Centers. - Daniel A. Spielman; Shang-Hua Teng; Alper Üngör (Euro-Par, 2004)

Time complexity of practical parallel steiner point insertion algorithms. - Daniel A. Spielman; Shang-Hua Teng; Alper Üngör (SPAA, 2004)

Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. - Daniel A. Spielman; Shang-Hua Teng (STOC, 2004)

Lower-Stretch Spanning Trees - Michael Elkin; Daniel A. Spielman; Shang-Hua Teng (CoRR, 2004)

Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. - Daniel A. Spielman; Shang-Hua Teng (J. ACM, 2004)

Smoothed Analysis of Algorithms and Heuristics. - Shang-Hua Teng (COCOON, 2005)

On Trip Planning Queries in Spatial Databases. - Feifei Li 001; Dihan Cheng; Marios Hadjieleftheriou; George Kollios; Shang-Hua Teng (SSTD, 2005)

Geometric Separator for d-Dimensional Ball Graphs. - Kebin Wang; Shang-Hua Teng (CCCG, 2006)

Sparse Games Are Hard. - Xi Chen 001; Xiaotie Deng; Shang-Hua Teng (WINE, 2006)

Truthful Auctions with Optimal Profit. - Pinyan Lu; Shang-Hua Teng; Changyuan Yu (WINE, 2006)

Computing Nash Equilibria: Approximation and Smoothed Complexity. - Xi Chen 001; Xiaotie Deng; Shang-Hua Teng (Electron. Colloquium Comput. Complex., 2006)

On the Approximation and Smoothed Complexity of Leontief Market Equilibria. - Li-Sha Huang; Shang-Hua Teng (Electron. Colloquium Comput. Complex., 2006)

Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices. - Arvind Sankar; Daniel A. Spielman; Shang-Hua Teng (SIAM J. Matrix Anal. Appl., 2006)

Subspace gradient domain mesh deformation. - Jin Huang 001; Xiaohan Shi; Xinguo Liu; Kun Zhou 001; Li-Yi Wei; Shang-Hua Teng; Hujun Bao; Baining Guo; Heung-Yeung Shum (ACM Trans. Graph., 2006)

Game and Market Equilibria: Computation, Approximation, and Smoothed Analysis. - Shang-Hua Teng (AAIM, 2007)

07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms. - Martin Dietzfelbinger; Shang-Hua Teng; Eli Upfal; Berthold Vöcking (Probabilistic Methods in the Design and Analysis of Algorithms, 2007)

Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation. - Xi Chen 001; Shang-Hua Teng (FOCS, 2007)

The approximation complexity of win-lose games. - Xi Chen 001; Shang-Hua Teng; Paul Valiant (SODA, 2007)

A PSPACE-complete Sperner Triangle Game. - Kyle W. Burke; Shang-Hua Teng (WINE, 2007)

k-Nearest-Neighbor Clustering and Percolation Theory. - Shang-Hua Teng; Frances F. Yao (Algorithmica, 2007)

A bounded-degree network formation game - Nikolaos Laoutaris; Rajmohan Rajaraman; Ravi Sundaram; Shang-Hua Teng (CoRR, 2007)

Paths Beyond Local Search: A Nearly Tight Bound for Randomized Fixed-Point Computation - Xi Chen 001; Shang-Hua Teng (CoRR, 2007)

Games on the Sperner Triangle - Kyle W. Burke; Shang-Hua Teng (CoRR, 2007)

Parallel Delaunay Refinement: Algorithms and Analyses. - Daniel A. Spielman; Shang-Hua Teng; Alper Üngör (Int. J. Comput. Geom. Appl., 2007)

Robust PageRank and locally computable spam detection features. - Reid Andersen; Christian Borgs; Jennifer T. Chayes; John E. Hopcroft; Kamal Jain; Vahab S. Mirrokni; Shang-Hua Teng (AIRWeb, 2008)

On the Stability of Web Crawling and Web Search. - Reid Andersen; Christian Borgs; Jennifer T. Chayes; John E. Hopcroft; Vahab S. Mirrokni; Shang-Hua Teng (ISAAC, 2008)

Preference Games and Personalized Equilibria, with Applications to Fractional BGP - Laura J. Poplawski; Rajmohan Rajaraman; Ravi Sundaram; Shang-Hua Teng (CoRR, 2008)

Decision trees are PAC-learnable from most product distributions: a smoothed analysis - Adam Tauman Kalai; Shang-Hua Teng (CoRR, 2008)

Local Computation of PageRank Contributions. - Reid Andersen; Christian Borgs; Jennifer T. Chayes; John E. Hopcroft; Vahab S. Mirrokni; Shang-Hua Teng (Internet Math., 2008)

Atropos: A PSPACE-Complete Sperner Triangle Game. - Kyle W. Burke; Shang-Hua Teng (Internet Math., 2008)

Lower-Stretch Spanning Trees. - Michael Elkin; Yuval Emek; Daniel A. Spielman; Shang-Hua Teng (SIAM J. Comput., 2008)

Trip Planning Queries in Road Network Databases. - Feifei Li 001; Marios Hadjieleftheriou; George Kollios; Dihan Cheng; Shang-Hua Teng (Encyclopedia of GIS, 2008)

Agnostic Clustering. - Maria-Florina Balcan; Heiko Röglin; Shang-Hua Teng (ALT, 2009)

On the alpha-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games. - Wei Chen 013; Shang-Hua Teng; Yajun Wang 001; Yuan Zhou 007 (FAW, 2009)

Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities. - Xi Chen 001; Decheng Dai; Ye Du; Shang-Hua Teng (FOCS, 2009)

Learning and Smoothed Analysis. - Adam Tauman Kalai; Alex Samorodnitsky; Shang-Hua Teng (FOCS, 2009)

Higher Eigenvalues of Graphs. - Jonathan A. Kelner; James R. Lee; Gregory N. Price; Shang-Hua Teng (FOCS, 2009)

Smoothed Analysis of Multiobjective Optimization. - Heiko Röglin; Shang-Hua Teng (FOCS, 2009)

Colocation Games and Their Application to Distributed Resource Management. - Jorge Londoño; Azer Bestavros; Shang-Hua Teng (HotCloud, 2009)

Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria. - Xi Chen 001; Shang-Hua Teng (ISAAC, 2009)

Compact Routing in Power-Law Graphs. - Wei Chen 013; Christian Sommer 001; Shang-Hua Teng; Yajun Wang 001 (DISC, 2009)

Finding local communities in protein networks. - Konstantin Voevodski; Shang-Hua Teng; Yu Xia 002 (BMC Bioinform., 2009)

Spectral affinity in protein networks. - Konstantin Voevodski; Shang-Hua Teng; Yu Xia 002 (BMC Syst. Biol., 2009)

Smoothed analysis: an attempt to explain the behavior of algorithms in practice. - Daniel A. Spielman; Shang-Hua Teng (Commun. ACM, 2009)

Settling the complexity of computing two-player Nash equilibria. - Xi Chen 001; Xiaotie Deng; Shang-Hua Teng (J. ACM, 2009)

Market equilibria with hybrid linear-Leontief utilities. - Xi Chen 001; Li-Sha Huang; Shang-Hua Teng (Theor. Comput. Sci., 2009)

The isolation game: A game of distances. - Yingchao Zhao 001; Wei Chen 013; Shang-Hua Teng (Theor. Comput. Sci., 2009)

Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces. - Yingchao Zhao 001; Shang-Hua Teng (Theor. Comput. Sci., 2009)

On the complexity of equilibria in markets with additively separable utilities. - Xi Chen 001; Decheng Dai; Ye Du; Shang-Hua Teng (BQGT, 2010)

Beyond convexity: local search and equilibrium computation. - Shang-Hua Teng (BQGT, 2010)

Subgraph sparsification and nearly optimal ultrasparsifiers. - Alexandra Kolla; Yury Makarychev; Amin Saberi; Shang-Hua Teng (STOC, 2010)

The Laplacian Paradigm: Emerging Algorithms for Massive Graphs. - Shang-Hua Teng (TAMC, 2010)

Efficient Clustering with Limited Distance Information. - Konstantin Voevodski; Maria-Florina Balcan; Heiko Röglin; Shang-Hua Teng; Yu Xia 002 (UAI, 2010)

Quantum Separation of Local Search and Fixed Point Computation. - Xi Chen 001; Xiaoming Sun 001; Shang-Hua Teng (Algorithmica, 2010)

Metric uniformization and spectral bounds for graphs - Jonathan A. Kelner; James R. Lee; Gregory N. Price; Shang-Hua Teng (CoRR, 2010)

Foreword to special issue on SODA 2008. - Mohammad Taghi Hajiaghayi; Shang-Hua Teng (ACM Trans. Algorithms, 2010)

Numerical Thinking in Algorithm Design and Analysis. - Shang-Hua Teng (Computer Science, The Hardware, Software and Heart of It, 2011)

Class Label Enhancement via Related Instances. - Zornitsa Kozareva; Konstantin Voevodski; Shang-Hua Teng (EMNLP, 2011)

A Complexity View of Markets with Social Influence. - Xi Chen 001; Shang-Hua Teng (ICS, 2011)

Min-sum Clustering of Protein Sequences with Limited Distance Information. - Konstantin Voevodski; Maria-Florina Balcan; Heiko Röglin; Shang-Hua Teng; Yu Xia 002 (SIMBAD, 2011)

Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs. - Paul F. Christiano; Jonathan A. Kelner; Aleksander Madry; Daniel A. Spielman; Shang-Hua Teng (STOC, 2011)

Clustering Protein Sequences Given the Approximation Stability of the Min-Sum Objective Function - Konstantin Voevodski; Maria-Florina Balcan; Heiko Röglin; Shang-Hua Teng; Yu Xia 002 (CoRR, 2011)

Smoothed analysis of condition numbers and complexity implications for linear programming. - John Dunagan; Daniel A. Spielman; Shang-Hua Teng (Math. Program., 2011)

Optimal Cache-Oblivious Mesh Layouts. - Michael A. Bender; Bradley C. Kuszmaul; Shang-Hua Teng; Kebin Wang (Theory Comput. Syst., 2011)

Spectral Sparsification of Graphs. - Daniel A. Spielman; Shang-Hua Teng (SIAM J. Comput., 2011)

Bounded budget betweenness centrality game for strategic network formations. - Xiaohui Bei; Wei Chen 013; Shang-Hua Teng; Jialin Zhang 001; Jiajie Zhu (Theor. Comput. Sci., 2011)

Competitive routing over time. - Martin Hoefer 001; Vahab S. Mirrokni; Heiko Röglin; Shang-Hua Teng (Theor. Comput. Sci., 2011)

Power SVM: Generalization with exemplar classification uncertainty. - Weiyu Zhang; Stella X. Yu; Shang-Hua Teng (CVPR, 2012)

A Sublinear Time Algorithm for PageRank Computations. - Christian Borgs; Michael Brautbar; Jennifer T. Chayes; Shang-Hua Teng (WAW, 2012)

I Like Her more than You: Self-determined Communities - Maria-Florina Balcan; Christian Borgs; Mark Braverman; Jennifer T. Chayes; Shang-Hua Teng (CoRR, 2012)

Sublinear Time Algorithm for PageRank Computations and Related Applications - Christian Borgs; Michael Brautbar; Jennifer T. Chayes; Shang-Hua Teng (CoRR, 2012)

Active Clustering of Biological Sequences. - Konstantin Voevodski; Maria-Florina Balcan; Heiko Röglin; Shang-Hua Teng; Yu Xia 002 (J. Mach. Learn. Res., 2012)

A compact routing scheme and approximate distance oracle for power-law graphs. - Wei Chen 013; Christian Sommer 001; Shang-Hua Teng; Yajun Wang 001 (ACM Trans. Algorithms, 2012)

Perturbation Analysis of Maximum-Weighted Bipartite Matchings with Low Rank Data. - Xingwu Liu; Shang-Hua Teng (COCOON, 2013)

Faster Canonical Forms for Strongly Regular Graphs. - László Babai; Xi Chen 001; Xiaorui Sun; Shang-Hua Teng; John Wilmes (FOCS, 2013)

Finding Endogenously Formed Communities. - Maria-Florina Balcan; Christian Borgs; Mark Braverman; Jennifer T. Chayes; Shang-Hua Teng (SODA, 2013)

Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems. - Xi Chen 001; Xiaorui Sun; Shang-Hua Teng (STOC, 2013)

Spectral sparsification of graphs: theory and algorithms. - Joshua D. Batson; Daniel A. Spielman; Nikhil Srivastava; Shang-Hua Teng (Commun. ACM, 2013)

Reducibility among Fractional Stability Problems. - Shiva Kintali; Laura J. Poplawski; Rajmohan Rajaraman; Ravi Sundaram; Shang-Hua Teng (SIAM J. Comput., 2013)

A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning. - Daniel A. Spielman; Shang-Hua Teng (SIAM J. Comput., 2013)

The interplay between dynamics and networks: centrality, communities, and cheeger inequality. - Rumi Ghosh; Shang-Hua Teng; Kristina Lerman; Xiaoran Yan (KDD, 2014)

Fixed-Points of Social Choice: An Axiomatic Approach to Network Communities. - Christian Borgs; Jennifer T. Chayes; Adrian Marple; Shang-Hua Teng (CoRR, 2014)

Signaling in Quasipolynomial time. - Yu Cheng 002; Ho Yee Cheung; Shaddin Dughmi; Shang-Hua Teng (CoRR, 2014)

Scalable Parallel Factorizations of SDD Matrices and Efficient Sampling for Gaussian Graphical Models. - Dehua Cheng; Yu Cheng 002; Yan Liu 002; Richard Peng; Shang-Hua Teng (CoRR, 2014)

Multiscale Matrix Sampling and Sublinear-Time PageRank Computation. - Christian Borgs; Michael Brautbar; Jennifer T. Chayes; Shang-Hua Teng (Internet Math., 2014)

Bounded Budget Connection (BBC) games or how to make friends and influence people, on a budget. - Nikolaos Laoutaris; Laura J. Poplawski; Rajmohan Rajaraman; Ravi Sundaram; Shang-Hua Teng (J. Comput. Syst. Sci., 2014)

Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems. - Daniel A. Spielman; Shang-Hua Teng (SIAM J. Matrix Anal. Appl., 2014)

Efficient Sampling for Gaussian Graphical Models via Spectral Sparsification. - Dehua Cheng; Yu Cheng 002; Yan Liu 002; Richard Peng; Shang-Hua Teng (COLT, 2015)

Mixture Selection, Mechanism Design, and Signaling. - Yu Cheng 002; Ho Yee Cheung; Shaddin Dughmi; Ehsan Emamjomeh-Zadeh; Li Han; Shang-Hua Teng (FOCS, 2015)

Spectral Sparsification of Random-Walk Matrix Polynomials. - Dehua Cheng; Yu Cheng 002; Yan Liu 002; Richard Peng; Shang-Hua Teng (CoRR, 2015)

An Axiomatic Approach to Community Detection. - Christian Borgs; Jennifer T. Chayes; Adrian Marple; Shang-Hua Teng (ITCS, 2016)

Interplay between Social Influence and Network Centrality: Shapley Values and Scalable Algorithms. - Wei Chen 013; Shang-Hua Teng (CoRR, 2016)

Network Composition from Multi-layer Data. - Kristina Lerman; Shang-Hua Teng; Xiaoran Yan (CoRR, 2016)

Scalable Algorithms for Data and Network Analysis. - Shang-Hua Teng (Found. Trends Theor. Comput. Sci., 2016)

Capturing the interplay of dynamics and networks through parameterizations of Laplacian operators. - Xiaoran Yan; Shang-Hua Teng; Kristina Lerman; Rumi Ghosh (PeerJ Comput. Sci., 2016)

Maximum bipartite matchings with low rank data: Locality and perturbation analysis. - Xingwu Liu; Shang-Hua Teng (Theor. Comput. Sci., 2016)

Multi-layer Network Composition Under a Unified Dynamical Process. - Xiaoran Yan; Shang-Hua Teng; Kristina Lerman (SBP-BRiMS, 2017)

Interplay between Social Influence and Network Centrality: A Comparative Study on Shapley Centrality and Single-Node-Influence Centrality. - Wei Chen 013; Shang-Hua Teng (WWW, 2017)

Network Essence: PageRank Completion and Centrality-Conforming Markov Chains. - Shang-Hua Teng (CoRR, 2017)

Trip Planning Queries in Road Network Databases. - Feifei Li 001; Marios Hadjieleftheriou; George Kollios; Dihan Cheng; Shang-Hua Teng (Encyclopedia of GIS, 2017)

Going Beyond Traditional Characterizations in the Age of Big Data and Network Sciences (Invited Talk). - Shang-Hua Teng (ISAAC, 2018)

Scalable Algorithms in the Age of Big Data and Network Sciences: Characterization, Primitives, and Techniques. - Shang-Hua Teng (WSDM, 2018)

A Systematic Framework and Characterization of Influence-Based Network Centrality. - Wei Chen 013; Shang-Hua Teng; Hanrui Zhang 001 (CoRR, 2018)

Capturing Complementarity in Set Functions by Going Beyond Submodularity/Subadditivity. - Wei Chen 013; Shang-Hua Teng; Hanrui Zhang 001 (ITCS, 2019)

Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis. - Jiaqing Jiang; Xiaoming Sun 001; Shang-Hua Teng; Bujiao Wu; Kewen Wu 001; Jialin Zhang 001 (SODA, 2020)

Quantum Combinatorial Games: Structures and Computational Complexity. - Kyle Burke; Matthew Ferland; Shang-Hua Teng (CoRR, 2020)

On the Equivalence Between High-Order Network-Influence Frameworks: General-Threshold, Hypergraph-Triggering, and Logic-Triggering Models. - Wei Chen 013; Shang-Hua Teng; Hanrui Zhang 001 (CoRR, 2020)

A graph-theoretical basis of stochastic-cascading network influence: Characterizations of influence-based centrality. - Wei Chen 013; Shang-Hua Teng; Hanrui Zhang 001 (Theor. Comput. Sci., 2020)

Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable. - Sina Dehghani; Hamed Saleh; Saeed Seddighin; Shang-Hua Teng (AAAI, 2021)

Winning the War by (Strategically) Losing Battles: Settling the Complexity of Grundy-Values in Undirected Geography. - Kyle W. Burke; Matthew T. Ferland; Shang-Hua Teng (FOCS, 2021)

Transverse Wave: an impartial color-propagation game inspired by Social Influence and Quantum Nim. - Kyle Burke; Matthew Ferland; Shang-Hua Teng (CoRR, 2021)

Nimber-Preserving Reductions and Homomorphic Sprague-Grundy Game Encodings. - Kyle Burke; Matthew Ferland; Shang-Hua Teng (CoRR, 2021)

Quantum-Inspired Combinatorial Games: Algorithms and Complexity. - Kyle W. Burke; Matthew Ferland; Shang-Hua Teng (FUN, 2022)

Beyond Traditional Characterizations in the Age of Data: Big Models, Scalable Algorithms, and Meaningful Solutions. - Shang-Hua Teng (KDD, 2022)

Technical Perspective: Maximum Flow through a Network: A Storied Problem and a Groundbreaking Solution. - Shang-Hua Teng (Commun. ACM, 2023)

Non-conservative diffusion and its application to social network analysis. - Rumi Ghosh; Kristina Lerman; Tawan Surachawala; Konstantin Voevodski; Shang-Hua Teng (J. Complex Networks, 2023)

"Intelligent Heuristics Are the Future of Computing". - Shang-Hua Teng (ACM Trans. Intell. Syst. Technol., 2023)

Regularization and Optimal Multiclass Learning. - Julian Asilis; Siddartha Devic; Shaddin Dughmi; Vatsal Sharan; Shang-Hua Teng (COLT, 2024)

Open Problem: Can Local Regularization Learn All Multiclass Problems? - Julian Asilis; Siddartha Devic; Shaddin Dughmi; Vatsal Sharan; Shang-Hua Teng (COLT, 2024)

A Tractability Gap Beyond Nim-Sums: It's Hard to Tell Whether a Bunch of Superstars Are Losers. - Kyle Burke; Matthew Ferland; Svenja Huntemann; Shang-Hua Teng (FUN, 2024)

ALPINE: Unveiling The Planning Capability of Autoregressive Learning in Language Models. - Siwei Wang 002; Yifei Shen; Shi Feng; Haoran Sun; Shang-Hua Teng; Wei Chen 013 (NeurIPS, 2024)

Transductive Learning is Compact. - Julian Asilis; Siddartha Devic; Shaddin Dughmi; Vatsal Sharan; Shang-Hua Teng (NeurIPS, 2024)

Learnability is a Compact Property. - Julian Asilis; Siddartha Devic; Shaddin Dughmi; Vatsal Sharan; Shang-Hua Teng (CoRR, 2024)

Nimber-preserving reduction: Game secrets and homomorphic Sprague-Grundy theorem. - Kyle Burke; Matthew Ferland; Shang-Hua Teng (Theor. Comput. Sci., 2024)

Proper Learnability and the Role of Unlabeled Data. - Julian Asilis; Siddartha Devic; Shaddin Dughmi; Vatsal Sharan; Shang-Hua Teng (ALT, 2025)