The following pages link to Shang-Hua Teng (Q248950):
Displaying 50 items.
- (Q198591) (redirect page) (← links)
- Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362) (← links)
- Optimal cache-oblivious mesh layouts (Q633762) (← links)
- Bounded budget betweenness centrality game for strategic network formations (Q655424) (← links)
- Metric uniformization and spectral bounds for graphs (Q659931) (← links)
- Independent sets versus perfect matchings (Q673116) (← links)
- Competitive routing over time (Q719282) (← links)
- Quantum separation of local search and fixed point computation (Q848947) (← links)
- Spectral partitioning works: planar graphs and finite element meshes (Q869898) (← links)
- Space efficient processor identity protocol (Q910199) (← links)
- Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces (Q1007250) (← links)
- Market equilibria with hybrid linear-Leontief utilities (Q1014627) (← links)
- The isolation game: a game of distances (Q1034611) (← links)
- Simple efficient graph compression schemes for dense and complement graphs (Q1288471) (← links)
- Dynamic scheduling on parallel machines (Q1331960) (← links)
- Functional inversion and communication complexity (Q1335026) (← links)
- On the complexity of computing the diameter of a polytope (Q1337144) (← links)
- Optimal on-line scheduling of parallel jobs with dependencies (Q1383801) (← links)
- Moments of inertia and graph separators (Q1383809) (← links)
- Combinatorial aspects of geometric graphs (Q1384214) (← links)
- Tree-based parallel algorithm design (Q1386764) (← links)
- Smoothed analysis of termination of linear programming algorithms (Q1403294) (← links)
- Layer based solutions for constrained space-time meshing. (Q1405147) (← links)
- Simultaneous refinement and coarsening for adaptive meshing (Q1809120) (← links)
- Recovering mesh geometry from a stiffness matrix (Q1851003) (← links)
- Generating local addresses and communication sets for data-parallel programs (Q1892863) (← links)
- An optimal parallel algorithm for planar cycle separators (Q1900892) (← links)
- Practical human-machine identification over insecure channels (Q1970332) (← links)
- Regression depth and center points. (Q1972305) (← links)
- A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality (Q2182332) (← links)
- \(k\)-nearest-neighbor clustering and percolation theory (Q2461550) (← links)
- (Q2768269) (← links)
- An Axiomatic Approach to Community Detection (Q2800560) (← links)
- A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning (Q2839169) (← links)
- Subgraph sparsification and nearly optimal ultrasparsifiers (Q2875132) (← links)
- A Sublinear Time Algorithm for PageRank Computations (Q2900584) (← links)
- A compact routing scheme and approximate distance oracle for power-law graphs (Q2933632) (← links)
- (Q2934593) (← links)
- Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems (Q2936576) (← links)
- Sliver exudation (Q2946996) (← links)
- Local Computation of PageRank Contributions (Q3078596) (← links)
- Spectral Sparsification of Graphs (Q3096091) (← links)
- (Q3128906) (← links)
- Smoothing and cleaning up slivers (Q3191993) (← links)
- (Q3390714) (← links)
- (Q3421283) (← links)
- PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES (Q3430330) (← links)
- Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices (Q3435007) (← links)
- (Q5090397) (← links)
- (Q5090990) (← links)
