Shang-Hua Teng
Orcid: 0000-0001-5011-4514Affiliations:
- Boston University, USA
According to our database1,
Shang-Hua Teng
authored at least 198 papers
between 1987 and 2024.
Collaborative distances:
Collaborative distances:
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 OtherLinks
Online presence:
-
on zbmath.org
-
on viaf.org
-
on id.loc.gov
-
on d-nb.info
-
on cs.bu.edu
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
A Tractability Gap Beyond Nim-Sums: It's Hard to Tell Whether a Bunch of Superstars Are Losers.
CoRR, 2024
2023
ACM Trans. Intell. Syst. Technol., December, 2023
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
Proceedings of the 11th International Conference on Fun with Algorithms, 2022
Proceedings of the 11th International Conference on Fun with Algorithms, 2022
2021
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
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
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
Proceedings of the Encyclopedia of GIS., 2017
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
Proceedings of the Social, Cultural, and Behavioral Modeling, 2017
2016
Theor. Comput. Sci., 2016
Capturing the interplay of dynamics and networks through parameterizations of Laplacian operators.
PeerJ Comput. Sci., 2016
Found. Trends Theor. Comput. Sci., 2016
Interplay between Social Influence and Network Centrality: Shapley Values and Scalable Algorithms.
CoRR, 2016
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016
2015
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015
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
Internet Math., 2014
Scalable Parallel Factorizations of SDD Matrices and Efficient Sampling for Gaussian Graphical Models.
CoRR, 2014
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
Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems.
Proceedings of the Symposium on Theory of Computing Conference, 2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013
2012
ACM Trans. Algorithms, 2012
CoRR, 2012
Proceedings of the Algorithms and Models for the Web Graph - 9th International Workshop, 2012
Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition, 2012
2011
Theor. Comput. Sci., 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
Proceedings of the Similarity-Based Pattern Recognition - First International Workshop, 2011
Proceedings of the Innovations in Computer Science, 2011
Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing, 2011
Proceedings of the Computer Science, The Hardware, Software and Heart of It, 2011
2010
Proceedings of the UAI 2010, 2010
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010
Proceedings of the Behavioral and Quantitative Game Theory, 2010
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
Electron. Colloquium Comput. Complex., 2009
Commun. ACM, 2009
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
Proceedings of the Workshop on Hot Topics in Cloud Computing, 2009
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009
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
Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009
2008
Proceedings of the Encyclopedia of GIS., 2008
Decision trees are PAC-learnable from most product distributions: a smoothed analysis
CoRR, 2008
CoRR, 2008
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008
Proceedings of the AIRWeb 2008, 2008
2007
Int. J. Comput. Geom. Appl., 2007
Paths Beyond Local Search: A Nearly Tight Bound for Randomized Fixed-Point Computation
CoRR, 2007
Proceedings of the Internet and Network Economics, Third International Workshop, 2007
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007
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
Proceedings of the Algorithmic Aspects in Information and Management, 2007
2006
SIAM J. Matrix Anal. Appl., 2006
Electron. Colloquium Comput. Complex., 2006
Electron. Colloquium Comput. Complex., 2006
Proceedings of the Internet and Network Economics, Second International Workshop, 2006
Proceedings of the Internet and Network Economics, Second International Workshop, 2006
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006
2005
Proceedings of the Advances in Spatial and Temporal Databases, 9th International Symposium, 2005
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
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
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004
Proceedings of the Euro-Par 2004 Parallel Processing, 2004
2003
Math. Program., 2003
Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time O(m<sup>1.31</sup>)
CoRR, 2003
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
2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
2000
Int. J. Comput. Geom. Appl., 2000
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000
1999
Int. J. Comput. Geom. Appl., 1999
Int. J. Comput. Geom. Appl., 1999
Proceedings of the 8th International Meshing Roundtable, 1999
Proceedings of the 32nd Annual Hawaii International Conference on System Sciences (HICSS-32), 1999
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
SIAM J. Sci. Comput., 1998
J. Comb. Optim., 1998
Proceedings of the Solving Irregularly Structured Problems in Parallel, 1998
Proceedings of the Solving Irregularly Structured Problems in Parallel, 1998
Proceedings of the 7th International Meshing Roundtable, 1998
1997
SIAM J. Matrix Anal. Appl., July, 1997
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
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
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997
1996
Int. J. Comput. Geom. Appl., 1996
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996
1995
ACM Trans. Program. Lang. Syst., 1995
J. Parallel Distributed Comput., 1995
Fundam. Informaticae, 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
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994
1993
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993
Proceedings of the Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1993
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993
1992
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
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991
1990
J. Parallel Distributed Comput., 1990
J. Algorithms, 1990
1989
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
Proceedings of the Advances in Cryptology, 1988
1987