default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew S. Brennan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Matthew S. Brennan, Guy Bresler, Brice Huang:
Threshold for detecting high dimensional geometry in anisotropic random geometric graphs. Random Struct. Algorithms 64(1): 125-137 (2024)- 2022
- [i11]Matthew S. Brennan, Guy Bresler, Brice Huang:
Threshold for Detecting High Dimensional Geometry in Anisotropic Random Geometric Graphs. CoRR abs/2206.14896 (2022) - 2021
- [b1]Matthew S. Brennan:
Reducibility and Statistical-Computational Gaps from Secret Leakage. Massachusetts Institute of Technology, USA, 2021 - [c7]Matthew S. Brennan, Guy Bresler, Samuel B. Hopkins, Jerry Li, Tselil Schramm:
Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent. COLT 2021: 774 - [c6]Emmanuel Abbe, Enric Boix-Adserà, Matthew S. Brennan, Guy Bresler, Dheeraj Nagaraj:
The staircase property: How hierarchical structure can guide deep learning. NeurIPS 2021: 26989-27002 - [i10]Matthew S. Brennan, Guy Bresler, Brice Huang:
De Finetti-Style Results for Wishart Matrices: Combinatorial Structure and Phase Transitions. CoRR abs/2103.14011 (2021) - [i9]Emmanuel Abbe, Enric Boix-Adserà, Matthew S. Brennan, Guy Bresler, Dheeraj Nagaraj:
The staircase property: How hierarchical structure can guide deep learning. CoRR abs/2108.10573 (2021) - 2020
- [c5]Matthew S. Brennan, Guy Bresler:
Reducibility and Statistical-Computational Gaps from Secret Leakage. COLT 2020: 648-847 - [i8]Matthew S. Brennan, Guy Bresler:
Reducibility and Statistical-Computational Gaps from Secret Leakage. CoRR abs/2005.08099 (2020) - [i7]Matthew S. Brennan, Guy Bresler, Samuel B. Hopkins, Jerry Li, Tselil Schramm:
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent. CoRR abs/2009.06107 (2020)
2010 – 2019
- 2019
- [c4]Matthew S. Brennan, Guy Bresler, Wasim Huleihel:
Universality of Computational Lower Bounds for Submatrix Detection. COLT 2019: 417-468 - [c3]Matthew S. Brennan, Guy Bresler:
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness. COLT 2019: 469-470 - [c2]Enric Boix-Adserà, Matthew S. Brennan, Guy Bresler:
The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs. FOCS 2019: 1256-1280 - [i6]Matthew S. Brennan, Guy Bresler, Wasim Huleihel:
Universality of Computational Lower Bounds for Submatrix Detection. CoRR abs/1902.06916 (2019) - [i5]Matthew S. Brennan, Guy Bresler:
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness. CoRR abs/1902.07380 (2019) - [i4]Enric Boix Adserà, Matthew S. Brennan, Guy Bresler:
The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs. CoRR abs/1903.08247 (2019) - [i3]Matthew S. Brennan, Guy Bresler:
Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries. CoRR abs/1908.06130 (2019) - [i2]Matthew S. Brennan, Guy Bresler, Dheeraj Nagaraj:
Phase Transitions for Detecting Latent Geometry in Random Graphs. CoRR abs/1910.14167 (2019) - 2018
- [c1]Matthew S. Brennan, Guy Bresler, Wasim Huleihel:
Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure. COLT 2018: 48-166 - [i1]Matthew S. Brennan, Guy Bresler, Wasim Huleihel:
Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure. CoRR abs/1806.07508 (2018) - 2017
- [j1]Christian Wachinger
, Matthew S. Brennan, Gregory C. Sharp, Polina Golland:
Efficient Descriptor-Based Segmentation of Parotid Glands With Nonlocal Means. IEEE Trans. Biomed. Eng. 64(7): 1492-1502 (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 2024-06-10 21:21 CEST 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:
