Recursive reconstruction on periodic trees. - Elchanan Mossel (Random Struct. Algorithms, 1998)

On Random Graph Homomorphisms into Z. - Itai Benjamini; Olle Häggström; Elchanan Mossel (J. Comb. Theory B, 2000)

Percolation in a dependent random environment. - Johan Jonasson; Elchanan Mossel; Yuval Peres (Random Struct. Algorithms, 2000)

Survey: Information Flow on Trees. - Elchanan Mossel (Graphs, Morphisms and Statistical Physics, 2001)

Glauber Dynamics on Trees and Hyperbolic Graphs. - Claire Kenyon; Elchanan Mossel; Yuval Peres (FOCS, 2001)

The Minesweeper Game: Percolation And Complexity. - Elchanan Mossel (Comb. Probab. Comput., 2002)

On the complexity of approximating the VC dimension. - Elchanan Mossel; Christopher Umans (J. Comput. Syst. Sci., 2002)

On e-Biased Generators in NC0. - Elchanan Mossel; Amir Shpilka; Luca Trevisan 001 (FOCS, 2003)

Learning juntas. - Elchanan Mossel; Ryan O'Donnell; Rocco A. Servedio (STOC, 2003)

On epsilon-Biased Generators in NC0 - Elchanan Mossel; Amir Shpilka; Luca Trevisan 001 (Electron. Colloquium Comput. Complex., 2003)

On the Impossibility of Reconstructing Ancestral Data and Phylogenies. - Elchanan Mossel (J. Comput. Biol., 2003)

On the noise sensitivity of monotone functions. - Elchanan Mossel; Ryan O'Donnell (Random Struct. Algorithms, 2003)

Shuffling by Semi-Random Transpositions. - Elchanan Mossel; Yuval Peres; Alistair Sinclair (FOCS, 2004)

On approximately fair allocations of indivisible goods. - Richard J. Lipton; Evangelos Markakis; Elchanan Mossel; Amin Saberi (EC, 2004)

Learning functions of k relevant variables. - Elchanan Mossel; Ryan O'Donnell; Rocco A. Servedio (J. Comput. Syst. Sci., 2004)

Noise stability of functions with low in.uences invariance and optimality. - Elchanan Mossel; Ryan O'Donnell; Krzysztof Oleszkiewicz (FOCS, 2005)

Online conflict-free coloring for intervals. - Amos Fiat; Meital Levy; Jirí Matousek 001; Elchanan Mossel; János Pach; Micha Sharir; Shakhar Smorodinsky; Uli Wagner 001; Emo Welzl (SODA, 2005)

Learning nonsingular phylogenies and hidden Markov models. - Elchanan Mossel; Sébastien Roch (STOC, 2005)

New Coins From Old: Computing With Unknown Bias. - Elchanan Mossel; Yuval Peres (Comb., 2005)

Evolutionary Trees and the Ising Model on the Bethe Lattice: a Proof of Steel's Conjecture. - Constantinos Daskalakis; Elchanan Mossel; Sebastien Roch (CoRR, 2005)

Noise stability of functions with low influences: invariance and optimality - Elchanan Mossel; Ryan O'Donnell; Krzysztof Oleszkiewicz (CoRR, 2005)

Learning DNF from random walks. - Nader H. Bshouty; Elchanan Mossel; Ryan O'Donnell; Rocco A. Servedio (J. Comput. Syst. Sci., 2005)

Coin flipping from a cosmic source: On error correction of truly random bits. - Elchanan Mossel; Ryan O'Donnell (Random Struct. Algorithms, 2005)

The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels. - Christian Borgs; Jennifer T. Chayes; Elchanan Mossel; Sébastien Roch (FOCS, 2006)

Maximal Accurate Forests from Distance Matrices. - Constantinos Daskalakis; Cameron Hill; Alexander Jaffe; Radu Mihaescu; Elchanan Mossel; Satish Rao (RECOMB, 2006)

Optimal phylogenetic reconstruction. - Constantinos Daskalakis; Elchanan Mossel; Sébastien Roch (STOC, 2006)

A law of large numbers for weighted majority. - Olle Häggström; Gil Kalai; Elchanan Mossel (Adv. Appl. Math., 2006)

