| 2025 | ALT | Computationally efficient reductions between some statistical models. | Mengqi Lou, Guy Bresler, Ashwin Pananjady |
| 2025 | COLT | Partial and Exact Recovery of a Random Hypergraph from its Graph Projection. | Guy Bresler, Chenghao Guo, Yury Polyanskiy, Andrew Yao |
| 2025 | COLT | Computational Equivalence of Spiked Covariance and Spiked Wigner Models via Gram-Schmidt Perturbation. | Guy Bresler, Alina Harbuzova |
| 2025 | STOC | Sandwiching Random Geometric Graphs and Erdos-Renyi with Applications: Sharp Thresholds, Robust Testing, and Enumeration. | Kiril Bangachev, Guy Bresler |
| 2025 | STOC | Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations. | Kiril Bangachev, Guy Bresler, Stefan Tiegel, Vinod Vaikuntanathan |
| 2024 | COLT | Detection of L | Kiril Bangachev, Guy Bresler |
| 2024 | COLT | Thresholds for Reconstruction of Random Hypergraphs From Graph Projections. | Guy Bresler, Chenghao Guo, Yury Polyanskiy |
| 2024 | STOC | On the Fourier Coefficients of High-Dimensional Random Geometric Graphs. | Kiril Bangachev, Guy Bresler |
| 2023 | COLT | Detection-Recovery and Detection-Refutation Gaps via Reductions from Planted Clique. | Guy Bresler, Tianze Jiang |
| 2023 | FOCS | Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra Triangles. | Guy Bresler, Chenghao Guo, Yury Polyanskiy |
| 2021 | COLT | Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent. | Matthew S. Brennan, Guy Bresler, Samuel B. Hopkins, Jerry Li, Tselil Schramm |
| 2021 | FOCS | Chow-Liu++: Optimal Prediction-Centric Learning of Tree Ising Models. | Enric Boix-Adser, Guy Bresler, Frederic Koehler |
| 2021 | FOCS | The Algorithmic Phase Transition of Random k-SAT for Low Degree Polynomials. | Guy Bresler, Brice Huang |
| 2020 | COLT | Reducibility and Statistical-Computational Gaps from Secret Leakage. | Matthew S. Brennan, Guy Bresler |
| 2020 | COLT | A Corrective View of Neural Networks: Representation, Memorization and Learning. | Guy Bresler, Dheeraj Nagaraj |
| 2020 | ISIT | Minimax Prediction in Tree Ising Models. | Guy Bresler, Mina Karzand |
| 2019 | COLT | Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness. | Matthew S. Brennan, Guy Bresler |
| 2019 | COLT | Universality of Computational Lower Bounds for Submatrix Detection. | Matthew S. Brennan, Guy Bresler, Wasim Huleihel |
| 2019 | FOCS | The Average-Case Complexity of Counting Cliques in Erdős-Rnyi Hypergraphs. | Enric Boix-Adser, Matthew S. Brennan, Guy Bresler |
| 2019 | ISIT | Information Storage in the Stochastic Ising Model at Low Temperature. | Ziv Goldfeld, Guy Bresler, Yury Polyanskiy |
| 2019 | STOC | Learning restricted Boltzmann machines via influence maximization. | Guy Bresler, Frederic Koehler, Ankur Moitra |
| 2018 | COLT | Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure. | Matthew S. Brennan, Guy Bresler, Wasim Huleihel |
| 2018 | COLT | Optimal Single Sample Tests for Structured versus Unstructured Network Data. | Guy Bresler, Dheeraj Nagaraj |
| 2018 | ISIT | Information Storage in the Stochastic Ising Model at Zero Temperature. | Ziv Goldfeld, Guy Bresler, Yury Polyanskiy |
| 2018 | ITA | Regret Bounds and Regimes of Optimality for User-User and Item-Item Collaborative Filtering. | Guy Bresler, Mina Karzand |
| 2016 | SIGMETRICS | Collaborative Filtering with Low Regret. | Guy Bresler, Devavrat Shah, Luis Filipe Voloch |
| 2015 | STOC | Efficiently Learning Ising Models on Arbitrary Graphs. | Guy Bresler |
| 2012 | ISIT | Information theory for DNA sequencing: Part I: A basic model. | Abolfazl S. Motahari, Guy Bresler, David Tse |
| 2011 | ITW | Feasibility of interference alignment for the MIMO interference channel: The symmetric square case. | Guy Bresler, Dustin Cartwright, David N. C. Tse |
| 2008 | FOCS | Mixing Time of Exponential Random Graphs. | Shankar Bhamidi, Guy Bresler, Allan Sly |
| 2006 | ISIT | Note On Mutual Information and Orthogonal Space-Time Codes. | Guy Bresler, Bruce E. Hajek |