default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHadley Black
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[c11]Hadley Black, Christopher Ye:
Distribution Testing in the Presence of Arbitrarily Dominant Noise with Verification Queries. SODA 2026: 4410-4480- 2025
- [c10]Hadley Black, Arya Mazumdar, Barna Saha, Yinzhan Xu:
Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs. COLT 2025: 315-343 - [c9]Hadley Black, Arya Mazumdar, Barna Saha:
Learning Partitions with Optimal Query and Round Complexities. COLT 2025: 344-374 - [i17]Hadley Black, Arya Mazumdar, Barna Saha:
Learning Partitions with Optimal Query and Round Complexities. CoRR abs/2505.05009 (2025) - [i16]Hadley Black, Arya Mazumdar, Barna Saha, Yinzhan Xu:
Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs. CoRR abs/2506.08405 (2025) - [i15]Hadley Black, Christopher Ye:
Distribution Testing in the Presence of Arbitrarily Dominant Noise with Verification Queries. CoRR abs/2509.17269 (2025) - [i14]Hadley Black, Kasper Green Larsen, Arya Mazumdar, Barna Saha, Geelon So:
Actively Learning Halfspaces without Synthetic Data. CoRR abs/2509.20848 (2025) - 2024
- [j1]Hadley Black
, Iden Kalemaj, Sofya Raskhodnikova:
Isoperimetric inequalities for real-valued functions with applications to monotonicity testing. Random Struct. Algorithms 65(1): 191-219 (2024) - [c8]Hadley Black:
Nearly Optimal Bounds for Sample-Based Testing and Learning of k-Monotone Functions. APPROX/RANDOM 2024: 37:1-37:23 - [c7]Hadley Black, Eric Blais, Nathaniel Harms:
Testing and Learning Convex Sets in the Ternary Hypercube. ITCS 2024: 15:1-15:21 - [c6]Hadley Black, Euiwoong Lee, Arya Mazumdar, Barna Saha:
Clustering with Non-adaptive Subset Queries. NeurIPS 2024 - [i13]Hadley Black, Euiwoong Lee, Arya Mazumdar, Barna Saha:
Clustering with Non-adaptive Subset Queries. CoRR abs/2409.10908 (2024) - 2023
- [b1]Hadley Black:
Testing and Learning in High-Dimensions: Monotonicity Testing, Directed Isoperimetry, and Convex Sets. University of California, Los Angeles, USA, 2023 - [c5]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
A d1/2+o(1) Monotonicity Tester for Boolean Functions on d-Dimensional Hypergrids. FOCS 2023: 1796-1821 - [c4]Hadley Black, Iden Kalemaj, Sofya Raskhodnikova:
Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity Testing. ICALP 2023: 25:1-25:20 - [c3]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n√d) Monotonicity Tester. STOC 2023: 233-241 - [i12]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
A d1/2+o(1) Monotonicity Tester for Boolean Functions on d-Dimensional Hypergrids. CoRR abs/2304.01416 (2023) - [i11]Hadley Black, Eric Blais, Nathaniel Harms:
Testing Convexity of Discrete Sets in High Dimensions. CoRR abs/2305.03194 (2023) - [i10]Hadley Black:
Nearly Optimal Bounds for Sample-Based Testing and Learning of $k$-Monotone Functions. CoRR abs/2310.12375 (2023) - [i9]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
A d1/2+o(1) Monotonicity Tester for Boolean Functions on $d$-Dimensional Hypergrids. Electron. Colloquium Comput. Complex. TR23: Article TR23-048 (2023) - 2022
- [i8]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n√d) Monotonicity Tester. CoRR abs/2211.05281 (2022) - [i7]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an $\widetilde{O}(n\sqrt{d})$ Monotonicity Tester. Electron. Colloquium Comput. Complex. TR22: Article TR22-162 (2022) - 2020
- [c2]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
Domain Reduction for Monotonicity Testing: A o(d) Tester for Boolean Functions in d-Dimensions. SODA 2020: 1975-1994 - [i6]Hadley Black, Iden Kalemaj, Sofya Raskhodnikova:
Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity Testing. CoRR abs/2011.09441 (2020) - [i5]Hadley Black, Iden Kalemaj, Sofya Raskhodnikova:
Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity Testing. Electron. Colloquium Comput. Complex. TR20: Article TR20-174 (2020)
2010 – 2019
- 2018
- [c1]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
A o(d) · polylog n Monotonicity Tester for Boolean Functions over the Hypergrid [n]d. SODA 2018: 2133-2151 - [i4]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
Domain Reduction for Monotonicity Testing: A o(d) Tester for Boolean Functions on Hypergrids. CoRR abs/1811.01427 (2018) - [i3]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
Domain Reduction for Monotonicity Testing: A $o(d)$ Tester for Boolean Functions on Hypergrids. Electron. Colloquium Comput. Complex. TR18: Article TR18-187 (2018) - 2017
- [i2]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
A $o(d) \cdot \text{polylog}~n$ Monotonicity Tester for Boolean Functions over the Hypergrid [n]d. CoRR abs/1710.10545 (2017) - [i1]Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
A o(d) · polylog n Monotonicity Tester for Boolean Functions over the Hypergrid [n]d. Electron. Colloquium Comput. Complex. TR17: Article TR17-159 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-02-20 22:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
