| 2009 |
|---|
| 60 | EE | Constantinos Daskalakis,
Richard M. Karp,
Elchanan Mossel,
Samantha Riesenfeld,
Elad Verbin:
Sorting and selection in posets.
SODA 2009: 392-401 |
| 59 | EE | Elchanan Mossel:
Arrow's Impossibility Theorem Without Unanimity
CoRR abs/0901.4727: (2009) |
| 58 | EE | Elchanan Mossel,
Sébastien Roch,
Mike A. Steel:
Shrinkage Effect in Ancestral Maximum Likelihood.
IEEE/ACM Trans. Comput. Biology Bioinform. 6(1): 126-133 (2009) |
| 2008 |
|---|
| 57 | EE | Andrej Bogdanov,
Elchanan Mossel,
Salil P. Vadhan:
The Complexity of Distinguishing Markov Random Fields.
APPROX-RANDOM 2008: 331-342 |
| 56 | EE | Guy Bresler,
Elchanan Mossel,
Allan Sly:
Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms.
APPROX-RANDOM 2008: 343-356 |
| 55 | EE | Elchanan Mossel:
Gaussian Bounds for Noise Correlation of Functions and Tight Analysis of Long Codes.
FOCS 2008: 156-165 |
| 54 | EE | Per Austrin,
Elchanan Mossel:
Approximation Resistant Predicates from Pairwise Independence.
IEEE Conference on Computational Complexity 2008: 249-258 |
| 53 | EE | Elchanan Mossel,
Allan Sly:
Rapid mixing of Gibbs sampling on graphs that are sparse on average.
SODA 2008: 238-247 |
| 52 | EE | Mark Braverman,
Elchanan Mossel:
Noisy sorting without resampling.
SODA 2008: 268-276 |
| 51 | EE | Per Austrin,
Elchanan Mossel:
Approximation Resistant Predicates From Pairwise Independence
CoRR abs/0802.2300: (2008) |
| 50 | EE | Jan Arpe,
Elchanan Mossel:
Multiple Random Oracles Are Better Than One
CoRR abs/0804.3817: (2008) |
| 49 | EE | Jan Arpe,
Elchanan Mossel:
Agnostically Learning Juntas from Random Walks
CoRR abs/0806.4210: (2008) |
| 48 | EE | Per Austrin,
Elchanan Mossel:
Approximation Resistant Predicates From Pairwise Independence.
Electronic Colloquium on Computational Complexity (ECCC) 15(009): (2008) |
| 2007 |
|---|
| 47 | EE | Elchanan Mossel,
Sébastien Roch:
On the submodularity of influence in social networks.
STOC 2007: 128-134 |
| 46 | EE | Mark Braverman,
Elchanan Mossel:
Noisy Sorting Without Resampling
CoRR abs/0707.1051: (2007) |
| 45 | EE | Constantinos Daskalakis,
Richard M. Karp,
Elchanan Mossel,
Samantha Riesenfeld,
Elad Verbin:
Sorting and Selection in Posets
CoRR abs/0707.1532: (2007) |
| 44 | EE | Amin Coja-Oghlan,
Elchanan Mossel,
Dan Vilenchik:
A Spectral Approach to Analyzing Belief Propagation for 3-Coloring
CoRR abs/0712.0171: (2007) |
| 43 | EE | Guy Bresler,
Elchanan Mossel,
Allan Sly:
Reconstruction of Markov Random Fields from Samples: Some Easy Observations and Algorithms
CoRR abs/0712.1402: (2007) |
| 42 | EE | Constantinos Daskalakis,
Alexandros G. Dimakis,
Elchanan Mossel:
Connectivity and Equilibrium in Random Games
CoRR abs/math/0703902: (2007) |
| 41 | EE | Elchanan Mossel:
Distorted Metrics on Trees and Phylogenetic Forests.
IEEE/ACM Trans. Comput. Biology Bioinform. 4(1): 108-116 (2007) |
| 40 | EE | Elitza N. Maneva,
Elchanan Mossel,
Martin J. Wainwright:
A new look at survey propagation and its generalizations.
J. ACM 54(4): (2007) |
| 39 | EE | Elchanan Mossel,
Sébastien Roch:
Slow emergence of cooperation for win-stay lose-shift on trees.
Machine Learning 67(1-2): 7-22 (2007) |
| 38 | EE | Ke Chen,
Amos Fiat,
Haim Kaplan,
Meital Levy,
Jirí Matousek,
Elchanan Mossel,
János Pach,
Micha Sharir,
Shakhar Smorodinsky,
Uli Wagner,
Emo Welzl:
Online Conflict-Free Coloring for Intervals.
SIAM J. Comput. 36(5): 1342-1359 (2007) |
| 37 | EE | Subhash Khot,
Guy Kindler,
Elchanan Mossel,
Ryan O'Donnell:
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?.
SIAM J. Comput. 37(1): 319-357 (2007) |
| 2006 |
|---|
| 36 | EE | Uriel Feige,
Elchanan Mossel,
Dan Vilenchik:
Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems.
APPROX-RANDOM 2006: 339-350 |
| 35 | EE | Christian Borgs,
Jennifer T. Chayes,
Elchanan Mossel,
Sébastien Roch:
The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels.
FOCS 2006: 518-530 |
| 34 | EE | Constantinos Daskalakis,
Cameron Hill,
Alexander Jaffe,
Radu Mihaescu,
Elchanan Mossel,
Satish Rao:
Maximal Accurate Forests from Distance Matrices.
RECOMB 2006: 281-295 |
| 33 | EE | Constantinos Daskalakis,
Elchanan Mossel,
Sébastien Roch:
Optimal phylogenetic reconstruction.
STOC 2006: 159-168 |
| 32 | EE | Irit Dinur,
Elchanan Mossel,
Oded Regev:
Conditional hardness for approximate coloring.
STOC 2006: 344-353 |
| 31 | EE | Elchanan Mossel,
Amir Shpilka,
Luca Trevisan:
On epsilon-biased generators in NC0.
Random Struct. Algorithms 29(1): 56-81 (2006) |
| 2005 |
|---|
| 30 | EE | Elchanan Mossel,
Ryan O'Donnell,
Krzysztof Oleszkiewicz:
Noise stability of functions with low in.uences invariance and optimality.
FOCS 2005: 21-30 |
| 29 | EE | Elitza N. Maneva,
Elchanan Mossel,
Martin J. Wainwright:
A new look at survey propagation and its generalizations.
SODA 2005: 1089-1098 |
| 28 | EE | Amos Fiat,
Meital Levy,
Jirí Matousek,
Elchanan Mossel,
János Pach,
Micha Sharir,
Shakhar Smorodinsky,
Uli Wagner,
Emo Welzl:
Online conflict-free coloring for intervals.
SODA 2005: 545-554 |
| 27 | EE | Elchanan Mossel,
Sébastien Roch:
Learning nonsingular phylogenies and hidden Markov models.
STOC 2005: 366-375 |
| 26 | EE | Elchanan Mossel,
Sébastien Roch:
Learning nonsingular phylogenies and hidden Markov models
CoRR abs/cs/0502076: (2005) |
| 25 | EE | Irit Dinur,
Elchanan Mossel,
Oded Regev:
Conditional Hardness for Approximate Coloring
CoRR abs/cs/0504062: (2005) |
| 24 | EE | Elchanan Mossel,
Ryan O'Donnell,
Krzysztof Oleszkiewicz:
Noise stability of functions with low influences: invariance and optimality
CoRR abs/math/0503503: (2005) |
| 23 | EE | Elchanan Mossel,
Yuval Peres:
New Coins From Old: Computing With Unknown Bias.
Combinatorica 25(6): 707-724 (2005) |
| 22 | EE | Irit Dinur,
Elchanan Mossel,
Oded Regev:
Conditional Hardness for Approximate Coloring
Electronic Colloquium on Computational Complexity (ECCC)(039): (2005) |
| 21 | EE | Guy Kindler,
Ryan O'Donnell,
Subhash Khot,
Elchanan Mossel:
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?
Electronic Colloquium on Computational Complexity (ECCC)(101): (2005) |
| 20 | EE | Nader H. Bshouty,
Elchanan Mossel,
Ryan O'Donnell,
Rocco A. Servedio:
Learning DNF from random walks.
J. Comput. Syst. Sci. 71(3): 250-265 (2005) |
| 19 | EE | Elchanan Mossel,
Ryan O'Donnell:
Coin flipping from a cosmic source: On error correction of truly random bits.
Random Struct. Algorithms 26(4): 418-436 (2005) |
| 2004 |
|---|
| 18 | EE | Richard J. Lipton,
Evangelos Markakis,
Elchanan Mossel,
Amin Saberi:
On approximately fair allocations of indivisible goods.
ACM Conference on Electronic Commerce 2004: 125-131 |
| 17 | EE | Subhash Khot,
Guy Kindler,
Elchanan Mossel,
Ryan O'Donnell:
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
FOCS 2004: 146-154 |
| 16 | EE | Elchanan Mossel,
Yuval Peres,
Alistair Sinclair:
Shuffling by Semi-Random Transpositions.
FOCS 2004: 572-581 |
| 15 | EE | Elitza N. Maneva,
Elchanan Mossel,
Martin J. Wainwright:
A New Look at Survey Propagation and its Generalizations
CoRR cs.CC/0409012: (2004) |
| 14 | EE | Elchanan Mossel,
Ryan O'Donnell,
Rocco A. Servedio:
Learning functions of k relevant variables.
J. Comput. Syst. Sci. 69(3): 421-434 (2004) |
| 2003 |
|---|
| 13 | EE | Elchanan Mossel,
Amir Shpilka,
Luca Trevisan:
On e-Biased Generators in NC0.
FOCS 2003: 136-145 |
| 12 | EE | Nader H. Bshouty,
Elchanan Mossel,
Ryan O'Donnell,
Rocco A. Servedio:
Learning DNF from Random Walks.
FOCS 2003: 189- |
| 11 | EE | Elchanan Mossel,
Ryan O'Donnell,
Rocco A. Servedio:
Learning juntas.
STOC 2003: 206-212 |
| 10 | EE | Elchanan Mossel,
Amir Shpilka,
Luca Trevisan:
On epsilon-Biased Generators in NC0
Electronic Colloquium on Computational Complexity (ECCC)(043): (2003) |
| 9 | EE | Elchanan Mossel:
On the Impossibility of Reconstructing Ancestral Data and Phylogenies.
Journal of Computational Biology 10(5): 669-676 (2003) |
| 8 | EE | Elchanan Mossel,
Ryan O'Donnell:
On the noise sensitivity of monotone functions.
Random Struct. Algorithms 23(3): 333-350 (2003) |
| 2002 |
|---|
| 7 | | Elchanan Mossel:
The Minesweeper Game: Percolation And Complexity.
Combinatorics, Probability & Computing 11(5): (2002) |
| 6 | EE | Elchanan Mossel,
Christopher Umans:
On the complexity of approximating the VC dimension.
J. Comput. Syst. Sci. 65(4): 660-671 (2002) |
| 2001 |
|---|
| 5 | | Claire Kenyon,
Elchanan Mossel,
Yuval Peres:
Glauber Dynamics on Trees and Hyperbolic Graphs.
FOCS 2001: 568-578 |
| 4 | EE | Elchanan Mossel,
Christopher Umans:
On the Complexity of Approximating the VC Dimension.
IEEE Conference on Computational Complexity 2001: 220-225 |
| 2000 |
|---|
| 3 | EE | Itai Benjamini,
Olle Häggström,
Elchanan Mossel:
On Random Graph Homomorphisms into Z.
J. Comb. Theory, Ser. B 78(1): 86-114 (2000) |
| 2 | | Johan Jonasson,
Elchanan Mossel,
Yuval Peres:
Percolation in a dependent random environment.
Random Struct. Algorithms 16(4): 333-343 (2000) |
| 1998 |
|---|
| 1 | | Elchanan Mossel:
Recursive reconstruction on periodic trees.
Random Struct. Algorithms 13(1): 81-97 (1998) |
