| No. |
Title |
Author |
Year |
| 1 |
Improved Monotonicity Testers via Hypercube Embeddings |
Braverman, Mark et al. |
2023 |
| 2 |
Almost Polynomial Factor Inapproximability for Parameterized k-Clique |
Karthik C. S. et al. |
2022 |
| 3 |
On Rich 2-to-1 Games |
Braverman, Mark et al. |
2021 |
| 4 |
Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality |
Kelman, Esty et al. |
2021 |
| 5 |
Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut |
Bhangale, Amey et al. |
2020 |
| 6 |
Improved 3LIN Hardness via Linear Label Cover |
Harsha, Prahladh et al. |
2019 |
| 7 |
UG-Hardness to NP-Hardness by Losing Half |
Bhangale, Amey et al. |
2019 |
| 8 |
An Improved Dictatorship Test with Perfect Completeness |
Bhangale, Amey et al. |
2018 |
| 9 |
An ~O(n) Queries Adaptive Tester for Unateness |
Khot, Subhash et al. |
2016 |
| 10 |
Hardness of Approximation (Invited Talk) |
Khot, Subhash |
2016 |
| 11 |
Hardness of Bipartite Expansion |
Khot, Subhash et al. |
2016 |
| 12 |
On Approximation Resistance of Predicates (Invited Talk) |
Khot, Subhash |
2013 |
