| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147331 | 2024-01-15 | Paper |
| Matrix discrepancy from Quantum communication | 2023-12-08 | Paper |
| Noise stability on the Boolean hypercube via a renormalized Brownian motion | 2022-08-12 | Paper |
| Average whenever you meet: opportunistic protocols for community detection | 2021-08-04 | Paper |
| Approximating rectangles by juntas and weakly exponential lower bounds for LP relaxations of CSPs | 2021-06-22 | Paper |
| Extended Formulation Lower Bounds for Refuting Random CSPs | 2021-02-02 | Paper |
| List Decodable Learning via Sum of Squares | 2021-02-02 | Paper |
| On statistical inference when fixed points of belief propagation are unstable | 2021-01-26 | Paper |
| Lifting sum-of-squares lower bounds: degree-2 to degree-4 | 2021-01-19 | Paper |
| Algorithms for heavy-tailed statistics: regression, covariance estimation, and beyond | 2021-01-19 | Paper |
| HIGH DIMENSIONAL ESTIMATION VIA SUM-OF-SQUARES PROOFS | 2020-09-22 | Paper |
| Dimension Reduction for Polynomials over Gaussian Space and Applications | 2020-09-22 | Paper |
| On the bit complexity of sum-of-squares proofs | 2020-05-27 | Paper |
| A birthday repetition theorem and complexity of approximating dense CSPs | 2020-05-27 | Paper |
| Algorithms for Heavy-Tailed Statistics: Regression, Covariance Estimation, and Beyond | 2019-12-23 | Paper |
| Exponential lower bounds on spectrahedral representations of hyperbolicity cones | 2019-10-15 | Paper |
| Approximating CSPs with global cardinality constraints using SDP hierarchies | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743431 | 2019-05-10 | Paper |
| Testing odd-cycle-freeness in Boolean functions | 2019-05-10 | Paper |
| Towards computing the Grothendieck constant | 2019-05-06 | Paper |
| On the integrality gap of degree-4 sum of squares for planted clique | 2018-11-13 | Paper |
| Bypassing UGC from some optimal geometric inapproximability results | 2018-10-30 | Paper |
| Approximate Constraint Satisfaction Requires Large LP Relaxations | 2018-08-02 | Paper |
| The matching problem has no small symmetric SDP | 2018-07-16 | Paper |
| On the integrality gap of degree-4 sum of squares for planted clique | 2018-07-16 | Paper |
| Real stability testing | 2018-05-03 | Paper |
| Correlation decay and tractability of CSPs | 2017-12-19 | Paper |
| The matching problem has no small symmetric SDP | 2017-10-27 | Paper |
| Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs | 2017-08-17 | Paper |
| Gap amplification for small-set expansion via random walks | 2017-03-22 | Paper |
| Making the Long Code Shorter | 2015-11-04 | Paper |
| Hardness of solving sparse overdetermined linear systems: a 3-query PCP over integers | 2015-09-24 | Paper |
| Lower bounds on the size of semidefinite programming relaxations | 2015-08-21 | Paper |
| Approximations for the isoperimetric and spectral profile of graphs and related parameters | 2014-08-13 | Paper |
| Graph expansion and the unique games conjecture | 2014-08-13 | Paper |
| Bounding the average sensitivity and noise sensitivity of polynomial threshold functions | 2014-08-13 | Paper |
| Rounding Semidefinite Programming Hierarchies via Global Correlation | 2014-07-30 | Paper |
| Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES | 2014-07-25 | Paper |
| How to Round Any CSP | 2014-07-25 | Paper |
| Average sensitivity and noise sensitivity of polynomial threshold functions | 2014-06-04 | Paper |
| Many sparse cuts via higher eigenvalues | 2014-05-13 | Paper |
| On mimicking networks representing minimum terminal cuts | 2014-04-17 | Paper |
| Improved approximation algorithms for the spanning star forest problem | 2013-08-05 | Paper |
| Buffer management for colored packets with deadlines | 2012-12-10 | Paper |
| Testing Odd-Cycle-Freeness in Boolean Functions | 2012-10-31 | Paper |
| Beating the random ordering is hard: every ordering CSP is approximation resistant | 2011-10-18 | Paper |
| Algorithmic extensions of Cheeger's inequality to higher eigenvalues and partitions | 2011-08-17 | Paper |
| Approximating sparsest cut in graphs of bounded treewidth | 2010-09-10 | Paper |
| Hardness of learning halfspaces with noise | 2010-04-29 | Paper |
| Coarse differentiation and multi-flows in planar graphs | 2010-03-04 | Paper |
| Perfectly reliable and secure message transmission tolerating mobile adversary | 2009-05-12 | Paper |
| On Proactive Perfectly Secure Message Transmission | 2009-03-06 | Paper |
| Improved Approximation Algorithms for the Spanning Star Forest Problem | 2009-02-17 | Paper |
| Coarse Differentiation and Multi-flows in Planar Graphs | 2009-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549708 | 2009-01-05 | Paper |
| A 3-query PCP over integers | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549676 | 2009-01-05 | Paper |
| Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness | 2008-11-27 | Paper |
| Robust recovery for stochastic block models, simplified and generalized | N/A | Paper |
| Certifying Euclidean Sections and Finding Planted Sparse Vectors Beyond the $\sqrt{n}$ Dimension Threshold | N/A | Paper |
