| 2025 | ALT | Proper Learnability and the Role of Unlabeled Data. | Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, Shang-Hua Teng |
| 2024 | COLT | Regularization and Optimal Multiclass Learning. | Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, Shang-Hua Teng |
| 2024 | COLT | Open Problem: Can Local Regularization Learn All Multiclass Problems? | Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, Shang-Hua Teng |
| 2024 | FUN | 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 |
| 2022 | FUN | Nimber-Preserving Reduction: Game Secrets And Homomorphic Sprague-Grundy Theorem. | Kyle W. Burke, Matthew Ferland, Shang-Hua Teng |
| 2022 | FUN | Quantum-Inspired Combinatorial Games: Algorithms and Complexity. | Kyle W. Burke, Matthew Ferland, Shang-Hua Teng |
| 2022 | KDD | Beyond Traditional Characterizations in the Age of Data: Big Models, Scalable Algorithms, and Meaningful Solutions. | Shang-Hua Teng |
| 2021 | AAAI | Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable. | Sina Dehghani, Hamed Saleh, Saeed Seddighin, Shang-Hua Teng |
| 2021 | FOCS | 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 |
| 2020 | SODA | Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis. | Jiaqing Jiang, Xiaoming Sun, Shang-Hua Teng, Bujiao Wu, Kewen Wu, Jialin Zhang |
| 2018 | ISAAC | Going Beyond Traditional Characterizations in the Age of Big Data and Network Sciences (Invited Talk). | Shang-Hua Teng |
| 2018 | WSDM | Scalable Algorithms in the Age of Big Data and Network Sciences: Characterization, Primitives, and Techniques. | Shang-Hua Teng |
| 2017 | WWW | Interplay between Social Influence and Network Centrality: A Comparative Study on Shapley Centrality and Single-Node-Influence Centrality. | Wei Chen, Shang-Hua Teng |
| 2015 | COLT | Efficient Sampling for Gaussian Graphical Models via Spectral Sparsification. | Dehua Cheng, Yu Cheng, Yan Liu, Richard Peng, Shang-Hua Teng |
| 2015 | FOCS | Mixture Selection, Mechanism Design, and Signaling. | Yu Cheng, Ho Yee Cheung, Shaddin Dughmi, Ehsan Emamjomeh-Zadeh, Li Han, Shang-Hua Teng |
| 2014 | KDD | The interplay between dynamics and networks: centrality, communities, and cheeger inequality. | Rumi Ghosh, Shang-Hua Teng, Kristina Lerman, Xiaoran Yan |
| 2013 | COCOON | Perturbation Analysis of Maximum-Weighted Bipartite Matchings with Low Rank Data. | Xingwu Liu, Shang-Hua Teng |
| 2013 | FOCS | Faster Canonical Forms for Strongly Regular Graphs. | Lszl Babai, Xi Chen, Xiaorui Sun, Shang-Hua Teng, John Wilmes |
| 2013 | SODA | Finding Endogenously Formed Communities. | Maria-Florina Balcan, Christian Borgs, Mark Braverman, Jennifer T. Chayes, Shang-Hua Teng |
| 2013 | STOC | Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems. | Xi Chen, Xiaorui Sun, Shang-Hua Teng |
| 2012 | CVPR | Power SVM: Generalization with exemplar classification uncertainty. | Weiyu Zhang, Stella X. Yu, Shang-Hua Teng |
| 2012 | WAW | A Sublinear Time Algorithm for PageRank Computations. | Christian Borgs, Michael Brautbar, Jennifer T. Chayes, Shang-Hua Teng |
| 2011 | EMNLP | Class Label Enhancement via Related Instances. | Zornitsa Kozareva, Konstantin Voevodski, Shang-Hua Teng |
| 2011 | STOC | 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 |
| 2010 | STOC | Subgraph sparsification and nearly optimal ultrasparsifiers. | Alexandra Kolla, Yury Makarychev, Amin Saberi, Shang-Hua Teng |
| 2010 | UAI | Efficient Clustering with Limited Distance Information. | Konstantin Voevodski, Maria-Florina Balcan, Heiko Rglin, Shang-Hua Teng, Yu Xia |
| 2010 | TAMC | The Laplacian Paradigm: Emerging Algorithms for Massive Graphs. | Shang-Hua Teng |
| 2009 | ALT | Agnostic Clustering. | Maria-Florina Balcan, Heiko Rglin, Shang-Hua Teng |
| 2009 | ESA | Bounded Budget Betweenness Centrality Game for Strategic Network Formations. | Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhang, Jiajie Zhu |
| 2009 | FAW | On the alpha-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games. | Wei Chen, Shang-Hua Teng, Yajun Wang, Yuan Zhou |
| 2009 | FOCS | Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities. | Xi Chen, Decheng Dai, Ye Du, Shang-Hua Teng |
| 2009 | FOCS | Learning and Smoothed Analysis. | Adam Tauman Kalai, Alex Samorodnitsky, Shang-Hua Teng |
| 2009 | FOCS | Higher Eigenvalues of Graphs. | Jonathan A. Kelner, James R. Lee, Gregory N. Price, Shang-Hua Teng |
| 2009 | FOCS | Reducibility among Fractional Stability Problems. | Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng |
| 2009 | FOCS | Smoothed Analysis of Multiobjective Optimization. | Heiko Rglin, Shang-Hua Teng |
| 2009 | ISAAC | Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria. | Xi Chen, Shang-Hua Teng |
| 2008 | COCOON | Quantum Separation of Local Search and Fixed Point Computation. | Xi Chen, Xiaoming Sun, Shang-Hua Teng |
| 2008 | ISAAC | 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 |
| 2008 | ISAAC | The Isolation Game: A Game of Distances. | Yingchao Zhao, Wei Chen, Shang-Hua Teng |
| 2008 | PODC | 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 |
| 2007 | AAIM | Game and Market Equilibria: Computation, Approximation, and Smoothed Analysis. | Shang-Hua Teng |
| 2007 | FAW | On the Approximation and Smoothed Complexity of Leontief Market Equilibria. | Li-Sha Huang, Shang-Hua Teng |
| 2007 | FOCS | Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation. | Xi Chen, Shang-Hua Teng |
| 2007 | SODA | The approximation complexity of win-lose games. | Xi Chen, Shang-Hua Teng, Paul Valiant |
| 2007 | TAMC | Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces. | Yingchao Zhao, Shang-Hua Teng |
| 2007 | WAW | Local Computation of PageRank Contributions. | Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng |
| 2006 | FOCS | Computing Nash Equilibria: Approximation and Smoothed Complexity. | Xi Chen, Xiaotie Deng, Shang-Hua Teng |
| 2005 | COCOON | Smoothed Analysis of Algorithms and Heuristics. | Shang-Hua Teng |
| 2005 | STOC | Lower-stretch spanning trees. | Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng |
| 2004 | EuroPar | Parallel Delaunay Refinement with Off-Centers. | Daniel A. Spielman, Shang-Hua Teng, Alper ngr |
| 2004 | STOC | Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. | Daniel A. Spielman, Shang-Hua Teng |
| 2004 | SPAA | Time complexity of practical parallel steiner point insertion algorithms. | Daniel A. Spielman, Shang-Hua Teng, Alper ngr |
| 2003 | FOCS | Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time 0(m | Daniel A. Spielman, Shang-Hua Teng |
| 2003 | WADS | Smoothed Analysis (Motivation and Discrete Models). | Daniel A. Spielman, Shang-Hua Teng |
| 2001 | SODA | Generating well-shaped Delaunay meshed in 3D. | Xiang-Yang Li, Shang-Hua Teng |
| 2001 | STOC | Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. | Daniel A. Spielman, Shang-Hua Teng |
| 2000 | STOC | Smoothing and cleaning up slivers. | Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua Teng, Alper ngr, Noel Walkington |
| 1998 | COCOON | Min-Max-Boundary Domain Decomposition. | Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng |
| 1997 | COCOON | Eigenvalues, Eigenvectors, and Graph Partitioning. | Shang-Hua Teng |
| 1997 | PDPTA | Fault-tolerant Properties of Pyramid Network. | Feng Cao, Ding-Zhu Du, Shang-Hua Teng |
| 1997 | PPoPP | High Performance FORTRAN for Highly Unstructured Problems. | Y. Charlie Hu, S. Lennart Johnsson, Shang-Hua Teng |
| 1997 | SODA | Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes. | Gary L. Miller, Dafna Talmor, Shang-Hua Teng |
| 1996 | COCOON | Fast Separator Decomposition for Finite Element Meshes. | Shang-Hua Teng |
| 1996 | FOCS | Spectral Partitioning Works: Planar Graphs and Finite Element Meshes. | Daniel A. Spielman, Shang-Hua Teng |
| 1995 | STOC | A Delaunay based numerical method for three dimensions: generation, formulation, and partition. | Gary L. Miller, Dafna Talmor, Shang-Hua Teng, Noel Walkington |
| 1994 | ISAAC | Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs. | Ming-Yang Kao, Shang-Hua Teng |
| 1994 | SODA | Moments of Inertia and Graph Separators. | Keith D. Gremban, Gary L. Miller, Shang-Hua Teng |
| 1993 | FOCS | Approximating Shortest Superstrings | Shang-Hua Teng, F. Frances Yao |
| 1993 | POPL | Automatic Array Alignment in Data-Parallel Programs. | Siddhartha Chatterjee, John R. Gilbert, Robert Schreiber, Shang-Hua Teng |
| 1993 | PPoPP | Generating Local Address and Communication Sets for Data-Parallel Programs. | Siddhartha Chatterjee, John R. Gilbert, Fred J. E. Long, Robert Schreiber, Shang-Hua Teng |
| 1993 | STOC | Optimal online scheduling of parallel jobs with dependencies. | Anja Feldmann, Ming-Yang Kao, Jir Sgall, Shang-Hua Teng |
| 1993 | WADS | Parallel Construction of Quadtrees and Quality Triangulations. | Marshall W. Bern, David Eppstein, Shang-Hua Teng |
| 1993 | WADS | Improved Parallel Depth-First Search in Undirected Planar Graphs. | Ming-Yang Kao, Shang-Hua Teng, Kentaro Toyama |
| 1992 | SPAA | Separator Based Parallel Divide and Conquer in Computational Geometry. | Alan M. Frieze, Gary L. Miller, Shang-Hua Teng |
| 1991 | CRYPTO | Functional Inversion and Communication Complexity. | Shang-Hua Teng |
| 1991 | FOCS | Dynamic Scheduling on Parallel Machines | Anja Feldmann, Jir Sgall, Shang-Hua Teng |
| 1991 | FOCS | A Unified Geometric Approach to Graph Separators | Gary L. Miller, Shang-Hua Teng, Stephen A. Vavasis |
| 1989 | SPAA | Constructing Trees in Parallel. | Mikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng |
| 1988 | CRYPTO | A Universal Problem in Secure and Verifiable Distributed Computation. | Ming-Deh A. Huang, Shang-Hua Teng |
| 1988 | PODC | Secure and Verifiable Schemes for Election and General Distributed Computing Problems. | Ming-Deh A. Huang, Shang-Hua Teng |
| 1987 | STOC | Dynamic Parallel Complexity of Computational Circuits | Gary L. Miller, Shang-Hua Teng |