|
Search the dblp DataBase
Shang-Hua Teng:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Daniel A. Spielman, Shang-Hua Teng
Spectral Partitioning Works: Planar Graphs and Finite Element Meshes. [Citation Graph (1, 0)][DBLP] FOCS, 1996, pp:96-105 [Conf]
- Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng
Min-Max-Boundary Domain Decomposition. [Citation Graph (0, 0)][DBLP] COCOON, 1998, pp:137-146 [Conf]
- Shang-Hua Teng
Smoothed Analysis of Algorithms and Heuristics. [Citation Graph (0, 0)][DBLP] COCOON, 2005, pp:10-11 [Conf]
- Shang-Hua Teng
Fast Separator Decomposition for Finite Element Meshes. [Citation Graph (0, 0)][DBLP] COCOON, 1996, pp:189-198 [Conf]
- Shang-Hua Teng
Eigenvalues, Eigenvectors, and Graph Partitioning. [Citation Graph (0, 0)][DBLP] COCOON, 1997, pp:515- [Conf]
- Siu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng
Sliver Exudation. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1999, pp:1-13 [Conf]
- Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng
Approximating Center Points with Iterated Radon Points. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1993, pp:91-98 [Conf]
- David Eppstein, Gary L. Miller, Shang-Hua Teng
A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1993, pp:99-108 [Conf]
- Daniel A. Spielman, Shang-Hua Teng
Disk Packings and Planar Separators. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1996, pp:349-358 [Conf]
- Ming-Deh A. Huang, Shang-Hua Teng
A Universal Problem in Secure and Verifiable Distributed Computation. [Citation Graph (0, 0)][DBLP] CRYPTO, 1988, pp:336-352 [Conf]
- Shang-Hua Teng
Functional Inversion and Communication Complexity. [Citation Graph (0, 0)][DBLP] CRYPTO, 1991, pp:232-241 [Conf]
- Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
Parallel Delaunay Refinement with Off-Centers. [Citation Graph (0, 0)][DBLP] Euro-Par, 2004, pp:812-819 [Conf]
- Anja Feldmann, Jiri Sgall, Shang-Hua Teng
Dynamic Scheduling on Parallel Machines [Citation Graph (0, 0)][DBLP] FOCS, 1991, pp:111-120 [Conf]
- Gary L. Miller, Shang-Hua Teng, Stephen A. Vavasis
A Unified Geometric Approach to Graph Separators [Citation Graph (0, 0)][DBLP] FOCS, 1991, pp:538-547 [Conf]
- Daniel A. Spielman, Shang-Hua Teng
Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time 0(m1.31). [Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:416-427 [Conf]
- Shang-Hua Teng, F. Frances Yao
Approximating Shortest Superstrings [Citation Graph (0, 0)][DBLP] FOCS, 1993, pp:158-165 [Conf]
- Xi Chen, Xiaotie Deng, Shang-Hua Teng
Computing Nash Equilibria: Approximation and Smoothed Complexity. [Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:603-612 [Conf]
- Shang-Hua Teng, Qi Lu
Efficient Large-Scale Access Control for Internet/Intranet Information Systems. [Citation Graph (0, 0)][DBLP] HICSS, 1999, pp:- [Conf]
- Shang-Hua Teng, Qi Lu, Matthias Eichstaedt, Daniel Alexander Ford, Tobin J. Lehman
Collaborative Web Crawling: Information Gathering/Processing over Internet. [Citation Graph (0, 0)][DBLP] HICSS, 1999, pp:- [Conf]
- Xiang-Yang Li, Shang-Hua Teng, Alper Üngör
Simultaneous Refinement and Coarsening: Adaptive Meshing with Moving Boundaries. [Citation Graph (0, 0)][DBLP] IMR, 1998, pp:201-210 [Conf]
- Xiang-Yang Li, Shang-Hua Teng, Alper Üngör
Biting Spheres in 3D. [Citation Graph (0, 0)][DBLP] IMR, 1999, pp:85-95 [Conf]
- Xiang-Yang Li, Shang-Hua Teng, Alper Üngör
Biting Ellipses to Generate Anisotropic Mesh. [Citation Graph (0, 0)][DBLP] IMR, 1999, pp:97-108 [Conf]
- Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
Parallel Delaunay Refinement: Algorithms And Analyses. [Citation Graph (0, 0)][DBLP] IMR, 2002, pp:205-217 [Conf]
- John R. Gilbert, Gary L. Miller, Shang-Hua Teng
Geometric mesh partitioning: implementation and experiments. [Citation Graph (0, 0)][DBLP] IPPS, 1995, pp:418-427 [Conf]
- Matthias Eichstaedt, Qi Lu, Shang-Hua Teng
Parallel Profile Matching for Large Scale Webcasting. [Citation Graph (0, 0)][DBLP] IRREGULAR, 1998, pp:17-28 [Conf]
- Xiang-Yang Li, Shang-Hua Teng
Dynamic Load Balancing for Parallel Adaptive Mesh Refinement. [Citation Graph (0, 0)][DBLP] IRREGULAR, 1998, pp:144-155 [Conf]
- Ming-Yang Kao, Shang-Hua Teng
Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs. [Citation Graph (0, 0)][DBLP] ISAAC, 1994, pp:451-459 [Conf]
- Feng Cao, Ding-Zhu Du, Shang-Hua Teng
Fault-tolerant Properties of Pyramid Network. [Citation Graph (0, 0)][DBLP] PDPTA, 1997, pp:1690-1693 [Conf]
- Ming-Deh A. Huang, Shang-Hua Teng
Secure and Verifiable Schemes for Election and General Distributed Computing Problems. [Citation Graph (0, 0)][DBLP] PODC, 1988, pp:182-196 [Conf]
- Siddhartha Chatterjee, John R. Gilbert, Robert Schreiber, Shang-Hua Teng
Automatic Array Alignment in Data-Parallel Programs. [Citation Graph (0, 0)][DBLP] POPL, 1993, pp:16-28 [Conf]
- Y. Charlie Hu, S. Lennart Johnsson, Shang-Hua Teng
High Performance FORTRAN for Highly Unstructured Problems. [Citation Graph (0, 0)][DBLP] PPOPP, 1997, pp:13-24 [Conf]
- Siddhartha Chatterjee, John R. Gilbert, Fred J. E. Long, Robert Schreiber, Shang-Hua Teng
Generating Local Address and Communication Sets for Data-Parallel Programs. [Citation Graph (0, 0)][DBLP] PPOPP, 1993, pp:149-158 [Conf]
- Y. Charlie Hu, S. Lennart Johnsson, Shang-Hua Teng
A Data-Parallel Adaptive N-body Method. [Citation Graph (0, 0)][DBLP] PPSC, 1997, pp:- [Conf]
- Y. Charlie Hu, Shang-Hua Teng, S. Lennart Johnsson
A Data-Parallel Implementation of the Geometric Partitioning Algorithm. [Citation Graph (0, 0)][DBLP] PPSC, 1997, pp:- [Conf]
- Siddhartha Chatterjee, John R. Gilbert, Robert Schneider, Shang-Hua Teng
Optimal Evaluation of Array Expressions on Massively Parallel Machines (Extended Abstract). [Citation Graph (0, 0)][DBLP] SIGPLAN Workshop, 1992, pp:68-71 [Conf]
- Xiang-Yang Li, Shang-Hua Teng
Generating well-shaped Delaunay meshed in 3D. [Citation Graph (0, 0)][DBLP] SODA, 2001, pp:28-37 [Conf]
- Keith D. Gremban, Gary L. Miller, Shang-Hua Teng
Moments of Inertia and Graph Separators. [Citation Graph (0, 0)][DBLP] SODA, 1994, pp:452-461 [Conf]
- Gary L. Miller, Dafna Talmor, Shang-Hua Teng
Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes. [Citation Graph (0, 0)][DBLP] SODA, 1997, pp:538-547 [Conf]
- Mikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng
Constructing Trees in Parallel. [Citation Graph (0, 0)][DBLP] SPAA, 1989, pp:421-431 [Conf]
- Alan M. Frieze, Gary L. Miller, Shang-Hua Teng
Separator Based Parallel Divide and Conquer in Computational Geometry. [Citation Graph (0, 0)][DBLP] SPAA, 1992, pp:420-429 [Conf]
- Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
Time complexity of practical parallel steiner point insertion algorithms. [Citation Graph (0, 0)][DBLP] SPAA, 2004, pp:267-268 [Conf]
- Feifei Li, Dihan Cheng, Marios Hadjieleftheriou, George Kollios, Shang-Hua Teng
On Trip Planning Queries in Spatial Databases. [Citation Graph (0, 0)][DBLP] SSTD, 2005, pp:273-290 [Conf]
- Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua Teng, Alper Üngör, Noel Walkington
Smoothing and cleaning up slivers. [Citation Graph (0, 0)][DBLP] STOC, 2000, pp:273-277 [Conf]
- Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng
Lower-stretch spanning trees. [Citation Graph (0, 0)][DBLP] STOC, 2005, pp:494-503 [Conf]
- Anja Feldmann, Ming-Yang Kao, Jiri Sgall, Shang-Hua Teng
Optimal online scheduling of parallel jobs with dependencies. [Citation Graph (0, 0)][DBLP] STOC, 1993, pp:642-651 [Conf]
- Gary L. Miller, Shang-Hua Teng
Dynamic Parallel Complexity of Computational Circuits [Citation Graph (0, 0)][DBLP] STOC, 1987, pp:254-263 [Conf]
- Gary L. Miller, Dafna Talmor, Shang-Hua Teng, Noel Walkington
A Delaunay based numerical method for three dimensions: generation, formulation, and partition. [Citation Graph (0, 0)][DBLP] STOC, 1995, pp:683-692 [Conf]
- Daniel A. Spielman, Shang-Hua Teng
Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. [Citation Graph (0, 0)][DBLP] STOC, 2001, pp:296-305 [Conf]
- Daniel A. Spielman, Shang-Hua Teng
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. [Citation Graph (0, 0)][DBLP] STOC, 2004, pp:81-90 [Conf]
- Marshall W. Bern, David Eppstein, Shang-Hua Teng
Parallel Construction of Quadtrees and Quality Triangulations. [Citation Graph (0, 0)][DBLP] WADS, 1993, pp:188-199 [Conf]
- Ming-Yang Kao, Shang-Hua Teng, Kentaro Toyama
Improved Parallel Depth-First Search in Undirected Planar Graphs. [Citation Graph (0, 0)][DBLP] WADS, 1993, pp:409-420 [Conf]
- Daniel A. Spielman, Shang-Hua Teng
Smoothed Analysis (Motivation and Discrete Models). [Citation Graph (0, 0)][DBLP] WADS, 2003, pp:256-270 [Conf]
- Xi Chen, Xiaotie Deng, Shang-Hua Teng
Sparse Games Are Hard. [Citation Graph (0, 0)][DBLP] WINE, 2006, pp:262-273 [Conf]
- Xi Chen, Li-Sha Huang, Shang-Hua Teng
Market Equilibria with Hybrid Linear-Leontief Utilities. [Citation Graph (0, 0)][DBLP] WINE, 2006, pp:274-285 [Conf]
- Pinyan Lu, Shang-Hua Teng, Changyuan Yu
Truthful Auctions with Optimal Profit. [Citation Graph (0, 0)][DBLP] WINE, 2006, pp:27-36 [Conf]
- Ming-Yang Kao, Shang-Hua Teng, Kentaro Toyama
An Optimal Parallel Algorithm for Planar Cycle Separators. [Citation Graph (0, 0)][DBLP] Algorithmica, 1995, v:14, n:5, pp:398-408 [Journal]
- Gary L. Miller, Shang-Hua Teng
Tree-Based Parallel Algorithm Design. [Citation Graph (0, 0)][DBLP] Algorithmica, 1997, v:19, n:4, pp:369-389 [Journal]
- Alan M. Frieze, Shang-Hua Teng
On the Complexity of Computing the Diameter of a Polytope. [Citation Graph (0, 0)][DBLP] Computational Complexity, 1994, v:4, n:, pp:207-219 [Journal]
- Shang-Hua Teng
Combinatorial aspects of geometric graphs. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1998, v:9, n:4, pp:277-287 [Journal]
- Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
Parallel Delaunay Refinement: Algorithms and Analyses [Citation Graph (0, 0)][DBLP] CoRR, 2002, v:0, n:, pp:- [Journal]
- Nina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng
Regression Depth and Center Points [Citation Graph (0, 0)][DBLP] CoRR, 1998, v:0, n:, pp:- [Journal]
- Daniel A. Spielman, Shang-Hua Teng
Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time [Citation Graph (0, 0)][DBLP] CoRR, 2001, v:0, n:, pp:- [Journal]
- Daniel A. Spielman, Shang-Hua Teng
Smoothed Analysis of Interior-Point Algorithms: Termination [Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal]
- John Dunagan, Daniel A. Spielman, Shang-Hua Teng
Smoothed Analysis of Interior-Point Algorithms: Condition Number [Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal]
- Daniel A. Spielman, Shang-Hua Teng
Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time O(m1.31) [Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal]
- Daniel A. Spielman, Shang-Hua Teng
Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems [Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal]
- Michael Elkin, Daniel A. Spielman, Shang-Hua Teng
Lower-Stretch Spanning Trees [Citation Graph (0, 0)][DBLP] CoRR, 2004, v:0, n:, pp:- [Journal]
- Arvind Sankar, Daniel A. Spielman, Shang-Hua Teng
Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices [Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal]
- Nina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng
Regression Depth and Center Points. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2000, v:23, n:3, pp:305-323 [Journal]
- Xiang-Yang Li, Shang-Hua Teng, Alper Üngör
Simultaneous Refinement and Coarsening for Adaptive Meshing. [Citation Graph (0, 0)][DBLP] Eng. Comput. (Lond.), 1999, v:15, n:3, pp:280-291 [Journal]
- David Eppstein, Gary L. Miller, Shang-Hua Teng
A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. [Citation Graph (0, 0)][DBLP] Fundam. Inform., 1995, v:22, n:4, pp:309-329 [Journal]
- Marshall W. Bern, David Eppstein, Shang-Hua Teng
Parallel Construction of Quadtrees and Quality Triangulations. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 1999, v:9, n:6, pp:517-532 [Journal]
- Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng
Approximating center points with iterative Radon points. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 1996, v:6, n:3, pp:357-377 [Journal]
- Gary L. Miller, Dafna Talmor, Shang-Hua Teng
Data Generation for Geometric Algorithms on Non-Uniform Distributions. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 1999, v:9, n:6, pp:577-0 [Journal]
- Shang-Hua Teng
Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2000, v:10, n:3, pp:225- [Journal]
- Shang-Hua Teng, Chi Wai Wong
Unstructured Mesh Generation: Theory, Practice, and Perspectives. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2000, v:10, n:3, pp:227-266 [Journal]
- Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
Parallel Delaunay Refinement: Algorithms and Analyses. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2007, v:17, n:1, pp:1-30 [Journal]
- Shang-Hua Teng
Space Efficient Processor Identity Protocol. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1990, v:34, n:3, pp:147-154 [Journal]
- Siu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng
Sliver exudation. [Citation Graph (0, 0)][DBLP] J. ACM, 2000, v:47, n:5, pp:883-904 [Journal]
- Gary L. Miller, Shang-Hua Teng, William P. Thurston, Stephen A. Vavasis
Separators for sphere-packings and nearest neighbor graphs. [Citation Graph (0, 0)][DBLP] J. ACM, 1997, v:44, n:1, pp:1-29 [Journal]
- Daniel A. Spielman, Shang-Hua Teng
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. [Citation Graph (0, 0)][DBLP] J. ACM, 2004, v:51, n:3, pp:385-463 [Journal]
- Ming-Deh A. Huang, Shang-Hua Teng
Security, Verifiability, and Universality in Distributed Computing. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1990, v:11, n:3, pp:492-521 [Journal]
- Gary L. Miller, Dafna Talmor, Shang-Hua Teng
Optimal Coarsening of Unstructured Meshes. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:31, n:1, pp:29-65 [Journal]
- Shang-Hua Teng
Low Energy and Mutually Distant Sampling. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:30, n:1, pp:52-67 [Journal]
- Anja Feldmann, Ming-Yang Kao, Jiri Sgall, Shang-Hua Teng
Optimal On-Line Scheduling of Parallel Jobs with Dependencies. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 1998, v:1, n:4, pp:393-411 [Journal]
- Keith D. Gremban, Gary L. Miller, Shang-Hua Teng
Moments of Inertia and Graph Separators. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 1997, v:1, n:1, pp:79-104 [Journal]
- Xiang-Yang Li, Shang-Hua Teng
Practical Human-Machine Identification over Insecure Channels. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 1999, v:3, n:4, pp:347-361 [Journal]
- Ming-Yang Kao, Neill Occhiogrosso, Shang-Hua Teng
Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 1998, v:2, n:4, pp:351-359 [Journal]
- Shang-Hua Teng
Functional Inversion and Communication Complexity. [Citation Graph (0, 0)][DBLP] J. Cryptology, 1994, v:7, n:3, pp:153-170 [Journal]
- Siddhartha Chatterjee, John R. Gilbert, Fred J. E. Long, Robert Schreiber, Shang-Hua Teng
Generating Local Address and Communication Sets for Data-Parallel Programs. [Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 1995, v:26, n:1, pp:72-84 [Journal]
- Shang-Hua Teng
Adaptive Parallel Algorithms for Integral Knapsack Problems. [Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 1990, v:8, n:4, pp:400-406 [Journal]
- Shang-Hua Teng, Bin Wang
Parallel Algorithms for Message Decomposition. [Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 1987, v:4, n:3, pp:231-249 [Journal]
- Shang-Hua Teng
Guest Editor's Foreward. [Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2002, v:35, n:3, pp:249- [Journal]
- Gary L. Miller, Shang-Hua Teng
The Dynamic Parallel Complexity of Computational Circuits. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1999, v:28, n:5, pp:1664-1688 [Journal]
- Shang-Hua Teng, F. Frances Yao
Approximating Shortest Superstrings. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1997, v:26, n:2, pp:410-417 [Journal]
- Feng Cao, Ding-Zhu Du, D. Frank Hsu, Shang-Hua Teng
Fault Tolerance Properties of Pyramid Networks. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1999, v:48, n:1, pp:88-93 [Journal]
- Anja Feldmann, Jiri Sgall, Shang-Hua Teng
Dynamic Scheduling on Parallel Machines. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1994, v:130, n:1, pp:49-72 [Journal]
- Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng
Min-max-boundary domain decomposition. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:261, n:2, pp:253-266 [Journal]
- Shang-Hua Teng
Independent Sets Versus Perfect Matchings. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1995, v:145, n:1&2, pp:381-390 [Journal]
- Jin Huang, Xiaohan Shi, Xinguo Liu, Kun Zhou, Li-Yi Wei, Shang-Hua Teng, Hujun Bao, Baining Guo, Heung-Yeung Shum
Subspace gradient domain mesh deformation. [Citation Graph (0, 0)][DBLP] ACM Trans. Graph., 2006, v:25, n:3, pp:1126-1134 [Journal]
- Siddhartha Chatterjee, John R. Gilbert, Robert Schreiber, Shang-Hua Teng
Optimal Evaluation of Array Expressions on Massively Parallel Machines. [Citation Graph (0, 0)][DBLP] ACM Trans. Program. Lang. Syst., 1995, v:17, n:1, pp:123-156 [Journal]
- Shang-Hua Teng
Game and Market Equilibria: Computation, Approximation, and Smoothed Analysis. [Citation Graph (0, 0)][DBLP] AAIM, 2007, pp:424- [Conf]
- Kebin Wang, Shang-Hua Teng
Geometric Separator for d-Dimensional Ball Graphs. [Citation Graph (0, 0)][DBLP] CCCG, 2006, pp:- [Conf]
- Xi Chen, Shang-Hua Teng, Paul Valiant
The approximation complexity of win-lose games. [Citation Graph (0, 0)][DBLP] SODA, 2007, pp:159-168 [Conf]
- Yingchao Zhao, Shang-Hua Teng
Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces. [Citation Graph (0, 0)][DBLP] TAMC, 2007, pp:554-565 [Conf]
- Reid Andersen, Christian Borgs, Jennifer T. Chayes, John Hopcraft, Vahab S. Mirrokni, Shang-Hua Teng
Local Computation of PageRank Contributions. [Citation Graph (0, 0)][DBLP] WAW, 2007, pp:150-165 [Conf]
- Li-Sha Huang, Shang-Hua Teng
On the Approximation and Smoothed Complexity of Leontief Market Equilibria. [Citation Graph (0, 0)][DBLP] FAW, 2007, pp:96-107 [Conf]
- Nikolaos Laoutaris, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng
A bounded-degree network formation game [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
- Xi Chen, Shang-Hua Teng
Paths Beyond Local Search: A Nearly Tight Bound for Randomized Fixed-Point Computation [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
- Kyle Burke, Shang-Hua Teng
Games on the Sperner Triangle [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
- Xi Chen, Xiaotie Deng, Shang-Hua Teng
Settling the Complexity of Computing Two-Player Nash Equilibria [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
- Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang
Optimal Cache-Oblivious Mesh Layouts [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
- Xi Chen, Xiaotie Deng, Shang-Hua Teng
Computing Nash Equilibria: Approximation and Smoothed Complexity [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal]
- Li-Sha Huang, Shang-Hua Teng
On the Approximation and Smoothed Complexity of Leontief Market Equilibria [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal]
- Daniel A. Spielman, Shang-Hua Teng
Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal]
Agnostic Clustering. [Citation Graph (, )][DBLP]
Quantum Separation of Local Search and Fixed Point Computation. [Citation Graph (, )][DBLP]
07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms. [Citation Graph (, )][DBLP]
Bounded Budget Betweenness Centrality Game for Strategic Network Formations. [Citation Graph (, )][DBLP]
Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation. [Citation Graph (, )][DBLP]
Learning and Smoothed Analysis. [Citation Graph (, )][DBLP]
Reducibility among Fractional Stability Problems. [Citation Graph (, )][DBLP]
Smoothed Analysis of Multiobjective Optimization. [Citation Graph (, )][DBLP]
Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities. [Citation Graph (, )][DBLP]
Higher Eigenvalues of Graphs. [Citation Graph (, )][DBLP]
The Isolation Game: A Game of Distances. [Citation Graph (, )][DBLP]
On the Stability of Web Crawling and Web Search. [Citation Graph (, )][DBLP]
Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria. [Citation Graph (, )][DBLP]
Bounded budget connection (BBC) games or how to make friends and influence people, on a budget. [Citation Graph (, )][DBLP]
Subgraph sparsification and nearly optimal ultrasparsifiers. [Citation Graph (, )][DBLP]
The Laplacian Paradigm: Emerging Algorithms for Massive Graphs. [Citation Graph (, )][DBLP]
Compact Routing in Power-Law Graphs. [Citation Graph (, )][DBLP]
Competitive Routing over Time. [Citation Graph (, )][DBLP]
A PSPACE-complete Sperner Triangle Game. [Citation Graph (, )][DBLP]
On the alpha-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games. [Citation Graph (, )][DBLP]
Robust PageRank and locally computable spam detection features. [Citation Graph (, )][DBLP]
k-Nearest-Neighbor Clustering and Percolation Theory. [Citation Graph (, )][DBLP]
Quantum Separation of Local Search and Fixed Point Computation. [Citation Graph (, )][DBLP]
Finding local communities in protein networks. [Citation Graph (, )][DBLP]
Smoothed analysis: an attempt to explain the behavior of algorithms in practice. [Citation Graph (, )][DBLP]
Bounded Budget Connection (BBC) Games or How to make friends and influence people, on a budget [Citation Graph (, )][DBLP]
Spectral Sparsification of Graphs [Citation Graph (, )][DBLP]
A Local Clustering Algorithm for Massive Graphs and its Application to Nearly-Linear Time Graph Partitioning [Citation Graph (, )][DBLP]
Preference Games and Personalized Equilibria, with Applications to Fractional BGP [Citation Graph (, )][DBLP]
Decision trees are PAC-learnable from most product distributions: a smoothed analysis [Citation Graph (, )][DBLP]
Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities [Citation Graph (, )][DBLP]
Reducibility Among Fractional Stability Problems [Citation Graph (, )][DBLP]
Spending is not Easier than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria [Citation Graph (, )][DBLP]
Subgraph Sparsification and Nearly Optimal Ultrasparsifiers [Citation Graph (, )][DBLP]
Metric uniformization and spectral bounds for graphs [Citation Graph (, )][DBLP]
On the Approximation and Smoothed Complexity of Leontief Market Equilibria. [Citation Graph (, )][DBLP]
Computing Nash Equilibria: Approximation and Smoothed Complexity. [Citation Graph (, )][DBLP]
Search in 0.008secs, Finished in 0.612secs
|