| Publication | Date of Publication | Type |
|---|
| New PRGs for unbounded-width/adaptive-order read-once branching programs | 2024-11-14 | Paper |
| New lower bounds and derandomization for ACC, and a derandomization-centric view on the algorithmic method | 2024-09-25 | Paper |
| Black-Box constructive proofs are unavoidable | 2024-09-25 | Paper |
| Truly low-space element distinctness and subset sum via pseudorandom hash functions | 2024-07-19 | Paper |
| Extremely efficient constructions of hash functions, with applications to hardness magnification and PRFs | 2024-07-05 | Paper |
| Constructive separations and their consequences | 2024-07-03 | Paper |
| Towards multi-pass streaming lower bounds for optimal approximation of \textsf{Max-Cut} | 2024-05-14 | Paper |
| When Arthur has neither random coins nor time to spare: superfast derandomization of proof systems | 2024-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126224 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126276 | 2024-04-09 | Paper |
| Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost | 2023-11-14 | Paper |
| Inverse-exponential correlation bounds and extremely rigid matrices from a new derandomized XOR lemma | 2023-11-14 | Paper |
| Almost optimal super-constant-pass streaming lower bounds for reachability | 2023-11-14 | Paper |
| Improved Merlin-Arthur protocols for central problems in fine-grained complexity | 2023-08-17 | Paper |
| Beyond Natural Proofs: Hardness Magnification and Locality | 2023-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875777 | 2023-02-03 | Paper |
| Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity | 2022-07-27 | Paper |
| Relations and equivalences between circuit lower bounds and karp-lipton theorems | 2022-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090396 | 2022-07-18 | Paper |
| Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization | 2022-05-31 | Paper |
| Efficient Construction of Rigid Matrices Using an NP Oracle | 2022-03-11 | Paper |
| Broadcast Congested Clique | 2021-01-20 | Paper |
| Strong average-case lower bounds from non-trivial derandomization | 2021-01-19 | Paper |
| Sharp threshold results for computational complexity | 2021-01-19 | Paper |
| On the hardness of approximate and exact (bichromatic) maximum inner product | 2020-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5121902 | 2020-09-22 | Paper |
| On the power of statistical zero knowledge | 2020-08-25 | Paper |
| Nearly optimal separation between partially and fully retroactive data structures | 2020-08-25 | Paper |
| An improved algorithm for incremental DFS tree in undirected graphs | 2020-08-25 | Paper |
| Complexity-theoretic foundations of quantum supremacy experiments | 2020-05-26 | Paper |
| Bootstrapping results for threshold circuits ``just beyond known lower bounds | 2020-01-30 | Paper |
| Beyond Natural Proofs: Hardness Magnification and Locality | 2019-11-19 | Paper |
| An equivalence class for orthogonal vectors | 2019-10-15 | Paper |
| Fine-grained complexity meets \(\mathrm{IP} = \mathrm{PSPACE}\) | 2019-10-15 | Paper |
| Adaptivity vs. postselection, and hardness amplification for polynomial approximation | 2018-04-19 | Paper |
| An algorithm based on the gradient-Hamilton decomposition theory of vector fields | 2010-07-08 | Paper |
| Limit analysis of structures containing flaws based on a modified elastic compensation method | 2008-04-07 | Paper |
