Matthew S. Brennan

22 papers A* 7Journal 14
YearRankTypeTitle / Venue / Authors
2025 J jnl
The Average-Case Complexity of Counting Cliques in Erdös-Rényi Hypergraphs.
SIAM J. Comput.
Enric Boix-Adserà, Matthew S. Brennan, Guy Bresler
2024 J jnl
Threshold for detecting high dimensional geometry in anisotropic random geometric graphs.
Random Struct. Algorithms
Matthew S. Brennan, Guy Bresler, Brice Huang
2022 J jnl
Threshold for Detecting High Dimensional Geometry in Anisotropic Random Geometric Graphs.
CoRR
Matthew S. Brennan, Guy Bresler, Brice Huang
2021 J jnl
De Finetti-Style Results for Wishart Matrices: Combinatorial Structure and Phase Transitions.
CoRR
Matthew S. Brennan, Guy Bresler, Brice Huang
2021 — —
Reducibility and Statistical-Computational Gaps from Secret Leakage.
Matthew S. Brennan
2021 A* conf
Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent.
COLT
Matthew S. Brennan, Guy Bresler, Samuel B. Hopkins, Jerry Li, Tselil Schramm
2021 A* conf
The staircase property: How hierarchical structure can guide deep learning.
NeurIPS
Emmanuel Abbe, Enric Boix-Adserà, Matthew S. Brennan, Guy Bresler, Dheeraj Nagaraj
2021 J jnl
The staircase property: How hierarchical structure can guide deep learning.
CoRR
Emmanuel Abbe, Enric Boix-Adserà, Matthew S. Brennan, Guy Bresler, Dheeraj Nagaraj
2020 A* conf
Reducibility and Statistical-Computational Gaps from Secret Leakage.
COLT
Matthew S. Brennan, Guy Bresler
2020 J jnl
Reducibility and Statistical-Computational Gaps from Secret Leakage.
CoRR
Matthew S. Brennan, Guy Bresler
2020 J jnl
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent.
CoRR
Matthew S. Brennan, Guy Bresler, Samuel B. Hopkins, Jerry Li, Tselil Schramm
2019 J jnl
Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries.
CoRR
Matthew S. Brennan, Guy Bresler
2019 A* conf
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness.
COLT
Matthew S. Brennan, Guy Bresler
2019 J jnl
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness.
CoRR
Matthew S. Brennan, Guy Bresler
2019 J jnl
Phase Transitions for Detecting Latent Geometry in Random Graphs.
CoRR
Matthew S. Brennan, Guy Bresler, Dheeraj Nagaraj
2019 A* conf
The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs.
FOCS
Enric Boix-Adserà, Matthew S. Brennan, Guy Bresler
2019 J jnl
The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs.
CoRR
Enric Boix Adserà, Matthew S. Brennan, Guy Bresler
2019 A* conf
Universality of Computational Lower Bounds for Submatrix Detection.
COLT
Matthew S. Brennan, Guy Bresler, Wasim Huleihel
2019 J jnl
Universality of Computational Lower Bounds for Submatrix Detection.
CoRR
Matthew S. Brennan, Guy Bresler, Wasim Huleihel
2018 A* conf
Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure.
COLT
Matthew S. Brennan, Guy Bresler, Wasim Huleihel
2018 J jnl
Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure.
CoRR
Matthew S. Brennan, Guy Bresler, Wasim Huleihel
2017 J jnl
Efficient Descriptor-Based Segmentation of Parotid Glands With Nonlocal Means.
IEEE Trans. Biomed. Eng.
Christian Wachinger, Matthew S. Brennan, Gregory C. Sharp, Polina Golland