Nathaniel Harms

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Equality is far weaker than constant-cost communication	2026-09-11	Paper
Better boosting of communication oracles, or not	2026-06-12	Paper
Testing support size more efficiently than learning histograms TheoretiCS	2026-05-28	Paper
Testing and learning convex sets in the ternary hypercube	2025-11-04	Paper
Distribution testing with a confused collector	2025-11-04	Paper
Randomized communication and implicit graph representations TheoretiCS	2025-10-22	Paper
Randomized communication and implicit representations for matrices and graphs of small sign-rank	2024-11-28	Paper
Optimal adjacency labels for subgraphs of Cartesian products	2024-11-14	Paper
Sketching distances in monotone graph classes	2024-08-22	Paper
Optimal adjacency labels for subgraphs of Cartesian products SIAM Journal on Discrete Mathematics	2024-07-31	Paper
Downsampling for testing and learning in product distributions	2024-06-24	Paper
Graphs with minimum fractional domatic number Discrete Applied Mathematics	2024-01-02	Paper
Randomized communication and implicit graph representations Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing	2023-12-08	Paper
VC dimension and distribution-free sample-based testing Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing	2023-11-14	Paper
scientific article; zbMATH DE number 7650381 (Why is no real title available?) (available as arXiv preprint)	2023-02-03	Paper
Optimal Adjacency Labels for Subgraphs of Cartesian Products	2022-06-06	Paper
Sketching Distances in Monotone Graph Classes	2022-02-18	Paper
Testing Halfspaces over Rotation-Invariant Distributions Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms	2019-10-15	Paper

Research outcomes over time

This page was built for person: Nathaniel Harms