Shang-Hua Teng | Academic Influence

Shang-Hua Teng's AcademicInfluence.com Rankings

Shang-Hua Teng

Computer Science

#704

World Rank

#726

Historical Rank

Database

#2857

World Rank

#2982

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Shang-Hua Teng's Degrees

Bachelors Computer Science National Taiwan University

Similar Degrees You Can Earn

Why Is Shang-Hua Teng Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Shang-Hua Teng is a Chinese-American computer scientist. He is the Seeley G. Mudd Professor of Computer Science and Mathematics at the University of Southern California. Previously, he was the chairman of the Computer Science Department at the Viterbi School of Engineering of the University of Southern California.

(See a Problem?)

Shang-Hua Teng's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems (2003) (934)
Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time (2001) (891)
Spectral partitioning works: planar graphs and finite element meshes (1996) (602)
Settling the complexity of computing two-player Nash equilibria (2007) (527)
Spectral Sparsification of Graphs (2008) (473)
Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems (2006) (398)
A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning (2008) (342)
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs (2010) (325)
Subspace gradient domain mesh deformation (2006) (301)
On Trip Planning Queries in Spatial Databases (2005) (292)
How Good is Recursive Bisection? (1997) (256)
Separators for sphere-packings and nearest neighbor graphs (1997) (247)
Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices (2003) (232)
Geometric mesh partitioning: implementation and experiments (1995) (229)
Lower-stretch spanning trees (2004) (213)
A unified geometric approach to graph separators (1991) (208)
Automatic Mesh Partitioning (1992) (193)
Computing Nash Equilibria: Approximation and Smoothed Complexity (2006) (189)
Generating local addresses and communication sets for data-parallel programs (1993) (182)
Smoothed analysis: an attempt to explain the behavior of algorithms in practice (2009) (174)
Spectral sparsification of graphs: theory and algorithms (2013) (172)
Automatic array alignment in data-parallel programs (1993) (164)
Local Computation of PageRank Contributions (2007) (163)
A Delaunay based numerical method for three dimensions: generation, formulation, and partition (1995) (162)
Geometric Separators for Finite-Element Meshes (1998) (126)
Parallel Construction of Quadtrees and Quality Triangulations (1993) (117)
Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities (2009) (108)
Dynamic scheduling on parallel machines (1991) (105)
Generating well-shaped Delaunay meshed in 3D (2001) (101)
Points, spheres, and separators: a unified geometric approach to graph partitioning (1992) (91)
Optimal Tree Contraction in the EREW Model (1988) (90)
Optimal On-Line Scheduling of Parallel Jobs with Dependencies (1993) (88)
Smoothing and cleaning up slivers (2000) (86)
Approximating center points with iterative Radon points (1996) (79)
Finding local communities in protein networks (2009) (79)
Unstructured Mesh Generation: Theory, Practice, and Perspectives (2000) (76)
Optimal evaluation of array expressions on massively parallel machines (1995) (74)
Scalable Algorithms for Data and Network Analysis (2016) (74)
Approximating shortest superstrings (1997) (71)
Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation (1998) (71)
Biting: advancing front meets sphere packing (2000) (66)
Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria (2009) (62)
Approximating center points with iterated radon points (1993) (62)
Subgraph sparsification and nearly optimal ultrasparsifiers (2009) (62)
Constructing trees in parallel (1989) (61)
Regression Depth and Center Points (1998) (60)
A Cartesian Parallel Nested Dissection Algorithm (1994) (60)
Reducibility among Fractional Stability Problems (2009) (58)
The Laplacian Paradigm: Emerging Algorithms for Massive Graphs (2010) (57)
Disk packings and planar separators (1996) (57)
A deterministic linear time algorithm for geometric separators and its applications (1993) (55)
Fault Tolerance Properties of Pyramid Networks (1999) (55)
Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time O(m1.31) (2003) (55)
Smoothed analysis of termination of linear programming algorithms (2003) (54)
Bounded budget connection (BBC) games or how to make friends and influence people, on a budget (2008) (51)
Finding Endogenously Formed Communities (2012) (49)
Competitive routing over time (2009) (46)
Learning and Smoothed Analysis (2009) (46)
Sparse Games Are Hard (2006) (45)
Mixture Selection, Mechanism Design, and Signaling (2015) (44)
Parallel Delaunay Refinement: Algorithms and Analyses (2002) (42)
Solving sparse, symmetric, diagonally-dominant linear systems in time O(m/sup 1.31/ (2003) (42)
High performance Fortran for highly irregular problems (1997) (41)
Active Clustering of Biological Sequences (2012) (41)
Optimal Coarsening of Unstructured Meshes (1999) (41)
Smoothed Analysis (Motivation and Discrete Models) (2003) (39)
The interplay between dynamics and networks: centrality, communities, and cheeger inequality (2014) (39)
On the Radius-Edge Condition in the Control Volume Method (1999) (39)
Adaptive Parallel Algorithms for Integral Knapsack Problems (1990) (38)
Smoothed Analysis of Renegar’s Condition Number for Linear Programming (2002) (37)
The approximation complexity of win-lose games (2007) (36)
Coarsening, Sampling, and Smoothing: Elements of the Multilevel Method (1999) (36)
Coarsening, Sampling, and Smoothing: Elements of the Multilevel Method (1999) (36)
Geometric Spectral Partitioning (1994) (36)
Interplay between Social Influence and Network Centrality: A Comparative Study on Shapley Centrality and Single-Node-Influence Centrality (2016) (35)
Smoothed Analysis of Multiobjective Optimization (2009) (35)
Robust PageRank and locally computable spam detection features (2008) (34)
Spectral affinity in protein networks (2009) (34)
Efficient Sampling for Gaussian Graphical Models via Spectral Sparsification (2015) (33)
Colocation Games and Their Application to Distributed Resource Management (2009) (33)
Biting Ellipses to Generate Anisotropic Mesh (1999) (32)
A Sublinear Time Algorithm for PageRank Computations (2012) (32)
On the Approximation and Smoothed Complexity of Leontief Market Equilibria (2006) (31)
Practical Human-Machine Identification over Insecure Channels (1999) (30)
Smoothed Analysis of Algorithms and Heuristics (2005) (30)
Dynamic parallel complexity of computational circuits (1987) (29)
Class Label Enhancement via Related Instances (2011) (29)
Compact Routing in Power-Law Graphs (2009) (29)
A compact routing scheme and approximate distance oracle for power-law graphs (2012) (29)
Sliver-free three dimensional delaunay mesh generation (2001) (28)
Metric Uniformization and Spectral Bounds for Graphs (2010) (28)
Faster Canonical Forms for Strongly Regular Graphs (2013) (27)
Non-Conservative Diffusion and its Application to Social Network Analysis (2011) (27)
Multiscale Matrix Sampling and Sublinear-Time PageRank Computation (2012) (27)
Power SVM: Generalization with exemplar classification uncertainty (2012) (27)
Efficient Clustering with Limited Distance Information (2010) (26)
Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis (2019) (25)
Bounded Budget Betweenness Centrality Game for Strategic Network Formations (2011) (25)
Biting Spheres in 3D (1999) (24)
Optimal good-aspect-ratio coarsening for unstructured meshes (1997) (23)
Agnostic Clustering (2009) (23)
Point placement for meshless methods using Sphere packing and Advancing Front methods (2001) (23)
Separator based parallel divide and conquer in computational geometry (1992) (22)
Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs (1994) (22)
k-Nearest-Neighbor Clustering and Percolation Theory (2007) (22)
Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation (2007) (20)
Collaborative Web crawling: information gathering/processing over Internet (1999) (20)
Smoothed analysis of condition numbers and complexity implications for linear programming (2011) (19)
Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems (2013) (18)
Data Generation for Geometric Algorithms on Non-Uniform Distributions (1999) (18)
Tree-Based Parallel Algorithm Design (1997) (17)
Space Efficient Processor Identity Protocol (1990) (16)
Higher Eigenvalues of Graphs (2009) (16)
Simultaneous Refinement and Coarsening: Adaptive Meshing with Moving Boundaries (1998) (15)
The isolation game: A game of distances (2008) (15)
Moments of Inertia and Graph Separators (1994) (15)
A Data-Parallel Implementation of the Geometric Partitioning Algorithm (1997) (15)
Time complexity of practical parallel steiner point insertion algorithms (2004) (14)
The construction of Huffman-equivalent prefix code in NC (1987) (13)
Spectral Sparsification of Random-Walk Matrix Polynomials (2015) (13)
Simultaneous Refinement and Coarsening for Adaptive Meshing (1999) (13)
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms (2008) (12)
Combinatorial aspects of geometric graphs (1998) (12)
Min-max-boundary domain decomposition (1998) (12)
Optimal Cache-Oblivious Mesh Layouts (2007) (12)
Min-sum Clustering of Protein Sequences with Limited Distance Information (2011) (12)
Market equilibria with hybrid linear-Leontief utilities (2006) (11)
Dynamic Load Balancing for Parallel Adaptive Mesh Refinement (1998) (11)
Truthful Auctions with Optimal Profit (2006) (11)
Decision trees are PAC-learnable from most product distributions: a smoothed analysis (2008) (11)
A Data-Parallel Adaptive N-body Method (1997) (11)
A bounded-degree network formation game (2007) (11)
Low Energy and Mutually Distant Sampling (1999) (11)
Foundations of Computational Mathematics, Santander 2005: Smoothed Analysis of Algorithms and Heuristics (2006) (10)
Independent Sets Versus Perfect Matchings (1995) (10)
I Like Her more than You: Self-determined Communities (2012) (10)
Secure and verifiable schemes for election and general distributed computing problems (1988) (10)
Partitioning Meshes with Lines and Planes (1996) (10)
A Complexity View of Markets with Social Influence (2010) (10)
Security, Verifiability, and Universality in Distributed Computing (1990) (9)
Quantum Separation of Local Search and Fixed Point Computation (2008) (9)
On the alpha-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games (2009) (9)
On the complexity of computing the diameter of a polytope (1994) (8)
Scalable Parallel Factorizations of SDD Matrices and Efficient Sampling for Gaussian Graphical Models (2014) (8)
Trip Planning Queries in Road Network Databases (2008) (8)
An Axiomatic Approach to Community Detection (2016) (8)
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms: Preface (2006) (8)
Parallel delaunay refinement and space-time meshing (2002) (8)
Layer based solutions for constrained space-time meshing (2003) (7)
Parallel Delaunay Refinement with Off-Centers (2004) (7)
Capturing the interplay of dynamics and networks through parameterizations of Laplacian operators (2016) (7)
Quantum Combinatorial Games: Structures and Computational Complexity (2020) (6)
Smoothed Analysis of Interior-Point Algorithms: Termination (2003) (6)
Mutually Repellant Sampling (1995) (6)
Smoothed Analysis of Interior-Point Algorithms: Condition Number (2003) (6)
Atropos: A PSPACE-Complete Sperner Triangle Game (2008) (6)
Capturing Complementarity in Set Functions by Going Beyond Submodularity/Subadditivity (2018) (5)
A Universal Problem in Secure and Verifiable Distributed Computation (1988) (5)
Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces (2007) (5)
Network Essence: PageRank Completion and Centrality-Conforming Markov Chains (2017) (4)
Optimal evaluation of array expressions on massively parallel machines (extended abstract) (1993) (4)
Sublinear Time Algorithm for PageRank Computations and Related Applications (2012) (4)
Dynamic Load Balancing for Parallel Adaptive Mesh Reenement ? (1998) (4)
Science for fun: new impartial board games (2009) (3)
A graph-theoretical basis of stochastic-cascading network influence: Characterizations of influence-based centrality (2020) (3)
The Dynamic Parallel Complexity of Computational Circuits (1999) (3)
Paths Beyond Local Search: A Nearly Tight Bound for Randomized Fixed-Point Computation (2007) (3)
Fast Nested Dissection for Finite Element Meshes (1997) (3)
Transverse Wave: an impartial color-propagation game inspired by Social Influence and Quantum Nim (2021) (3)
Maximum bipartite matchings with low rank data: Locality and perturbation analysis (2016) (3)
Winning the War by (Strategically) Losing Battles: Settling the Complexity of Grundy-Values in Undirected Geography (2021) (3)
Improved Parallel Depth-First Search in Undirected Planar Graphs (1993) (3)
Automated Parallel Solution of Unstructured PDE Problems (2007) (2)
Recovering Mesh Geometry from a Stiffness Matrix (2002) (2)
An optimal parallel algorithm for planar cycle separators (1995) (2)
Interplay between Social Influence and Network Centrality: Shapley Values and Scalable Algorithms (2016) (2)
High Performance FORTRAN for Highly Unstructured Problems (1997) (2)
Scalable Algorithms in the Age of Big Data and Network Sciences: Characterization, Primitives, and Techniques (2018) (2)
Parallel Profile Matching for Large Scale Webcasting (1998) (2)
Parallel Algorithms for Message Decomposition (1987) (2)
Fixed-Points of Social Choice: An Axiomatic Approach to Network Communities (2014) (2)
On the Approximation and Smoothed Complexity of (2006) (2)
The Betweenness Centrality Game for Strategic Network Formations (2008) (2)
Preference Games and Personalized Equilibria, with Applications to Fractional BGP (2008) (2)
Network Composition from Multi-layer Data (2016) (2)
Spectral Partitioning Works : Planar graphs and nite element meshes Preliminary Draft (1997) (2)
Geometric Separator for d-Dimensional Ball Graphs (2006) (2)
Quantum-Inspired Combinatorial Games: Algorithms and Complexity (2022) (1)
Matching randomly in parallel (1989) (1)
Faster Canonical Forms For Strongly Regular Graphs ( Extended Abstract ) (2013) (1)
A Systematic Framework and Characterization of Influence-Based Network Centrality (2018) (1)
Biting Spheres in 3 D (1999) (1)
20 06 Computing Nash Equilibria : Approximation and Smoothed Complexity (2006) (1)
Efficient large-scale access control for Internet/intranet information systems (1999) (1)
Functional inversion and communication complexity (1991) (1)
On the Equivalence Between High-Order Network-Influence Frameworks: General-Threshold, Hypergraph-Triggering, and Logic-Triggering Models (2020) (1)
Multi-layer Network Composition Under a Unified Dynamical Process (2017) (1)
On the complexity of equilibria in markets with additively separable utilities (2010) (1)
Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable (2021) (1)
Numerical Thinking in Algorithm Design and Analysis (2011) (1)
Signaling in Quasipolynomial time (2014) (1)
Proceedings of the 11th International Conference on Algorithms and Computation (2000) (1)
To Generate Good Triangular Meshes, Conforming to Control Spacing Requirements (2001) (1)
On the Stability of Web Crawling and Web Search (2008) (1)
Going Beyond Traditional Characterizations in the Age of Big Data and Network Sciences (Invited Talk) (2018) (0)
Dynamic Load Balancing for Parallel Adaptive Mesh Refinement Dynamic Load Balancing for Parallel Adaptive Mesh Reenement Table of Contents Chapter 1 Introduction 2 Mesh Generation 3 Graph Partition List of Figures (1999) (0)
Generate Good Mesh E (2007) (0)
Eigenvalues, Eigenvectors, and Graph Partitioning (1997) (0)
6.50s A Peek at Parallel Processing from an Applications Perspective (1996) (0)
Game and Market Equilibria: Computation, Approximation, and Smoothed Analysis (2007) (0)
TRANSVERSE WAVE: AN IMPARTIAL COLOR-PROPAGATION GAME INSPRIED BY SOCIAL INFLUENCE AND QUANTUM NIM 21B (2021) (0)
3.5 Computer Science (2002) (0)
Simultaneous Refinement and Coarsening for Adaptive Meshing 1 (0)
Fault-tolerant Properties of Pyramid Network (1997) (0)
Clustering Protein Sequences Given the Approximation Stability of the Min-Sum Objective Function (2011) (0)
Foreword to special issue on SODA 2008 (2010) (0)
Beyond convexity: local search and equilibrium computation (2010) (0)
07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms (2007) (0)
Algorithms and computation : 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000 : proceedings (2000) (0)
Nimber-Preserving Reductions and Homomorphic Sprague-Grundy Game Encodings (2021) (0)
A PSPACE-complete Sperner Triangle Game (2007) (0)
Parallel profile matching in a large scale webcasting system (1999) (0)
Games on the Sperner Triangle (2007) (0)
Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2000, Bar Harbor, Maine, USA, July 9-13, 2000 (2000) (0)
D S ] 1 2 Fe b 20 15 Spectral Sparsification of Random-Walk Matrix Polynomials (2018) (0)
Fast Separator Decomposition for Finite Element Meshes (1996) (0)
Clustering and network analysis with biological applications (2011) (0)
Nimber-Preserving Reduction: Game Secrets And Homomorphic Sprague-Grundy Theorem (2022) (0)
Lecture 5 - Complexity of Games (2010) (0)
Beyond Traditional Characterizations in the Age of Data: Big Models, Scalable Algorithms, and Meaningful Solutions (2022) (0)
G T ] 1 4 A ug 2 01 5 Mixture Selection , Mechanism Design , and Signaling ∗ (2018) (0)
Perturbation Analysis of Maximum-Weighted Bipartite Matchings with Low Rank Data (2013) (0)
Guest Editor’s Foreword (2002) (0)
Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007 (2007) (0)
Guest Editor's Foreward. (2002) (0)
Generate Good Mesh Respecting to Control (2007) (0)
3.5 Computer Science Parallel Programming Paradigms (2001) (0)

This paper list is powered by the following services:

Other Resources About Shang-Hua Teng

en.wikipedia.org

What Schools Are Affiliated With Shang-Hua Teng?

Shang-Hua Teng is affiliated with the following schools: