| Publication | Date of Publication | Type |
|---|
| Bounded geometries, fractals, and low-distortion embeddings | 2026-05-29 | Paper |
| Measured descent: a new embedding method for finite metrics | 2026-05-29 | Paper |
| L_p metrics on the Heisenberg group and the Goemans-Linial conjecture | 2026-05-29 | Paper |
| Algorithms on negatively curved spaces | 2026-05-29 | Paper |
| Sparsifying sums of norms | 2025-08-15 | Paper |
| Fusible HSTs and the randomized k-server conjecture | 2025-08-12 | Paper |
| Talagrand's convolution conjecture on Gaussian space | 2025-08-05 | Paper |
| Approximate constraint satisfaction requires large LP relaxations | 2025-05-20 | Paper |
scientific article; zbMATH DE number 7829292 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
Non-existence of annular separators in geometric graphs
Discrete & Computational Geometry | 2024-02-09 | Paper |
Relations between scaling exponents in unimodular random graphs
Geometric and Functional Analysis. GAFA | 2023-12-18 | Paper |
| Sparsifying generalized linear models | 2023-11-29 | Paper |
Spectral dimension, Euclidean embeddings, and the metric growth exponent
Israel Journal of Mathematics | 2023-10-12 | Paper |
| Sparsifying sums of norms | 2023-05-15 | Paper |
Pure entropic regularization for metrical task systems
Theory of Computing | 2023-01-11 | Paper |
| Spectral hypergraph sparsification via chaining | 2022-09-09 | Paper |
Conformal growth rates and spectral geometry on distributional limits of graphs
The Annals of Probability | 2022-02-01 | Paper |
Chemical subdiffusivity of critical 2D percolation
Communications in Mathematical Physics | 2022-01-31 | Paper |
On planar graphs of uniform polynomial growth
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2021-07-23 | Paper |
Metrical task systems on trees via mirror descent and unfair gluing
SIAM Journal on Computing | 2021-06-22 | Paper |
Adversarial Hypothesis Testing and a Quantum Stein’s Lemma for Restricted Measurements
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Metrical task systems on trees via mirror descent and unfair gluing
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Flow-Cut Gaps and Face Covers in Planar Graphs
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Discrete uniformizing metrics on distributional limits of sphere packings
Geometric and Functional Analysis. GAFA | 2019-09-11 | Paper |
\(k\)-server via multiscale entropic regularization
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Pure entropic regularization for metrical task systems
(available as arXiv preprint) | 2019-06-10 | Paper |
| Dimension reduction for finite trees in \(\ell_1\) | 2019-05-10 | Paper |
Approximate Constraint Satisfaction Requires Large LP Relaxations
Journal of the ACM | 2018-08-02 | Paper |
Regularization under diffusion and anticoncentration of the information content
Duke Mathematical Journal | 2018-05-18 | Paper |
Separators in region intersection graphs
(available as arXiv preprint) | 2018-05-03 | Paper |
Transport-entropy inequalities and curvature in discrete-space Markov chains
A Journey Through Discrete Mathematics | 2018-02-26 | Paper |
| Fusible HSTs and the randomized k-server conjecture | 2017-11-06 | Paper |
Randomly removing \(g\) handles at once
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Diffusive estimates for random walks on stationary random graphs of polynomial growth
Geometric and Functional Analysis. GAFA | 2017-07-18 | Paper |
Covering the large spectrum and generalized Riesz products
SIAM Journal on Discrete Mathematics | 2017-05-24 | Paper |
Adversarial hypothesis testing and a quantum Stein's lemma for restricted measurements (extended abstract)
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
A Gaussian upper bound for martingale small-ball probabilities
The Annals of Probability | 2017-01-13 | Paper |
A node-capacitated Okamura-Seymour theorem
Mathematical Programming. Series A. Series B | 2015-10-19 | Paper |
Lower bounds on the size of semidefinite programming relaxations
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Multiway spectral partitioning and higher-order Cheeger inequalities
Journal of the ACM | 2015-08-14 | Paper |
| scientific article; zbMATH DE number 6469222 (Why is no real title available?) | 2015-08-03 | Paper |
On the 2-sum embedding conjecture
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
On the geometry of graphs with a forbidden minor
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
| On distance scales, embeddings, and efficient relaxations of the cut cone | 2014-10-13 | Paper |
Bilipschitz snowflakes and metrics of negative type
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
A node-capacitated Okamura-Seymour theorem
Proceedings of the forty-fifth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Higher Eigenvalues of Graphs
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Near-optimal distortion bounds for embedding doubling spaces into L <sub>1</sub>
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Cover times, blanket times, and majorizing measures
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
| scientific article; zbMATH DE number 6297701 (Why is no real title available?) | 2014-05-22 | Paper |
Multi-way spectral partitioning and higher-order Cheeger inequalities
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Pathwidth, trees, and random embeddings
Combinatorica | 2014-03-17 | Paper |
Dimension reduction for finite trees in _1
Discrete & Computational Geometry | 2014-01-24 | Paper |
Harmonic maps on amenable groups and a diffusive lower bound for random walks
The Annals of Probability | 2013-11-12 | Paper |
Harmonic maps on amenable groups and a diffusive lower bound for random walks
The Annals of Probability | 2013-11-12 | Paper |
Markov type and threshold embeddings
Geometric and Functional Analysis. GAFA | 2013-08-12 | Paper |
| A lower bound on dimension reduction for trees in \ell₁ | 2013-02-26 | Paper |
On the Hausdorff dimension of ultrametric subsets in R^n
Fundamenta Mathematicae | 2012-09-17 | Paper |
Cover times, blanket times, and majorizing measures
Annals of Mathematics. Second Series | 2012-06-29 | Paper |
| A note on mixing times of planar random walks | 2012-05-17 | Paper |
Metric uniformization and spectral bounds for graphs
Geometric and Functional Analysis. GAFA | 2012-01-24 | Paper |
On the optimality of gluing over scales
Discrete & Computational Geometry | 2011-08-23 | Paper |
Eigenvectors of random graphs: nodal domains
Random Structures & Algorithms | 2011-08-09 | Paper |
Randomly removing \(g\) handles at once
Computational Geometry | 2010-09-02 | Paper |
Euclidean distortion and the sparsest cut (extended abstract)
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
The intrinsic dimensionality of graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Trees and Markov convexity
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Trees and Markov convexity
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Almost Euclidean subspaces of \ell₁N via expander codes
(available as arXiv preprint) | 2010-08-06 | Paper |
Coarse differentiation and multi-flows in planar graphs
Discrete & Computational Geometry | 2010-03-04 | Paper |
An improved approximation ratio for the minimum linear arrangement problem
Information Processing Letters | 2010-01-29 | Paper |
On the Optimality of Gluing over Scales
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Volume distortion for subsets of Euclidean spaces
Discrete & Computational Geometry | 2009-05-06 | Paper |
Improved Approximation Algorithms for Minimum Weight Vertex Separators
SIAM Journal on Computing | 2009-04-30 | Paper |
Trees and Markov convexity
Geometric and Functional Analysis. GAFA | 2009-03-13 | Paper |
Eigenvectors of Random Graphs: Nodal Domains
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
Coarse Differentiation and Multi-flows in Planar Graphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
| scientific article; zbMATH DE number 5506210 (Why is no real title available?) | 2009-02-10 | Paper |
Vertex cuts, random walks, and dimension reduction in series-parallel graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing | 2009-01-05 | Paper |
Euclidean Sections of $\ell_1^N$ with Sublinear Randomness and Error-Correction over the Reals
Lecture Notes in Computer Science | 2008-11-27 | Paper |
The intrinsic dimensionality of graphs
Combinatorica | 2008-10-22 | Paper |
| Eigenvalue multiplicity and volume growth | 2008-06-10 | Paper |
Fréchet embeddings of negative type metrics
Discrete & Computational Geometry | 2008-02-18 | Paper |
Euclidean distortion and the sparsest cut
Journal of the American Mathematical Society | 2007-11-01 | Paper |
The black-box complexity of nearest-neighbor search
Theoretical Computer Science | 2006-01-09 | Paper |
Measured descent: A new embedding method for finite metrics
Geometric and Functional Analysis. GAFA | 2005-11-14 | Paper |
Metric structures in \(L_1\): dimension, snowflakes, and average distortion
European Journal of Combinatorics | 2005-09-29 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Extending Lipschitz functions via random metric partitions
Inventiones Mathematicae | 2005-04-14 | Paper |
Hardness of Approximation for Vertex-Connectivity Network Design Problems
SIAM Journal on Computing | 2005-02-21 | Paper |
Embedding the diamond graph in L_p and dimension reduction in L₁
Geometric and Functional Analysis. GAFA | 2005-02-11 | Paper |
Absolute Lipschitz extendability
Comptes Rendus. Mathématique. Académie des Sciences, Paris | 2004-08-20 | Paper |
| scientific article; zbMATH DE number 1947057 (Why is no real title available?) | 2003-07-07 | Paper |
On expanders from the action of GL(2,Z)
(available as arXiv preprint) | N/A | Paper |