On epsilon-biased generators in NC0. - Elchanan Mossel; Amir Shpilka; Luca Trevisan 001 (Random Struct. Algorithms, 2006)

How much can evolved characters tell us about the tree that generated them? - Elchanan Mossel; Mike A. Steel (Mathematics of Evolution and Phylogeny, 2007)

On the submodularity of influence in social networks. - Elchanan Mossel; Sébastien Roch (STOC, 2007)

A Spectral Approach to Analyzing Belief Propagation for 3-Coloring - Amin Coja-Oghlan; Elchanan Mossel; Dan Vilenchik (CoRR, 2007)

Reconstruction of Markov Random Fields from Samples: Some Easy Observations and Algorithms - Guy Bresler; Elchanan Mossel; Allan Sly (CoRR, 2007)

Connectivity and Equilibrium in Random Games - Constantinos Daskalakis; Alexandros G. Dimakis; Elchanan Mossel (CoRR, 2007)

A new look at survey propagation and its generalizations. - Elitza N. Maneva; Elchanan Mossel; Martin J. Wainwright (J. ACM, 2007)

Slow emergence of cooperation for win-stay lose-shift on trees. - Elchanan Mossel; Sébastien Roch (Mach. Learn., 2007)

Online Conflict-Free Coloring for Intervals. - Ke Chen 006; Amos Fiat; Haim Kaplan; Meital Levy; Jirí Matousek 001; Elchanan Mossel; János Pach; Micha Sharir; Shakhar Smorodinsky; Uli Wagner 001; Emo Welzl (SIAM J. Comput., 2007)

Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?. - Subhash Khot; Guy Kindler; Elchanan Mossel; Ryan O'Donnell (SIAM J. Comput., 2007)

Distorted Metrics on Trees and Phylogenetic Forests. - Elchanan Mossel (IEEE ACM Trans. Comput. Biol. Bioinform., 2007)

The Complexity of Distinguishing Markov Random Fields. - Andrej Bogdanov; Elchanan Mossel; Salil P. Vadhan (APPROX-RANDOM, 2008)

Gaussian Bounds for Noise Correlation of Functions and Tight Analysis of Long Codes. - Elchanan Mossel (FOCS, 2008)

Smooth compression, Gallager bound and nonlinear sparse-graph codes. - Andrea Montanari; Elchanan Mossel (ISIT, 2008)

Noisy sorting without resampling. - Mark Braverman; Elchanan Mossel (SODA, 2008)

Multiple Random Oracles Are Better Than One - Jan Arpe; Elchanan Mossel (CoRR, 2008)

Agnostically Learning Juntas from Random Walks - Jan Arpe; Elchanan Mossel (CoRR, 2008)

Approximation Resistant Predicates from Pairwise Independence. - Per Austrin; Elchanan Mossel (Comput. Complex., 2009)

Arrow's Impossibility Theorem Without Unanimity - Elchanan Mossel (CoRR, 2009)

VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension - Elchanan Mossel; Christos H. Papadimitriou; Michael Schapira; Yaron Singer (CoRR, 2009)

Sorting from Noisy Information - Mark Braverman; Elchanan Mossel (CoRR, 2009)

A Spectral Approach to Analysing Belief Propagation for 3-Colouring. - Amin Coja-Oghlan; Elchanan Mossel; Dan Vilenchik (Comb. Probab. Comput., 2009)

Rapid mixing of Gibbs sampling on graphs that are sparse on average. - Elchanan Mossel; Allan Sly (Random Struct. Algorithms, 2009)

Conditional Hardness for Approximate Coloring. - Irit Dinur; Elchanan Mossel; Oded Regev 001 (SIAM J. Comput., 2009)

Shrinkage Effect in Ancestral Maximum Likelihood. - Elchanan Mossel; Sébastien Roch; Mike A. Steel (IEEE ACM Trans. Comput. Biol. Bioinform., 2009)

Reaching Consensus on Social Networks. - Elchanan Mossel; Grant Schoenebeck (ICS, 2010)

Truthful Fair Division. - Elchanan Mossel; Omer Tamuz (SAGT, 2010)

