| Publication | Date of Publication | Type |
|---|
| Foundations of data science | 2021-06-23 | Paper |
| Finding a latent k–simplex in O* (k · nnz(data)) time via Subset Smoothing | 2021-02-02 | Paper |
| Randomized algorithms in numerical linear algebra | 2017-11-17 | Paper |
| Faster mixing via average conductance | 2016-09-29 | Paper |
| Computing a Nonnegative Matrix Factorization---Provably | 2016-09-02 | Paper |
| Polynomial-time algorithm for the orbit problem | 2016-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501796 | 2015-08-14 | Paper |
| Learning mixtures of arbitrary gaussians | 2015-02-27 | Paper |
| Random walks on polytopes and an affine interior point method for linear programming | 2015-02-04 | Paper |
| Games of fixed rank: a hierarchy of bimatrix games | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934697 | 2014-12-18 | Paper |
| A simple randomised algorithm for convex optimisation | 2014-10-17 | Paper |
| Spectral methods for matrices and tensors | 2014-08-13 | Paper |
| A New Probability Inequality Using Typical Moments and Concentration Results | 2014-07-25 | Paper |
| Computing a nonnegative matrix factorization -- provably | 2014-05-13 | Paper |
| Zero-One Rounding of Singular Vectors | 2013-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3165958 | 2012-10-19 | Paper |
| Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming | 2012-05-24 | Paper |
| On clusterings | 2010-08-17 | Paper |
| Tensor decomposition and approximation schemes for constraint satisfaction problems | 2010-08-16 | Paper |
| The space complexity of pass-efficient algorithms for clustering | 2010-08-16 | Paper |
| Random sampling and approximation of MAX-CSP problems | 2010-08-05 | Paper |
| Pass-Efficient Algorithms for Learning Mixtures of Uniform Distributions | 2010-07-07 | Paper |
| Finding Dense Subgraphs in G(n,1/2) | 2010-05-11 | Paper |
| Games of fixed rank: a hierarchy of bimatrix games | 2010-02-19 | Paper |
| Spectral Algorithms | 2009-12-22 | Paper |
| Optimization of a convex program with a polynomial perturbation | 2009-12-07 | Paper |
| Adaptive Sampling for k-Means Clustering | 2009-10-28 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| The Spectral Method for General Mixture Models | 2009-06-22 | Paper |
| Decoupling and Partial Independence | 2009-02-12 | Paper |
| Two new Probability inequalities and Concentration Results | 2008-09-15 | Paper |
| Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms | 2008-06-05 | Paper |
| Spectral Clustering by Recursive Partitioning | 2008-03-11 | Paper |
| Fast monte-carlo algorithms for finding low-rank approximations | 2008-01-14 | Paper |
| Blocking Conductance and Mixing in Random Walks | 2007-07-30 | Paper |
| Learning Theory | 2006-06-22 | Paper |
| Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication | 2006-06-01 | Paper |
| Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix | 2006-06-01 | Paper |
| Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition | 2006-06-01 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Learning mixtures of separated nonspherical Gaussians | 2005-04-29 | Paper |
| Clustering large graphs via the singular value decomposition | 2005-01-19 | Paper |
| Random sampling and approximation of MAX-CSPs | 2004-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471298 | 2004-07-28 | Paper |
| Deterministic and randomized polynomial‐time approximation of radii | 2003-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4549234 | 2003-06-16 | Paper |
| A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527038 | 2001-03-01 | Paper |
| Log-Sobolev inequalities and sampling from log-concave distributions | 2000-02-07 | Paper |
| Quick approximation to matrices and applications | 1999-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4262220 | 1999-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234129 | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252032 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252300 | 1999-06-17 | Paper |
| A simple algorithm for constructing Szemerédi's regularity partition | 1999-03-31 | Paper |
| A polynomial-time algorithm for learning noisy linear threshold functions | 1998-11-11 | Paper |
| Sampling contingency tables | 1998-04-05 | Paper |
| Learning an intersection of a constant number of halfspaces over a uniform distribution | 1997-12-08 | Paper |
| On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension | 1997-10-28 | Paper |
| Random walks and anO*(n5) volume algorithm for convex bodies | 1997-09-04 | Paper |
| A Randomized Algorithm to Optimize Over Certain Convex Sets | 1996-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4839059 | 1995-08-07 | Paper |
| Isoperimetric problems for convex bodies and a localization lemma | 1995-07-02 | Paper |
| Sampling from log-concave distributions | 1995-05-30 | Paper |
| A random polynomial-time algorithm for approximating the volume of convex bodies | 1994-08-21 | Paper |
| A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem | 1994-04-28 | Paper |
| A circuit-based proof of Toda's theorem | 1993-08-30 | Paper |
| Lattice translates of a polytope and the Frobenius problem | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975941 | 1992-06-26 | Paper |
| Chvátal closures for mixed integer programming problems | 1990-01-01 | Paper |
| The Shapes of Polyhedra | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3352842 | 1990-01-01 | Paper |
| On nontrivial separators for \(k\)-page graphs and simulations by nondeterministic one-tape Turing machines | 1989-01-01 | Paper |
| On 3-pushdown graphs with large separators | 1989-01-01 | Paper |
| Succinct Certificates for Almost All Subset Sum Problems | 1989-01-01 | Paper |
| Covering minima and lattice-point-free convex bodies | 1988-01-01 | Paper |
| Reconstructing Truncated Integer Variables Satisfying Linear Congruences | 1988-01-01 | Paper |
| Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers | 1988-01-01 | Paper |
| Hermite Normal Form Computation Using Modulo Determinant Arithmetic | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3776152 | 1987-01-01 | Paper |
| Minkowski's Convex Body Theorem and Integer Programming | 1987-01-01 | Paper |
| Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3757974 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4724708 | 1986-01-01 | Paper |
| Solving systems of linear equations over polynomials | 1985-01-01 | Paper |
| Unraveling k-page graphs | 1985-01-01 | Paper |
| Towards separating nondeterminism from determinism | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3223803 | 1983-01-01 | Paper |
| Polynomial-Time Aggregation of Integer Programming Problems | 1983-01-01 | Paper |
| Circuit-size lower bounds and non-reducibility to sparse sets | 1982-01-01 | Paper |
| Exponential Lower Bounds on a Class of Knapsack Algorithms | 1981-01-01 | Paper |
| A characterization of threshold matroids | 1980-01-01 | Paper |
| A Polynomial Algorithm for the Two-Variable Integer Programming Problem | 1980-01-01 | Paper |
| Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4182255 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4182256 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4194739 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4197629 | 1978-01-01 | Paper |
