Shang-Hua Teng

Orcid: 0000-0001-5011-4514

Affiliations:
  • Boston University, USA


According to our database1, Shang-Hua Teng authored at least 200 papers between 1987 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Awards

ACM Fellow

ACM Fellow 2009, "For contributions to theoretical computer science, algorithms and interdisciplinary applications of computing.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Nimber-preserving reduction: Game secrets and homomorphic Sprague-Grundy theorem.
Theor. Comput. Sci., 2024

ALPINE: Unveiling the Planning Capability of Autoregressive Learning in Language Models.
CoRR, 2024

Learnability is a Compact Property.
CoRR, 2024

A Tractability Gap Beyond Nim-Sums: It's Hard to Tell Whether a Bunch of Superstars Are Losers.
Proceedings of the 12th International Conference on Fun with Algorithms, 2024

Open Problem: Can Local Regularization Learn All Multiclass Problems?
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

Regularization and Optimal Multiclass Learning.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023
"Intelligent Heuristics Are the Future of Computing".
ACM Trans. Intell. Syst. Technol., December, 2023

Non-conservative diffusion and its application to social network analysis.
J. Complex Networks, December, 2023

Technical Perspective: Maximum Flow through a Network: A Storied Problem and a Groundbreaking Solution.
Commun. ACM, December, 2023

2022
Beyond Traditional Characterizations in the Age of Data: Big Models, Scalable Algorithms, and Meaningful Solutions.
Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

Quantum-Inspired Combinatorial Games: Algorithms and Complexity.
Proceedings of the 11th International Conference on Fun with Algorithms, 2022

2021
Nimber-Preserving Reductions and Homomorphic Sprague-Grundy Game Encodings.
CoRR, 2021

Transverse Wave: an impartial color-propagation game inspired by Social Influence and Quantum Nim.
CoRR, 2021

Winning the War by (Strategically) Losing Battles: Settling the Complexity of Grundy-Values in Undirected Geography.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
A graph-theoretical basis of stochastic-cascading network influence: Characterizations of influence-based centrality.
Theor. Comput. Sci., 2020

On the Equivalence Between High-Order Network-Influence Frameworks: General-Threshold, Hypergraph-Triggering, and Logic-Triggering Models.
CoRR, 2020

Quantum Combinatorial Games: Structures and Computational Complexity.
CoRR, 2020

Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Capturing Complementarity in Set Functions by Going Beyond Submodularity/Subadditivity.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

2018
A Systematic Framework and Characterization of Influence-Based Network Centrality.
CoRR, 2018

Scalable Algorithms in the Age of Big Data and Network Sciences: Characterization, Primitives, and Techniques.
Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, 2018

Going Beyond Traditional Characterizations in the Age of Big Data and Network Sciences (Invited Talk).
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017
Trip Planning Queries in Road Network Databases.
Proceedings of the Encyclopedia of GIS., 2017

Network Essence: PageRank Completion and Centrality-Conforming Markov Chains.
CoRR, 2017

Interplay between Social Influence and Network Centrality: A Comparative Study on Shapley Centrality and Single-Node-Influence Centrality.
Proceedings of the 26th International Conference on World Wide Web, 2017

Multi-layer Network Composition Under a Unified Dynamical Process.
Proceedings of the Social, Cultural, and Behavioral Modeling, 2017

2016
Maximum bipartite matchings with low rank data: Locality and perturbation analysis.
Theor. Comput. Sci., 2016

Capturing the interplay of dynamics and networks through parameterizations of Laplacian operators.
PeerJ Comput. Sci., 2016

Scalable Algorithms for Data and Network Analysis.
Found. Trends Theor. Comput. Sci., 2016

Network Composition from Multi-layer Data.
CoRR, 2016

Interplay between Social Influence and Network Centrality: Shapley Values and Scalable Algorithms.
CoRR, 2016

An Axiomatic Approach to Community Detection.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

2015
Spectral Sparsification of Random-Walk Matrix Polynomials.
CoRR, 2015

Mixture Selection, Mechanism Design, and Signaling.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Efficient Sampling for Gaussian Graphical Models via Spectral Sparsification.
Proceedings of The 28th Conference on Learning Theory, 2015

2014
Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems.
SIAM J. Matrix Anal. Appl., 2014

Bounded Budget Connection (BBC) games or how to make friends and influence people, on a budget.
J. Comput. Syst. Sci., 2014

Multiscale Matrix Sampling and Sublinear-Time PageRank Computation.
Internet Math., 2014