Inapproximability for VCG-Based Combinatorial Auctions. - David Buchfuhrer; Shaddin Dughmi; Hu Fu 001; Robert Kleinberg; Elchanan Mossel; Christos H. Papadimitriou; Michael Schapira; Yaron Singer; Christopher Umans (SODA, 2010)

Iterative maximum likelihood on networks. - Elchanan Mossel; Omer Tamuz (Adv. Appl. Math., 2010)

On the inference of large phylogenies with long branches: How long is too long? - Elchanan Mossel; Sebastien Roch; Allan Sly (CoRR, 2010)

Efficient Bayesian Learning in Social Networks with Gaussian Estimators - Elchanan Mossel; Omer Tamuz (CoRR, 2010)

The Computational Complexity of Estimating Convergence Time - Nayantara Bhatnagar; Andrej Bogdanov; Elchanan Mossel (CoRR, 2010)

Application of a Generalization of Russo's Formula to Learning from Multiple Random Oracles. - Jan Arpe; Elchanan Mossel (Comb. Probab. Comput., 2010)

Submodularity of Influence in Social Networks: From Local to Global. - Elchanan Mossel; Sébastien Roch (SIAM J. Comput., 2010)

Incomplete Lineage Sorting: Consistent Phylogeny Estimation from Multiple Loci. - Elchanan Mossel; Sébastien Roch (IEEE ACM Trans. Comput. Biol. Bioinform., 2010)

The Computational Complexity of Estimating MCMC Convergence Time. - Nayantara Bhatnagar; Andrej Bogdanov; Elchanan Mossel (APPROX-RANDOM, 2011)

Identifiability and inference of non-parametric rates-across-sites models on large-scale phylogenies. - Elchanan Mossel; Sebastien Roch (CoRR, 2011)

Phylogenetic mixtures: Concentration of measure in the large-tree limit. - Elchanan Mossel; Sebastien Roch (CoRR, 2011)

Sorting and Selection in Posets. - Constantinos Daskalakis; Richard M. Karp; Elchanan Mossel; Samantha J. Riesenfeld; Elad Verbin (SIAM J. Comput., 2011)

Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep. - Constantinos Daskalakis; Elchanan Mossel; Sébastien Roch (SIAM J. Discret. Math., 2011)

Co-evolution Is Incompatible with the Markov Assumption in Phylogenetics. - Tamir Tuller; Elchanan Mossel (IEEE ACM Trans. Comput. Biol. Bioinform., 2011)

On Extracting Common Random Bits From Correlated Sources. - Andrej Bogdanov; Elchanan Mossel (IEEE Trans. Inf. Theory, 2011)

The geometry of manipulation - A quantitative proof of the Gibbard-Satterthwaite theorem. - Marcus Isaksson; Guy Kindler; Elchanan Mossel (Comb., 2012)

Bundling Customers: How to Exploit Trust Among Customers to Maximize Seller Profit - Elchanan Mossel; Omer Tamuz (CoRR, 2012)

Strategic Learning and the Topology of Social Networks - Elchanan Mossel; Allan Sly; Omer Tamuz (CoRR, 2012)

VC bounds on the cardinality of nearly orthogonal function classes. - Lee-Ad Gottlieb; Aryeh Kontorovich; Elchanan Mossel (Discret. Math., 2012)

A note on the Entropy/Influence conjecture. - Nathan Keller; Elchanan Mossel; Tomer Schlank (Discret. Math., 2012)

Explicit Optimal hardness via Gaussian stability results. - Anindya De; Elchanan Mossel (Electron. Colloquium Comput. Complex., 2012)

Complete characterization of functions satisfying the conditions of Arrow's theorem. - Elchanan Mossel; Omer Tamuz (Soc. Choice Welf., 2012)

Election manipulation: the average case. - Elchanan Mossel; Miklós Z. Rácz (SIGecom Exch., 2012)

Spectral redemption: clustering sparse networks. - Florent Krzakala; Cristopher Moore; Elchanan Mossel; Joe Neeman; Allan Sly; Lenka Zdeborová; Pan Zhang (CoRR, 2013)

Computation in anonymous networks. - Elchanan Mossel; Anupam Prakash; Gregory Valiant (CoRR, 2013)

