The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Elchanan Mossel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Uriel Feige, Elchanan Mossel, Dan Vilenchik
    Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:339-350 [Conf]
  2. Elchanan Mossel, Christopher Umans
    On the Complexity of Approximating the VC Dimension. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:220-225 [Conf]
  3. Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
    Learning DNF from Random Walks. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:189-0 [Conf]
  4. Claire Kenyon, Elchanan Mossel, Yuval Peres
    Glauber Dynamics on Trees and Hyperbolic Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:568-578 [Conf]
  5. Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell
    Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs? [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:146-154 [Conf]
  6. Elchanan Mossel, Ryan O'Donnell, Krzysztof Oleszkiewicz
    Noise stability of functions with low in.uences invariance and optimality. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:21-30 [Conf]
  7. Elchanan Mossel, Yuval Peres, Alistair Sinclair
    Shuffling by Semi-Random Transpositions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:572-581 [Conf]
  8. Elchanan Mossel, Amir Shpilka, Luca Trevisan
    On e-Biased Generators in NC0. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:136-145 [Conf]
  9. Christian Borgs, Jennifer T. Chayes, Elchanan Mossel, Sébastien Roch
    The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:518-530 [Conf]
  10. Constantinos Daskalakis, Cameron Hill, Alexander Jaffe, Radu Mihaescu, Elchanan Mossel, Satish Rao
    Maximal Accurate Forests from Distance Matrices. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2006, pp:281-295 [Conf]
  11. Richard J. Lipton, Evangelos Markakis, Elchanan Mossel, Amin Saberi
    On approximately fair allocations of indivisible goods. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2004, pp:125-131 [Conf]
  12. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:545-554 [Conf]
  13. Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright
    A new look at survey propagation and its generalizations. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:1089-1098 [Conf]
  14. Constantinos Daskalakis, Elchanan Mossel, Sébastien Roch
    Optimal phylogenetic reconstruction. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:159-168 [Conf]
  15. Irit Dinur, Elchanan Mossel, Oded Regev
    Conditional hardness for approximate coloring. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:344-353 [Conf]
  16. Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
    Learning juntas. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:206-212 [Conf]
  17. Elchanan Mossel, Sébastien Roch
    Learning nonsingular phylogenies and hidden Markov models. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:366-375 [Conf]
  18. Elchanan Mossel, Yuval Peres
    New Coins From Old: Computing With Unknown Bias. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2005, v:25, n:6, pp:707-724 [Journal]
  19. Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright
    A New Look at Survey Propagation and its Generalizations [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  20. Elchanan Mossel
    The Minesweeper Game: Percolation And Complexity. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:5, pp:- [Journal]
  21. Elchanan Mossel, Amir Shpilka, Luca Trevisan
    On epsilon-Biased Generators in NC0 [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:043, pp:- [Journal]
  22. Irit Dinur, Elchanan Mossel, Oded Regev
    Conditional Hardness for Approximate Coloring [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:039, pp:- [Journal]
  23. Guy Kindler, Ryan O'Donnell, Subhash Khot, Elchanan Mossel
    Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:101, pp:- [Journal]
  24. Elchanan Mossel
    On the Impossibility of Reconstructing Ancestral Data and Phylogenies. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2003, v:10, n:5, pp:669-676 [Journal]
  25. Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
    Learning DNF from random walks. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:71, n:3, pp:250-265 [Journal]
  26. Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
    Learning functions of k relevant variables. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:3, pp:421-434 [Journal]
  27. Elchanan Mossel, Christopher Umans
    On the complexity of approximating the VC dimension. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:4, pp:660-671 [Journal]
  28. Itai Benjamini, Olle Häggström, Elchanan Mossel
    On Random Graph Homomorphisms into Z. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:78, n:1, pp:86-114 [Journal]
  29. Johan Jonasson, Elchanan Mossel, Yuval Peres
    Percolation in a dependent random environment. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:16, n:4, pp:333-343 [Journal]
  30. Elchanan Mossel
    Recursive reconstruction on periodic trees. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:1, pp:81-97 [Journal]
  31. Elchanan Mossel, Ryan O'Donnell
    On the noise sensitivity of monotone functions. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:23, n:3, pp:333-350 [Journal]
  32. Elchanan Mossel, Ryan O'Donnell
    Coin flipping from a cosmic source: On error correction of truly random bits. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:26, n:4, pp:418-436 [Journal]
  33. Elchanan Mossel, Amir Shpilka, Luca Trevisan
    On epsilon-biased generators in NC0. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:29, n:1, pp:56-81 [Journal]
  34. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1342-1359 [Journal]
  35. Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell
    Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:319-357 [Journal]
  36. Elchanan Mossel, Sébastien Roch
    On the submodularity of influence in social networks. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:128-134 [Conf]
  37. Constantinos Daskalakis, Alexandros G. Dimakis, Elchanan Mossel
    Connectivity and Equilibrium in Random Games [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  38. Elchanan Mossel, Sébastien Roch
    Learning nonsingular phylogenies and hidden Markov models [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  39. Elchanan Mossel, Ryan O'Donnell, Krzysztof Oleszkiewicz
    Noise stability of functions with low influences: invariance and optimality [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  40. Irit Dinur, Elchanan Mossel, Oded Regev
    Conditional Hardness for Approximate Coloring [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  41. Mark Braverman, Elchanan Mossel
    Noisy Sorting Without Resampling [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  42. Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld, Elad Verbin
    Sorting and Selection in Posets [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  43. Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright
    A new look at survey propagation and its generalizations. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2007, v:54, n:4, pp:- [Journal]
  44. Elchanan Mossel, Sébastien Roch
    Slow emergence of cooperation for win-stay lose-shift on trees. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2007, v:67, n:1-2, pp:7-22 [Journal]
  45. Elchanan Mossel
    Distorted Metrics on Trees and Phylogenetic Forests. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2007, v:4, n:1, pp:108-116 [Journal]

  46. Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms. [Citation Graph (, )][DBLP]


  47. The Complexity of Distinguishing Markov Random Fields. [Citation Graph (, )][DBLP]


  48. Approximation Resistant Predicates from Pairwise Independence. [Citation Graph (, )][DBLP]


  49. Gaussian Bounds for Noise Correlation of Functions and Tight Analysis of Long Codes. [Citation Graph (, )][DBLP]


  50. Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep. [Citation Graph (, )][DBLP]


  51. Rapid mixing of Gibbs sampling on graphs that are sparse on average. [Citation Graph (, )][DBLP]


  52. Noisy sorting without resampling. [Citation Graph (, )][DBLP]


  53. Sorting and selection in posets. [Citation Graph (, )][DBLP]


  54. Inapproximability for VCG-Based Combinatorial Auctions. [Citation Graph (, )][DBLP]


  55. Reaching Consensus on Social Networks. [Citation Graph (, )][DBLP]


  56. Approximation Resistant Predicates from Pairwise Independence. [Citation Graph (, )][DBLP]


  57. Reconstruction of Markov Random Fields from Samples: Some Easy Observations and Algorithms [Citation Graph (, )][DBLP]


  58. A Spectral Approach to Analyzing Belief Propagation for 3-Coloring [Citation Graph (, )][DBLP]


  59. Approximation Resistant Predicates From Pairwise Independence [Citation Graph (, )][DBLP]


  60. Multiple Random Oracles Are Better Than One [Citation Graph (, )][DBLP]


  61. Agnostically Learning Juntas from Random Walks [Citation Graph (, )][DBLP]


  62. Arrow's Impossibility Theorem Without Unanimity [Citation Graph (, )][DBLP]


  63. VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension [Citation Graph (, )][DBLP]


  64. Sorting from Noisy Information [Citation Graph (, )][DBLP]


  65. Efficient Bayesian Learning in Social Networks with Gaussian Estimators [Citation Graph (, )][DBLP]


  66. Truthful Fair Division [Citation Graph (, )][DBLP]


  67. The Computational Complexity of Estimating Convergence Time [Citation Graph (, )][DBLP]


  68. On extracting common random bits from correlated sources [Citation Graph (, )][DBLP]


  69. Co-evolution is Incompatible with the Markov Assumption in Phylogenetics [Citation Graph (, )][DBLP]


  70. A Spectral Approach to Analysing Belief Propagation for 3-Colouring. [Citation Graph (, )][DBLP]


  71. Approximation Resistant Predicates From Pairwise Independence. [Citation Graph (, )][DBLP]


Search in 0.093secs, Finished in 0.096secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002