Scalable Parallel Factorizations of SDD Matrices and Efficient Sampling for Gaussian Graphical Models.
CoRR, 2014

Signaling in Quasipolynomial time.
CoRR, 2014

Fixed-Points of Social Choice: An Axiomatic Approach to Network Communities.
CoRR, 2014

The interplay between dynamics and networks: centrality, communities, and cheeger inequality.
Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

2013
A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning.
SIAM J. Comput., 2013

Reducibility among Fractional Stability Problems.
SIAM J. Comput., 2013

Spectral sparsification of graphs: theory and algorithms.
Commun. ACM, 2013

Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Finding Endogenously Formed Communities.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Faster Canonical Forms for Strongly Regular Graphs.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Perturbation Analysis of Maximum-Weighted Bipartite Matchings with Low Rank Data.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012
A compact routing scheme and approximate distance oracle for power-law graphs.
ACM Trans. Algorithms, 2012

Active Clustering of Biological Sequences.
J. Mach. Learn. Res., 2012

Sublinear Time Algorithm for PageRank Computations and Related Applications
CoRR, 2012

I Like Her more than You: Self-determined Communities
CoRR, 2012

A Sublinear Time Algorithm for PageRank Computations.
Proceedings of the Algorithms and Models for the Web Graph - 9th International Workshop, 2012

Power SVM: Generalization with exemplar classification uncertainty.
Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition, 2012

2011
Competitive routing over time.
Theor. Comput. Sci., 2011

Bounded budget betweenness centrality game for strategic network formations.
Theor. Comput. Sci., 2011

Spectral Sparsification of Graphs.
SIAM J. Comput., 2011

Optimal Cache-Oblivious Mesh Layouts.
Theory Comput. Syst., 2011

Smoothed analysis of condition numbers and complexity implications for linear programming.
Math. Program., 2011

Clustering Protein Sequences Given the Approximation Stability of the Min-Sum Objective Function
CoRR, 2011

Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Min-sum Clustering of Protein Sequences with Limited Distance Information.
Proceedings of the Similarity-Based Pattern Recognition - First International Workshop, 2011

A Complexity View of Markets with Social Influence.
Proceedings of the Innovations in Computer Science, 2011

Class Label Enhancement via Related Instances.
Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing, 2011

Numerical Thinking in Algorithm Design and Analysis.
Proceedings of the Computer Science, The Hardware, Software and Heart of It, 2011

2010
Foreword to special issue on SODA 2008.
ACM Trans. Algorithms, 2010

Metric uniformization and spectral bounds for graphs
CoRR, 2010

Quantum Separation of Local Search and Fixed Point Computation.
Algorithmica, 2010

Efficient Clustering with Limited Distance Information.
Proceedings of the UAI 2010, 2010

The Laplacian Paradigm: Emerging Algorithms for Massive Graphs.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Subgraph sparsification and nearly optimal ultrasparsifiers.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Beyond convexity: local search and equilibrium computation.
Proceedings of the Behavioral and Quantitative Game Theory, 2010

On the complexity of equilibria in markets with additively separable utilities.
Proceedings of the Behavioral and Quantitative Game Theory, 2010

2009
Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces.
Theor. Comput. Sci., 2009

The isolation game: A game of distances.
Theor. Comput. Sci., 2009

Market equilibria with hybrid linear-Leontief utilities.
Theor. Comput. Sci., 2009

Settling the complexity of computing two-player Nash equilibria.
J. ACM, 2009

Smoothed analysis: an attempt to explain the behavior of algorithms in practice.
Commun. ACM, 2009

Spectral affinity in protein networks.
BMC Syst. Biol., 2009

Finding local communities in protein networks.
BMC Bioinform., 2009

Compact Routing in Power-Law Graphs.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Colocation Games and Their Application to Distributed Resource Management.
Proceedings of the Workshop on Hot Topics in Cloud Computing, 2009

Smoothed Analysis of Multiobjective Optimization.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Higher Eigenvalues of Graphs.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Learning and Smoothed Analysis.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

On the alpha-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games.
Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

Agnostic Clustering.
Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

2008
Trip Planning Queries in Road Network Databases.
Proceedings of the Encyclopedia of GIS., 2008

Lower-Stretch Spanning Trees.
SIAM J. Comput., 2008

Atropos: A PSPACE-Complete Sperner Triangle Game.
Internet Math., 2008

Local Computation of PageRank Contributions.
Internet Math., 2008

Decision trees are PAC-learnable from most product distributions: a smoothed analysis
CoRR, 2008

