Hadley Black

Orcid: 0009-0008-9662-2870

According to our database1, Hadley Black authored at least 16 papers between 2017 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs.
Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

Learning Partitions with Optimal Query and Round Complexities.
Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

2024
Clustering with Non-adaptive Subset Queries.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Testing and Learning Convex Sets in the Ternary Hypercube.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Nearly Optimal Bounds for Sample-Based Testing and Learning of k-Monotone Functions.
Proceedings of the Approximation, 2024

2023
Testing and Learning in High-Dimensions: Monotonicity Testing, Directed Isoperimetry, and Convex Sets
PhD thesis, 2023

A d<sup>1/2+o(1)</sup> Monotonicity Tester for Boolean Functions on $d$-Dimensional Hypergrids.
Electron. Colloquium Comput. Complex., 2023

Testing Convexity of Discrete Sets in High Dimensions.
CoRR, 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

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
Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity Testing.
Electron. Colloquium Comput. Complex., 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


  Loading...