| 2026 | COLT | Online Realizable Regression and Applications for ReLU Networks. | Ilan Doron-Arad, Idan Mehalel, Elchanan Mossel |
| 2026 | COLT | Learning Ising Models from Evolutions (Extended Abstract). | Jason Gaitonde, Ankur Moitra, Elchanan Mossel |
| 2026 | COLT | Reconstructing Riemannian Metrics From Random Geometric Graphs. | Han Huang, Pakawut Jiradilok, Elchanan Mossel |
| 2026 | ISIT | Detecting Mutual Excitations in Non-Stationary Hawkes Processes. | Elchanan Mossel, Anirudh Sridhar |
| 2026 | SODA | Comparison Theorems for the Mixing Times of Systematic and Random Scan Dynamics. | Jason Gaitonde, Elchanan Mossel |
| 2025 | COLT | Stochastic block models with many communities and the Kesten-Stigum bound - extended abstract. | Byron Chin, Elchanan Mossel, Youngtak Sohn, Alexander S. Wein |
| 2025 | COLT | Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions. | Elisabetta Cornacchia, Dan Mikulincer, Elchanan Mossel |
| 2025 | COLT | Polynomial low degree hardness for Broadcasting on Trees (Extended Abstract). | Han Huang, Elchanan Mossel |
| 2025 | STOC | Bypassing the Noisy Parity Barrier: Learning Higher-Order Markov Random Fields from Dynamics. | Jason Gaitonde, Ankur Moitra, Elchanan Mossel |
| 2025 | STOC | Weak Recovery, Hypothesis Testing, and Mutual Information in Stochastic Block Models and Planted Factor Graphs. | Elchanan Mossel, Allan Sly, Youngtak Sohn |
| 2024 | COLT | Errors are Robustly Tamed in Cumulative Knowledge Processes. | Anna M. Brandenberger, Cassandra Marcussen, Elchanan Mossel, Madhu Sudan |
| 2024 | COLT | The power of an adversary in Glauber dynamics. | Byron Chin, Ankur Moitra, Elchanan Mossel, Colin Sandon |
| 2024 | COLT | Reconstructing the Geometry of Random Geometric Graphs (Extended Abstract). | Han Huang, Pakawut Jiradilok, Elchanan Mossel |
| 2024 | COLT | Finding Super-spreaders in Network Cascades. | Elchanan Mossel, Anirudh Sridhar |
| 2024 | STOC | A Unified Approach to Learning Ising Models: Beyond Independence and Bounded Width. | Jason Gaitonde, Elchanan Mossel |
| 2024 | STOC | Influences in Mixing Measures. | Frederic Koehler, Noam Lifshitz, Dor Minzer, Elchanan Mossel |
| 2023 | COLT | Sharp thresholds in inference of planted subgraphs. | Elchanan Mossel, Jonathan Niles-Weed, Youngtak Sohn, Nike Sun, Ilias Zadik |
| 2023 | ICML | A Mathematical Model for Curriculum Learning for Parities. | Elisabetta Cornacchia, Elchanan Mossel |
| 2023 | SODA | Almost-Linear Planted Cliques Elude the Metropolis Process. | Zongchen Chen, Elchanan Mossel, Ilias Zadik |
| 2023 | STOC | Exact Phase Transitions for Stochastic Block Models and Reconstruction on Trees. | Elchanan Mossel, Allan Sly, Youngtak Sohn |
| 2022 | SODA | Spectral recovery of binary censored block models. | Souvik Dhara, Julia Gaudio, Elchanan Mossel, Colin Sandon |
| 2022 | STOC | Approximate polymorphisms. | Gilad Chase, Yuval Filmus, Dor Minzer, Elchanan Mossel, Nitin Saurabh |
| 2021 | COLT | Learning to Sample from Censored Markov Random Fields. | Ankur Moitra, Elchanan Mossel, Colin Sandon |
| 2021 | ISIT | Reconstruction on 2D Regular Grids. | Anuran Makur, Elchanan Mossel, Yury Polyanskiy |
| 2021 | STOC | Robust testing of low dimensional functions. | Anindya De, Elchanan Mossel, Joe Neeman |
| 2020 | COLT | Parallels Between Phase Transitions and Circuit Complexity? | Ankur Moitra, Elchanan Mossel, Colin Sandon |
| 2020 | STOC | AND testing and robust judgement aggregation. | Yuval Filmus, Noam Lifshitz, Dor Minzer, Elchanan Mossel |
| 2019 | COLT | Is your function low dimensional? | Anindya De, Elchanan Mossel, Joe Neeman |
| 2019 | COLT | Reasoning in Bayesian Opinion Exchange Networks Is PSPACE-Hard. | Jan Hazla, Ali Jadbabaie, Elchanan Mossel, M. Amin Rahimian |
| 2019 | COLT | Accuracy-Memory Tradeoffs and Phase Transitions in Belief Propagation. | Vishesh Jain, Frederic Koehler, Jingbo Liu, Elchanan Mossel |
| 2019 | EC | Seeding with Costly Network Information. | Dean Eckles, Hossein Esfandiari, Elchanan Mossel, M. Amin Rahimian |
| 2019 | FOCS | Junta Correlation is Testable. | Anindya De, Elchanan Mossel, Joe Neeman |
| 2019 | ISIT | Broadcasting on Random Networks. | Anuran Makur, Elchanan Mossel, Yury Polyanskiy |
| 2019 | RECOMB | How Many Subpopulations Is Too Many? Exponential Lower Bounds for Inferring Population Histories. | Younhun Kim, Frederic Koehler, Ankur Moitra, Elchanan Mossel, Govind Ramnarayan |
| 2019 | SODA | Seeded Graph Matching via Large Neighborhood Statistics. | Elchanan Mossel, Jiaming Xu |
| 2018 | COLT | The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity. | Vishesh Jain, Frederic Koehler, Elchanan Mossel |
| 2018 | COLT | The Vertex Sample Complexity of Free Energy is Polynomial. | Vishesh Jain, Frederic Koehler, Elchanan Mossel |
| 2018 | SODA | Non interactive simulation of correlated distributions is decidable. | Anindya De, Elchanan Mossel, Joe Neeman |
| 2016 | COLT | Density Evolution in the Degree-correlated Stochastic Block Model. | Elchanan Mossel, Jiaming Xu |
| 2016 | ISIT | Sequence assembly from corrupted shotgun reads. | Shirshendu Ganguly, Elchanan Mossel, Mikls Z. Rcz |
| 2015 | COLT | MCMC Learning. | Varun Kanade, Elchanan Mossel |
| 2015 | STOC | Consistency Thresholds for the Planted Bisection Model. | Elchanan Mossel, Joe Neeman, Allan Sly |
| 2014 | COLT | Belief propagation, robust reconstruction and optimal recovery of block models. | Elchanan Mossel, Joe Neeman, Allan Sly |
| 2013 | STOC | Majority is stablest: discrete and SoS. | Anindya De, Elchanan Mossel, Joe Neeman |
| 2012 | STOC | A quantitative gibbard-satterthwaite theorem without neutrality. | Elchanan Mossel, Mikls Z. Rcz |
| 2010 | FOCS | The Geometry of Manipulation: A Quantitative Proof of the Gibbard-Satterthwaite Theorem. | Marcus Isaksson, Guy Kindler, Elchanan Mossel |
| 2010 | SODA | Inapproximability for VCG-Based Combinatorial Auctions. | David Buchfuhrer, Shaddin Dughmi, Hu Fu, Robert Kleinberg, Elchanan Mossel, Christos H. Papadimitriou, Michael Schapira, Yaron Singer, Christopher Umans |
| 2010 | SAGT | Truthful Fair Division. | Elchanan Mossel, Omer Tamuz |
| 2009 | RECOMB | Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep. | Constantinos Daskalakis, Elchanan Mossel, Sbastien Roch |
| 2009 | SODA | Sorting and selection in posets. | Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha J. Riesenfeld, Elad Verbin |
| 2008 | FOCS | Gaussian Bounds for Noise Correlation of Functions and Tight Analysis of Long Codes. | Elchanan Mossel |
| 2008 | ISIT | Smooth compression, Gallager bound and nonlinear sparse-graph codes. | Andrea Montanari, Elchanan Mossel |
| 2008 | SODA | Noisy sorting without resampling. | Mark Braverman, Elchanan Mossel |
| 2008 | SODA | Rapid mixing of Gibbs sampling on graphs that are sparse on average. | Elchanan Mossel, Allan Sly |
| 2007 | STOC | On the submodularity of influence in social networks. | Elchanan Mossel, Sbastien Roch |
| 2006 | FOCS | The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels. | Christian Borgs, Jennifer T. Chayes, Elchanan Mossel, Sbastien Roch |
| 2006 | RECOMB | Maximal Accurate Forests from Distance Matrices. | Constantinos Daskalakis, Cameron Hill, Alexander Jaffe, Radu Mihaescu, Elchanan Mossel, Satish Rao |
| 2006 | STOC | Optimal phylogenetic reconstruction. | Constantinos Daskalakis, Elchanan Mossel, Sbastien Roch |
| 2006 | STOC | Conditional hardness for approximate coloring. | Irit Dinur, Elchanan Mossel, Oded Regev |
| 2005 | FOCS | Noise stability of functions with low in.uences invariance and optimality. | Elchanan Mossel, Ryan O'Donnell, Krzysztof Oleszkiewicz |
| 2005 | SODA | Online conflict-free coloring for intervals. | Amos Fiat, Meital Levy, Jir Matousek, Elchanan Mossel, Jnos Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl |
| 2005 | SODA | A new look at survey propagation and its generalizations. | Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright |
| 2005 | STOC | Learning nonsingular phylogenies and hidden Markov models. | Elchanan Mossel, Sbastien Roch |
| 2004 | FOCS | Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs? | Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell |
| 2004 | FOCS | Shuffling by Semi-Random Transpositions. | Elchanan Mossel, Yuval Peres, Alistair Sinclair |
| 2003 | FOCS | Learning DNF from Random Walks. | Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio |
| 2003 | FOCS | On e-Biased Generators in NC0. | Elchanan Mossel, Amir Shpilka, Luca Trevisan |
| 2003 | STOC | Learning juntas. | Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio |
| 2001 | FOCS | Glauber Dynamics on Trees and Hyperbolic Graphs. | Claire Kenyon, Elchanan Mossel, Yuval Peres |