Elchanan Mossel - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

2010

Application of a Generalization of Russo s Formula to Learning from Multiple Random OraclesJan Arpe, Elchanan Mossel. cpc, 19(2):183-199, 2010. [doi]

Inapproximability for VCG-Based Combinatorial AuctionsDavid Buchfuhrer, Shaddin Dughmi, Hu Fu, Robert Kleinberg, Elchanan Mossel, Christos H. Papadimitriou, Michael Schapira, Yaron Singer, Christopher Umans. soda 2010: 518-536 [doi]

The Geometry of Manipulation: A Quantitative Proof of the Gibbard-Satterthwaite TheoremMarcus Isaksson, Guy Kindler, Elchanan Mossel. focs 2010: 319-328 [doi]

Incomplete Lineage Sorting: Consistent Phylogeny Estimation from Multiple LociElchanan Mossel, SÃ©bastien Roch. tcbb, 7(1):166-171, 2010. [doi]

Truthful Fair DivisionElchanan Mossel, Omer Tamuz. sagt 2010: 288-299 [doi]

Reaching Consensus on Social NetworksElchanan Mossel, Grant Schoenebeck. innovations 2010: 214-229 [doi]

Submodularity of Influence in Social Networks: From Local to GlobalElchanan Mossel, Sébastien Roch. siamcomp, 39(6):2176-2188, 2010. [doi]

2009

Approximation Resistant Predicates from Pairwise IndependencePer Austrin, Elchanan Mossel. cc, 18(2):249-271, 2009. [doi]

A Spectral Approach to Analysing Belief Propagation for 3-ColouringAmin Coja-Oghlan, Elchanan Mossel, Dan Vilenchik. cpc, 18(6):881-912, 2009. [doi]

Sorting and selection in posetsConstantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld, Elad Verbin. soda 2009: 392-401 [doi]

Phylogenies without Branch Bounds: Contracting the Short, Pruning the DeepConstantinos Daskalakis, Elchanan Mossel, Sébastien Roch. recomb 2009: 451-465 [doi]

Conditional Hardness for Approximate ColoringIrit Dinur, Elchanan Mossel, Oded Regev. siamcomp, 39(3):843-873, 2009. [doi]

Shrinkage Effect in Ancestral Maximum LikelihoodElchanan Mossel, Sébastien Roch, Mike A. Steel. tcbb, 6(1):126-133, 2009. [doi]

Rapid mixing of Gibbs sampling on graphs that are sparse on averageElchanan Mossel, Allan Sly. rsa, 35(2):250-270, 2009. [doi]

2008

Approximation Resistant Predicates from Pairwise IndependencePer Austrin, Elchanan Mossel. coco 2008: 249-258 [doi]

Approximation Resistant Predicates From Pairwise IndependencePer Austrin, Elchanan Mossel. eccc, 15(009), 2008. [doi]

The Complexity of Distinguishing Markov Random FieldsAndrej Bogdanov, Elchanan Mossel, Salil P. Vadhan. approx 2008: 331-342 [doi]

Noisy sorting without resamplingMark Braverman, Elchanan Mossel. soda 2008: 268-276 [doi]

Reconstruction of Markov Random Fields from Samples: Some Observations and AlgorithmsGuy Bresler, Elchanan Mossel, Allan Sly. approx 2008: 343-356 [doi]

Rapid mixing of Gibbs sampling on graphs that are sparse on averageElchanan Mossel, Allan Sly. soda 2008: 238-247 [doi]

Gaussian Bounds for Noise Correlation of Functions and Tight Analysis of Long CodesElchanan Mossel. focs 2008: 156-165 [doi]

2007

Online Conflict-Free Coloring for IntervalsKe Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl. siamcomp, 36(5):1342-1359, 2007. [doi]

Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O Donnell. siamcomp, 37(1):319-357, 2007. [doi]

A new look at survey propagation and its generalizationsElitza N. Maneva, Elchanan Mossel, Martin J. Wainwright. JACM, 54(4), 2007. [doi]

