| Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations | 0 | 0.34 | 2022 |
| The Resolution of Keller's Conjecture | 0 | 0.34 | 2022 |
| PROMISE CONSTRAINT SATISFACTION: ALGEBRAIC STRUCTURE AND A SYMMETRIC BOOLEAN DICHOTOMY | 0 | 0.34 | 2021 |
| Conditional Dichotomy of Boolean Ordered Promise CSPs. | 0 | 0.34 | 2021 |
| The Quest for Strong Inapproximability Results with Perfect Completeness | 0 | 0.34 | 2021 |
| On the Mysteries of MAX NAE-SAT | 0 | 0.34 | 2021 |
| The Resolution of Keller's Conjecture. | 0 | 0.34 | 2020 |
| The Power Of The Combined Basic Linear Programming And Affine Relaxation For Promise Constraint Satisfaction Problems | 0 | 0.34 | 2020 |
| Symmetric Polymorphisms and Efficient Decidability of Promise CSPs. | 0 | 0.34 | 2020 |
| The Resolution of Keller's Conjecture. | 0 | 0.34 | 2020 |
| Smoothed Complexity of 2-player Nash Equilibria | 0 | 0.34 | 2020 |
| The Power of the Combined Basic LP and Affine Relaxation for Promise CSPs. | 0 | 0.34 | 2020 |
| An Algorithmic Blend of LPs and Ring Equations for Promise CSPs. | 1 | 0.36 | 2019 |
| Constant-factor approximation of near-linear edit distance in near-linear time. | 0 | 0.34 | 2019 |
| Promise Constraint Satisfaction: Structure Theory and a Symmetric Boolean Dichotomy. | 1 | 0.36 | 2018 |
| Combining LPs and Ring Equations via Structured Polymorphisms. | 0 | 0.34 | 2018 |
| A Family of Dictatorship Tests with Perfect Completeness for 2-to-2 Label Cover. | 0 | 0.34 | 2017 |
| Vertex isoperimetry and independent set stability for tensor powers of cliques. | 0 | 0.34 | 2017 |
| New hardness results for graph and hypergraph colorings. | 0 | 0.34 | 2016 |
| Bounds on the Size of Sound Monotone Switching Networks Accepting Permutation Sets of Directed Trees | 0 | 0.34 | 2013 |