A Smooth Transition from Powerlessness to Absolute Power. - Elchanan Mossel; Ariel D. Procaccia; Miklós Z. Rácz (J. Artif. Intell. Res., 2013)

Scaling Limits for Width Two Partially Ordered Sets: The Incomparability Window. - Nayantara Bhatnagar; Nick Crawford; Elchanan Mossel; Arnab Sen (Order, 2013)

Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms. - Guy Bresler; Elchanan Mossel; Allan Sly (SIAM J. Comput., 2013)

Making Consensus Tractable. - Elchanan Mossel; Omer Tamuz (ACM Trans. Economics and Comput., 2013)

Robust Estimation of Latent Tree Graphical Models: Inferring Hidden States With Inexact Parameters. - Elchanan Mossel; Sébastien Roch; Allan Sly (IEEE Trans. Inf. Theory, 2013)

Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. - Uriel Feige; Elchanan Mossel; Dan Vilenchik (Theory Comput., 2013)

Special Issue on Analysis of Boolean Functions: Guest Editors' Foreword. - Elchanan Mossel; Ryan O'Donnell (Theory Comput., 2013)

Belief propagation, robust reconstruction and optimal recovery of block models. - Elchanan Mossel; Joe Neeman; Allan Sly (COLT, 2014)

Majority dynamics and aggregation of information in social networks. - Elchanan Mossel; Joe Neeman; Omer Tamuz (Auton. Agents Multi Agent Syst., 2014)

From trees to seeds: on the inference of the seed from large trees in the uniform attachment model. - Sébastien Bubeck; Ronen Eldan; Elchanan Mossel; Miklós Z. Rácz (CoRR, 2014)

On the Speed of Social Learning. - Matan Harel; Elchanan Mossel; Philipp Strack; Omer Tamuz (CoRR, 2014)

Strong Contraction and Influences in Tail Spaces. - Steven Heilman; Elchanan Mossel; Krzysztof Oleszkiewicz (CoRR, 2014)

Consistency Thresholds for Binary Symmetric Block Models. - Elchanan Mossel; Joe Neeman; Allan Sly (CoRR, 2014)

Opinion Exchange Dynamics. - Elchanan Mossel; Omer Tamuz (CoRR, 2014)

On Extracting Common Random Bits From Correlated Sources on Large Alphabets. - Siu On Chan; Elchanan Mossel; Joe Neeman (IEEE Trans. Inf. Theory, 2014)

Distance-based Species Tree Estimation: Information-Theoretic Trade-off between Number of Loci and Sequence Length under the Coalescent. - Elchanan Mossel; Sébastien Roch (APPROX-RANDOM, 2015)

MCMC Learning. - Varun Kanade; Elchanan Mossel (COLT, 2015)

Standard Simplices and Pluralities are Not the Most Noise Stable. - Steven Heilman; Elchanan Mossel; Joe Neeman (ITCS, 2015)

Consistency Thresholds for the Planted Bisection Model. - Elchanan Mossel; Joe Neeman; Allan Sly (STOC, 2015)

A quantitative Gibbard-Satterthwaite theorem without neutrality. - Elchanan Mossel; Miklós Z. Rácz (Comb., 2015)

Corruption Detection on Networks. - Noga Alon; Elchanan Mossel; Robin Pemantle (CoRR, 2015)

Sharp Thresholds for Monotone Non-Boolean Functions and Social Choice Theory. - Gil Kalai; Elchanan Mossel (Math. Oper. Res., 2015)

On the Influence of the Seed Graph in the Preferential Attachment Model. - Sébastien Bubeck; Elchanan Mossel; Miklós Z. Rácz (IEEE Trans. Netw. Sci. Eng., 2015)

Efficient Bayesian Learning in Social Networks with Gaussian Estimators. - Elchanan Mossel; Noah Olsman; Omer Tamuz (Allerton, 2016)

Lower Bounds on Same-Set Inner Product in Correlated Spaces. - Jan Hazla; Thomas Holenstein; Elchanan Mossel (APPROX-RANDOM, 2016)

Harmonicity and Invariance on Slices of the Boolean Cube. - Yuval Filmus; Elchanan Mossel (CCC, 2016)

