| 2026 | CP | Classification of Non-Redundancy of Boolean Predicates of Arity 4. | Joshua Brakensiek, Venkatesan Guruswami, Aaron Putterman |
| 2026 | ICALP | Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors. | Joshua Brakensiek, Yeyuan Chen, Manik Dhar, Zihan Zhang |
| 2026 | ICALP | Multiplicative Error Set System Sparsification: A Simpler Proof via Chain Length Contraction. | Joshua Brakensiek, Venkatesan Guruswami, Aaron Putterman |
| 2026 | SODA | MAX BISECTION might be harder to approximate than MAX CUT. | Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick |
| 2026 | SODA | New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs. | Joshua Brakensiek, Lorenzo Ciardo, Venkatesan Guruswami, Aaron Potechin, Stanislav Zivn |
| 2026 | STOC | Combinatorial Bounds for List Recovery via Discrete Brascamp-Lieb Inequalities. | Joshua Brakensiek, Yeyuan Chen, Manik Dhar, Zihan Zhang |
| 2026 | STOC | From Random to Explicit via Subspace Designs with Applications to Local Properties and Matroids. | Joshua Brakensiek, Yeyuan Chen, Manik Dhar, Zihan Zhang |
| 2026 | STOC | Improved Approximation Algorithms for Multiway Cut by Large Mixtures of New and Old Rounding Schemes. | Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick |
| 2025 | STOC | Redundancy Is All You Need. | Joshua Brakensiek, Venkatesan Guruswami |
| 2024 | SODA | Tight approximability of MAX 2-SAT and relatives, under UGC. | Joshua Brakensiek, Neng Huang, Uri Zwick |
| 2024 | STOC | Generalized GM-MDS: Polynomial Codes Are Higher Order MDS. | Joshua Brakensiek, Manik Dhar, Sivakanth Gopi |
| 2024 | STOC | AG Codes Achieve List Decoding Capacity over Constant-Sized Fields. | Joshua Brakensiek, Manik Dhar, Sivakanth Gopi, Zihan Zhang |
| 2023 | FOCS | Separating MAX 2-AND, MAX DI-CUT and MAX CUT. | Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick |
| 2023 | ISIT | Improved Field Size Bounds for Higher Order MDS Codes. | Joshua Brakensiek, Manik Dhar, Sivakanth Gopi |
| 2023 | STOC | Generic Reed-Solomon Codes Achieve List-Decoding Capacity. | Joshua Brakensiek, Sivakanth Gopi, Visu Makam |
| 2023 | STOC | SDPs and Robust Satisfiability of Promise CSP. | Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep |
| 2021 | ICALP | Conditional Dichotomy of Boolean Ordered Promise CSPs. | Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep |
| 2021 | SODA | On the Mysteries of MAX NAE-SAT. | Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick |
| 2020 | CADE | The Resolution of Keller's Conjecture. | Joshua Brakensiek, Marijn Heule, John Mackey, David E. Narvez |
| 2020 | FOCS | Smoothed Complexity of 2-player Nash Equilibria. | Shant Boodaghians, Joshua Brakensiek, Samuel B. Hopkins, Aviad Rubinstein |
| 2020 | FOCS | Coded trace reconstruction in a constant number of traces. | Joshua Brakensiek, Ray Li, Bruce Spang |
| 2020 | SODA | Symmetric Polymorphisms and Efficient Decidability of Promise CSPs. | Joshua Brakensiek, Venkatesan Guruswami |
| 2020 | STOC | Constant-factor approximation of near-linear edit distance in near-linear time. | Joshua Brakensiek, Aviad Rubinstein |
| 2019 | SODA | An Algorithmic Blend of LPs and Ring Equations for Promise CSPs. | Joshua Brakensiek, Venkatesan Guruswami |
| 2019 | STOC | Bridging between 0/1 and linear programming via random walks. | Joshua Brakensiek, Venkatesan Guruswami |
| 2019 | STOC | CSPs with global modular constraints: algorithms and hardness via polynomial representations. | Joshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami |
| 2018 | SODA | Promise Constraint Satisfaction: Structure Theory and a Symmetric Boolean Dichotomy. | Joshua Brakensiek, Venkatesan Guruswami |
| 2016 | SODA | Efficient Low-Redundancy Codes for Correcting Multiple Deletions. | Joshua Brakensiek, Venkatesan Guruswami, Samuel Zbarsky |