| Publication | Date of Publication | Type |
|---|
| On the threshold for Szemerédi's theorem with random differences | 2024-11-09 | Paper |
| On converses to the polynomial method | 2024-06-27 | Paper |
| Orthogonal schedules in single round robin tournaments | 2024-06-17 | Paper |
| Discreteness of asymptotic tensor ranks | 2023-06-02 | Paper |
| On the threshold for Szemer\'edi's theorem with random differences | 2023-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874388 | 2023-02-07 | Paper |
| Random restrictions of high-rank tensors and polynomial maps | 2022-12-28 | Paper |
| Subspaces of tensors with high analytic rank | 2022-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090458 | 2022-07-18 | Paper |
| Quantum Query Algorithms are Completely Bounded Forms. | 2021-06-15 | Paper |
| Gaussian Width Bounds with Applications to Arithmetic Progressions in Random Settings | 2021-03-16 | Paper |
| High-entropy dual functions over finite fields and locally decodable codes | 2021-03-10 | Paper |
| Failure of the trilinear operator space Grothendieck theorem | 2020-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5204830 | 2019-12-05 | Paper |
| Quasirandom quantum channels | 2019-08-17 | Paper |
| Quantum Query Algorithms Are Completely Bounded Forms | 2019-05-07 | Paper |
| Outlaw distributions and locally decodable codes | 2018-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4603214 | 2018-02-19 | Paper |
| Tight Hardness of the Non-commutative Grothendieck Problem | 2018-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5278031 | 2017-07-12 | Paper |
| Entanglement-Assisted Zero-Error Source-Channel Coding | 2017-04-28 | Paper |
| Arithmetic expanders and deviation bounds for random tensors | 2016-10-11 | Paper |
| On the orthogonal rank of Cayley graphs and impossibility of quantum round elimination | 2016-08-22 | Paper |
| On the existence of 0/1 polytopes with high semidefinite extension complexity | 2015-10-14 | Paper |
| Grothendieck inequalities for semidefinite programs with rank constraint | 2014-10-06 | Paper |
| Violating the Shannon capacity of metric graphs with entanglement | 2014-07-25 | Paper |
| Lower Bounds for Approximate LDCs | 2014-07-01 | Paper |
| Entanglement-Assisted Zero-Error Source-Channel Coding | 2014-06-11 | Paper |
| On the existence of 0/1 polytopes with high semidefinite extension complexity | 2013-09-17 | Paper |
| Explicit lower and upper bounds on the entangled value of multiplayer XOR games | 2013-07-26 | Paper |
| Locally decodable codes and the failure of cotype for projective tensor products | 2012-12-03 | Paper |
| Monotonicity testing and shortest-path routing on the cube | 2012-09-18 | Paper |
| Locally decodable quantum codes | 2012-04-24 | Paper |
| All Schatten spaces endowed with the Schur product are \(Q\)-algebras | 2011-12-14 | Paper |
| A generalized Grothendieck inequality and nonlocal correlations that require high entanglement | 2011-08-23 | Paper |
| Monotonicity testing and shortest-path routing on the cube | 2010-09-10 | Paper |
| The positive semidefinite Grothendieck problem with rank constraint | 2010-09-07 | Paper |
| Testing equivalence of pure quantum states and graph states under SLOCC | 2010-06-03 | Paper |
| Noisy decoding by shallow circuits with parities: classical and quantum | N/A | Paper |
