default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElchanan Mossel
Person information
- affiliation: Massachusetts Institute of Technology, USA
- affiliation (former): University of California, Berkeley, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j72]Jan Hazla, Yan Jin, Elchanan Mossel, Govind Ramnarayan:
A Geometric Model of Opinion Polarization. Math. Oper. Res. 49(1): 251-277 (2024)- [j71]Souvik Dhara
, Julia Gaudio, Elchanan Mossel, Colin Sandon:
The Power of Two Matrices in Spectral Algorithms for Community Recovery. IEEE Trans. Inf. Theory 70(5): 3599-3621 (2024) - [c87]Anna M. Brandenberger, Cassandra Marcussen, Elchanan Mossel, Madhu Sudan:
Errors are Robustly Tamed in Cumulative Knowledge Processes. COLT 2024: 630-631 - [c86]Byron Chin, Ankur Moitra, Elchanan Mossel, Colin Sandon:
The power of an adversary in Glauber dynamics. COLT 2024: 1102-1124 - [c85]Han Huang, Pakawut Jiradilok, Elchanan Mossel:
Reconstructing the Geometry of Random Geometric Graphs (Extended Abstract). COLT 2024: 2519-2521 - [c84]Elchanan Mossel, Anirudh Sridhar:
Finding Super-spreaders in Network Cascades. COLT 2024: 3874-3914 - [c83]Zongchen Chen, Elchanan Mossel:
Influence Maximization in Ising Models. ITCS 2024: 30:1-30:14 - [c82]Jason Gaitonde, Elchanan Mossel:
A Unified Approach to Learning Ising Models: Beyond Independence and Bounded Width. STOC 2024: 503-514 - [c81]Frederic Koehler, Noam Lifshitz, Dor Minzer, Elchanan Mossel:
Influences in Mixing Measures. STOC 2024: 527-536 - [i127]Han Huang, Pakawut Jiradilok, Elchanan Mossel:
Reconstructing the Geometry of Random Geometric Graphs. CoRR abs/2402.09591 (2024) - [i126]Pakawut Jiradilok, Elchanan Mossel:
Gaussian Broadcast on Grids. CoRR abs/2402.11990 (2024) - [i125]Jason Gaitonde, Elchanan Mossel:
Sample-Efficient Linear Regression with Self-Selection Bias. CoRR abs/2402.14229 (2024) - [i124]Elchanan Mossel, Anirudh Sridhar:
Finding Super-spreaders in Network Cascades. CoRR abs/2403.03205 (2024) - [i123]Elchanan Mossel, Allan Sly, Youngtak Sohn:
Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs. CoRR abs/2406.15957 (2024) - [i122]Jason Gaitonde, Ankur Moitra, Elchanan Mossel:
Efficiently Learning Markov Random Fields from Dynamics. CoRR abs/2409.05284 (2024) - [i121]Jason Gaitonde, Elchanan Mossel:
Comparison Theorems for the Mixing Times of Systematic and Random Scan Dynamics. CoRR abs/2410.11136 (2024) - 2023
- [j70]Ali Jadbabaie, Anuran Makur, Elchanan Mossel, Rabih Salhab:
Inference in Opinion Dynamics Under Social Pressure. IEEE Trans. Autom. Control. 68(6): 3377-3392 (2023) - [c80]Elchanan Mossel, Jonathan Niles-Weed, Youngtak Sohn, Nike Sun, Ilias Zadik:
Sharp thresholds in inference of planted subgraphs. COLT 2023: 5573-5577 - [c79]Elisabetta Cornacchia, Elchanan Mossel:
A Mathematical Model for Curriculum Learning for Parities. ICML 2023: 6402-6423 - [c78]Omri Ben-Eliezer, Dan Mikulincer, Elchanan Mossel, Madhu Sudan:
Is This Correct? Let's Check! ITCS 2023: 15:1-15:11 - [c77]Daniel Halpern, Joseph Y. Halpern, Ali Jadbabaie, Elchanan Mossel, Ariel D. Procaccia, Manon Revel:
In Defense of Liquid Democracy. EC 2023: 852 - [c76]Zongchen Chen, Elchanan Mossel, Ilias Zadik:
Almost-Linear Planted Cliques Elude the Metropolis Process. SODA 2023: 4504-4539 - [c75]Elchanan Mossel, Allan Sly, Youngtak Sohn:
Exact Phase Transitions for Stochastic Block Models and Reconstruction on Trees. STOC 2023: 96-102 - [i120]Elisabetta Cornacchia, Elchanan Mossel:
A Mathematical Model for Curriculum Learning. CoRR abs/2301.13833 (2023) - [i119]Elchanan Mossel, Jonathan Niles-Weed, Youngtak Sohn, Nike Sun, Ilias Zadik:
Sharp thresholds in inference of planted subgraphs. CoRR abs/2302.14830 (2023) - [i118]Frederic Koehler, Noam Lifshitz, Dor Minzer, Elchanan Mossel:
Influences in Mixing Measures. CoRR abs/2307.07625 (2023) - [i117]Zongchen Chen, Elchanan Mossel:
Influence Maximization in Ising Models. CoRR abs/2309.05206 (2023) - [i116]Anna M. Brandenberger, Cassandra Marcussen, Elchanan Mossel, Madhu Sudan:
Combinative Cumulative Knowledge Processes. CoRR abs/2309.05638 (2023) - [i115]David Gamarnik, Elchanan Mossel, Ilias Zadik:
Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique. CoRR abs/2311.04204 (2023) - [i114]Jason Gaitonde, Elchanan Mossel:
A Unified Approach to Learning Ising Models: Beyond Independence and Bounded Width. CoRR abs/2311.09197 (2023) - 2022
- [j69]Pim van der Hoorn, Gabor Lippner, Elchanan Mossel:
Regular Graphs with Many Triangles are Structured. Electron. J. Comb. 29(1) (2022) - [j68]Dean Eckles, Hossein Esfandiari, Elchanan Mossel, M. Amin Rahimian:
Seeding with Costly Network Information. Oper. Res. 70(4): 2318-2348 (2022) - [j67]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Two-Dimensional Regular Grids. IEEE Trans. Inf. Theory 68(10): 6297-6334 (2022) - [c74]Frederic Koehler, Elchanan Mossel:
Reconstruction on Trees and Low-Degree Polynomials. NeurIPS 2022 - [c73]Souvik Dhara, Julia Gaudio, Elchanan Mossel, Colin Sandon:
Spectral recovery of binary censored block models. SODA 2022: 3389-3416 - [c72]Gilad Chase, Yuval Filmus, Dor Minzer, Elchanan Mossel, Nitin Saurabh:
Approximate polymorphisms. STOC 2022: 195-202 - [i113]Souvik Dhara, Julia Gaudio, Elchanan Mossel, Colin Sandon:
Spectral Algorithms Optimally Recover (Censored) Planted Dense Subgraphs. CoRR abs/2203.11847 (2022) - [i112]Zongchen Chen, Elchanan Mossel, Ilias Zadik:
Almost-Linear Planted Cliques Elude the Metropolis Process. CoRR abs/2204.01911 (2022) - [i111]Elchanan Mossel, David Vulakh:
Efficient Reconstruction of Stochastic Pedigrees: Some Steps From Theory to Practice. CoRR abs/2204.04573 (2022) - [i110]Elchanan Mossel, Jonathan Niles-Weed, Nike Sun, Ilias Zadik:
On the Second Kahn-Kalai Conjecture. CoRR abs/2209.03326 (2022) - [i109]Elchanan Mossel, Jonathan Niles-Weed, Nike Sun, Ilias Zadik:
A second moment proof of the spread lemma. CoRR abs/2209.11347 (2022) - [i108]Souvik Dhara, Julia Gaudio, Elchanan Mossel, Colin Sandon:
The Power of Two Matrices in Spectral Algorithms. CoRR abs/2210.05893 (2022) - [i107]Omri Ben-Eliezer, Dan Mikulincer, Elchanan Mossel, Madhu Sudan:
Is this correct? Let's check! CoRR abs/2211.12301 (2022) - [i106]Elchanan Mossel, Allan Sly, Youngtak Sohn:
Exact Phase Transitions for Stochastic Block Models and Reconstruction on Trees. CoRR abs/2212.03362 (2022) - 2021
- [j66]Jan Hazla, Ali Jadbabaie, Elchanan Mossel, M. Amin Rahimian:
Bayesian Decision Making in Groups is Hard. Oper. Res. 69(2): 632-654 (2021) - [c71]Ankur Moitra, Elchanan Mossel, Colin Sandon:
Learning to Sample from Censored Markov Random Fields. COLT 2021: 3419-3451 - [c70]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Reconstruction on 2D Regular Grids. ISIT 2021: 2107-2112 - [c69]Anindya De, Elchanan Mossel, Joe Neeman:
Robust testing of low dimensional functions. STOC 2021: 584-597 - [i105]Ankur Moitra, Elchanan Mossel, Colin Sandon:
Learning to Sample from Censored Markov Random Fields. CoRR abs/2101.06178 (2021) - [i104]Ali Jadbabaie, Anuran Makur, Elchanan Mossel, Rabih Salhab:
Opinion Dynamics under Social Pressure. CoRR abs/2104.11172 (2021) - [i103]Gilad Chase, Yuval Filmus, Dor Minzer, Elchanan Mossel, Nitin Saurabh:
Approximate polymorphisms. CoRR abs/2106.00093 (2021) - [i102]Ankur Moitra, Elchanan Mossel, Colin Sandon:
Spoofing Generalization: When Can't You Trust Proprietary Models? CoRR abs/2106.08393 (2021) - [i101]Omri Ben-Eliezer, Elchanan Mossel, Madhu Sudan:
Information Spread with Error Correction. CoRR abs/2107.06362 (2021) - [i100]Daniel Halpern, Joseph Y. Halpern, Ali Jadbabaie, Elchanan Mossel, Ariel D. Procaccia, Manon Revel:
In Defense of Fluid Democracy. CoRR abs/2107.11868 (2021) - [i99]Frederic Koehler, Elchanan Mossel:
Reconstruction on Trees and Low-Degree Polynomials. CoRR abs/2109.06915 (2021) - [i98]Anindya De, Elchanan Mossel, Joe Neeman:
Robust testing of low-dimensional functions. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j65]Younhun Kim, Frederic Koehler, Ankur Moitra, Elchanan Mossel, Govind Ramnarayan:
How Many Subpopulations Is Too Many? Exponential Lower Bounds for Inferring Population Histories. J. Comput. Biol. 27(4): 613-625 (2020) - [j64]Charles Bordenave, Uriel Feige, Elchanan Mossel:
Shotgun assembly of random jigsaw puzzles. Random Struct. Algorithms 56(4): 998-1015 (2020) - [j63]Elchanan Mossel, Jiaming Xu:
Seeded graph matching via large neighborhood statistics. Random Struct. Algorithms 57(3): 570-611 (2020) - [j62]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Random Directed Acyclic Graphs. IEEE Trans. Inf. Theory 66(2): 780-812 (2020) - [j61]Noga Alon, Elchanan Mossel, Robin Pemantle:
Distributed Corruption Detection in Networks. Theory Comput. 16: 1-23 (2020) - [c68]Ankur Moitra, Elchanan Mossel, Colin Sandon:
Parallels Between Phase Transitions and Circuit Complexity? COLT 2020: 2910-2946 - [c67]Yuval Filmus, Noam Lifshitz, Dor Minzer, Elchanan Mossel:
AND testing and robust judgement aggregation. STOC 2020: 222-233 - [i97]Anindya De, Elchanan Mossel, Joe Neeman:
Robust testing of low-dimensional functions. CoRR abs/2004.11642 (2020) - [i96]Frederic Koehler, Elchanan Mossel:
A Phase Transition in Arrow's Theorem. CoRR abs/2004.12580 (2020) - [i95]Younhun Kim, Elchanan Mossel, Govind Ramnarayan, Paxton Turner:
Efficient Reconstruction of Stochastic Pedigrees. CoRR abs/2005.03810 (2020) - [i94]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Two-Dimensional Regular Grids. CoRR abs/2010.01390 (2020)
2010 – 2019
- 2019
- [j60]Elchanan Mossel, Mesrob I. Ohannessian:
On the Impossibility of Learning the Missing Mass. Entropy 21(1): 28 (2019) - [j59]Elchanan Mossel, Nathan Ross:
Shotgun Assembly of Labeled Graphs. IEEE Trans. Netw. Sci. Eng. 6(2): 145-157 (2019) - [j58]Anindya De, Elchanan Mossel, Joe Neeman:
Noise Stability is Computable and Approximately Low-Dimensional. Theory Comput. 15: 1-47 (2019) - [c66]Anindya De, Elchanan Mossel, Joe Neeman:
Is your function low dimensional? COLT 2019: 979-993 - [c65]Jan Hazla, Ali Jadbabaie, Elchanan Mossel, M. Amin Rahimian:
Reasoning in Bayesian Opinion Exchange Networks Is PSPACE-Hard. COLT 2019: 1614-1648 - [c64]Vishesh Jain, Frederic Koehler, Jingbo Liu, Elchanan Mossel:
Accuracy-Memory Tradeoffs and Phase Transitions in Belief Propagation. COLT 2019: 1756-1771 - [c63]Dean Eckles, Hossein Esfandiari, Elchanan Mossel, M. Amin Rahimian:
Seeding with Costly Network Information. EC 2019: 421-422 - [c62]Anindya De, Elchanan Mossel, Joe Neeman:
Junta Correlation is Testable. FOCS 2019: 1549-1563 - [c61]Yan Jin, Elchanan Mossel, Govind Ramnarayan:
Being Corrupt Requires Being Clever, But Detecting Corruption Doesn't. ITCS 2019: 45:1-45:14 - [c60]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Random Networks. ISIT 2019: 1632-1636 - [c59]Younhun Kim, Frederic Koehler, Ankur Moitra, Elchanan Mossel, Govind Ramnarayan:
How Many Subpopulations Is Too Many? Exponential Lower Bounds for Inferring Population Histories. RECOMB 2019: 136-157 - [c58]Elchanan Mossel, Jiaming Xu:
Seeded Graph Matching via Large Neighborhood Statistics. SODA 2019: 1005-1014 - [i93]Anindya De, Elchanan Mossel, Joe Neeman:
Junta correlation is testable. CoRR abs/1904.04216 (2019) - [i92]Ankur Moitra, Elchanan Mossel, Colin Sandon:
The Circuit Complexity of Inference. CoRR abs/1904.05483 (2019) - [i91]Dean Eckles, Hossein Esfandiari, Elchanan Mossel, M. Amin Rahimian:
Seeding with Costly Network Information. CoRR abs/1905.04325 (2019) - [i90]Vishesh Jain, Frederic Koehler, Jingbo Liu, Elchanan Mossel:
Accuracy-Memory Tradeoffs and Phase Transitions in Belief Propagation. CoRR abs/1905.10031 (2019) - [i89]Jan Hazla, Yan Jin, Elchanan Mossel, Govind Ramnarayan:
A Geometric Model of Opinion Polarization. CoRR abs/1910.05274 (2019) - [i88]Yuval Filmus, Noam Lifshitz, Dor Minzer, Elchanan Mossel:
AND Testing and Robust Judgement Aggregation. CoRR abs/1911.00159 (2019) - 2018
- [j57]Elchanan Mossel, Joe Neeman, Allan Sly:
A Proof of the Block Model Threshold Conjecture. Comb. 38(3): 665-708 (2018) - [j56]Yuval Filmus, Guy Kindler, Elchanan Mossel, Karl Wimmer:
Invariance Principle on the Slice. ACM Trans. Comput. Theory 10(3): 11:1-11:37 (2018) - [c57]Sampath Kannan, Elchanan Mossel, Swagato Sanyal, Grigory Yaroslavtsev:
Linear Sketching over F_2. CCC 2018: 8:1-8:37 - [c56]Vishesh Jain, Frederic Koehler, Elchanan Mossel:
The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity. COLT 2018: 1326-1347 - [c55]Vishesh Jain, Frederic Koehler, Elchanan Mossel:
The Vertex Sample Complexity of Free Energy is Polynomial. COLT 2018: 1395-1419 - [c54]Yash Deshpande, Subhabrata Sen, Andrea Montanari, Elchanan Mossel:
Contextual Stochastic Block Models. NeurIPS 2018: 8590-8602 - [c53]Elchanan Mossel, Manuel Mueller-Frank, Allan Sly, Omer Tamuz:
Social Learning Equilibria. EC 2018: 639 - [c52]Anindya De, Elchanan Mossel, Joe Neeman:
Non interactive simulation of correlated distributions is decidable. SODA 2018: 2728-2746 - [i87]Vishesh Jain, Frederic Koehler, Elchanan Mossel:
The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity. CoRR abs/1802.06126 (2018) - [i86]Vishesh Jain, Frederic Koehler, Elchanan Mossel:
The Vertex Sample Complexity of Free Energy is Polynomial. CoRR abs/1802.06129 (2018) - [i85]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Bounded Degree DAGs. CoRR abs/1803.07527 (2018) - [i84]Guy Bresler, Frederic Koehler, Ankur Moitra, Elchanan Mossel:
Learning Restricted Boltzmann Machines via Influence Maximization. CoRR abs/1805.10262 (2018) - [i83]Anindya De, Elchanan Mossel, Joe Neeman:
Is your data low-dimensional? CoRR abs/1806.10057 (2018) - [i82]Yash Deshpande, Andrea Montanari, Elchanan Mossel, Subhabrata Sen:
Contextual Stochastic Block Models. CoRR abs/1807.09596 (2018) - [i81]Elchanan Mossel, Jiaming Xu:
Seeded Graph Matching via Large Neighborhood Statistics. CoRR abs/1807.10262 (2018) - [i80]Jan Hazla, Ali Jadbabaie, Elchanan Mossel, M. Amin Rahimian:
Reasoning in Bayesian Opinion Exchange Networks Is PSPACE-Hard. CoRR abs/1809.01077 (2018) - [i79]Yan Jin, Elchanan Mossel, Govind Ramnarayan:
Being Corrupt Requires Being Clever, But Detecting Corruption Doesn't. CoRR abs/1809.10325 (2018) - [i78]Dean Eckles, Elchanan Mossel, M. Amin Rahimian, Subhabrata Sen:
Long ties accelerate noisy threshold-based contagions. CoRR abs/1810.03579 (2018) - [i77]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Random Directed Acyclic Graphs. CoRR abs/1811.03946 (2018) - 2017
- [j55]Tonci Antunovic, Yael Dekel, Elchanan Mossel, Yuval Peres:
Competing first passage percolation on random regular graphs. Random Struct. Algorithms 50(4): 534-583 (2017) - [c51]M. Amin Rahimian, Ali Jadbabaie, Elchanan Mossel:
Complexity of Bayesian belief exchange over a network. CDC 2017: 2611-2616 - [c50]Anindya De, Elchanan Mossel, Joe Neeman:
Noise Stability Is Computable and Approximately Low-Dimensional. CCC 2017: 10:1-10:11 - [i76]Anindya De, Elchanan Mossel, Joe Neeman:
Noise Stability is computable and low dimensional. CoRR abs/1701.01483 (2017) - [i75]Anindya De, Elchanan Mossel, Joe Neeman:
Non interactive simulation of correlated distributions is decidable. CoRR abs/1701.01485 (2017) - [i74]Ali Jadbabaie, Elchanan Mossel, M. Amin Rahimian:
Bayesian Group Decisions: Algorithms and Complexity. CoRR abs/1705.04770 (2017) - [i73]Gautam Dasarathy, Elchanan Mossel, Robert D. Nowak, Sebastien Roch:
Coalescent-based species tree estimation: a stochastic Farris transform. CoRR abs/1707.04300 (2017) - [i72]Vishesh Jain, Frederic Koehler, Elchanan Mossel:
Approximating Partition Functions in Constant Time. CoRR abs/1711.01655 (2017) - 2016
- [j54]Tonci Antunovic, Elchanan Mossel, Miklós Z. Rácz:
Coexistence in Preferential Attachment Networks. Comb. Probab. Comput. 25(6): 797-822 (2016) - [j53]Gil Kalai, Nathan Keller, Elchanan Mossel:
On the correlation of increasing families. J. Comb. Theory A 144: 250-276 (2016) - [j52]Alessandro Arlotto, Elchanan Mossel, J. Michael Steele:
Quickest online selection of an increasing subsequence of specified size. Random Struct. Algorithms 49(2): 235-252 (2016) - [j51]Varun Kanade, Elchanan Mossel, Tselil Schramm:
Global and Local Information in Clustering Labeled Block Models. IEEE Trans. Inf. Theory 62(10): 5906-5917 (2016) - [j50]Anindya De, Elchanan Mossel, Joe Neeman:
Majority is Stablest: Discrete and SoS. Theory Comput. 12(1): 1-50 (2016) - [c49]Elchanan Mossel, Noah Olsman, Omer Tamuz:
Efficient Bayesian Learning in Social Networks with Gaussian Estimators. Allerton 2016: 425-432 - [c48]Jan Hazla, Thomas Holenstein, Elchanan Mossel:
Lower Bounds on Same-Set Inner Product in Correlated Spaces. APPROX-RANDOM 2016: 34:1-34:11 - [c47]Yuval Filmus, Guy Kindler, Elchanan Mossel, Karl Wimmer:
Invariance Principle on the Slice. CCC 2016: 15:1-15:10 - [c46]Yuval Filmus, Elchanan Mossel:
Harmonicity and Invariance on Slices of the Boolean Cube. CCC 2016: 16:1-16:13 - [c45]Elchanan Mossel, Jiaming Xu:
Density Evolution in the Degree-correlated Stochastic Block Model. COLT 2016: 1319-1356 - [c44]Elchanan Mossel, Jiaming Xu:
Local Algorithms for Block Models with Side Information. ITCS 2016: 71-80 - [c43]Shirshendu Ganguly, Elchanan Mossel, Miklós Z. Rácz:
Sequence assembly from corrupted shotgun reads. ISIT 2016: 265-269 - [i71]Shirshendu Ganguly, Elchanan Mossel, Miklós Z. Rácz:
Sequence assembly from corrupted shotgun reads. CoRR abs/1601.07086 (2016) - [i70]Elchanan Mossel, Joe Neeman:
Noise Stability and Correlation with Half Spaces. CoRR abs/1603.01799 (2016) - [i69]Charles Bordenave, Uriel Feige, Elchanan Mossel:
Shotgun Assembly of Random Jigsaw Puzzles. CoRR abs/1605.03086 (2016) - [i68]Sampath Kannan, Elchanan Mossel, Grigory Yaroslavtsev:
Linear Sketching over $\mathbb F_2$. CoRR abs/1611.01879 (2016) - [i67]Elchanan Mossel:
Deep Learning and Hierarchal Generative Models. CoRR abs/1612.09057 (2016) - [i66]Elchanan Mossel, Sampath Kannan, Grigory Yaroslavtsev:
Linear Sketching over 𝔽2. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j49]Elchanan Mossel, Miklós Z. Rácz:
A quantitative Gibbard-Satterthwaite theorem without neutrality. Comb. 35(3): 317-387 (2015) - [j48]Gil Kalai, Elchanan Mossel:
Sharp Thresholds for Monotone Non-Boolean Functions and Social Choice Theory. Math. Oper. Res. 40(4): 915-925 (2015) - [j47]Sébastien Bubeck, Elchanan Mossel, Miklós Z. Rácz:
On the Influence of the Seed Graph in the Preferential Attachment Model. IEEE Trans. Netw. Sci. Eng. 2(1): 30-39 (2015) - [c42]Elchanan Mossel, Sébastien Roch:
Distance-based Species Tree Estimation: Information-Theoretic Trade-off between Number of Loci and Sequence Length under the Coalescent. APPROX-RANDOM 2015: 931-942 - [c41]Varun Kanade, Elchanan Mossel:
MCMC Learning. COLT 2015: 1101-1128 - [c40]Steven Heilman, Elchanan Mossel, Joe Neeman:
Standard Simplices and Pluralities are Not the Most Noise Stable. ITCS 2015: 255 - [c39]Elchanan Mossel, Joe Neeman, Allan Sly:
Consistency Thresholds for the Planted Bisection Model. STOC 2015: 69-75 - [i65]Elchanan Mossel, Mesrob I. Ohannessian:
On the Impossibility of Learning the Missing Mass. CoRR abs/1503.03613 (2015) - [i64]Elchanan Mossel, Sébastien Roch:
Distance-based species tree estimation: information-theoretic trade-off between number of loci and sequence length under the coalescent. CoRR abs/1504.05289 (2015) - [i63]Elchanan Mossel, Nathan Ross:
Shotgun assembly of labeled graphs. CoRR abs/1504.07682 (2015) - [i62]Noga Alon, Elchanan Mossel, Robin Pemantle:
Corruption Detection on Networks. CoRR abs/1505.05637 (2015) - [i61]Elchanan Mossel, Jiaming Xu:
Local Algorithms for Block Models with Side Information. CoRR abs/1508.02344 (2015) - [i60]Elchanan Mossel, Jiaming Xu:
Density Evolution in the Degree-correlated Stochastic Block Model. CoRR abs/1509.03281 (2015) - [i59]Jan Hazla, Thomas Holenstein, Elchanan Mossel:
Lower Bounds on Same-Set Inner Product in Correlated Spaces. CoRR abs/1509.06191 (2015) - 2014
- [j46]Elchanan Mossel, Joe Neeman, Omer Tamuz:
Majority dynamics and aggregation of information in social networks. Auton. Agents Multi Agent Syst. 28(3): 408-429 (2014) - [j45]Siu On Chan, Elchanan Mossel, Joe Neeman:
On Extracting Common Random Bits From Correlated Sources on Large Alphabets. IEEE Trans. Inf. Theory 60(3): 1630-1637 (2014) - [c38]Varun Kanade, Elchanan Mossel, Tselil Schramm:
Global and Local Information in Clustering Labeled Block Models. APPROX-RANDOM 2014: 779-792 - [c37]Elchanan Mossel, Joe Neeman, Allan Sly:
Belief propagation, robust reconstruction and optimal recovery of block models. COLT 2014: 356-370 - [i58]Elchanan Mossel, Omer Tamuz:
Opinion Exchange Dynamics. CoRR abs/1401.4770 (2014) - [i57]Sébastien Bubeck, Elchanan Mossel, Miklós Z. Rácz:
On the influence of the seed graph in the preferential attachment model. CoRR abs/1401.4849 (2014) - [i56]Steven Heilman, Elchanan Mossel, Joe Neeman:
Standard Simplices and Pluralities are Not the Most Noise Stable. CoRR abs/1403.0885 (2014) - [i55]Varun Kanade, Elchanan Mossel, Tselil Schramm:
Global and Local Information in Clustering Labeled Block Models. CoRR abs/1404.6325 (2014) - [i54]Steven Heilman, Elchanan Mossel, Krzysztof Oleszkiewicz:
Strong Contraction and Influences in Tail Spaces. CoRR abs/1406.7855 (2014) - [i53]Elchanan Mossel, Joe Neeman, Allan Sly:
Consistency Thresholds for Binary Symmetric Block Models. CoRR abs/1407.1591 (2014) - [i52]Sébastien Bubeck, Ronen Eldan, Elchanan Mossel, Miklós Z. Rácz:
From trees to seeds: on the inference of the seed from large trees in the uniform attachment model. CoRR abs/1409.7685 (2014) - [i51]Matan Harel, Elchanan Mossel, Philipp Strack, Omer Tamuz:
On the Speed of Social Learning. CoRR abs/1412.7172 (2014) - 2013
- [j44]Elchanan Mossel, Ariel D. Procaccia, Miklós Z. Rácz:
A Smooth Transition from Powerlessness to Absolute Power. J. Artif. Intell. Res. 48: 923-951 (2013) - [j43]Nayantara Bhatnagar, Nick Crawford, Elchanan Mossel, Arnab Sen:
Scaling Limits for Width Two Partially Ordered Sets: The Incomparability Window. Order 30(1): 289-311 (2013) - [j42]Guy Bresler, Elchanan Mossel, Allan Sly:
Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms. SIAM J. Comput. 42(2): 563-578 (2013) - [j41]Elchanan Mossel, Omer Tamuz:
Making Consensus Tractable. ACM Trans. Economics and Comput. 1(4): 20:1-20:19 (2013) - [j40]Elchanan Mossel, Sébastien Roch, Allan Sly:
Robust Estimation of Latent Tree Graphical Models: Inferring Hidden States With Inexact Parameters. IEEE Trans. Inf. Theory 59(7): 4357-4373 (2013) - [j39]Elchanan Mossel, Ryan O'Donnell:
Special Issue on Analysis of Boolean Functions: Guest Editors' Foreword. Theory Comput. 9: 579-585 (2013) - [j38]Uriel Feige, Elchanan Mossel, Dan Vilenchik:
Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. Theory Comput. 9: 617-651 (2013) - [j37]Anindya De, Elchanan Mossel:
Explicit Optimal Hardness via Gaussian Stability Results. ACM Trans. Comput. Theory 5(4): 14:1-14:26 (2013) - [c36]Anindya De, Elchanan Mossel, Joe Neeman:
Majority is stablest: discrete and SoS. STOC 2013: 477-486 - [i50]Elchanan Mossel, Anupam Prakash, Gregory Valiant:
Computation in anonymous networks. CoRR abs/1306.4151 (2013) - [i49]Florent Krzakala, Cristopher Moore, Elchanan Mossel, Joe Neeman, Allan Sly, Lenka Zdeborová, Pan Zhang:
Spectral redemption: clustering sparse networks. CoRR abs/1306.5550 (2013) - [i48]Tonci Antunovic, Elchanan Mossel, Miklós Z. Rácz:
Coexistence in preferential attachment networks. CoRR abs/1307.2893 (2013) - [i47]Varun Kanade, Elchanan Mossel:
MCMC Learning. CoRR abs/1307.3617 (2013) - [i46]Elchanan Mossel, Joe Neeman, Allan Sly:
Belief Propagation, Robust Reconstruction, and Optimal Recovery of Block Models. CoRR abs/1309.1380 (2013) - [i45]Elchanan Mossel, Joe Neeman, Allan Sly:
A Proof Of The Block Model Threshold Conjecture. CoRR abs/1311.4115 (2013) - 2012
- [j36]Marcus Isaksson, Guy Kindler, Elchanan Mossel:
The geometry of manipulation - A quantitative proof of the Gibbard-Satterthwaite theorem. Comb. 32(2): 221-250 (2012) - [j35]Lee-Ad Gottlieb, Aryeh Kontorovich, Elchanan Mossel:
VC bounds on the cardinality of nearly orthogonal function classes. Discret. Math. 312(10): 1766-1775 (2012) - [j34]Nathan Keller, Elchanan Mossel, Tomer Schlank:
A note on the Entropy/Influence conjecture. Discret. Math. 312(22): 3364-3372 (2012) - [j33]Elchanan Mossel, Omer Tamuz:
Complete characterization of functions satisfying the conditions of Arrow's theorem. Soc. Choice Welf. 39(1): 127-140 (2012) - [j32]Elchanan Mossel, Miklós Z. Rácz:
Election manipulation: the average case. SIGecom Exch. 11(2): 22-24 (2012) - [c35]Elchanan Mossel, Miklós Z. Rácz:
A quantitative gibbard-satterthwaite theorem without neutrality. STOC 2012: 1041-1060 - [i44]Elchanan Mossel, Omer Tamuz:
Bundling Customers: How to Exploit Trust Among Customers to Maximize Seller Profit. CoRR abs/1202.0969 (2012) - [i43]Anindya De, Elchanan Mossel:
Explicit Optimal Hardness via Gaussian stability results. CoRR abs/1202.5258 (2012) - [i42]Elchanan Mossel, Ariel D. Procaccia, Miklós Z. Rácz:
A Smooth Transition from Powerlessness to Absolute Power. CoRR abs/1205.2074 (2012) - [i41]Elchanan Mossel, Joe Neeman, Omer Tamuz:
Majority Dynamics and Aggregation of Information in Social Networks. CoRR abs/1207.0893 (2012) - [i40]Siu On Chan, Elchanan Mossel, Joe Neeman:
On extracting common random bits from correlated sources on large alphabets. CoRR abs/1208.5946 (2012) - [i39]Elchanan Mossel, Allan Sly, Omer Tamuz:
Strategic Learning and the Topology of Social Networks. CoRR abs/1209.5527 (2012) - [i38]Anindya De, Elchanan Mossel, Joe Neeman:
Majority is Stablest : Discrete and SoS. CoRR abs/1211.1001 (2012) - [i37]Anindya De, Elchanan Mossel:
Explicit Optimal hardness via Gaussian stability results. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j31]Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha J. Riesenfeld, Elad Verbin:
Sorting and Selection in Posets. SIAM J. Comput. 40(3): 597-622 (2011) - [j30]Constantinos Daskalakis, Elchanan Mossel, Sébastien Roch:
Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep. SIAM J. Discret. Math. 25(2): 872-893 (2011) - [j29]Tamir Tuller, Elchanan Mossel:
Co-evolution Is Incompatible with the Markov Assumption in Phylogenetics. IEEE ACM Trans. Comput. Biol. Bioinform. 8(6): 1667-1670 (2011) - [j28]Andrej Bogdanov, Elchanan Mossel:
On Extracting Common Random Bits From Correlated Sources. IEEE Trans. Inf. Theory 57(10): 6351-6355 (2011) - [c34]Nayantara Bhatnagar, Andrej Bogdanov, Elchanan Mossel:
The Computational Complexity of Estimating MCMC Convergence Time. APPROX-RANDOM 2011: 424-435 - [i36]Nathan Keller, Elchanan Mossel, Tomer Schlank:
A Note on the Entropy/Influence Conjecture. CoRR abs/1105.2651 (2011) - [i35]Elchanan Mossel, Sebastien Roch:
Identifiability and inference of non-parametric rates-across-sites models on large-scale phylogenies. CoRR abs/1108.0129 (2011) - [i34]Elchanan Mossel, Sebastien Roch:
Phylogenetic mixtures: Concentration of measure in the large-tree limit. CoRR abs/1108.3112 (2011) - [i33]Elchanan Mossel, Sébastien Roch, Allan Sly:
Robust estimation of latent tree graphical models: Inferring hidden states with inexact parameters. CoRR abs/1109.4668 (2011) - [i32]Elchanan Mossel, Miklós Z. Rácz:
A quantitative Gibbard-Satterthwaite theorem without neutrality. CoRR abs/1110.5888 (2011) - 2010
- [j27]Elchanan Mossel, Omer Tamuz:
Iterative maximum likelihood on networks. Adv. Appl. Math. 45(1): 36-49 (2010) - [j26]Jan Arpe, Elchanan Mossel:
Application of a Generalization of Russo's Formula to Learning from Multiple Random Oracles. Comb. Probab. Comput. 19(2): 183-199 (2010) - [j25]Elchanan Mossel, Sébastien Roch:
Submodularity of Influence in Social Networks: From Local to Global. SIAM J. Comput. 39(6): 2176-2188 (2010) - [j24]Elchanan Mossel, Sébastien Roch:
Incomplete Lineage Sorting: Consistent Phylogeny Estimation from Multiple Loci. IEEE ACM Trans. Comput. Biol. Bioinform. 7(1): 166-171 (2010) - [c33]Marcus Isaksson, Guy Kindler, Elchanan Mossel:
The Geometry of Manipulation: A Quantitative Proof of the Gibbard-Satterthwaite Theorem. FOCS 2010: 319-328 - [c32]Elchanan Mossel, Grant Schoenebeck:
Reaching Consensus on Social Networks. ICS 2010: 214-229 - [c31]Elchanan Mossel, Omer Tamuz:
Truthful Fair Division. SAGT 2010: 288-299 - [c30]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: 518-536 - [i31]Elchanan Mossel, Sebastien Roch, Allan Sly:
On the inference of large phylogenies with long branches: How long is too long? CoRR abs/1001.3480 (2010) - [i30]Elchanan Mossel, Omer Tamuz:
Efficient Bayesian Learning in Social Networks with Gaussian Estimators. CoRR abs/1002.0747 (2010) - [i29]Elchanan Mossel, Omer Tamuz:
Truthful Fair Division. CoRR abs/1003.5480 (2010) - [i28]Nayantara Bhatnagar, Andrej Bogdanov, Elchanan Mossel:
The Computational Complexity of Estimating Convergence Time. CoRR abs/1007.0089 (2010) - [i27]Andrej Bogdanov, Elchanan Mossel:
On extracting common random bits from correlated sources. CoRR abs/1007.2315 (2010) - [i26]Tamir Tuller, Elchanan Mossel:
Co-evolution is Incompatible with the Markov Assumption in Phylogenetics. CoRR abs/1008.0322 (2010)
2000 – 2009
- 2009
- [j23]Per Austrin, Elchanan Mossel:
Approximation Resistant Predicates from Pairwise Independence. Comput. Complex. 18(2): 249-271 (2009) - [j22]Amin Coja-Oghlan, Elchanan Mossel, Dan Vilenchik:
A Spectral Approach to Analysing Belief Propagation for 3-Colouring. Comb. Probab. Comput. 18(6): 881-912 (2009) - [j21]Elchanan Mossel, Allan Sly:
Rapid mixing of Gibbs sampling on graphs that are sparse on average. Random Struct. Algorithms 35(2): 250-270 (2009) - [j20]Irit Dinur, Elchanan Mossel, Oded Regev:
Conditional Hardness for Approximate Coloring. SIAM J. Comput. 39(3): 843-873 (2009) - [j19]Elchanan Mossel, Sébastien Roch, Mike A. Steel:
Shrinkage Effect in Ancestral Maximum Likelihood. IEEE ACM Trans. Comput. Biol. Bioinform. 6(1): 126-133 (2009) - [c29]Elchanan Mossel, Omer Tamuz:
Iterative maximum likelihood on networks. Allerton 2009: 416-423 - [c28]Constantinos Daskalakis, Elchanan Mossel, Sébastien Roch:
Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep. RECOMB 2009: 451-465 - [c27]Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha J. Riesenfeld, Elad Verbin:
Sorting and selection in posets. SODA 2009: 392-401 - [i25]Elchanan Mossel:
Arrow's Impossibility Theorem Without Unanimity. CoRR abs/0901.4727 (2009) - [i24]Elchanan Mossel, Christos H. Papadimitriou, Michael Schapira, Yaron Singer:
VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension. CoRR abs/0905.1995 (2009) - [i23]Mark Braverman, Elchanan Mossel:
Sorting from Noisy Information. CoRR abs/0910.1191 (2009) - 2008
- [c26]Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan:
The Complexity of Distinguishing Markov Random Fields. APPROX-RANDOM 2008: 331-342 - [c25]Guy Bresler, Elchanan Mossel, Allan Sly:
Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms. APPROX-RANDOM 2008: 343-356 - [c24]Per Austrin, Elchanan Mossel:
Approximation Resistant Predicates from Pairwise Independence. CCC 2008: 249-258 - [c23]Elchanan Mossel:
Gaussian Bounds for Noise Correlation of Functions and Tight Analysis of Long Codes. FOCS 2008: 156-165 - [c22]Andrea Montanari, Elchanan Mossel:
Smooth compression, Gallager bound and nonlinear sparse-graph codes. ISIT 2008: 2474-2478 - [c21]Elchanan Mossel, Allan Sly:
Rapid mixing of Gibbs sampling on graphs that are sparse on average. SODA 2008: 238-247 - [c20]Mark Braverman, Elchanan Mossel:
Noisy sorting without resampling. SODA 2008: 268-276 - [i22]Constantinos Daskalakis, Elchanan Mossel, Sebastien Roch:
Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep. CoRR abs/0801.4190 (2008) - [i21]Elchanan Mossel, Sebastien Roch, Mike A. Steel:
Shrinkage Effect in Ancestral Maximum Likelihood. CoRR abs/0802.0914 (2008) - [i20]Per Austrin, Elchanan Mossel:
Approximation Resistant Predicates From Pairwise Independence. CoRR abs/0802.2300 (2008) - [i19]Jan Arpe, Elchanan Mossel:
Multiple Random Oracles Are Better Than One. CoRR abs/0804.3817 (2008) - [i18]Jan Arpe, Elchanan Mossel:
Agnostically Learning Juntas from Random Walks. CoRR abs/0806.4210 (2008) - [i17]Per Austrin, Elchanan Mossel:
Approximation Resistant Predicates From Pairwise Independence. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j18]Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright:
A new look at survey propagation and its generalizations. J. ACM 54(4): 17 (2007) - [j17]Elchanan Mossel, Sébastien Roch:
Slow emergence of cooperation for win-stay lose-shift on trees. Mach. Learn. 67(1-2): 7-22 (2007) - [j16]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) - [j15]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) - [j14]Elchanan Mossel:
Distorted Metrics on Trees and Phylogenetic Forests. IEEE ACM Trans. Comput. Biol. Bioinform. 4(1): 108-116 (2007) - [c19]Elchanan Mossel, Sébastien Roch:
On the submodularity of influence in social networks. STOC 2007: 128-134 - [p1]Elchanan Mossel, Mike A. Steel:
How much can evolved characters tell us about the tree that generated them? Mathematics of Evolution and Phylogeny 2007 - [i16]Mark Braverman, Elchanan Mossel:
Noisy Sorting Without Resampling. CoRR abs/0707.1051 (2007) - [i15]Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha J. Riesenfeld, Elad Verbin:
Sorting and Selection in Posets. CoRR abs/0707.1532 (2007) - [i14]Elchanan Mossel, Sébastien Roch:
Incomplete Lineage Sorting: Consistent Phylogeny Estimation From Multiple Loci. CoRR abs/0710.0262 (2007) - [i13]Amin Coja-Oghlan, Elchanan Mossel, Dan Vilenchik:
A Spectral Approach to Analyzing Belief Propagation for 3-Coloring. CoRR abs/0712.0171 (2007) - [i12]Guy Bresler, Elchanan Mossel, Allan Sly:
Reconstruction of Markov Random Fields from Samples: Some Easy Observations and Algorithms. CoRR abs/0712.1402 (2007) - [i11]Constantinos Daskalakis, Alexandros G. Dimakis, Elchanan Mossel:
Connectivity and Equilibrium in Random Games. CoRR abs/math/0703902 (2007) - 2006
- [j13]Olle Häggström, Gil Kalai, Elchanan Mossel:
A law of large numbers for weighted majority. Adv. Appl. Math. 37(1): 112-123 (2006) - [j12]Elchanan Mossel, Amir Shpilka, Luca Trevisan:
On epsilon-biased generators in NC0. Random Struct. Algorithms 29(1): 56-81 (2006) - [c18]Uriel Feige, Elchanan Mossel, Dan Vilenchik:
Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. APPROX-RANDOM 2006: 339-350 - [c17]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 - [c16]Constantinos Daskalakis, Cameron Hill, Alexander Jaffe, Radu Mihaescu, Elchanan Mossel, Satish Rao:
Maximal Accurate Forests from Distance Matrices. RECOMB 2006: 281-295 - [c15]Constantinos Daskalakis, Elchanan Mossel, Sébastien Roch:
Optimal phylogenetic reconstruction. STOC 2006: 159-168 - [c14]Irit Dinur, Elchanan Mossel, Oded Regev:
Conditional hardness for approximate coloring. STOC 2006: 344-353 - [i10]Christian Borgs, Jennifer T. Chayes, Elchanan Mossel, Sebastien Roch:
The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels. CoRR abs/math/0604366 (2006) - [i9]Elchanan Mossel, Sebastien Roch:
On the Submodularity of Influence in Social Networks. CoRR abs/math/0612046 (2006) - 2005
- [j11]Elchanan Mossel, Yuval Peres:
New Coins From Old: Computing With Unknown Bias. Comb. 25(6): 707-724 (2005) - [j10]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) - [j9]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) - [c13]Elchanan Mossel, Ryan O'Donnell, Krzysztof Oleszkiewicz:
Noise stability of functions with low in.uences invariance and optimality. FOCS 2005: 21-30 - [c12]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 - [c11]Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright:
A new look at survey propagation and its generalizations. SODA 2005: 1089-1098 - [c10]Elchanan Mossel, Sébastien Roch:
Learning nonsingular phylogenies and hidden Markov models. STOC 2005: 366-375 - [i8]Elchanan Mossel, Sébastien Roch:
Learning nonsingular phylogenies and hidden Markov models. CoRR abs/cs/0502076 (2005) - [i7]Irit Dinur, Elchanan Mossel, Oded Regev:
Conditional Hardness for Approximate Coloring. CoRR abs/cs/0504062 (2005) - [i6]Elchanan Mossel, Ryan O'Donnell, Krzysztof Oleszkiewicz:
Noise stability of functions with low influences: invariance and optimality. CoRR abs/math/0503503 (2005) - [i5]Constantinos Daskalakis, Elchanan Mossel, Sebastien Roch:
Evolutionary Trees and the Ising Model on the Bethe Lattice: a Proof of Steel's Conjecture. CoRR abs/math/0509575 (2005) - [i4]Irit Dinur, Elchanan Mossel, Oded Regev:
Conditional Hardness for Approximate Coloring. Electron. Colloquium Comput. Complex. TR05 (2005) - [i3]Guy Kindler, Ryan O'Donnell, Subhash Khot, Elchanan Mossel:
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j8]Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio:
Learning functions of k relevant variables. J. Comput. Syst. Sci. 69(3): 421-434 (2004) - [c9]Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell:
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs? FOCS 2004: 146-154 - [c8]Elchanan Mossel, Yuval Peres, Alistair Sinclair:
Shuffling by Semi-Random Transpositions. FOCS 2004: 572-581 - [c7]Richard J. Lipton, Evangelos Markakis, Elchanan Mossel, Amin Saberi:
On approximately fair allocations of indivisible goods. EC 2004: 125-131 - [i2]Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright:
A New Look at Survey Propagation and its Generalizations. CoRR cs.CC/0409012 (2004) - 2003
- [j7]Elchanan Mossel:
On the Impossibility of Reconstructing Ancestral Data and Phylogenies. J. Comput. Biol. 10(5): 669-676 (2003) - [j6]Elchanan Mossel, Ryan O'Donnell:
On the noise sensitivity of monotone functions. Random Struct. Algorithms 23(3): 333-350 (2003) - [c6]Elchanan Mossel, Amir Shpilka, Luca Trevisan:
On e-Biased Generators in NC0. FOCS 2003: 136-145 - [c5]Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio:
Learning DNF from Random Walks. FOCS 2003: 189-198 - [c4]Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio:
Learning juntas. STOC 2003: 206-212 - [i1]Elchanan Mossel, Amir Shpilka, Luca Trevisan:
On epsilon-Biased Generators in NC0. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j5]Elchanan Mossel:
The Minesweeper Game: Percolation And Complexity. Comb. Probab. Comput. 11(5): 487-499 (2002) - [j4]Elchanan Mossel, Christopher Umans:
On the complexity of approximating the VC dimension. J. Comput. Syst. Sci. 65(4): 660-671 (2002) - 2001
- [c3]Elchanan Mossel, Christopher Umans:
On the Complexity of Approximating the VC Dimension. CCC 2001: 220-225 - [c2]Elchanan Mossel:
Survey: Information Flow on Trees. Graphs, Morphisms and Statistical Physics 2001: 155-170 - [c1]Claire Kenyon, Elchanan Mossel, Yuval Peres:
Glauber Dynamics on Trees and Hyperbolic Graphs. FOCS 2001: 568-578 - 2000
- [j3]Itai Benjamini, Olle Häggström, Elchanan Mossel:
On Random Graph Homomorphisms into Z. J. Comb. Theory B 78(1): 86-114 (2000) - [j2]Johan Jonasson, Elchanan Mossel, Yuval Peres:
Percolation in a dependent random environment. Random Struct. Algorithms 16(4): 333-343 (2000)
1990 – 1999
- 1998
- [j1]Elchanan Mossel:
Recursive reconstruction on periodic trees. Random Struct. Algorithms 13(1): 81-97 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-03 21:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
