Shang-Hua Teng | Academic Influence

Why Is Shang-Hua Teng Influential?

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.

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 Papers

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

Shang-Hua Teng's AcademicInfluence.com Rankings

Computer Science