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

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

Testing surface area with arbitrary accuracy. - Joe Neeman (STOC, 2014)

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

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

Non-Reconstructability in the Stochastic Block Model. - Joe Neeman; Praneeth Netrapalli (CoRR, 2014)

A law of large numbers for weighted plurality. - Joe Neeman (Soc. Choice Welf., 2014)

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

Preference Completion: Large-scale Collaborative Ranking from Pairwise Comparisons. - Dohyung Park; Joe Neeman; Jin Zhang; Sujay Sanghavi; Inderjit S. Dhillon (ICML, 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)

Information-theoretic thresholds for community detection in sparse networks. - Jess Banks; Cristopher Moore; Joe Neeman; Praneeth Netrapalli (COLT, 2016)

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

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

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

The Search Problem in Mixture Models. - Avik Ray; Joe Neeman; Sujay Sanghavi; Sanjay Shakkottai (J. Mach. Learn. Res., 2017)

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)

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

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

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

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

Finding cliques using few probes. - Uriel Feige; David Gamarnik; Joe Neeman; Miklós Z. Rácz; Prasad Tetali (Random Struct. Algorithms, 2020)

Unique Games hardness of Quantum Max-Cut, and a vector-valued Borell's inequality. - Yeongwoo Hwang; Joe Neeman; Ojas Parekh; Kevin Thompson 007; John Wright 004 (CoRR, 2021)

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

Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality. - Yeongwoo Hwang; Joe Neeman; Ojas Parekh; Kevin Thompson 007; John Wright 004 (SODA, 2023)

Moderate deviations in cycle count. - Joe Neeman; Charles Radin; Lorenzo Sadun (Random Struct. Algorithms, 2023)