default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNathaniel Harms
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Maximilien Gadouleau, Nathaniel Harms, George B. Mertzios, Viktor Zamaraev
:
Graphs with minimum fractional domatic number. Discret. Appl. Math. 343: 140-148 (2024)- [j1]Louis Esperet, Nathaniel Harms, Viktor Zamaraev:
Optimal Adjacency Labels for Subgraphs of Cartesian Products. SIAM J. Discret. Math. 38(3): 2181-2193 (2024) - [c12]Nathaniel Harms, Artur Riazanov:
Better Boosting of Communication Oracles, or Not. FSTTCS 2024: 25:1-25:14 - [c11]Hadley Black, Eric Blais, Nathaniel Harms:
Testing and Learning Convex Sets in the Ternary Hypercube. ITCS 2024: 15:1-15:21 - [c10]Renato Ferreira Pinto Jr., Nathaniel Harms:
Distribution Testing with a Confused Collector. ITCS 2024: 47:1-47:14 - [c9]Nathaniel Harms, Viktor Zamaraev:
Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank. SODA 2024: 1810-1833 - [c8]Yuting Fang, Lianna Hambardzumyan, Nathaniel Harms, Pooya Hatami:
No Complete Problem for Constant-Cost Randomized Communication. STOC 2024: 1287-1298 - [i17]Yuting Fang, Lianna Hambardzumyan, Nathaniel Harms, Pooya Hatami:
No Complete Problem for Constant-Cost Randomized Communication. CoRR abs/2404.00812 (2024) - [i16]Yuting Fang, Mika Göös, Nathaniel Harms, Pooya Hatami:
Constant-Cost Communication is not Reducible to k-Hamming Distance. CoRR abs/2407.20204 (2024) - [i15]Nathaniel Harms, Artur Riazanov:
Better Boosting of Communication Oracles, or Not. CoRR abs/2410.00838 (2024) - [i14]Renato Ferreira Pinto Jr., Nathaniel Harms:
Testing Support Size More Efficiently Than Learning Histograms. CoRR abs/2410.18915 (2024) - [i13]Yuting Fang, Lianna Hambardzumyan, Nathaniel Harms, Pooya Hatami:
No Complete Problem for Constant-Cost Randomized Communication. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c7]Louis Esperet, Nathaniel Harms, Viktor Zamaraev:
Optimal Adjacency Labels for Subgraphs of Cartesian Products. ICALP 2023: 57:1-57:11 - [i12]Maximilien Gadouleau, Nathaniel Harms, George B. Mertzios, Viktor Zamaraev:
Graphs with minimum fractional domatic number. CoRR abs/2302.11668 (2023) - [i11]Renato Ferreira Pinto Jr., Nathaniel Harms:
Distribution Testing Under the Parity Trace. CoRR abs/2304.01374 (2023) - [i10]Hadley Black, Eric Blais, Nathaniel Harms:
Testing Convexity of Discrete Sets in High Dimensions. CoRR abs/2305.03194 (2023) - [i9]Nathaniel Harms, Viktor Zamaraev:
Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank. CoRR abs/2307.04441 (2023) - [i8]Renato Ferreira Pinto Jr., Nathaniel Harms:
Distribution Testing with a Confused Collector. CoRR abs/2311.14247 (2023) - 2022
- [c6]Louis Esperet, Nathaniel Harms, Andrey Kupavskii:
Sketching Distances in Monotone Graph Classes. APPROX/RANDOM 2022: 18:1-18:23 - [c5]Nathaniel Harms, Yuichi Yoshida:
Downsampling for Testing and Learning in Product Distributions. ICALP 2022: 71:1-71:19 - [c4]Nathaniel Harms, Sebastian Wild, Viktor Zamaraev:
Randomized communication and implicit graph representations. STOC 2022: 1220-1233 - [i7]Louis Esperet, Nathaniel Harms, Andrey Kupavskii:
Sketching Distances in Monotone Graph Classes. CoRR abs/2202.09253 (2022) - [i6]Louis Esperet, Nathaniel Harms, Viktor Zamaraev:
Optimal Adjacency Labels for Subgraphs of Cartesian Products. CoRR abs/2206.02872 (2022) - 2021
- [c3]Eric Blais, Renato Ferreira Pinto Jr., Nathaniel Harms:
VC dimension and distribution-free sample-based testing. STOC 2021: 504-517 - [i5]Nathaniel Harms, Sebastian Wild, Viktor Zamaraev:
Randomized Communication and the Implicit Graph Conjecture. CoRR abs/2111.03639 (2021) - 2020
- [c2]Nathaniel Harms:
Universal Communication, Universal Graphs, and Graph Labeling. ITCS 2020: 33:1-33:27 - [i4]Nathaniel Harms, Yuichi Yoshida:
Downsampling for Testing and Learning in Product Distributions. CoRR abs/2007.07449 (2020) - [i3]Eric Blais, Renato Ferreira Pinto Jr., Nathaniel Harms:
VC Dimension and Distribution-Free Sample-Based Testing. CoRR abs/2012.03923 (2020)
2010 – 2019
- 2019
- [c1]Nathaniel Harms:
Testing Halfspaces over Rotation-Invariant Distributions. SODA 2019: 694-713 - [i2]Nathaniel Harms:
Universal Communication, Universal Graphs, and Graph Labeling. CoRR abs/1911.03757 (2019) - 2018
- [i1]Nathaniel Harms:
Testing Halfspaces over Rotation-Invariant Distributions. CoRR abs/1811.00139 (2018)
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 2025-01-09 13:21 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:
