Elchanan Mossel

Computational Theory and Mathematics · 2001–2017

A researcher in the Science corpus: 17 papers; trusts 50 researchers and is trusted by 29 researchers here, as inferred from the citation graph.

Subfields

Computational Theory and Mathematics — 31 citations into it; #2,355 of 12,182 by trust here, #1,157 by citations
Statistical and Nonlinear Physics — 25 citations into it; #9,576 of 10,127 by trust here, #3,735 by citations
Computer Networks and Communications — 21 citations into it; #7,779 of 9,886 by trust here, #4,950 by citations
Artificial Intelligence — 19 citations into it; #11,510 of 35,345 by trust here, #13,760 by citations
Mathematical Physics — 16 citations into it; #5,477 of 8,562 by trust here, #4,785 by citations
Statistics and Probability — 16 citations into it; #2,927 of 12,932 by trust here, #4,132 by citations
Geometry and Topology — 15 citations into it; #3,510 of 7,422 by trust here, #3,077 by citations
Applied Mathematics — 11 citations into it; #6,467 of 7,620 by trust here, #4,749 by citations

Whom Elchanan Mossel trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

Who trusts Elchanan Mossel overall

Papers from Elchanan Mossel's perspective

Ordered by how strongly the researchers Elchanan Mossel trusts endorse each paper. Same corpus, a different order for every researcher.

Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper
Some optimal inapproximability results
On the power of unique 2-prover 1-round games (Proceedings 17th IEEE Annual Conference on Computational Complexity)
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Normalized cuts and image segmentation
Reducibility Among Combinatorial Problems
The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into l/sub 1/ (IEEE Annual Symposium on Foundations of Computer Science)
Noise Stability of Functions with Low Influences: Invariance and Optimality II - The Non Reversible Case
Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? (45th Annual IEEE Symposium on Foundations of Computer Science)
Adam: A Method for Stochastic Optimization (International Conference on Learning Representations)

Their papers

A new look at survey propagation and its generalizations (2004) — 166 citations
Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? (2004) — 885 citations
A Proof of the Block Model Threshold Conjecture (2013) — 356 citations
Gaussian Bounds for Noise Correlation of Functions (2007) — 153 citations
Non interactive simulation of correlated distributions is decidable (2017) — 29 citations
A quantitative Arrow theorem (2009) — 55 citations
On Reverse Hypercontractivity (2011) — 94 citations
Phase transitions in phylogeny (2003) — 98 citations
Robust dimension free isoperimetry in Gaussian space (2012) — 54 citations
On approximately fair allocations of indivisible goods (2004) — 738 citations
Information flow on trees (2001) — 145 citations
Spectral redemption in clustering sparse networks (2013) — 660 citations
Reconstruction and estimation in the planted partition model (2012) — 388 citations
Robust Optimality of Gaussian Noise Stability (2012) — 62 citations
VC bounds on the cardinality of nearly orthogonal function classes (2010) — 12 citations
Noise Stability of Functions with Low Influences: Invariance and Optimality II - The Non Reversible Case (2007) — 307 citations
Robust reconstruction on trees is determined by the second eigenvalue (2004) — 86 citations