Preference Games and Personalized Equilibria, with Applications to Fractional BGP
CoRR, 2008

On the Stability of Web Crawling and Web Search.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Robust PageRank and locally computable spam detection features.
Proceedings of the AIRWeb 2008, 2008

2007
Parallel Delaunay Refinement: Algorithms and Analyses.
Int. J. Comput. Geom. Appl., 2007

Games on the Sperner Triangle
CoRR, 2007

Paths Beyond Local Search: A Nearly Tight Bound for Randomized Fixed-Point Computation
CoRR, 2007

A bounded-degree network formation game
CoRR, 2007

<i>k</i>-Nearest-Neighbor Clustering and Percolation Theory.
Algorithmica, 2007

A PSPACE-complete Sperner Triangle Game.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

The approximation complexity of win-lose games.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms.
Proceedings of the Probabilistic Methods in the Design and Analysis of Algorithms, 23.09., 2007

Game and Market Equilibria: Computation, Approximation, and Smoothed Analysis.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006
Subspace gradient domain mesh deformation.
ACM Trans. Graph., 2006

Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices.
SIAM J. Matrix Anal. Appl., 2006

On the Approximation and Smoothed Complexity of Leontief Market Equilibria.
Electron. Colloquium Comput. Complex., 2006

Computing Nash Equilibria: Approximation and Smoothed Complexity.
Electron. Colloquium Comput. Complex., 2006

Truthful Auctions with Optimal Profit.
Proceedings of the Internet and Network Economics, Second International Workshop, 2006

Sparse Games Are Hard.
Proceedings of the Internet and Network Economics, Second International Workshop, 2006

Geometric Separator for d-Dimensional Ball Graphs.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
On Trip Planning Queries in Spatial Databases.
Proceedings of the Advances in Spatial and Temporal Databases, 9th International Symposium, 2005

Smoothed Analysis of Algorithms and Heuristics.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time.
J. ACM, 2004

Lower-Stretch Spanning Trees
CoRR, 2004

Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Time complexity of practical parallel steiner point insertion algorithms.
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

Parallel Delaunay Refinement with Off-Centers.
Proceedings of the Euro-Par 2004 Parallel Processing, 2004

2003
Smoothed analysis of termination of linear programming algorithms.
Math. Program., 2003

Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time O(m<sup>1.31</sup>)
CoRR, 2003

Smoothed Analysis of Interior-Point Algorithms: Condition Number
CoRR, 2003

Smoothed Analysis of Interior-Point Algorithms: Termination
CoRR, 2003

Smoothed Analysis (Motivation and Discrete Models).
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time 0(m<sup>1.31</sup>).
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2002
Recovering Mesh Geometry from a Stiffness Matrix.
Numer. Algorithms, 2002

Guest Editor's Foreward.
Theory Comput. Syst., 2002

2001
Min-max-boundary domain decomposition.
Theor. Comput. Sci., 2001

Generating well-shaped Delaunay meshed in 3D.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000
Sliver exudation.
J. ACM, 2000

Unstructured Mesh Generation: Theory, Practice, and Perspectives.
Int. J. Comput. Geom. Appl., 2000

Guest Editor's Foreword.
Int. J. Comput. Geom. Appl., 2000

Regression Depth and Center Points.
Discret. Comput. Geom., 2000

Smoothing and cleaning up slivers.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999
Fault Tolerance Properties of Pyramid Networks.
IEEE Trans. Computers, 1999

The Dynamic Parallel Complexity of Computational Circuits.
SIAM J. Comput., 1999

Practical Human-Machine Identification over Insecure Channels.
J. Comb. Optim., 1999

Low Energy and Mutually Distant Sampling.
J. Algorithms, 1999

Optimal Coarsening of Unstructured Meshes.
J. Algorithms, 1999

Data Generation for Geometric Algorithms on Non-Uniform Distributions.
Int. J. Comput. Geom. Appl., 1999

Parallel Construction of Quadtrees and Quality Triangulations.
Int. J. Comput. Geom. Appl., 1999

Simultaneous Refinement and Coarsening for Adaptive Meshing.
Eng. Comput., 1999

Biting Ellipses to Generate Anisotropic Mesh.
Proceedings of the 8th International Meshing Roundtable, 1999

Biting Spheres in 3D.
Proceedings of the 8th International Meshing Roundtable, 1999

Collaborative Web Crawling: Information Gathering/Processing over Internet.
Proceedings of the 32nd Annual Hawaii International Conference on System Sciences (HICSS-32), 1999

