| Randomized communication and implicit graph representations N Harms, S Wild, V Zamaraev Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 27 | 2022 |
| VC dimension and distribution-free sample-based testing E Blais, R Ferreira Pinto Jr, N Harms Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 26 | 2021 |
| Universal Communication, Universal Graphs, and Graph Labeling N Harms arXiv preprint arXiv:1911.03757, 2019 | 23 | 2019 |
| Downsampling for Testing and Learning in Product Distributions N Harms, Y Yoshida arXiv preprint arXiv:2007.07449, 2020 | 18 | 2020 |
| Testing halfspaces over rotation-invariant distributions N Harms Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 17 | 2019 |
| Sketching Distances in Monotone Graph Classes L Esperet, N Harms, A Kupavskii arXiv preprint arXiv:2202.09253, 2022 | 14 | 2022 |
| Optimal adjacency labels for subgraphs of cartesian products L Esperet, N Harms, V Zamaraev SIAM Journal on Discrete Mathematics 38 (3), 2181-2193, 2024 | 13 | 2024 |
| Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank N Harms, V Zamaraev Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 10 | 2024 |
| No Complete Problem for Constant-Cost Randomized Communication Y Fang, L Hambardzumyan, N Harms, P Hatami Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1287-1298, 2024 | 7 | 2024 |
| Testing and Learning Convex Sets in the Ternary Hypercube H Black, E Blais, N Harms 15th Innovations in Theoretical Computer Science Conference (ITCS 2024), 2024 | 7* | 2024 |
| Testing Support Size More Efficiently Than Learning Histograms R Ferreira Pinto Jr, N Harms Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 995-1006, 2025 | 5* | 2025 |
| Distribution Testing Under the Parity Trace R Ferreira Pinto Jr, N Harms arXiv e-prints, arXiv: 2304.01374, 2023 | 5* | 2023 |
| Better Boosting of Communication Oracles, or Not N Harms, A Riazanov arXiv preprint arXiv:2410.00838, 2024 | 3 | 2024 |
| Adjacency Labeling and Sketching for Induced Subgraphs of the Hypercube N Harms | 3 | 2022 |
| Equality is Far Weaker than Constant-Cost Communication M Göös, N Harms, A Riazanov arXiv preprint arXiv:2507.11162, 2025 | 2 | 2025 |
| Constant-cost communication is not reducible to k-hamming distance Y Fang, M Göös, N Harms, P Hatami Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 565-571, 2025 | 2 | 2025 |
| Distribution Testing with a Confused Collector R Ferreira Pinto Jr, N Harms arXiv e-prints, arXiv: 2311.14247, 2023 | 2* | 2023 |
| Sign-Rank of -Hamming Distance is Constant M Göös, N Harms, V Imbach, D Sokolov arXiv preprint arXiv:2506.12022, 2025 | 1 | 2025 |
| Graphs with minimum fractional domatic number M Gadouleau, N Harms, GB Mertzios, V Zamaraev Discrete Applied Mathematics 343, 140-148, 2024 | 1 | 2024 |
| Feature Selection and Junta Testing are Statistically Equivalent L Beretta, N Harms, C Koch Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2026 | | 2026 |
Renato Ferreira Pinto JrColumbia UniversityVerified email at uwaterloo.ca
