| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6126238 | 2024-04-09 | Paper |
| Playing unique games on certified small-set expanders | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090379 | 2022-07-18 | Paper |
| Noisy tensor completion via the sum-of-squares hierarchy | 2022-06-14 | Paper |
| The Complexity of Public-Key Cryptography | 2022-01-12 | Paper |
| Deep double descent: where bigger models and more data hurt* | 2022-01-03 | Paper |
| Sum-of-squares meets program obfuscation, revisited | 2020-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967162 | 2019-07-03 | Paper |
| A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem | 2019-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633934 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4584894 | 2018-09-04 | Paper |
| Subexponential Algorithms for Unique Games and Related Problems | 2018-08-02 | Paper |
| Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation) | 2018-07-09 | Paper |
| Sum-of-squares proofs and the quest toward optimal algorithms | 2017-11-06 | Paper |
| Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles | 2017-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365060 | 2017-09-29 | Paper |
| Quantum entanglement, sum of squares, and the log rank conjecture | 2017-08-17 | Paper |
| On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction | 2017-05-16 | Paper |
| Making the Long Code Shorter | 2015-11-04 | Paper |
| Sum of Squares Lower Bounds from Pairwise Independence | 2015-08-21 | Paper |
| Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method | 2015-08-21 | Paper |
| Rounding sum-of-squares relaxations | 2015-06-26 | Paper |
| Clock synchronization with faults and recoveries (extended abstract) | 2015-03-03 | Paper |
| 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction | 2014-11-25 | Paper |
| How to compress interactive communication | 2014-08-13 | Paper |
| Public-key cryptography from different assumptions | 2014-08-13 | Paper |
| Rounding Semidefinite Programming Hierarchies via Global Correlation | 2014-07-30 | Paper |
| Fractional Sylvester–Gallai theorems | 2014-07-25 | Paper |
| Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes | 2014-06-05 | Paper |
| Protecting Obfuscation against Algebraic Attacks | 2014-05-27 | Paper |
| Hypercontractivity, sum-of-squares proofs, and their applications | 2014-05-13 | Paper |
| Obfuscation for Evasive Functions | 2014-02-18 | Paper |
| On the (im)possibility of obfuscating programs | 2014-02-17 | Paper |
| How to Compress Interactive Communication | 2013-09-25 | Paper |
| 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction | 2013-01-03 | Paper |
| Secure computation without authentication | 2012-01-13 | Paper |
| Leftover Hash Lemma, Revisited | 2011-08-12 | Paper |
| Simulating independence | 2010-08-16 | Paper |
| Strict polynomial-time in simulation and extraction | 2010-08-05 | Paper |
| Simulating independence | 2010-07-14 | Paper |
| Bounded Key-Dependent Message Security | 2010-06-01 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| True Random Number Generators Secure in a Changing Environment | 2010-03-09 | Paper |
| Universal Arguments and their Applications | 2009-11-06 | Paper |
| Strong Parallel Repetition Theorem for Free Projection Games | 2009-10-28 | Paper |
| Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle | 2009-10-20 | Paper |
| Computational Complexity | 2009-07-22 | Paper |
| Theory of Cryptography | 2009-05-14 | Paper |
| Derandomization in Cryptography | 2008-04-22 | Paper |
| Protocols and Lower Bounds for Failure Localization in the Internet | 2008-04-15 | Paper |
| Secure Computation Without Authentication | 2008-03-17 | Paper |
| Advances in Cryptology - CRYPTO 2003 | 2007-11-28 | Paper |
| Extracting Randomness Using Few Independent Sources | 2007-09-07 | Paper |
| Lower bounds for non-black-box zero knowledge | 2006-04-28 | Paper |
| A Simple Explicit Construction of an $n^{\Tilde{O}(\log n)}$-Ramsey Graph | 2006-01-26 | Paper |
| Strict Polynomial-Time in Simulation and Extraction | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4440438 | 2003-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4783716 | 2002-12-08 | Paper |