Density Evolution in the Degree-correlated Stochastic Block Model. - Elchanan Mossel; Jiaming Xu 002 (COLT, 2016)

Local Algorithms for Block Models with Side Information. - Elchanan Mossel; Jiaming Xu 002 (ITCS, 2016)

Sequence assembly from corrupted shotgun reads. - Shirshendu Ganguly; Elchanan Mossel; Miklós Z. Rácz (ISIT, 2016)

Linear Sketching over $ mathbb F_2$. - Sampath Kannan; Elchanan Mossel; Grigory Yaroslavtsev (CoRR, 2016)

Deep Learning and Hierarchal Generative Models. - Elchanan Mossel (CoRR, 2016)

Noise Stability and Correlation with Half Spaces. - Elchanan Mossel; Joe Neeman (CoRR, 2016)

Coexistence in Preferential Attachment Networks. - Tonci Antunovic; Elchanan Mossel; Miklós Z. Rácz (Comb. Probab. Comput., 2016)

Linear Sketching over 𝔽2. - Elchanan Mossel; Sampath Kannan; Grigory Yaroslavtsev (Electron. Colloquium Comput. Complex., 2016)

On the correlation of increasing families. - Gil Kalai; Nathan Keller; Elchanan Mossel (J. Comb. Theory A, 2016)

Quickest online selection of an increasing subsequence of specified size. - Alessandro Arlotto; Elchanan Mossel; J. Michael Steele (Random Struct. Algorithms, 2016)

Global and Local Information in Clustering Labeled Block Models. - Varun Kanade; Elchanan Mossel; Tselil Schramm (IEEE Trans. Inf. Theory, 2016)

Majority is Stablest: Discrete and SoS. - Anindya De; Elchanan Mossel; Joe Neeman (Theory Comput., 2016)

Complexity of Bayesian belief exchange over a network. - M. Amin Rahimian; Ali Jadbabaie; Elchanan Mossel (CDC, 2017)

Coalescent-based species tree estimation: a stochastic Farris transform. - Gautam Dasarathy; Elchanan Mossel; Robert D. Nowak; Sebastien Roch (CoRR, 2017)

Noise Stability is computable and low dimensional. - Anindya De; Elchanan Mossel; Joe Neeman (CoRR, 2017)

Bayesian Group Decisions: Algorithms and Complexity. - Ali Jadbabaie; Elchanan Mossel; M. Amin Rahimian (CoRR, 2017)

Approximating Partition Functions in Constant Time. - Vishesh Jain; Frederic Koehler; Elchanan Mossel (CoRR, 2017)

Competing first passage percolation on random regular graphs. - Tonci Antunovic; Yael Dekel; Elchanan Mossel; Yuval Peres (Random Struct. Algorithms, 2017)

Linear Sketching over F_2. - Sampath Kannan; Elchanan Mossel; Swagato Sanyal; Grigory Yaroslavtsev (CCC, 2018)

The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity. - Vishesh Jain; Frederic Koehler; Elchanan Mossel (COLT, 2018)

The Vertex Sample Complexity of Free Energy is Polynomial. - Vishesh Jain; Frederic Koehler; Elchanan Mossel (COLT, 2018)

Contextual Stochastic Block Models. - Yash Deshpande; Subhabrata Sen; Andrea Montanari; Elchanan Mossel (NeurIPS, 2018)

Social Learning Equilibria. - Elchanan Mossel; Manuel Mueller-Frank; Allan Sly; Omer Tamuz (EC, 2018)

Non interactive simulation of correlated distributions is decidable. - Anindya De; Elchanan Mossel; Joe Neeman (SODA, 2018)

A Proof of the Block Model Threshold Conjecture. - Elchanan Mossel; Joe Neeman; Allan Sly (Comb., 2018)

Broadcasting on Bounded Degree DAGs. - Anuran Makur; Elchanan Mossel; Yury Polyanskiy (CoRR, 2018)

Learning Restricted Boltzmann Machines via Influence Maximization. - Guy Bresler; Frederic Koehler; Ankur Moitra; Elchanan Mossel (CoRR, 2018)

Is your data low-dimensional? - Anindya De; Elchanan Mossel; Joe Neeman (CoRR, 2018)

