| Publication | Date of Publication | Type |
|---|
| Rapid convergence of the unadjusted Langevin algorithm: isoperimetry suffices | 2024-09-20 | Paper |
| A unified approach to discrepancy minimization | 2024-08-22 | Paper |
| The manifold joys of sampling (invited talk) | 2024-06-24 | Paper |
scientific article; zbMATH DE number 7788369 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Robustly learning mixtures of k arbitrary Gaussians
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Reducing isotropy and volume to KLS: an o *( n 3 ψ 2 ) volume algorithm
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| Contrastive Moments: Unsupervised Halfspace Learning in Polynomial Time | 2023-11-02 | Paper |
Approximating sparse graphs: The random overlapping communities model
Random Structures & Algorithms | 2023-10-17 | Paper |
A unified view of graph regularity via matrix decompositions
Random Structures & Algorithms | 2023-10-12 | Paper |
Convergence of Gibbs sampling: coordinate hit-and-run mixes fast
Discrete & Computational Geometry | 2023-08-17 | Paper |
| scientific article; zbMATH DE number 7650131 (Why is no real title available?) | 2023-02-03 | Paper |
Socially fair network design via iterative rounding
Operations Research Letters | 2022-10-17 | Paper |
| A Slightly Improved Bound for the KLS Constant | 2022-08-24 | Paper |
| scientific article; zbMATH DE number 7559100 (Why is no real title available?) | 2022-07-18 | Paper |
Optimal convergence rate of Hamiltonian Monte Carlo for strongly logconcave distributions
Theory of Computing | 2022-05-18 | Paper |
Geodesic Walks in Polytopes
SIAM Journal on Computing | 2022-05-03 | Paper |
| Convergence of the Riemannian Langevin Algorithm | 2022-04-22 | Paper |
| The $k$-Cap Process on Geometric Random Graphs | 2022-03-23 | Paper |
Statistical query algorithms for mean vector estimation and stochastic convex optimization
Mathematics of Operations Research | 2021-09-14 | Paper |
| Long term memory and the densest K-subgraph problem | 2021-06-15 | Paper |
The Communication Complexity of Optimization
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Strong self-concordance and sampling
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
A generalized central limit conjecture for convex bodies
Lecture Notes in Mathematics | 2020-08-21 | Paper |
Efficient convex optimization with oracles
Bolyai Society Mathematical Studies | 2020-07-08 | Paper |
A 4/3-approximation algorithm for the minimum 2-edge connected subgraph problem
ACM Transactions on Algorithms | 2019-12-02 | Paper |
The Kannan-Lovász-Simonovits conjecture
Current Developments in Mathematics | 2019-11-12 | Paper |
Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Stochastic localization + Stieltjes barrier = tight bound for log-Sobolev
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
A cubic algorithm for computing Gaussian volume
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Visual categorization with random projection
Neural Computation | 2019-06-04 | Paper |
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
(available as arXiv preprint) | 2019-05-10 | Paper |
| Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms | 2019-05-10 | Paper |
| Expanders via random spanning trees | 2019-05-06 | Paper |
| Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Suffices | 2019-03-20 | Paper |
A note on non-degenerate integer programs with small sub-determinants
Operations Research Letters | 2019-01-11 | Paper |
On the complexity of random satisfiability problems with planted solutions
SIAM Journal on Computing | 2018-07-17 | Paper |
Adaptive Matrix Vector Product
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Statistical query algorithms for mean vector estimation and stochastic convex optimization
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Gaussian Cooling and $O^*(n^3)$ Algorithms for Volume and Gaussian Volume
SIAM Journal on Computing | 2018-07-04 | Paper |
Statistical algorithms and a lower bound for detecting planted cliques
Journal of the ACM | 2018-05-17 | Paper |
scientific article; zbMATH DE number 6866300 (Why is no real title available?)
(available as arXiv preprint) | 2018-05-03 | Paper |
Randomized algorithms in numerical linear algebra
Acta Numerica | 2017-11-17 | Paper |
Query complexity of sampling and small geometric partitions
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
| Algorithms for implicit hitting set problems | 2017-09-29 | Paper |
| Random Overlapping Communities: Approximating Motif Densities of Large Graphs | 2017-09-27 | Paper |
Geodesic walks in polytopes
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Geometric random edge
Mathematical Programming. Series A. Series B | 2017-07-21 | Paper |
Integer feasibility of random polytopes: random integer programs
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
| Randomly-oriented \(k\)-\(d\) trees adapt to intrinsic dimension | 2017-01-26 | Paper |
| Eldan's Stochastic Localization and the KLS Conjecture: Isoperimetry, Concentration and Mixing | 2016-12-05 | Paper |
A practical volume algorithm
Mathematical Programming Computation | 2016-06-20 | Paper |
The cutting plane method is polynomial for perfect matchings
Mathematics of Operations Research | 2016-04-15 | Paper |
The cutting plane method is polynomial for perfect matchings
Mathematics of Operations Research | 2016-04-15 | Paper |
Stochastic Billiards for Sampling from the Boundary of a Convex Set
Mathematics of Operations Research | 2016-01-29 | Paper |
Adaptive simulated annealing: A near-optimal connection between sampling and counting
Journal of the ACM | 2015-11-11 | Paper |
Bypassing KLS: Gaussian cooling and an \(O^\ast(n^3)\) volume algorithm
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
On the complexity of random satisfiability problems with planted solutions (extended abstract)
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
| scientific article; zbMATH DE number 6472593 (Why is no real title available?) | 2015-08-14 | Paper |
Fourier PCA and robust tensor decomposition
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Optimal outlier removal in high-dimensional
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
On the approximability of the traveling salesman problem (extended abstract)
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Statistical algorithms and a lower bound for detecting planted cliques
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
The approximate rank of a matrix and its algorithmic applications
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Expanders via Random Spanning Trees
SIAM Journal on Computing | 2014-07-30 | Paper |
An FPTAS for #Knapsack and Related Counting Problems
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Near-optimal deterministic algorithms for volume computation via M-ellipsoids
Proceedings of the National Academy of Sciences | 2014-07-25 | Paper |
Near-optimal deterministic algorithms for volume computation via M-ellipsoids
Proceedings of the National Academy of Sciences | 2014-07-25 | Paper |
| Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP's | 2014-07-10 | Paper |
Thin partitions, isoperimetric inequalities and a sampling algorithm for star shaped bodies
(available as arXiv preprint) | 2014-05-22 | Paper |
Many sparse cuts via higher eigenvalues
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
| Recent progress and open problems in algorithmic convex geometry | 2012-08-29 | Paper |
A deterministic polynomial-time approximation scheme for counting knapsack solutions
SIAM Journal on Computing | 2012-08-10 | Paper |
Local versus global properties of metric spaces
SIAM Journal on Computing | 2012-05-30 | Paper |
Semantic communication for simple goals is equivalent to on-line learning
Lecture Notes in Computer Science | 2011-10-19 | Paper |
On noise-tolerant learning of sparse parities and related problems
Lecture Notes in Computer Science | 2011-10-19 | Paper |
Algorithmic extensions of Cheeger's inequality to higher eigenvalues and partitions
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Matrix approximation and projective clustering via volume sampling
Theory of Computing | 2011-05-24 | Paper |
A random-sampling-based algorithm for learning intersections of halfspaces
Journal of the ACM | 2011-05-16 | Paper |
An efficient rescaled perceptron algorithm for conic systems
Mathematics of Operations Research | 2011-04-27 | Paper |
Solving convex programs by random walks
Journal of the ACM | 2011-02-01 | Paper |
On Nash-equilibria of approximation-stable games
Algorithmic Game Theory | 2010-10-19 | Paper |
On clusterings: good, bad and spectral
Journal of the ACM | 2010-08-17 | Paper |
Local versus global properties of metric spaces
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Tensor decomposition and approximation schemes for constraint satisfaction problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Matrix approximation and projective clustering via volume sampling
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Hit-and-run from a corner
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
A simple polynomial-time rescaling algorithm for solving linear programs
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Logconcave random graphs
The Electronic Journal of Combinatorics | 2010-08-12 | Paper |
Logconcave random graphs
The Electronic Journal of Combinatorics | 2010-08-12 | Paper |
Logconcave random graphs
The Electronic Journal of Combinatorics | 2010-08-12 | Paper |
Solving convex programs by random walks
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Approximation algorithms for minimum-cost k-vertex connected subgraphs
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Efficient algorithms for online decision problems.
Lecture Notes in Computer Science | 2010-03-23 | Paper |
Spectral algorithms
Foundations and Trends in Theoretical Computer Science | 2009-12-22 | Paper |
Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Random Tensors and Planted Cliques
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Algorithmic Prediction of Health-Care Costs
Operations Research | 2009-08-13 | Paper |
The Spectral Method for General Mixture Models
SIAM Journal on Computing | 2009-06-22 | Paper |
Isotropic PCA and Affine-Invariant Clustering
Bolyai Society Mathematical Studies | 2009-02-12 | Paper |
| scientific article; zbMATH DE number 5485581 (Why is no real title available?) | 2009-01-05 | Paper |
| scientific article; zbMATH DE number 5485592 (Why is no real title available?) | 2009-01-05 | Paper |
Dispersion of mass and the complexity of randomized geometric algorithms
Advances in Mathematics | 2008-10-07 | Paper |
A simple polynomial-time rescaling algorithm for solving linear programs
Mathematical Programming. Series A. Series B | 2008-06-03 | Paper |
Simulated Annealing for Convex Optimization
Mathematics of Operations Research | 2008-05-27 | Paper |
Fast monte-carlo algorithms for finding low-rank approximations
Journal of the ACM | 2008-01-14 | Paper |
Nash equilibria in random games
Random Structures & Algorithms | 2008-01-08 | Paper |
An Efficient Re-scaled Perceptron Algorithm for Conic Systems
Learning Theory | 2008-01-03 | Paper |
Adaptive Sampling and Fast Low-Rank Matrix Approximation
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
The geometry of logconcave functions and sampling algorithms
Random Structures & Algorithms | 2007-05-11 | Paper |
Network design via iterative rounding of setpair relaxations
Combinatorica | 2007-01-08 | Paper |
On the approximability of the traveling salesman problem
Combinatorica | 2007-01-02 | Paper |
Kernels as features: on kernels, margins, and low-dimensional mappings
Machine Learning | 2006-11-22 | Paper |
An algorithmic theory of learning: robust concepts and random projection
Machine Learning | 2006-11-22 | Paper |
An algorithmic theory of learning: Robust concepts and random projection
Machine Learning | 2006-08-14 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2006-06-22 | Paper |
Hit-and-Run from a Corner
SIAM Journal on Computing | 2006-06-01 | Paper |
Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
Journal of Computer and System Sciences | 2006-04-28 | Paper |
| scientific article; zbMATH DE number 5019925 (Why is no real title available?) | 2006-04-28 | Paper |
Efficient algorithms for online decision problems
Journal of Computer and System Sciences | 2005-10-10 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2005-08-18 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
Clustering large graphs via the singular value decomposition
Machine Learning | 2005-01-19 | Paper |
Optimal outlier removal in high-dimensional spaces
Journal of Computer and System Sciences | 2004-11-22 | Paper |
10.1162/153244303321897672
CrossRef Listing of Deleted DOIs | 2004-10-28 | Paper |
| scientific article; zbMATH DE number 2109363 (Why is no real title available?) | 2004-10-25 | Paper |
| scientific article; zbMATH DE number 2086253 (Why is no real title available?) | 2004-08-11 | Paper |
Flow metrics
Theoretical Computer Science | 2004-08-10 | Paper |
A spectral algorithm for learning mixture models
Journal of Computer and System Sciences | 2004-08-06 | Paper |
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 | 2004-01-29 | Paper |
An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph
SIAM Journal on Computing | 2003-09-28 | Paper |
| scientific article; zbMATH DE number 1833416 (Why is no real title available?) | 2002-11-21 | Paper |
| scientific article; zbMATH DE number 1757965 (Why is no real title available?) | 2002-06-20 | Paper |
| scientific article; zbMATH DE number 1757945 (Why is no real title available?) | 2002-06-20 | Paper |
| scientific article; zbMATH DE number 1670548 (Why is no real title available?) | 2001-11-11 | Paper |
Random sampling of Euler tours
Algorithmica | 2001-10-14 | Paper |
| scientific article; zbMATH DE number 1263205 (Why is no real title available?) | 2001-08-27 | Paper |
| scientific article; zbMATH DE number 1559589 (Why is no real title available?) | 2001-03-01 | Paper |
| scientific article; zbMATH DE number 1559577 (Why is no real title available?) | 2001-02-28 | Paper |
| scientific article; zbMATH DE number 1857652 (Why is no real title available?) | 2001-01-01 | Paper |
Latent semantic indexing: A probabilistic analysis
Journal of Computer and System Sciences | 2000-12-19 | Paper |
| scientific article; zbMATH DE number 1522943 (Why is no real title available?) | 2000-10-30 | Paper |
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
Theoretical Computer Science | 2000-06-04 | Paper |
A constant-factor approximation algorithm for the \(k\)-MST problem
Journal of Computer and System Sciences | 2000-02-17 | Paper |
| scientific article; zbMATH DE number 1334601 (Why is no real title available?) | 1999-11-11 | Paper |
| scientific article; zbMATH DE number 1263203 (Why is no real title available?) | 1999-09-15 | Paper |
| scientific article; zbMATH DE number 1305546 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1305418 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1256763 (Why is no real title available?) | 1999-05-18 | Paper |
The Colin de Verdière number and sphere representations of a graph
Combinatorica | 1999-03-14 | Paper |
A Constant-Factor Approximation Algorithm for the Geometrick-MST Problem in the Plane
SIAM Journal on Computing | 1999-02-22 | Paper |
A polynomial-time algorithm for learning noisy linear threshold functions
Algorithmica | 1998-11-11 | Paper |
New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
SIAM Journal on Computing | 1998-09-21 | Paper |
