| Publication | Date of Publication | Type |
|---|
| MATHEMATICS OF MACHINE LEARNING: AN INTRODUCTION | 2020-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4553314 | 2018-11-02 | Paper |
| Subexponential Algorithms for Unique Games and Related Problems | 2018-08-02 | Paper |
| A Combinatorial, Primal-Dual Approach to Semidefinite Programs | 2018-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5371188 | 2017-10-25 | Paper |
| Provable learning of noisy-OR networks | 2017-08-17 | Paper |
| Message-Passing Algorithms and Improved LP Decoding | 2017-06-08 | Paper |
| Approximation schemes for minimum latency problems | 2016-09-29 | Paper |
| Computing a Nonnegative Matrix Factorization---Provably | 2016-09-02 | Paper |
| Simulating quadratic dynamical systems is PSPACE-complete (preliminary version) | 2016-09-01 | Paper |
| Expander flows, geometric embeddings and graph partitioning | 2015-11-11 | Paper |
| Provable ICA with unknown Gaussian noise, and implications for Gaussian mixtures and autoencoders | 2015-05-21 | Paper |
| Message passing algorithms and improved LP decoding | 2015-02-04 | Paper |
| New approximation guarantee for chromatic number | 2014-11-25 | Paper |
| Computing a nonnegative matrix factorization -- provably | 2014-05-13 | Paper |
| Testing Permanent Oracles – Revisited | 2012-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2913806 | 2012-09-27 | Paper |
| Towards strong nonapproximability results in the Lovász-Schrijver hierarchy | 2012-06-26 | Paper |
| Local Versus Global Properties of Metric Spaces | 2012-05-30 | Paper |
| Semidefinite Programming and Approximation Algorithms: A Survey | 2011-12-16 | Paper |
| New Tools for Graph Coloring | 2011-08-17 | Paper |
| New Algorithms for Learning in Presence of Errors | 2011-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002764 | 2011-05-24 | Paper |
| $O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time | 2010-11-04 | Paper |
| Euclidean distortion and the sparsest cut | 2010-08-16 | Paper |
| Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy | 2010-08-16 | Paper |
| Local versus global properties of metric spaces | 2010-08-16 | Paper |
| Expander flows, geometric embeddings and graph partitioning | 2010-08-15 | Paper |
| Fitting algebraic curves to noisy data | 2010-08-05 | Paper |
| Computational Complexity | 2009-07-22 | Paper |
| Towards a Study of Low-Complexity Graphs | 2009-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549617 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549678 | 2009-01-05 | Paper |
| Fréchet embeddings of negative type metrics | 2008-02-18 | Paper |
| A randomized online algorithm for bandwidth utilization | 2007-12-20 | Paper |
| Euclidean distortion and the sparsest cut | 2007-11-01 | Paper |
| A Fast Random Sampling Algorithm for Sparsifying Matrices | 2007-08-28 | Paper |
| Improved low-degree testing and its applications | 2006-06-27 | Paper |
| A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem | 2006-06-14 | Paper |
| Learning mixtures of separated nonspherical Gaussians | 2005-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4650568 | 2005-02-18 | Paper |
| Approximation schemes for degree-restricted MST and red-blue separation problems | 2005-02-11 | Paper |
| Proof verification and the hardness of approximation problems | 2005-01-25 | Paper |
| Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828980 | 2004-11-29 | Paper |
| Fitting algebraic curves to noisy data | 2004-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474203 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461907 | 2004-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449174 | 2004-02-08 | Paper |
| Approximation Schemes for Minimum Latency Problems | 2003-09-28 | Paper |
| Approximation schemes for NP-hard geometric optimization problems: a survey | 2003-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4549231 | 2002-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542527 | 2002-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542552 | 2002-08-01 | Paper |
| A new rounding procedure for the assignment problem with applications to dense graph arrangement problems | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230322 | 2002-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753720 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234075 | 2001-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527016 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230321 | 2000-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952696 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252725 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252268 | 2000-04-13 | Paper |
| Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems | 2000-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250161 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395317 | 1999-05-05 | Paper |
| Probabilistic checking of proofs | 1998-10-25 | Paper |
| On winning strategies in Ehrenfeucht-Fraïssé games | 1998-10-22 | Paper |
| The hardness of approximate optima in lattices, codes, and systems of linear equations | 1997-12-08 | Paper |
| On-Line Algorithms for Path Selection in a Nonblocking Network | 1996-11-26 | Paper |
