| No. |
Title |
Author |
Year |
| 1 |
A Generalization of the Satisfiability Coding Lemma and Its Applications |
Mossé, Milan et al. |
2022 |
| 2 |
Reconstructing Decision Trees |
Blanc, Guy et al. |
2022 |
| 3 |
The Composition Complexity of Majority |
Lecomte, Victor et al. |
2022 |
| 4 |
Decision Tree Heuristics Can Fail, Even in the Smoothed Setting |
Blanc, Guy et al. |
2021 |
| 5 |
Deterministic Approximate Counting of Polynomial Threshold Functions via a Derandomized Regularity Lemma |
Servedio, Rocco A. et al. |
2021 |
| 6 |
Learning Stochastic Decision Trees |
Blanc, Guy et al. |
2021 |
| 7 |
On the Power and Limitations of Branch and Cut |
Fleming, Noah et al. |
2021 |
| 8 |
The Power of Many Samples in Query Complexity |
Bassilakis, Andrew et al. |
2020 |
| 9 |
Top-Down Induction of Decision Trees: Rigorous Guarantees and Inherent Limitations |
Blanc, Guy et al. |
2020 |
| 10 |
Improved Pseudorandom Generators from Pseudorandom Multi-Switching Lemmas |
Servedio, Rocco A. et al. |
2019 |
| 11 |
Luby-Velickovic-Wigderson Revisited: Improved Correlation Bounds and Pseudorandom Generators for Depth-Two Circuits |
Servedio, Rocco A. et al. |
2018 |
| 12 |
Adaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces |
Chen, Xi et al. |
2017 |
| 13 |
Settling the Query Complexity of Non-Adaptive Junta Testing |
Chen, Xi et al. |
2017 |
| 14 |
What Circuit Classes Can Be Learned with Non-Trivial Savings? |
Servedio, Rocco A. et al. |
2017 |
| 15 |
Adaptivity Helps for Testing Juntas |
Servedio, Rocco A. et al. |
2015 |
| 16 |
Learning Circuits with few Negations |
Blais, Eric et al. |
2015 |
