Hadley Black
According to our database1,
Hadley Black
authored at least 12 papers
between 2017 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024
2023
A d<sup>1/2+o(1)</sup> Monotonicity Tester for Boolean Functions on $d$-Dimensional Hypergrids.
Electron. Colloquium Comput. Complex., 2023
Nearly Optimal Bounds for Sample-Based Testing and Learning of $k$-Monotone Functions.
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