Matthew D. Brennan

Available identifiers

Publication	Date of Publication	Type
Threshold for detecting high dimensional geometry in anisotropic random geometric graphs	2024-01-05	Paper
The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs	2021-10-18	Paper
De Finetti-Style Results for Wishart Matrices: Combinatorial Structure and Phase Transitions	2021-03-25	Paper
Phase transitions for detecting latent geometry in random graphs	2020-11-08	Paper
Reducibility and Statistical-Computational Gaps from Secret Leakage	2020-05-16	Paper
Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries	2019-08-08	Paper
The Average-Case Complexity of Counting Cliques in Erdos-Renyi Hypergraphs	2019-03-19	Paper
Universality of Computational Lower Bounds for Submatrix Detection	2019-02-19	Paper
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness	2019-02-19	Paper
Ramsey numbers of trees and unicyclic graphs versus fans	2017-02-27	Paper
Ramsey numbers of trees versus odd cycles	2016-07-13	Paper
Modeling intercellular transfer of biomolecules through tunneling nanotubes	2013-10-11	Paper

This page was built for person: Matthew D. Brennan