Long ties accelerate noisy threshold-based contagions. - Dean Eckles; Elchanan Mossel; M. Amin Rahimian; Subhabrata Sen (CoRR, 2018)

Invariance Principle on the Slice. - Yuval Filmus; Guy Kindler; Elchanan Mossel; Karl Wimmer (ACM Trans. Comput. Theory, 2018)

Is your function low dimensional? - Anindya De; Elchanan Mossel; Joe Neeman (COLT, 2019)

Reasoning in Bayesian Opinion Exchange Networks Is PSPACE-Hard. - Jan Hazla; Ali Jadbabaie; Elchanan Mossel; M. Amin Rahimian (COLT, 2019)

Accuracy-Memory Tradeoffs and Phase Transitions in Belief Propagation. - Vishesh Jain; Frederic Koehler; Jingbo Liu; Elchanan Mossel (COLT, 2019)

Junta Correlation is Testable. - Anindya De; Elchanan Mossel; Joe Neeman (FOCS, 2019)

Being Corrupt Requires Being Clever, But Detecting Corruption Doesn't. - Yan Jin; Elchanan Mossel; Govind Ramnarayan (ITCS, 2019)

Broadcasting on Random Networks. - Anuran Makur; Elchanan Mossel; Yury Polyanskiy (ISIT, 2019)

The Circuit Complexity of Inference. - Ankur Moitra; Elchanan Mossel; Colin Sandon (CoRR, 2019)

On the Impossibility of Learning the Missing Mass. - Elchanan Mossel; Mesrob I. Ohannessian (Entropy, 2019)

Shotgun Assembly of Labeled Graphs. - Elchanan Mossel; Nathan Ross (IEEE Trans. Netw. Sci. Eng., 2019)

Noise Stability is Computable and Approximately Low-Dimensional. - Anindya De; Elchanan Mossel; Joe Neeman (Theory Comput., 2019)

Parallels Between Phase Transitions and Circuit Complexity? - Ankur Moitra; Elchanan Mossel; Colin Sandon (COLT, 2020)

AND testing and robust judgement aggregation. - Yuval Filmus; Noam Lifshitz; Dor Minzer; Elchanan Mossel (STOC, 2020)

A Phase Transition in Arrow's Theorem. - Frederic Koehler; Elchanan Mossel (CoRR, 2020)

Efficient Reconstruction of Stochastic Pedigrees. - Younhun Kim; Elchanan Mossel; Govind Ramnarayan; Paxton Turner (CoRR, 2020)

How Many Subpopulations Is Too Many? Exponential Lower Bounds for Inferring Population Histories. - Younhun Kim; Frederic Koehler; Ankur Moitra; Elchanan Mossel; Govind Ramnarayan (J. Comput. Biol., 2020)

Seeded graph matching via large neighborhood statistics. - Elchanan Mossel; Jiaming Xu 002 (Random Struct. Algorithms, 2020)

Broadcasting on Random Directed Acyclic Graphs. - Anuran Makur; Elchanan Mossel; Yury Polyanskiy (IEEE Trans. Inf. Theory, 2020)

Distributed Corruption Detection in Networks. - Noga Alon; Elchanan Mossel; Robin Pemantle (Theory Comput., 2020)

Shotgun assembly of random jigsaw puzzles. - Charles Bordenave; Uriel Feige; Elchanan Mossel (Random Struct. Algorithms, 2020)

Learning to Sample from Censored Markov Random Fields. - Ankur Moitra; Elchanan Mossel; Colin Sandon (COLT, 2021)

Reconstruction on 2D Regular Grids. - Anuran Makur; Elchanan Mossel; Yury Polyanskiy (ISIT, 2021)

Opinion Dynamics under Social Pressure. - Ali Jadbabaie; Anuran Makur; Elchanan Mossel; Rabih Salhab (CoRR, 2021)

Spoofing Generalization: When Can't You Trust Proprietary Models? - Ankur Moitra; Elchanan Mossel; Colin Sandon (CoRR, 2021)

Information Spread with Error Correction. - Omri Ben-Eliezer; Elchanan Mossel; Madhu Sudan 001 (CoRR, 2021)

