1. Random (log )-CNF Are Hard for Cutting Planes (Again);Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. How Random CSPs Fool Hierarchies;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
3. A Survey on the Densest Subgraph Problem and its Variants;ACM Computing Surveys;2024-04-30
4. A Systematic Study of Sparse LWE;Lecture Notes in Computer Science;2024
5. Lossy Cryptography from Code-Based Assumptions;Lecture Notes in Computer Science;2024