Distorted Metrics on Trees and Phylogenetic ForestsElchanan Mossel. tcbb, 4(1):108-116, 2007. [doi]

Slow emergence of cooperation for win-stay lose-shift on treesElchanan Mossel, Sébastien Roch. ml, 67(1-2):7-22, 2007. [doi]

On the submodularity of influence in social networksElchanan Mossel, Sébastien Roch. stoc 2007: 128-134 [doi]

2006

The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary ChannelsChristian Borgs, Jennifer T. Chayes, Elchanan Mossel, Sébastien Roch. focs 2006: 518-530 [doi]

Maximal Accurate Forests from Distance MatricesConstantinos Daskalakis, Cameron Hill, Alexander Jaffe, Radu Mihaescu, Elchanan Mossel, Satish Rao. recomb 2006: 281-295 [doi]

Optimal phylogenetic reconstructionConstantinos Daskalakis, Elchanan Mossel, Sébastien Roch. stoc 2006: 159-168 [doi]

Conditional hardness for approximate coloringIrit Dinur, Elchanan Mossel, Oded Regev. stoc 2006: 344-353 [doi]

Complete Convergence of Message Passing Algorithms for Some Satisfiability ProblemsUriel Feige, Elchanan Mossel, Dan Vilenchik. approx 2006: 339-350 [doi]

On epsilon-biased generators in NC:::0:::Elchanan Mossel, Amir Shpilka, Luca Trevisan. rsa, 29(1):56-81, 2006. [doi]

2005

Learning DNF from random walksNader H. Bshouty, Elchanan Mossel, Ryan O Donnell, Rocco A. Servedio. jcss, 71(3):250-265, 2005. [doi]

Conditional Hardness for Approximate ColoringIrit Dinur, Elchanan Mossel, Oded Regev. eccc, (039), 2005. [doi]

Online conflict-free coloring for intervalsAmos Fiat, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl. soda 2005: 545-554 [doi]

Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?Guy Kindler, Ryan O Donnell, Subhash Khot, Elchanan Mossel. eccc, (101), 2005. [doi]

A new look at survey propagation and its generalizationsElitza N. Maneva, Elchanan Mossel, Martin J. Wainwright. soda 2005: 1089-1098 [doi]

Noise stability of functions with low in.uences invariance and optimalityElchanan Mossel, Ryan O Donnell, Krzysztof Oleszkiewicz. focs 2005: 21-30 [doi]

New Coins From Old: Computing With Unknown BiasElchanan Mossel, Yuval Peres. combinatorica, 25(6):707-724, 2005. [doi]

Learning nonsingular phylogenies and hidden Markov modelsElchanan Mossel, Sébastien Roch. stoc 2005: 366-375 [doi]

Coin flipping from a cosmic source: On error correction of truly random bitsElchanan Mossel, Ryan O Donnell. rsa, 26(4):418-436, 2005. [doi]

2004

2003

2002

The Minesweeper Game: Percolation And ComplexityElchanan Mossel. cpc, 11(5), 2002.

On the complexity of approximating the VC dimensionElchanan Mossel, Christopher Umans. jcss, 65(4):660-671, 2002. [doi]

2001

Glauber Dynamics on Trees and Hyperbolic GraphsClaire Kenyon, Elchanan Mossel, Yuval Peres. focs 2001: 568-578

On the Complexity of Approximating the VC DimensionElchanan Mossel, Christopher Umans. cocoon 2001: 220-225 [doi]

2000

On Random Graph Homomorphisms into ZItai Benjamini, Olle Häggström, Elchanan Mossel. JCT, 78(1):86-114, 2000. [doi]

Percolation in a dependent random environmentJohan Jonasson, Elchanan Mossel, Yuval Peres. rsa, 16(4):333-343, 2000.

1998

Recursive reconstruction on periodic treesElchanan Mossel. rsa, 13(1):81-97, 1998.