In Defense of Fluid Democracy. - Daniel Halpern 002; Joseph Y. Halpern; Ali Jadbabaie; Elchanan Mossel; Ariel D. Procaccia; Manon Revel (CoRR, 2021)

Robust testing of low-dimensional functions. - Anindya De; Elchanan Mossel; Joe Neeman (Electron. Colloquium Comput. Complex., 2021)

Bayesian Decision Making in Groups is Hard. - Jan Hazla; Ali Jadbabaie; Elchanan Mossel; M. Amin Rahimian (Oper. Res., 2021)

Reconstruction on Trees and Low-Degree Polynomials. - Frederic Koehler; Elchanan Mossel (NeurIPS, 2022)

Spectral recovery of binary censored block models. - Souvik Dhara; Julia Gaudio; Elchanan Mossel; Colin Sandon (SODA, 2022)

Approximate polymorphisms. - Gilad Chase; Yuval Filmus; Dor Minzer; Elchanan Mossel; Nitin Saurabh (STOC, 2022)

Regular Graphs with Many Triangles are Structured. - Pim van der Hoorn; Gabor Lippner; Elchanan Mossel (Electron. J. Comb., 2022)

Spectral Algorithms Optimally Recover (Censored) Planted Dense Subgraphs. - Souvik Dhara; Julia Gaudio; Elchanan Mossel; Colin Sandon (CoRR, 2022)

Efficient Reconstruction of Stochastic Pedigrees: Some Steps From Theory to Practice. - Elchanan Mossel; David Vulakh (CoRR, 2022)

On the Second Kahn-Kalai Conjecture. - Elchanan Mossel; Jonathan Niles-Weed; Nike Sun; Ilias Zadik (CoRR, 2022)

A second moment proof of the spread lemma. - Elchanan Mossel; Jonathan Niles-Weed; Nike Sun; Ilias Zadik (CoRR, 2022)

The Power of Two Matrices in Spectral Algorithms. - Souvik Dhara; Julia Gaudio; Elchanan Mossel; Colin Sandon (CoRR, 2022)

Seeding with Costly Network Information. - Dean Eckles; Hossein Esfandiari; Elchanan Mossel; M. Amin Rahimian (Oper. Res., 2022)

Broadcasting on Two-Dimensional Regular Grids. - Anuran Makur; Elchanan Mossel; Yury Polyanskiy (IEEE Trans. Inf. Theory, 2022)

Sharp thresholds in inference of planted subgraphs. - Elchanan Mossel; Jonathan Niles-Weed; Youngtak Sohn; Nike Sun; Ilias Zadik (COLT, 2023)

A Mathematical Model for Curriculum Learning for Parities. - Elisabetta Cornacchia; Elchanan Mossel (ICML, 2023)

Is This Correct? Let's Check! - Omri Ben-Eliezer; Dan Mikulincer; Elchanan Mossel; Madhu Sudan 001 (ITCS, 2023)

In Defense of Liquid Democracy. - Daniel Halpern 002; Joseph Y. Halpern; Ali Jadbabaie; Elchanan Mossel; Ariel D. Procaccia; Manon Revel (EC, 2023)

Exact Phase Transitions for Stochastic Block Models and Reconstruction on Trees. - Elchanan Mossel; Allan Sly; Youngtak Sohn (STOC, 2023)

A Mathematical Model for Curriculum Learning. - Elisabetta Cornacchia; Elchanan Mossel (CoRR, 2023)

Combinative Cumulative Knowledge Processes. - Anna M. Brandenberger; Cassandra Marcussen; Elchanan Mossel; Madhu Sudan 001 (CoRR, 2023)

Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique. - David Gamarnik; Elchanan Mossel; Ilias Zadik (CoRR, 2023)

Inference in Opinion Dynamics Under Social Pressure. - Ali Jadbabaie; Anuran Makur; Elchanan Mossel; Rabih Salhab (IEEE Trans. Autom. Control., 2023)

Errors are Robustly Tamed in Cumulative Knowledge Processes. - Anna M. Brandenberger; Cassandra Marcussen; Elchanan Mossel; Madhu Sudan 001 (COLT, 2024)

The power of an adversary in Glauber dynamics. - Byron Chin; Ankur Moitra; Elchanan Mossel; Colin Sandon (COLT, 2024)

