Testing Halfspaces over Rotation-Invariant Distributions. - Nathaniel Harms (SODA, 2019)

Universal Communication, Universal Graphs, and Graph Labeling. - Nathaniel Harms (ITCS, 2020)

VC dimension and distribution-free sample-based testing. - Eric Blais; Renato Ferreira Pinto Jr.; Nathaniel Harms (STOC, 2021)

Randomized Communication and the Implicit Graph Conjecture. - Nathaniel Harms; Sebastian Wild; Viktor Zamaraev (CoRR, 2021)

Sketching Distances in Monotone Graph Classes. - Louis Esperet; Nathaniel Harms; Andrey Kupavskii (APPROX/RANDOM, 2022)

Downsampling for Testing and Learning in Product Distributions. - Nathaniel Harms; Yuichi Yoshida (ICALP, 2022)

Randomized communication and implicit graph representations. - Nathaniel Harms; Sebastian Wild; Viktor Zamaraev (STOC, 2022)

Distribution Testing Under the Parity Trace. - Renato Ferreira Pinto Jr.; Nathaniel Harms (CoRR, 2023)

Testing Convexity of Discrete Sets in High Dimensions. - Hadley Black; Eric Blais; Nathaniel Harms (CoRR, 2023)

Better Boosting of Communication Oracles, or Not. - Nathaniel Harms; Artur Riazanov (FSTTCS, 2024)

Testing and Learning Convex Sets in the Ternary Hypercube. - Hadley Black; Eric Blais; Nathaniel Harms (ITCS, 2024)

Distribution Testing with a Confused Collector. - Renato Ferreira Pinto Jr.; Nathaniel Harms (ITCS, 2024)

Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank. - Nathaniel Harms; Viktor Zamaraev (SODA, 2024)

No Complete Problem for Constant-Cost Randomized Communication. - Yuting Fang; Lianna Hambardzumyan; Nathaniel Harms; Pooya Hatami (Electron. Colloquium Comput. Complex., 2024)

Optimal Adjacency Labels for Subgraphs of Cartesian Products. - Louis Esperet; Nathaniel Harms; Viktor Zamaraev (SIAM J. Discret. Math., 2024)

Graphs with minimum fractional domatic number. - Maximilien Gadouleau; Nathaniel Harms; George B. Mertzios; Viktor Zamaraev (Discret. Appl. Math., 2024)

Constant-Cost Communication Is Not Reducible to k-Hamming Distance. - Yuting Fang; Mika Göös; Nathaniel Harms; Pooya Hatami (STOC, 2025)

Testing Support Size More Efficiently Than Learning Histograms. - Renato Ferreira Pinto Jr.; Nathaniel Harms (STOC, 2025)

Sign-Rank of $k$-Hamming Distance is Constant. - Mika Göös; Nathaniel Harms; Valentin Imbach; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2025)

Equality is Far Weaker Than Constant-Cost Communication. - Mika Göös; Nathaniel Harms; Artur Riazanov (Electron. Colloquium Comput. Complex., 2025)

Testing Juntas Optimally with Samples. - Lorenzo Beretta 003; Nathaniel Harms; Caleb Koch (CoRR, 2025)

Sign-Rank of k-Hamming Distance is Constant. - Mika Göös; Nathaniel Harms; Valentin Imbach; Dmitry Sokolov 001 (CoRR, 2025)