Efficient Large-Scale Access Control for Internet/Intranet Information Systems.
Proceedings of the 32nd Annual Hawaii International Conference on System Sciences (HICSS-32), 1999

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

Geometric Separators for Finite-Element Meshes.
SIAM J. Sci. Comput., 1998

Geometric Mesh Partitioning: Implementation and Experiments.
SIAM J. Sci. Comput., 1998

Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs.
J. Comb. Optim., 1998

Optimal On-Line Scheduling of Parallel Jobs with Dependencies.
J. Comb. Optim., 1998

Combinatorial aspects of geometric graphs.
Comput. Geom., 1998

Dynamic Load Balancing for Parallel Adaptive Mesh Refinement.
Proceedings of the Solving Irregularly Structured Problems in Parallel, 1998

Parallel Profile Matching for Large Scale Webcasting.
Proceedings of the Solving Irregularly Structured Problems in Parallel, 1998

Simultaneous Refinement and Coarsening: Adaptive Meshing with Moving Boundaries.
Proceedings of the 7th International Meshing Roundtable, 1998

1997
Fast Nested Dissection for Finite Element Meshes.
SIAM J. Matrix Anal. Appl., July, 1997

How Good is Recursive Bisection?
SIAM J. Sci. Comput., 1997

Approximating Shortest Superstrings.
SIAM J. Comput., 1997

Moments of Inertia and Graph Separators.
J. Comb. Optim., 1997

Separators for sphere-packings and nearest neighbor graphs.
J. ACM, 1997

Tree-Based Parallel Algorithm Design.
Algorithmica, 1997

Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

A Data-Parallel Implementation of the Geometric Partitioning Algorithm.
Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1997

A Data-Parallel Adaptive N-body Method.
Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1997

High Performance FORTRAN for Highly Unstructured Problems.
Proceedings of the Sixth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPOPP), 1997

Fault-tolerant Properties of Pyramid Network.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1997

Eigenvalues, Eigenvectors, and Graph Partitioning.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996
Approximating center points with iterative Radon points.
Int. J. Comput. Geom. Appl., 1996

Spectral Partitioning Works: Planar Graphs and Finite Element Meshes.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Disk Packings and Planar Separators.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Fast Separator Decomposition for Finite Element Meshes.
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995
Optimal Evaluation of Array Expressions on Massively Parallel Machines.
ACM Trans. Program. Lang. Syst., 1995

Independent Sets Versus Perfect Matchings.
Theor. Comput. Sci., 1995

Generating Local Address and Communication Sets for Data-Parallel Programs.
J. Parallel Distributed Comput., 1995

A Deterministic Linear Time Algorithm for Geometric Separators and its Applications.
Fundam. Informaticae, 1995

An Optimal Parallel Algorithm for Planar Cycle Separators.
Algorithmica, 1995

A Delaunay based numerical method for three dimensions: generation, formulation, and partition.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994
Dynamic Scheduling on Parallel Machines.
Theor. Comput. Sci., 1994

Functional Inversion and Communication Complexity.
J. Cryptol., 1994

On the Complexity of Computing the Diameter of a Polytope.
Comput. Complex., 1994

Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993
Improved Parallel Depth-First Search in Undirected Planar Graphs.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Optimal online scheduling of parallel jobs with dependencies.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Automatic Array Alignment in Data-Parallel Programs.
Proceedings of the Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1993

Approximating Center Points with Iterated Radon Points.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

1992
Separator Based Parallel Divide and Conquer in Computational Geometry.
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

Optimal Evaluation of Array Expressions on Massively Parallel Machines (Extended Abstract).
Proceedings of the 2nd SIGPLAN Workshop on Languages, Compilers, and Run-Time Environments for Distributed Memory Multiprocessors, Boulder, Colorado, September 30, 1992

1991
A Unified Geometric Approach to Graph Separators
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
Adaptive Parallel Algorithms for Integral Knapsack Problems.
J. Parallel Distributed Comput., 1990

Security, Verifiability, and Universality in Distributed Computing.
J. Algorithms, 1990

Space Efficient Processor Identity Protocol.
Inf. Process. Lett., 1990

1989
Constructing Trees in Parallel.
Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

1988
Secure and Verifiable Schemes for Election and General Distributed Computing Problems.
Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988

A Universal Problem in Secure and Verifiable Distributed Computation.
Proceedings of the Advances in Cryptology, 1988

1987
The construction of Huffman-equivalent prefix code in NC.
SIGACT News, 1987

Parallel Algorithms for Message Decomposition.
J. Parallel Distributed Comput., 1987


  Loading...