Reconstructing the Geometry of Random Geometric Graphs (Extended Abstract). - Han Huang; Pakawut Jiradilok; Elchanan Mossel (COLT, 2024)

Finding Super-spreaders in Network Cascades. - Elchanan Mossel; Anirudh Sridhar (COLT, 2024)

Influence Maximization in Ising Models. - Zongchen Chen; Elchanan Mossel (ITCS, 2024)

Low Degree Hardness for Broadcasting on Trees. - Han Huang; Elchanan Mossel (NeurIPS, 2024)

A Unified Approach to Learning Ising Models: Beyond Independence and Bounded Width. - Jason Gaitonde; Elchanan Mossel (STOC, 2024)

Influences in Mixing Measures. - Frederic Koehler; Noam Lifshitz; Dor Minzer; Elchanan Mossel (STOC, 2024)

Reconstructing the Geometry of Random Geometric Graphs. - Han Huang; Pakawut Jiradilok; Elchanan Mossel (CoRR, 2024)

Gaussian Broadcast on Grids. - Pakawut Jiradilok; Elchanan Mossel (CoRR, 2024)

Sample-Efficient Linear Regression with Self-Selection Bias. - Jason Gaitonde; Elchanan Mossel (CoRR, 2024)

Efficiently Learning Markov Random Fields from Dynamics. - Jason Gaitonde; Ankur Moitra; Elchanan Mossel (CoRR, 2024)

Comparison Theorems for the Mixing Times of Systematic and Random Scan Dynamics. - Jason Gaitonde; Elchanan Mossel (CoRR, 2024)

Finding the root in random nearest neighbor trees. - Anna M. Brandenberger; Cassandra Marcussen; Elchanan Mossel; Madhu Sudan 001 (CoRR, 2024)

A Geometric Model of Opinion Polarization. - Jan Hazla; Yan Jin; Elchanan Mossel; Govind Ramnarayan (Math. Oper. Res., 2024)

The Power of Two Matrices in Spectral Algorithms for Community Recovery. - Souvik Dhara; Julia Gaudio; Elchanan Mossel; Colin Sandon (IEEE Trans. Inf. Theory, 2024)

Stochastic block models with many communities and the Kesten-Stigum bound - extended abstract. - Byron Chin; Elchanan Mossel; Youngtak Sohn; Alexander S. Wein (COLT, 2025)

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions. - Elisabetta Cornacchia; Dan Mikulincer; Elchanan Mossel (COLT, 2025)

Polynomial low degree hardness for Broadcasting on Trees (Extended Abstract). - Han Huang; Elchanan Mossel (COLT, 2025)

Bypassing the Noisy Parity Barrier: Learning Higher-Order Markov Random Fields from Dynamics. - Jason Gaitonde; Ankur Moitra; Elchanan Mossel (STOC, 2025)

Weak Recovery, Hypothesis Testing, and Mutual Information in Stochastic Block Models and Planted Factor Graphs. - Elchanan Mossel; Allan Sly; Youngtak Sohn (STOC, 2025)

A Bayesian Proof of the Spread Lemma. - Elchanan Mossel; Jonathan Niles-Weed; Nike Sun; Ilias Zadik (Random Struct. Algorithms, 2025)

Noise Sensitivity of Hierarchical Functions and Deep Learning Lower Bounds in General Product Measures. - Rupert Li; Elchanan Mossel (CoRR, 2025)

Stochastic block models with many communities and the Kesten-Stigum bound. - Byron Chin; Elchanan Mossel; Youngtak Sohn; Alexander S. Wein (CoRR, 2025)

Almost-Linear Planted Cliques Elude the Metropolis Process. - Zongchen Chen; Elchanan Mossel; Ilias Zadik (Random Struct. Algorithms, 2025)

Online Learning of Neural Networks. - Amit Daniely; Idan Mehalel; Elchanan Mossel (CoRR, 2025)

Better Models and Algorithms for Learning Ising Models from Dynamics. - Jason Gaitonde; Ankur Moitra; Elchanan Mossel (CoRR, 2025)

On Algorithmic Robustness of Corrupted Markov Chains. - Jason Gaitonde; Elchanan Mossel (CoRR, 2025)