| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147280 | 2024-01-15 | Paper |
| Robustly learning mixtures of k arbitrary Gaussians | 2023-12-08 | Paper |
| Reducing isotropy and volume to KLS: an o *( n 3 ψ 2 ) volume algorithm | 2023-11-14 | Paper |
| Approximating sparse graphs: The random overlapping communities model | 2023-10-17 | Paper |
| A unified view of graph regularity via matrix decompositions | 2023-10-12 | Paper |
| Convergence of Gibbs sampling: coordinate hit-and-run mixes fast | 2023-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875524 | 2023-02-03 | Paper |
| Socially fair network design via iterative rounding | 2022-10-17 | Paper |
| A Slightly Improved Bound for the KLS Constant | 2022-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090436 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5077151 | 2022-05-18 | Paper |
| Geodesic Walks in Polytopes | 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 | 2021-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4993327 | 2021-06-15 | Paper |
| The Communication Complexity of Optimization | 2021-02-02 | Paper |
| Strong self-concordance and sampling | 2021-01-19 | Paper |
| A Generalized Central Limit Conjecture for Convex Bodies | 2020-08-21 | Paper |
| Efficient Convex Optimization with Oracles | 2020-07-08 | Paper |
| A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem | 2019-12-02 | Paper |
| The Kannan–Lovász–Simonovits conjecture | 2019-11-12 | Paper |
| Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation | 2019-08-22 | Paper |
| Stochastic localization + Stieltjes barrier = tight bound for log-Sobolev | 2019-08-22 | Paper |
| A Cubic Algorithm for Computing Gaussian Volume | 2019-06-20 | Paper |
| Visual Categorization with Random Projection | 2019-06-04 | Paper |
| Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633869 | 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 | 2019-01-11 | Paper |
| On the Complexity of Random Satisfiability Problems with Planted Solutions | 2018-07-17 | Paper |
| Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization | 2018-07-16 | Paper |
| Adaptive Matrix Vector Product | 2018-07-16 | Paper |
| Gaussian Cooling and $O^*(n^3)$ Algorithms for Volume and Gaussian Volume | 2018-07-04 | Paper |
| Statistical Algorithms and a Lower Bound for Detecting Planted Cliques | 2018-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4638058 | 2018-05-03 | Paper |
| Randomized algorithms in numerical linear algebra | 2017-11-17 | Paper |
| Query Complexity of Sampling and Small Geometric Partitions | 2017-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365067 | 2017-09-29 | Paper |
| Random Overlapping Communities: Approximating Motif Densities of Large Graphs | 2017-09-27 | Paper |
| Geodesic walks in polytopes | 2017-08-17 | Paper |
| Geometric random edge | 2017-07-21 | Paper |
| Integer feasibility of random polytopes | 2017-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957480 | 2017-01-26 | Paper |
| Eldan's Stochastic Localization and the KLS Conjecture: Isoperimetry, Concentration and Mixing | 2016-12-05 | Paper |
| A practical volume algorithm | 2016-06-20 | Paper |
| The Cutting Plane Method is Polynomial for Perfect Matchings | 2016-04-15 | Paper |
| Stochastic Billiards for Sampling from the Boundary of a Convex Set | 2016-01-29 | Paper |
| Adaptive simulated annealing: A near-optimal connection between sampling and counting | 2015-11-11 | Paper |
| On the Complexity of Random Satisfiability Problems with Planted Solutions | 2015-08-21 | Paper |
| Bypassing KLS | 2015-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501796 | 2015-08-14 | Paper |
| Fourier PCA and robust tensor decomposition | 2015-06-26 | Paper |
| Optimal outlier removal in high-dimensional | 2015-02-27 | Paper |
| On the approximability of the traveling salesman problem (extended abstract) | 2014-09-26 | Paper |
| Statistical algorithms and a lower bound for detecting planted cliques | 2014-08-07 | Paper |
| The approximate rank of a matrix and its algorithmic applications | 2014-08-07 | Paper |
| Expanders via Random Spanning Trees | 2014-07-30 | Paper |
| Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings | 2014-07-30 | Paper |
| An FPTAS for #Knapsack and Related Counting Problems | 2014-07-30 | Paper |
| Near-optimal deterministic algorithms for volume computation via M-ellipsoids | 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 Sampling Algorithms for some Nonconvex Families | 2014-05-22 | Paper |
| Many sparse cuts via higher eigenvalues | 2014-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2908836 | 2012-08-29 | Paper |
| A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions | 2012-08-10 | Paper |
| Local Versus Global Properties of Metric Spaces | 2012-05-30 | Paper |
| Semantic Communication for Simple Goals Is Equivalent to On-line Learning | 2011-10-19 | Paper |
| On Noise-Tolerant Learning of Sparse Parities and Related Problems | 2011-10-19 | Paper |
| Algorithmic Extensions of Cheeger’s Inequality to Higher Eigenvalues and Partitions | 2011-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002774 | 2011-05-24 | Paper |
| A random-sampling-based algorithm for learning intersections of halfspaces | 2011-05-16 | Paper |
| An Efficient Rescaled Perceptron Algorithm for Conic Systems | 2011-04-27 | Paper |
| Solving convex programs by random walks | 2011-02-01 | Paper |
| On Nash-Equilibria of Approximation-Stable Games | 2010-10-19 | Paper |
| On clusterings | 2010-08-17 | Paper |
| Tensor decomposition and approximation schemes for constraint satisfaction problems | 2010-08-16 | Paper |
| Matrix approximation and projective clustering via volume sampling | 2010-08-16 | Paper |
| Local versus global properties of metric spaces | 2010-08-16 | Paper |
| A simple polynomial-time rescaling algorithm for solving linear programs | 2010-08-15 | Paper |
| Hit-and-run from a corner | 2010-08-15 | Paper |
| Logconcave random graphs | 2010-08-12 | Paper |
| Solving convex programs by random walks | 2010-08-05 | Paper |
| Approximation algorithms for minimum-cost k-vertex connected subgraphs | 2010-08-05 | Paper |
| Learning Theory and Kernel Machines | 2010-03-23 | Paper |
| Spectral Algorithms | 2009-12-22 | Paper |
| Random Tensors and Planted Cliques | 2009-10-28 | Paper |
| Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry | 2009-10-28 | Paper |
| Algorithmic Prediction of Health-Care Costs | 2009-08-13 | Paper |
| The Spectral Method for General Mixture Models | 2009-06-22 | Paper |
| Isotropic PCA and Affine-Invariant Clustering | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302092 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302103 | 2009-01-05 | Paper |
| Dispersion of mass and the complexity of randomized geometric algorithms | 2008-10-07 | Paper |
| A simple polynomial-time rescaling algorithm for solving linear programs | 2008-06-03 | Paper |
| Simulated Annealing for Convex Optimization | 2008-05-27 | Paper |
| Fast monte-carlo algorithms for finding low-rank approximations | 2008-01-14 | Paper |
| Nash equilibria in random games | 2008-01-08 | Paper |
| An Efficient Re-scaled Perceptron Algorithm for Conic Systems | 2008-01-03 | Paper |
| Adaptive Sampling and Fast Low-Rank Matrix Approximation | 2007-08-28 | Paper |
| The geometry of logconcave functions and sampling algorithms | 2007-05-11 | Paper |
| Network design via iterative rounding of setpair relaxations | 2007-01-08 | Paper |
| On the approximability of the traveling salesman problem | 2007-01-02 | Paper |
| An algorithmic theory of learning: robust concepts and random projection | 2006-11-22 | Paper |
| Kernels as features: on kernels, margins, and low-dimensional mappings | 2006-11-22 | Paper |
| An algorithmic theory of learning: Robust concepts and random projection | 2006-08-14 | Paper |
| Learning Theory | 2006-06-22 | Paper |
| Hit-and-Run from a Corner | 2006-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5290281 | 2006-04-28 | Paper |
| Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm | 2006-04-28 | Paper |
| Efficient algorithms for online decision problems | 2005-10-10 | Paper |
| Algorithmic Learning Theory | 2005-08-18 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| Clustering large graphs via the singular value decomposition | 2005-01-19 | Paper |
| Optimal outlier removal in high-dimensional spaces | 2004-11-22 | Paper |
| 10.1162/153244303321897672 | 2004-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4821981 | 2004-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044352 | 2004-08-11 | Paper |
| Flow metrics | 2004-08-10 | Paper |
| A spectral algorithm for learning mixture models | 2004-08-06 | Paper |
| Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems | 2004-01-29 | Paper |
| An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph | 2003-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780797 | 2002-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537732 | 2002-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537753 | 2002-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753746 | 2001-11-11 | Paper |
| Random sampling of Euler tours | 2001-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234076 | 2001-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527038 | 2001-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527029 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788611 | 2001-01-01 | Paper |
| Latent semantic indexing: A probabilistic analysis | 2000-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511239 | 2000-10-30 | Paper |
| Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems | 2000-06-04 | Paper |
| A constant-factor approximation algorithm for the \(k\)-MST problem | 2000-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4262220 | 1999-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234074 | 1999-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252300 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252438 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228499 | 1999-05-18 | Paper |
| The Colin de Verdière number and sphere representations of a graph | 1999-03-14 | Paper |
| A Constant-Factor Approximation Algorithm for the Geometrick-MST Problem in the Plane | 1999-02-22 | Paper |
| A polynomial-time algorithm for learning noisy linear threshold functions | 1998-11-11 | Paper |
| New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen | 1998-09-21 | Paper |
