Matthew D. Brennan

MaRDI QIDQ512569zbMATH OpenORCIDWikidataFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The average-case complexity of counting cliques in Erdős-Rényi hypergraphs SIAM Journal on Computing	2025-09-16	Paper
The average-case complexity of counting cliques in Erdős-Rényi hypergraphs	2025-08-12	Paper
Threshold for detecting high dimensional geometry in anisotropic random geometric graphs Random Structures & Algorithms	2024-01-05	Paper
The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs SIAM Journal on Computing	2021-10-18	Paper
De Finetti-Style Results for Wishart Matrices: Combinatorial Structure and Phase Transitions	2021-03-25	Paper
De Finetti-Style Results for Wishart Matrices: Combinatorial Structure and Phase Transitions (available as arXiv preprint)	2021-01-01	Paper
Phase transitions for detecting latent geometry in random graphs Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete	2020-11-08	Paper
Reducibility and Statistical-Computational Gaps from Secret Leakage	2020-05-16	Paper
Reducibility and Statistical-Computational Gaps from Secret Leakage (available as arXiv preprint)	2020-01-01	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 (available as arXiv preprint)	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
Universality of Computational Lower Bounds for Submatrix Detection (available as arXiv preprint)	2019-01-01	Paper
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness (available as arXiv preprint)	2019-01-01	Paper
Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries (available as arXiv preprint)	2019-01-01	Paper
Ramsey numbers of trees and unicyclic graphs versus fans Discrete Mathematics	2017-02-27	Paper
Ramsey numbers of trees versus odd cycles The Electronic Journal of Combinatorics	2016-07-13	Paper
Ramsey numbers of trees versus odd cycles The Electronic Journal of Combinatorics	2016-07-13	Paper
Modeling intercellular transfer of biomolecules through tunneling nanotubes Bulletin of Mathematical Biology	2013-10-11	Paper

Research outcomes over time

This page was built for person: Matthew D. Brennan