Hadley Black
Orcid: 0009-0008-9662-2870
According to our database1,
Hadley Black authored at least 18 papers
between 2017 and 2026.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2026
Distribution Testing in the Presence of Arbitrarily Dominant Noise with Verification Queries.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026
2025
Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025
Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025
2024
Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024
Proceedings of the Approximation, 2024
2023
Testing and Learning in High-Dimensions: Monotonicity Testing, Directed Isoperimetry, and Convex Sets
PhD thesis, 2023
Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n√d) Monotonicity Tester.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity Testing.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
A d<sup>1/2+o(1)</sup> Monotonicity Tester for Boolean Functions on d-Dimensional Hypergrids.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
2022
Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an $\widetilde{O}(n\sqrt{d})$ Monotonicity Tester.
Electron. Colloquium Comput. Complex., 2022
2020
Domain Reduction for Monotonicity Testing: A <i>o</i>(<i>d</i>) Tester for Boolean Functions in <i>d</i>-Dimensions.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
2018
Domain Reduction for Monotonicity Testing: A $o(d)$ Tester for Boolean Functions on Hypergrids.
Electron. Colloquium Comput. Complex., 2018
A <i>o</i>(<i>d</i>) · polylog <i>n</i> Monotonicity Tester for Boolean Functions over the Hypergrid [<i>n</i>]<sup><i>d</i></sup>.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
2017
A o(d) · polylog n Monotonicity Tester for Boolean Functions over the Hypergrid [n]<sup>d</sup>.
Electron. Colloquium Comput. Complex., 2017
A $o(d) \cdot \text{polylog}~n$ Monotonicity Tester for Boolean Functions over the Hypergrid [n]<sup>d</sup>.
CoRR, 2017