#### Filter Results:

- Full text PDF available (73)

#### Publication Year

1982

2019

- This year (1)
- Last 5 years (24)
- Last 10 years (75)

#### Supplemental Content

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Daniel A. Spielman, Shang-Hua Teng
- J. ACM
- 2004

We introduce the smoothed analysis of algorithms, which continuously interpolates between the worst-case and average-case analyses of algorithms. In smoothed analysis, we measure the maximum over… (More)

- Daniel A. Spielman, Shang-Hua Teng
- STOC
- 2003

We present algorithms for solving symmetric, diagonally-dominant linear systems to accuracy ε in time linear in their number of non-zeros and log (κf (A) ε), where κf (A) is the condition number of… (More)

- Xi Chen, Xiaotie Deng, Shang-Hua Teng
- J. ACM
- 2007

We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version) introduced by… (More)

In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to a specific category,… (More)

- Daniel A. Spielman, Shang-Hua Teng
- SIAM J. Comput.
- 2008

We introduce a new notion of graph sparsificaiton based on spectral similarity of graph Laplacians: spectral sparsification requires that the Laplacian quadratic form of the sparsifier approximate… (More)

- Daniel A. Spielman, Shang-Hua Teng
- SIAM J. Matrix Analysis Applications
- 2006

We present a randomized algorithm that, on input a symmetric, weakly diagonally dominant n-by-n matrix A with m nonzero entries and an n-vector b, produces a y such that $\norm{y - \pinv{A} b}_{A}… (More)

- Daniel A. Spielman, Shang-Hua Teng
- SIAM J. Comput.
- 2008

We study the design of local algorithms for massive graphs. A local algorithm is one that finds a solution containing or near a given vertex without looking at the whole graph. We present a local… (More)

Abstract Spectral partitioning methods use the Fiedler vector—the eigenvector of the second-smallest eigenvalue of the Laplacian matrix—to find a small separator of a graph. These methods are… (More)

- Jin Huang, Xiaohan Shi, +6 authors Heung-yeung Shum
- SIGGRAPH
- 2006

In this paper we present a general framework for performing constrained mesh deformation tasks with gradient domain techniques. We present a gradient domain technique that works well with a wide… (More)