Journal Article
Algorithms and Certificates for Boolean CSP Refutation: Smoothed Is No Harder Than Random
Algorithms and Certificates for Boolean CSP Refutation: Smoothed Is No Harder Than Random
An Exponential Lower Bound on the Sub-Packetization of Minimum Storage Regenerating Codes
Explicit two-deletion codes with redundancy matching the existential bound
Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy
Strongly refuting all semi-random Boolean CSPs