Efficient Descriptor-Based Segmentation of Parotid Glands With Nonlocal Means. - Christian Wachinger; Matthew S. Brennan; Gregory C. Sharp; Polina Golland (IEEE Trans. Biomed. Eng., 2017)

Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure. - Matthew S. Brennan; Guy Bresler; Wasim Huleihel (COLT, 2018)

Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness. - Matthew S. Brennan; Guy Bresler (COLT, 2019)

Universality of Computational Lower Bounds for Submatrix Detection. - Matthew S. Brennan; Guy Bresler; Wasim Huleihel (COLT, 2019)

The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs. - Enric Boix-Adserà; Matthew S. Brennan; Guy Bresler (FOCS, 2019)

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries. - Matthew S. Brennan; Guy Bresler (CoRR, 2019)

Phase Transitions for Detecting Latent Geometry in Random Graphs. - Matthew S. Brennan; Guy Bresler; Dheeraj Nagaraj (CoRR, 2019)

Reducibility and Statistical-Computational Gaps from Secret Leakage. - Matthew S. Brennan; Guy Bresler (COLT, 2020)

Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent. - Matthew S. Brennan; Guy Bresler; Samuel B. Hopkins 001; Jerry Li 001; Tselil Schramm (COLT, 2021)

The staircase property: How hierarchical structure can guide deep learning. - Emmanuel Abbe; Enric Boix-Adserà; Matthew S. Brennan; Guy Bresler; Dheeraj Nagaraj (NeurIPS, 2021)

De Finetti-Style Results for Wishart Matrices: Combinatorial Structure and Phase Transitions. - Matthew S. Brennan; Guy Bresler; Brice Huang (CoRR, 2021)

Reducibility and Statistical-Computational Gaps from Secret Leakage. - Matthew S. Brennan (2021)

Threshold for detecting high dimensional geometry in anisotropic random geometric graphs. - Matthew S. Brennan; Guy Bresler; Brice Huang (Random Struct. Algorithms, 2024)