| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Anindya De, Elchanan Mossel |
Explicit Optimal hardness via Gaussian stability results.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Lee-Ad Gottlieb, Aryeh Kontorovich, Elchanan Mossel |
VC bounds on the cardinality of nearly orthogonal function classes. |
Discrete Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anindya De, Elchanan Mossel |
Explicit Optimal Hardness via Gaussian stability results |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Elchanan Mossel, Omer Tamuz |
Bundling Customers: How to Exploit Trust Among Customers to Maximize Seller Profit |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Elchanan Mossel, Miklós Z. Rácz |
A quantitative gibbard-satterthwaite theorem without neutrality. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Elchanan Mossel, Miklós Z. Rácz |
A quantitative Gibbard-Satterthwaite theorem without neutrality |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Nathan Keller, Elchanan Mossel, Tomer Schlank |
A Note on the Entropy/Influence Conjecture |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Elchanan Mossel, Sébastien Roch, Allan Sly |
Robust estimation of latent tree graphical models: Inferring hidden states with inexact parameters |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Constantinos Daskalakis, Elchanan Mossel, Sébastien Roch |
Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tamir Tuller, Elchanan Mossel |
Co-evolution Is Incompatible with the Markov Assumption in Phylogenetics. |
IEEE/ACM Trans. Comput. Biology Bioinform. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld, Elad Verbin |
Sorting and Selection in Posets. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Elchanan Mossel |
On Extracting Common Random Bits From Correlated Sources. |
IEEE Transactions on Information Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nayantara Bhatnagar, Andrej Bogdanov, Elchanan Mossel |
The Computational Complexity of Estimating MCMC Convergence Time. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Arpe, Elchanan Mossel |
Application of a Generalization of Russo's Formula to Learning from Multiple Random Oracles. |
Combinatorics, Probability & Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Elchanan Mossel, Omer Tamuz |
Truthful Fair Division |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Elchanan Mossel, Omer Tamuz |
Efficient Bayesian Learning in Social Networks with Gaussian Estimators |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Tamir Tuller, Elchanan Mossel |
Co-evolution is Incompatible with the Markov Assumption in Phylogenetics |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Nayantara Bhatnagar, Andrej Bogdanov, Elchanan Mossel |
The Computational Complexity of Estimating Convergence Time |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrej Bogdanov, Elchanan Mossel |
On extracting common random bits from correlated sources |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Elchanan Mossel, Sébastien Roch |
Incomplete Lineage Sorting: Consistent Phylogeny Estimation from Multiple Loci. |
IEEE/ACM Trans. Comput. Biology Bioinform. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Elchanan Mossel, Sébastien Roch |
Submodularity of Influence in Social Networks: From Local to Global. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | David Buchfuhrer, Shaddin Dughmi, Hu Fu, Robert Kleinberg, Elchanan Mossel, Christos H. Papadimitriou, Michael Schapira, Yaron Singer, Christopher Umans |
Inapproximability for VCG-Based Combinatorial Auctions. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Elchanan Mossel, Omer Tamuz |
Truthful Fair Division. |
SAGT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Elchanan Mossel, Grant Schoenebeck |
Reaching Consensus on Social Networks. |
ICS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Marcus Isaksson, Guy Kindler, Elchanan Mossel |
The Geometry of Manipulation: A Quantitative Proof of the Gibbard-Satterthwaite Theorem. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Elchanan Mossel, Allan Sly |
Rapid mixing of Gibbs sampling on graphs that are sparse on average. |
Random Struct. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Elchanan Mossel, Dan Vilenchik |
A Spectral Approach to Analysing Belief Propagation for 3-Colouring. |
Combinatorics, Probability & Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Per Austrin, Elchanan Mossel |
Approximation Resistant Predicates from Pairwise Independence. |
Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
MSC Primary 68Q17, Secondary 41A52, Subject classification |
| 1 | Elchanan Mossel |
Arrow's Impossibility Theorem Without Unanimity |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman, Elchanan Mossel |
Sorting from Noisy Information |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Elchanan Mossel, Christos H. Papadimitriou, Michael Schapira, Yaron Singer |
VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Elchanan Mossel, Sébastien Roch, Mike A. Steel |
Shrinkage Effect in Ancestral Maximum Likelihood. |
IEEE/ACM Trans. Comput. Biology Bioinform. |
2009 |
DBLP DOI BibTeX RDF |
Markov processes, Biology and genetics |
| 1 | Irit Dinur, Elchanan Mossel, Oded Regev |
Conditional Hardness for Approximate Coloring. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld, Elad Verbin |
Sorting and selection in posets. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Constantinos Daskalakis, Elchanan Mossel, Sébastien Roch |
Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep. |
RECOMB |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Per Austrin, Elchanan Mossel |
Approximation Resistant Predicates From Pairwise Independence. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Jan Arpe, Elchanan Mossel |
Agnostically Learning Juntas from Random Walks |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Per Austrin, Elchanan Mossel |
Approximation Resistant Predicates From Pairwise Independence |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Jan Arpe, Elchanan Mossel |
Multiple Random Oracles Are Better Than One |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman, Elchanan Mossel |
Noisy sorting without resampling. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Elchanan Mossel, Allan Sly |
Rapid mixing of Gibbs sampling on graphs that are sparse on average. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
Erd?s-Rényi random graphs, Glauber dynamics, Gibbs samplers, mixing time, Ising model |
| 1 | Andrea Montanari, Elchanan Mossel |
Smooth compression, Gallager bound and nonlinear sparse-graph codes. |
ISIT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan |
The Complexity of Distinguishing Markov Random Fields. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Bresler, Elchanan Mossel, Allan Sly |
Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Elchanan Mossel |
Gaussian Bounds for Noise Correlation of Functions and Tight Analysis of Long Codes. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Per Austrin, Elchanan Mossel |
Approximation Resistant Predicates from Pairwise Independence. |
IEEE Conference on Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
Max k-CSP, Approximation Resistance, Pairwise Independence, Unique Games Conjecture |
| 1 | Elchanan Mossel, Sébastien Roch |
Slow emergence of cooperation for win-stay lose-shift on trees. |
Machine Learning |
2007 |
DBLP DOI BibTeX RDF |
Games on graphs, Prisoner’s dilemma game, Win-Stay Lose-Shift, Oriented percolation, Emergence of cooperation, Learning |
| 1 | Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright |
A new look at survey propagation and its generalizations. |
J. ACM |
2007 |
DBLP DOI BibTeX RDF |
sum-product, survey propagation, message-passing, Markov random field, belief propagation, Gibbs sampling, Satisfiability problems, factor graph, k-SAT |
| 1 | Guy Bresler, Elchanan Mossel, Allan Sly |
Reconstruction of Markov Random Fields from Samples: Some Easy Observations and Algorithms |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman, Elchanan Mossel |
Noisy Sorting Without Resampling |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Elchanan Mossel, Dan Vilenchik |
A Spectral Approach to Analyzing Belief Propagation for 3-Coloring |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Constantinos Daskalakis, Alexandros G. Dimakis, Elchanan Mossel |
Connectivity and Equilibrium in Random Games |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld, Elad Verbin |
Sorting and Selection in Posets |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Elchanan Mossel |
Distorted Metrics on Trees and Phylogenetic Forests. |
IEEE/ACM Trans. Comput. Biology Bioinform. |
2007 |
DBLP DOI BibTeX RDF |
CFN, Jukes-Cantor, metric, tree, distortion, Phylogenetics, forest |
| 1 | Ke Chen 0006, 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. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell |
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Elchanan Mossel, Sébastien Roch |
On the submodularity of influence in social networks. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
social networks, coupling, viral marketing, submodularity |
| 1 | Elchanan Mossel, Amir Shpilka, Luca Trevisan |
On epsilon-biased generators in NC0. |
Random Struct. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Uriel Feige, Elchanan Mossel, Dan Vilenchik |
Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Borgs, Jennifer T. Chayes, Elchanan Mossel, Sébastien Roch |
The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Constantinos Daskalakis, Cameron Hill, Alexander Jaffe, Radu Mihaescu, Elchanan Mossel, Satish Rao |
Maximal Accurate Forests from Distance Matrices. |
RECOMB |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Constantinos Daskalakis, Elchanan Mossel, Sébastien Roch |
Optimal phylogenetic reconstruction. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
CFN model, Jukes Cantor, reconstruction problem, phase transitions, phylogenetics, Ising model |
| 1 | Irit Dinur, Elchanan Mossel, Oded Regev |
Conditional hardness for approximate coloring. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
graph coloring, hardness of approximation, unique games conjecture |
| 1 | Irit Dinur, Elchanan Mossel, Oded Regev |
Conditional Hardness for Approximate Coloring |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | 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) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Elchanan Mossel, Ryan O'Donnell |
Coin flipping from a cosmic source: On error correction of truly random bits. |
Random Struct. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Elchanan Mossel, Yuval Peres |
New Coins From Old: Computing With Unknown Bias. |
Combinatorica |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 68Q70, 14P10, 65C50 |
| 1 | Irit Dinur, Elchanan Mossel, Oded Regev |
Conditional Hardness for Approximate Coloring |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Elchanan Mossel, Ryan O'Donnell, Krzysztof Oleszkiewicz |
Noise stability of functions with low influences: invariance and optimality |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Elchanan Mossel, Sébastien Roch |
Learning nonsingular phylogenies and hidden Markov models |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio |
Learning DNF from random walks. |
J. Comput. Syst. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright |
A new look at survey propagation and its generalizations. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Elchanan Mossel, Ryan O'Donnell, Krzysztof Oleszkiewicz |
Noise stability of functions with low in.uences invariance and optimality. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Elchanan Mossel, Sébastien Roch |
Learning nonsingular phylogenies and hidden Markov models. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
hidden Markov models, PAC learning, evolutionary trees, phylogenetic reconstruction |
| 1 | Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright |
A New Look at Survey Propagation and its Generalizations |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio |
Learning functions of k relevant variables. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard J. Lipton, Evangelos Markakis, Elchanan Mossel, Amin Saberi |
On approximately fair allocations of indivisible goods. |
ACM Conference on Electronic Commerce |
2004 |
DBLP DOI BibTeX RDF |
envy, approximation algorithm, fairness, truthfulness |
| 1 | Elchanan Mossel, Yuval Peres, Alistair Sinclair |
Shuffling by Semi-Random Transpositions. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell |
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs? |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Elchanan Mossel, Amir Shpilka, Luca Trevisan |
On epsilon-Biased Generators in NC0 |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Elchanan Mossel |
On the Impossibility of Reconstructing Ancestral Data and Phylogenies. |
Journal of Computational Biology |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Elchanan Mossel, Ryan O'Donnell |
On the noise sensitivity of monotone functions. |
Random Struct. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio |
Learning DNF from Random Walks. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Elchanan Mossel, Amir Shpilka, Luca Trevisan |
On e-Biased Generators in NC0. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio |
Learning juntas. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
juntas, relevant variables, learning, uniform distribution, fourier |
| 1 | Elchanan Mossel |
The Minesweeper Game: Percolation And Complexity. |
Combinatorics, Probability & Computing |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Elchanan Mossel, Christopher Umans |
On the complexity of approximating the VC dimension. |
J. Comput. Syst. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Claire Kenyon, Elchanan Mossel, Yuval Peres |
Glauber Dynamics on Trees and Hyperbolic Graphs. |
FOCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Elchanan Mossel, Christopher Umans |
On the Complexity of Approximating the VC Dimension. (PDF / PS) |
IEEE Conference on Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Itai Benjamini, Olle Häggström, Elchanan Mossel |
On Random Graph Homomorphisms into Z. |
J. Comb. Theory, Ser. B |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Johan Jonasson, Elchanan Mossel, Yuval Peres |
Percolation in a dependent random environment. |
Random Struct. Algorithms |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Elchanan Mossel |
Recursive reconstruction on periodic trees. |
Random Struct. Algorithms |
1998 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")