| Publication | Date of Publication | Type |
|---|
| The (Im)possibility of simple search-to-decision reductions for approximation problems | 2025-01-14 | Paper |
| Range avoidance for constant depth circuits: hardness and algorithms | 2025-01-14 | Paper |
| Quantum worst-case to average-case reductions for all linear problems | 2024-11-28 | Paper |
| Sketching approximability of (weak) monarchy predicates | 2024-08-22 | Paper |
| Polynomial formulations as a barrier for reduction-based hardness proofs | 2024-05-14 | Paper |
| Lattice problems beyond polynomial time | 2024-05-08 | Paper |
| Revisiting time-space tradeoffs for function inversion | 2024-02-02 | Paper |
| Improving \(3N\) circuit complexity lower bounds | 2024-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147364 | 2024-01-15 | Paper |
| Linear space streaming lower bounds for approximating CSPs | 2023-12-08 | Paper |
| Worst-case to average-case reductions via additive combinatorics | 2023-12-08 | Paper |
| The (generalized) orthogonality dimension of (generalized) kneser graphs: bounds and applications | 2023-07-12 | Paper |
| Collapsing Superstring Conjecture | 2023-02-03 | Paper |
| String Matching: Communication, Circuits, and Learning. | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5060749 | 2023-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091223 | 2022-07-21 | Paper |
| Polynomial data structure lower bounds in the group model | 2022-04-01 | Paper |
| The minrank of random graphs | 2021-07-28 | Paper |
| Data structures meet cryptography: 3SUM with preprocessing | 2021-01-19 | Paper |
| The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications | 2020-02-20 | Paper |
| Static data structure lower bounds imply rigidity | 2020-01-30 | Paper |
| The Minrank of Random Graphs | 2018-12-04 | Paper |
| Families with infants: speeding up algorithms for NP-hard problems using FFT | 2018-11-05 | Paper |
| Tight Bounds for Graph Homomorphism and Subgraph Isomorphism | 2018-07-16 | Paper |
| On the limits of gate elimination | 2018-06-06 | Paper |
| Tight lower bounds on graph embedding problems | 2018-05-17 | Paper |
| Circuit size lower bounds and \#SAT upper bounds through a general framework | 2018-03-21 | Paper |
| On the limits of gate elimination | 2018-03-21 | Paper |
| Gate elimination: circuit size lower bounds and \#SAT upper bounds | 2018-03-12 | Paper |
| Weighted gate elimination: Boolean dispersers for quadratic varieties imply improved circuit lower bounds | 2016-04-15 | Paper |
| Lower bounds for the graph homomorphism problem | 2015-10-27 | Paper |
| Condensed Unpredictability | 2015-10-27 | Paper |
| A formal treatment of backdoored pseudorandom generators | 2015-09-30 | Paper |
| Approximating asymmetric TSP in exponential time | 2014-07-04 | Paper |
| Families with infants: a general approach to solve hard partition problems | 2014-07-01 | Paper |
| Solving SCS for bounded length strings in fewer than \(2^n\) steps | 2014-04-30 | Paper |
| New exact algorithms for the 2-constraint satisfaction problem | 2014-03-13 | Paper |
| Solving 3-superstring in \(3^{n/3}\) time | 2013-09-20 | Paper |
| Approximating shortest superstring problem using de Bruijn graphs | 2013-06-14 | Paper |
| A new algorithm for parameterized MAX-SAT | 2013-01-07 | Paper |
| New upper bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the average variable degree | 2012-06-15 | Paper |
