• Publications
  • Influence
On distributing symmetric streaming computations
TLDR
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. Expand
Approximation algorithms for low-distortion embeddings into low-dimensional spaces
TLDR
We present several approximation algorithms for the problem of embedding metric spaces into a line, and into the two-dimensional plane. Expand
Convergence and Approximation in Potential Games
TLDR
We study the speed of convergence to approximately optimal states in two classes of potential games. Expand
Low-distortion embeddings of general metrics into the line
TLDR
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Expand
Convergence and approximation in potential games
TLDR
We study the speed of convergence on deterministic best-response walks in these games and prove that starting from an arbitrary configuration, after one round of best responses of players, the resulting configuration is a @Q(n)-approximate solution. Expand
Approximation algorithms for embedding general metrics into trees
TLDR
We consider the problem of embedding general metrics into trees. Expand
Computing the Gromov-Hausdorff Distance for Metric Trees
TLDR
We give the first proof of hardness and first non-trivial approximation algorithm for computing Gromov-Hausdorff distance for geodesic metrics in trees. Expand
Fat Polygonal Partitions with Applications to Visualization and Embeddings
TLDR
We introduce a new hierarchical partition scheme, called a polygonal partition, which uses convex polygons rather than just rectangles. Expand
Approximate Greedy Clustering and Distance Selection for Graph Metrics
TLDR
We show efficient approximation algorithms for greedy permutations in graphs and in high-dimensional Euclidean spaces, and fast exact algorithms for graphs of bounded treewidth. Expand
Theory research at Google
TLDR
This article is derived from the emergence of web search and associated technologies, and focuses on the problems of research interest to theoretical computer scientists that arise at Google. Expand
...
1
2
3
4
5
...