| 2026 | SODA | Feature Selection and Junta Testing are Statistically Equivalent. | Lorenzo Beretta, Nathaniel Harms, Caleb Koch |
| 2026 | STOC | Pseudodeterministic Communication Complexity. | Mika Gs, Nathaniel Harms, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov, Weiqiang Yuan |
| 2025 | FOCS | Sign-Rank of k-Hamming Distance is Constant. | Mika Gs, Nathaniel Harms, Valentin Imbach, Dmitry Sokolov |
| 2025 | STOC | Constant-Cost Communication Is Not Reducible to k-Hamming Distance. | Yuting Fang, Mika Gs, Nathaniel Harms, Pooya Hatami |
| 2025 | STOC | Testing Support Size More Efficiently Than Learning Histograms. | Renato Ferreira Pinto Jr., Nathaniel Harms |
| 2024 | SODA | Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank. | Nathaniel Harms, Viktor Zamaraev |
| 2024 | STOC | No Complete Problem for Constant-Cost Randomized Communication. | Yuting Fang, Lianna Hambardzumyan, Nathaniel Harms, Pooya Hatami |
| 2023 | ICALP | Optimal Adjacency Labels for Subgraphs of Cartesian Products. | Louis Esperet, Nathaniel Harms, Viktor Zamaraev |
| 2022 | ICALP | Downsampling for Testing and Learning in Product Distributions. | Nathaniel Harms, Yuichi Yoshida |
| 2022 | STOC | Randomized communication and implicit graph representations. | Nathaniel Harms, Sebastian Wild, Viktor Zamaraev |
| 2021 | STOC | VC dimension and distribution-free sample-based testing. | Eric Blais, Renato Ferreira Pinto Jr., Nathaniel Harms |
| 2019 | SODA | Testing Halfspaces over Rotation-Invariant Distributions. | Nathaniel Harms |