default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Elchanan Mossel
@article{DBLP:journals/mor/HazlaJMR24,
author = {Jan Hazla and
Yan Jin and
Elchanan Mossel and
Govind Ramnarayan},
title = {A Geometric Model of Opinion Polarization},
journal = {Math. Oper. Res.},
volume = {49},
number = {1},
pages = {251--277},
year = {2024},
url = {https://doi.org/10.1287/moor.2023.1355},
doi = {10.1287/MOOR.2023.1355},
timestamp = {Thu, 20 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/HazlaJMR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/DharaGMS24,
author = {Souvik Dhara and
Julia Gaudio and
Elchanan Mossel and
Colin Sandon},
title = {The Power of Two Matrices in Spectral Algorithms for Community Recovery},
journal = {{IEEE} Trans. Inf. Theory},
volume = {70},
number = {5},
pages = {3599--3621},
year = {2024},
url = {https://doi.org/10.1109/TIT.2023.3346909},
doi = {10.1109/TIT.2023.3346909},
timestamp = {Fri, 17 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/DharaGMS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BrandenbergerMM24,
author = {Anna M. Brandenberger and
Cassandra Marcussen and
Elchanan Mossel and
Madhu Sudan},
editor = {Shipra Agrawal and
Aaron Roth},
title = {Errors are Robustly Tamed in Cumulative Knowledge Processes},
booktitle = {The Thirty Seventh Annual Conference on Learning Theory, June 30 -
July 3, 2023, Edmonton, Canada},
series = {Proceedings of Machine Learning Research},
volume = {247},
pages = {630--631},
publisher = {{PMLR}},
year = {2024},
url = {https://proceedings.mlr.press/v247/brandenberger24a.html},
timestamp = {Fri, 05 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/BrandenbergerMM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/ChinMMS24,
author = {Byron Chin and
Ankur Moitra and
Elchanan Mossel and
Colin Sandon},
editor = {Shipra Agrawal and
Aaron Roth},
title = {The power of an adversary in Glauber dynamics},
booktitle = {The Thirty Seventh Annual Conference on Learning Theory, June 30 -
July 3, 2023, Edmonton, Canada},
series = {Proceedings of Machine Learning Research},
volume = {247},
pages = {1102--1124},
publisher = {{PMLR}},
year = {2024},
url = {https://proceedings.mlr.press/v247/chin24a.html},
timestamp = {Fri, 05 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/ChinMMS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/HuangJM24,
author = {Han Huang and
Pakawut Jiradilok and
Elchanan Mossel},
editor = {Shipra Agrawal and
Aaron Roth},
title = {Reconstructing the Geometry of Random Geometric Graphs (Extended Abstract)},
booktitle = {The Thirty Seventh Annual Conference on Learning Theory, June 30 -
July 3, 2023, Edmonton, Canada},
series = {Proceedings of Machine Learning Research},
volume = {247},
pages = {2519--2521},
publisher = {{PMLR}},
year = {2024},
url = {https://proceedings.mlr.press/v247/huang24c.html},
timestamp = {Fri, 05 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/HuangJM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/MosselS24,
author = {Elchanan Mossel and
Anirudh Sridhar},
editor = {Shipra Agrawal and
Aaron Roth},
title = {Finding Super-spreaders in Network Cascades},
booktitle = {The Thirty Seventh Annual Conference on Learning Theory, June 30 -
July 3, 2023, Edmonton, Canada},
series = {Proceedings of Machine Learning Research},
volume = {247},
pages = {3874--3914},
publisher = {{PMLR}},
year = {2024},
url = {https://proceedings.mlr.press/v247/mossel24a.html},
timestamp = {Fri, 05 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/MosselS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ChenM24,
author = {Zongchen Chen and
Elchanan Mossel},
editor = {Venkatesan Guruswami},
title = {Influence Maximization in Ising Models},
booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {287},
pages = {30:1--30:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.30},
doi = {10.4230/LIPICS.ITCS.2024.30},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/ChenM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GaitondeM24,
author = {Jason Gaitonde and
Elchanan Mossel},
editor = {Bojan Mohar and
Igor Shinkar and
Ryan O'Donnell},
title = {A Unified Approach to Learning Ising Models: Beyond Independence and
Bounded Width},
booktitle = {Proceedings of the 56th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2024, Vancouver, BC, Canada, June 24-28, 2024},
pages = {503--514},
publisher = {{ACM}},
year = {2024},
url = {https://doi.org/10.1145/3618260.3649674},
doi = {10.1145/3618260.3649674},
timestamp = {Tue, 18 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GaitondeM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KoehlerLMM24,
author = {Frederic Koehler and
Noam Lifshitz and
Dor Minzer and
Elchanan Mossel},
editor = {Bojan Mohar and
Igor Shinkar and
Ryan O'Donnell},
title = {Influences in Mixing Measures},
booktitle = {Proceedings of the 56th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2024, Vancouver, BC, Canada, June 24-28, 2024},
pages = {527--536},
publisher = {{ACM}},
year = {2024},
url = {https://doi.org/10.1145/3618260.3649731},
doi = {10.1145/3618260.3649731},
timestamp = {Tue, 18 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KoehlerLMM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-09591,
author = {Han Huang and
Pakawut Jiradilok and
Elchanan Mossel},
title = {Reconstructing the Geometry of Random Geometric Graphs},
journal = {CoRR},
volume = {abs/2402.09591},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.09591},
doi = {10.48550/ARXIV.2402.09591},
eprinttype = {arXiv},
eprint = {2402.09591},
timestamp = {Tue, 20 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-09591.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-11990,
author = {Pakawut Jiradilok and
Elchanan Mossel},
title = {Gaussian Broadcast on Grids},
journal = {CoRR},
volume = {abs/2402.11990},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.11990},
doi = {10.48550/ARXIV.2402.11990},
eprinttype = {arXiv},
eprint = {2402.11990},
timestamp = {Thu, 21 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-11990.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-14229,
author = {Jason Gaitonde and
Elchanan Mossel},
title = {Sample-Efficient Linear Regression with Self-Selection Bias},
journal = {CoRR},
volume = {abs/2402.14229},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.14229},
doi = {10.48550/ARXIV.2402.14229},
eprinttype = {arXiv},
eprint = {2402.14229},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-14229.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-03205,
author = {Elchanan Mossel and
Anirudh Sridhar},
title = {Finding Super-spreaders in Network Cascades},
journal = {CoRR},
volume = {abs/2403.03205},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.03205},
doi = {10.48550/ARXIV.2403.03205},
eprinttype = {arXiv},
eprint = {2403.03205},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-03205.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2406-15957,
author = {Elchanan Mossel and
Allan Sly and
Youngtak Sohn},
title = {Weak recovery, hypothesis testing, and mutual information in stochastic
block models and planted factor graphs},
journal = {CoRR},
volume = {abs/2406.15957},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2406.15957},
doi = {10.48550/ARXIV.2406.15957},
eprinttype = {arXiv},
eprint = {2406.15957},
timestamp = {Wed, 24 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2406-15957.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tac/JadbabaieMMS23,
author = {Ali Jadbabaie and
Anuran Makur and
Elchanan Mossel and
Rabih Salhab},
title = {Inference in Opinion Dynamics Under Social Pressure},
journal = {{IEEE} Trans. Autom. Control.},
volume = {68},
number = {6},
pages = {3377--3392},
year = {2023},
url = {https://doi.org/10.1109/TAC.2022.3191791},
doi = {10.1109/TAC.2022.3191791},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tac/JadbabaieMMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/MosselNSSZ23,
author = {Elchanan Mossel and
Jonathan Niles{-}Weed and
Youngtak Sohn and
Nike Sun and
Ilias Zadik},
editor = {Gergely Neu and
Lorenzo Rosasco},
title = {Sharp thresholds in inference of planted subgraphs},
booktitle = {The Thirty Sixth Annual Conference on Learning Theory, {COLT} 2023,
12-15 July 2023, Bangalore, India},
series = {Proceedings of Machine Learning Research},
volume = {195},
pages = {5573--5577},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v195/mossel23a.html},
timestamp = {Wed, 06 Sep 2023 17:49:05 +0200},
biburl = {https://dblp.org/rec/conf/colt/MosselNSSZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/CornacchiaM23,
author = {Elisabetta Cornacchia and
Elchanan Mossel},
editor = {Andreas Krause and
Emma Brunskill and
Kyunghyun Cho and
Barbara Engelhardt and
Sivan Sabato and
Jonathan Scarlett},
title = {A Mathematical Model for Curriculum Learning for Parities},
booktitle = {International Conference on Machine Learning, {ICML} 2023, 23-29 July
2023, Honolulu, Hawaii, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {202},
pages = {6402--6423},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v202/cornacchia23a.html},
timestamp = {Mon, 28 Aug 2023 17:23:08 +0200},
biburl = {https://dblp.org/rec/conf/icml/CornacchiaM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Ben-EliezerMM023,
author = {Omri Ben{-}Eliezer and
Dan Mikulincer and
Elchanan Mossel and
Madhu Sudan},
editor = {Yael Tauman Kalai},
title = {Is This Correct? Let's Check!},
booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
series = {LIPIcs},
volume = {251},
pages = {15:1--15:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.15},
doi = {10.4230/LIPICS.ITCS.2023.15},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/Ben-EliezerMM023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/0002HJMPR23,
author = {Daniel Halpern and
Joseph Y. Halpern and
Ali Jadbabaie and
Elchanan Mossel and
Ariel D. Procaccia and
Manon Revel},
editor = {Kevin Leyton{-}Brown and
Jason D. Hartline and
Larry Samuelson},
title = {In Defense of Liquid Democracy},
booktitle = {Proceedings of the 24th {ACM} Conference on Economics and Computation,
{EC} 2023, London, United Kingdom, July 9-12, 2023},
pages = {852},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3580507.3597817},
doi = {10.1145/3580507.3597817},
timestamp = {Fri, 21 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sigecom/0002HJMPR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChenMZ23,
author = {Zongchen Chen and
Elchanan Mossel and
Ilias Zadik},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Almost-Linear Planted Cliques Elude the Metropolis Process},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {4504--4539},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch171},
doi = {10.1137/1.9781611977554.CH171},
timestamp = {Fri, 17 Feb 2023 09:28:57 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChenMZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MosselSS23,
author = {Elchanan Mossel and
Allan Sly and
Youngtak Sohn},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Exact Phase Transitions for Stochastic Block Models and Reconstruction
on Trees},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {96--102},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585155},
doi = {10.1145/3564246.3585155},
timestamp = {Mon, 22 May 2023 13:01:48 +0200},
biburl = {https://dblp.org/rec/conf/stoc/MosselSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-13833,
author = {Elisabetta Cornacchia and
Elchanan Mossel},
title = {A Mathematical Model for Curriculum Learning},
journal = {CoRR},
volume = {abs/2301.13833},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.13833},
doi = {10.48550/ARXIV.2301.13833},
eprinttype = {arXiv},
eprint = {2301.13833},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-13833.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-14830,
author = {Elchanan Mossel and
Jonathan Niles{-}Weed and
Youngtak Sohn and
Nike Sun and
Ilias Zadik},
title = {Sharp thresholds in inference of planted subgraphs},
journal = {CoRR},
volume = {abs/2302.14830},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.14830},
doi = {10.48550/ARXIV.2302.14830},
eprinttype = {arXiv},
eprint = {2302.14830},
timestamp = {Thu, 02 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-14830.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-07625,
author = {Frederic Koehler and
Noam Lifshitz and
Dor Minzer and
Elchanan Mossel},
title = {Influences in Mixing Measures},
journal = {CoRR},
volume = {abs/2307.07625},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.07625},
doi = {10.48550/ARXIV.2307.07625},
eprinttype = {arXiv},
eprint = {2307.07625},
timestamp = {Thu, 27 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-07625.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-05206,
author = {Zongchen Chen and
Elchanan Mossel},
title = {Influence Maximization in Ising Models},
journal = {CoRR},
volume = {abs/2309.05206},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.05206},
doi = {10.48550/ARXIV.2309.05206},
eprinttype = {arXiv},
eprint = {2309.05206},
timestamp = {Fri, 15 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-05206.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-05638,
author = {Anna M. Brandenberger and
Cassandra Marcussen and
Elchanan Mossel and
Madhu Sudan},
title = {Combinative Cumulative Knowledge Processes},
journal = {CoRR},
volume = {abs/2309.05638},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.05638},
doi = {10.48550/ARXIV.2309.05638},
eprinttype = {arXiv},
eprint = {2309.05638},
timestamp = {Fri, 15 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-05638.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-04204,
author = {David Gamarnik and
Elchanan Mossel and
Ilias Zadik},
title = {Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to
Planted Clique},
journal = {CoRR},
volume = {abs/2311.04204},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.04204},
doi = {10.48550/ARXIV.2311.04204},
eprinttype = {arXiv},
eprint = {2311.04204},
timestamp = {Tue, 14 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-04204.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-09197,
author = {Jason Gaitonde and
Elchanan Mossel},
title = {A Unified Approach to Learning Ising Models: Beyond Independence and
Bounded Width},
journal = {CoRR},
volume = {abs/2311.09197},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.09197},
doi = {10.48550/ARXIV.2311.09197},
eprinttype = {arXiv},
eprint = {2311.09197},
timestamp = {Tue, 21 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-09197.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/HoornLM22,
author = {Pim van der Hoorn and
Gabor Lippner and
Elchanan Mossel},
title = {Regular Graphs with Many Triangles are Structured},
journal = {Electron. J. Comb.},
volume = {29},
number = {1},
year = {2022},
url = {https://doi.org/10.37236/10369},
doi = {10.37236/10369},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/HoornLM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/EcklesEMR22,
author = {Dean Eckles and
Hossein Esfandiari and
Elchanan Mossel and
M. Amin Rahimian},
title = {Seeding with Costly Network Information},
journal = {Oper. Res.},
volume = {70},
number = {4},
pages = {2318--2348},
year = {2022},
url = {https://doi.org/10.1287/opre.2022.2290},
doi = {10.1287/OPRE.2022.2290},
timestamp = {Sat, 10 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/EcklesEMR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/MakurMP22,
author = {Anuran Makur and
Elchanan Mossel and
Yury Polyanskiy},
title = {Broadcasting on Two-Dimensional Regular Grids},
journal = {{IEEE} Trans. Inf. Theory},
volume = {68},
number = {10},
pages = {6297--6334},
year = {2022},
url = {https://doi.org/10.1109/TIT.2022.3177667},
doi = {10.1109/TIT.2022.3177667},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/MakurMP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/KoehlerM22,
author = {Frederic Koehler and
Elchanan Mossel},
editor = {Sanmi Koyejo and
S. Mohamed and
A. Agarwal and
Danielle Belgrave and
K. Cho and
A. Oh},
title = {Reconstruction on Trees and Low-Degree Polynomials},
booktitle = {Advances in Neural Information Processing Systems 35: Annual Conference
on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans,
LA, USA, November 28 - December 9, 2022},
year = {2022},
url = {http://papers.nips.cc/paper\_files/paper/2022/hash/77e6814d32a86b76123bd10aa7e2ad81-Abstract-Conference.html},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/KoehlerM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DharaGMS22,
author = {Souvik Dhara and
Julia Gaudio and
Elchanan Mossel and
Colin Sandon},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Spectral recovery of binary censored block models},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {3389--3416},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.134},
doi = {10.1137/1.9781611977073.134},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/DharaGMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChaseFMMS22,
author = {Gilad Chase and
Yuval Filmus and
Dor Minzer and
Elchanan Mossel and
Nitin Saurabh},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Approximate polymorphisms},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {195--202},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519966},
doi = {10.1145/3519935.3519966},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChaseFMMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-11847,
author = {Souvik Dhara and
Julia Gaudio and
Elchanan Mossel and
Colin Sandon},
title = {Spectral Algorithms Optimally Recover (Censored) Planted Dense Subgraphs},
journal = {CoRR},
volume = {abs/2203.11847},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.11847},
doi = {10.48550/ARXIV.2203.11847},
eprinttype = {arXiv},
eprint = {2203.11847},
timestamp = {Tue, 29 Mar 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-11847.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-01911,
author = {Zongchen Chen and
Elchanan Mossel and
Ilias Zadik},
title = {Almost-Linear Planted Cliques Elude the Metropolis Process},
journal = {CoRR},
volume = {abs/2204.01911},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.01911},
doi = {10.48550/ARXIV.2204.01911},
eprinttype = {arXiv},
eprint = {2204.01911},
timestamp = {Wed, 06 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-01911.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-04573,
author = {Elchanan Mossel and
David Vulakh},
title = {Efficient Reconstruction of Stochastic Pedigrees: Some Steps From
Theory to Practice},
journal = {CoRR},
volume = {abs/2204.04573},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.04573},
doi = {10.48550/ARXIV.2204.04573},
eprinttype = {arXiv},
eprint = {2204.04573},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-04573.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-03326,
author = {Elchanan Mossel and
Jonathan Niles{-}Weed and
Nike Sun and
Ilias Zadik},
title = {On the Second Kahn-Kalai Conjecture},
journal = {CoRR},
volume = {abs/2209.03326},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.03326},
doi = {10.48550/ARXIV.2209.03326},
eprinttype = {arXiv},
eprint = {2209.03326},
timestamp = {Thu, 29 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-03326.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-11347,
author = {Elchanan Mossel and
Jonathan Niles{-}Weed and
Nike Sun and
Ilias Zadik},
title = {A second moment proof of the spread lemma},
journal = {CoRR},
volume = {abs/2209.11347},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.11347},
doi = {10.48550/ARXIV.2209.11347},
eprinttype = {arXiv},
eprint = {2209.11347},
timestamp = {Thu, 29 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-11347.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-05893,
author = {Souvik Dhara and
Julia Gaudio and
Elchanan Mossel and
Colin Sandon},
title = {The Power of Two Matrices in Spectral Algorithms},
journal = {CoRR},
volume = {abs/2210.05893},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.05893},
doi = {10.48550/ARXIV.2210.05893},
eprinttype = {arXiv},
eprint = {2210.05893},
timestamp = {Wed, 19 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-05893.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-12301,
author = {Omri Ben{-}Eliezer and
Dan Mikulincer and
Elchanan Mossel and
Madhu Sudan},
title = {Is this correct? Let's check!},
journal = {CoRR},
volume = {abs/2211.12301},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.12301},
doi = {10.48550/ARXIV.2211.12301},
eprinttype = {arXiv},
eprint = {2211.12301},
timestamp = {Thu, 24 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-12301.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-03362,
author = {Elchanan Mossel and
Allan Sly and
Youngtak Sohn},
title = {Exact Phase Transitions for Stochastic Block Models and Reconstruction
on Trees},
journal = {CoRR},
volume = {abs/2212.03362},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.03362},
doi = {10.48550/ARXIV.2212.03362},
eprinttype = {arXiv},
eprint = {2212.03362},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-03362.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/HazlaJMR21,
author = {Jan Hazla and
Ali Jadbabaie and
Elchanan Mossel and
M. Amin Rahimian},
title = {Bayesian Decision Making in Groups is Hard},
journal = {Oper. Res.},
volume = {69},
number = {2},
pages = {632--654},
year = {2021},
url = {https://doi.org/10.1287/opre.2020.2000},
doi = {10.1287/OPRE.2020.2000},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/HazlaJMR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/MoitraMS21,
author = {Ankur Moitra and
Elchanan Mossel and
Colin Sandon},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Learning to Sample from Censored Markov Random Fields},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3419--3451},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/moitra21a.html},
timestamp = {Fri, 29 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/MoitraMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/MakurMP21,
author = {Anuran Makur and
Elchanan Mossel and
Yury Polyanskiy},
title = {Reconstruction on 2D Regular Grids},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2021,
Melbourne, Australia, July 12-20, 2021},
pages = {2107--2112},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/ISIT45174.2021.9518174},
doi = {10.1109/ISIT45174.2021.9518174},
timestamp = {Fri, 03 Sep 2021 10:54:55 +0200},
biburl = {https://dblp.org/rec/conf/isit/MakurMP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DeMN21,
author = {Anindya De and
Elchanan Mossel and
Joe Neeman},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Robust testing of low dimensional functions},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {584--597},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451115},
doi = {10.1145/3406325.3451115},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DeMN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-06178,
author = {Ankur Moitra and
Elchanan Mossel and
Colin Sandon},
title = {Learning to Sample from Censored Markov Random Fields},
journal = {CoRR},
volume = {abs/2101.06178},
year = {2021},
url = {https://arxiv.org/abs/2101.06178},
eprinttype = {arXiv},
eprint = {2101.06178},
timestamp = {Fri, 22 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-06178.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-11172,
author = {Ali Jadbabaie and
Anuran Makur and
Elchanan Mossel and
Rabih Salhab},
title = {Opinion Dynamics under Social Pressure},
journal = {CoRR},
volume = {abs/2104.11172},
year = {2021},
url = {https://arxiv.org/abs/2104.11172},
eprinttype = {arXiv},
eprint = {2104.11172},
timestamp = {Tue, 27 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-11172.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-00093,
author = {Gilad Chase and
Yuval Filmus and
Dor Minzer and
Elchanan Mossel and
Nitin Saurabh},
title = {Approximate polymorphisms},
journal = {CoRR},
volume = {abs/2106.00093},
year = {2021},
url = {https://arxiv.org/abs/2106.00093},
eprinttype = {arXiv},
eprint = {2106.00093},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-00093.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-08393,
author = {Ankur Moitra and
Elchanan Mossel and
Colin Sandon},
title = {Spoofing Generalization: When Can't You Trust Proprietary Models?},
journal = {CoRR},
volume = {abs/2106.08393},
year = {2021},
url = {https://arxiv.org/abs/2106.08393},
eprinttype = {arXiv},
eprint = {2106.08393},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-08393.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-06362,
author = {Omri Ben{-}Eliezer and
Elchanan Mossel and
Madhu Sudan},
title = {Information Spread with Error Correction},
journal = {CoRR},
volume = {abs/2107.06362},
year = {2021},
url = {https://arxiv.org/abs/2107.06362},
eprinttype = {arXiv},
eprint = {2107.06362},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-06362.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-11868,
author = {Daniel Halpern and
Joseph Y. Halpern and
Ali Jadbabaie and
Elchanan Mossel and
Ariel D. Procaccia and
Manon Revel},
title = {In Defense of Fluid Democracy},
journal = {CoRR},
volume = {abs/2107.11868},
year = {2021},
url = {https://arxiv.org/abs/2107.11868},
eprinttype = {arXiv},
eprint = {2107.11868},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-11868.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-06915,
author = {Frederic Koehler and
Elchanan Mossel},
title = {Reconstruction on Trees and Low-Degree Polynomials},
journal = {CoRR},
volume = {abs/2109.06915},
year = {2021},
url = {https://arxiv.org/abs/2109.06915},
eprinttype = {arXiv},
eprint = {2109.06915},
timestamp = {Wed, 22 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-06915.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DeMN21,
author = {Anindya De and
Elchanan Mossel and
Joe Neeman},
title = {Robust testing of low-dimensional functions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-005}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/005},
eprinttype = {ECCC},
eprint = {TR21-005},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DeMN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/KimKMMR20,
author = {Younhun Kim and
Frederic Koehler and
Ankur Moitra and
Elchanan Mossel and
Govind Ramnarayan},
title = {How Many Subpopulations Is Too Many? Exponential Lower Bounds for
Inferring Population Histories},
journal = {J. Comput. Biol.},
volume = {27},
number = {4},
pages = {613--625},
year = {2020},
url = {https://doi.org/10.1089/cmb.2019.0318},
doi = {10.1089/CMB.2019.0318},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/KimKMMR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BordenaveFM20,
author = {Charles Bordenave and
Uriel Feige and
Elchanan Mossel},
title = {Shotgun assembly of random jigsaw puzzles},
journal = {Random Struct. Algorithms},
volume = {56},
number = {4},
pages = {998--1015},
year = {2020},
url = {https://doi.org/10.1002/rsa.20899},
doi = {10.1002/RSA.20899},
timestamp = {Sun, 13 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BordenaveFM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MosselX20,
author = {Elchanan Mossel and
Jiaming Xu},
title = {Seeded graph matching via large neighborhood statistics},
journal = {Random Struct. Algorithms},
volume = {57},
number = {3},
pages = {570--611},
year = {2020},
url = {https://doi.org/10.1002/rsa.20934},
doi = {10.1002/RSA.20934},
timestamp = {Sat, 17 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MosselX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/MakurMP20,
author = {Anuran Makur and
Elchanan Mossel and
Yury Polyanskiy},
title = {Broadcasting on Random Directed Acyclic Graphs},
journal = {{IEEE} Trans. Inf. Theory},
volume = {66},
number = {2},
pages = {780--812},
year = {2020},
url = {https://doi.org/10.1109/TIT.2019.2935772},
doi = {10.1109/TIT.2019.2935772},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/MakurMP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/AlonMP20,
author = {Noga Alon and
Elchanan Mossel and
Robin Pemantle},
title = {Distributed Corruption Detection in Networks},
journal = {Theory Comput.},
volume = {16},
pages = {1--23},
year = {2020},
url = {https://doi.org/10.4086/toc.2020.v016a001},
doi = {10.4086/TOC.2020.V016A001},
timestamp = {Wed, 10 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toc/AlonMP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/MoitraMS20,
author = {Ankur Moitra and
Elchanan Mossel and
Colin Sandon},
editor = {Jacob D. Abernethy and
Shivani Agarwal},
title = {Parallels Between Phase Transitions and Circuit Complexity?},
booktitle = {Conference on Learning Theory, {COLT} 2020, 9-12 July 2020, Virtual
Event [Graz, Austria]},
series = {Proceedings of Machine Learning Research},
volume = {125},
pages = {2910--2946},
publisher = {{PMLR}},
year = {2020},
url = {http://proceedings.mlr.press/v125/moitra20a.html},
timestamp = {Fri, 27 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/MoitraMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FilmusLMM20,
author = {Yuval Filmus and
Noam Lifshitz and
Dor Minzer and
Elchanan Mossel},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {{AND} testing and robust judgement aggregation},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {222--233},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384254},
doi = {10.1145/3357713.3384254},
timestamp = {Mon, 18 Dec 2023 07:33:37 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FilmusLMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-11642,
author = {Anindya De and
Elchanan Mossel and
Joe Neeman},
title = {Robust testing of low-dimensional functions},
journal = {CoRR},
volume = {abs/2004.11642},
year = {2020},
url = {https://arxiv.org/abs/2004.11642},
eprinttype = {arXiv},
eprint = {2004.11642},
timestamp = {Tue, 28 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-11642.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-12580,
author = {Frederic Koehler and
Elchanan Mossel},
title = {A Phase Transition in Arrow's Theorem},
journal = {CoRR},
volume = {abs/2004.12580},
year = {2020},
url = {https://arxiv.org/abs/2004.12580},
eprinttype = {arXiv},
eprint = {2004.12580},
timestamp = {Wed, 29 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-12580.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-03810,
author = {Younhun Kim and
Elchanan Mossel and
Govind Ramnarayan and
Paxton Turner},
title = {Efficient Reconstruction of Stochastic Pedigrees},
journal = {CoRR},
volume = {abs/2005.03810},
year = {2020},
url = {https://arxiv.org/abs/2005.03810},
eprinttype = {arXiv},
eprint = {2005.03810},
timestamp = {Thu, 14 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-03810.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-01390,
author = {Anuran Makur and
Elchanan Mossel and
Yury Polyanskiy},
title = {Broadcasting on Two-Dimensional Regular Grids},
journal = {CoRR},
volume = {abs/2010.01390},
year = {2020},
url = {https://arxiv.org/abs/2010.01390},
eprinttype = {arXiv},
eprint = {2010.01390},
timestamp = {Tue, 13 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-01390.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/entropy/MosselO19,
author = {Elchanan Mossel and
Mesrob I. Ohannessian},
title = {On the Impossibility of Learning the Missing Mass},
journal = {Entropy},
volume = {21},
number = {1},
pages = {28},
year = {2019},
url = {https://doi.org/10.3390/e21010028},
doi = {10.3390/E21010028},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/entropy/MosselO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tnse/MosselR19,
author = {Elchanan Mossel and
Nathan Ross},
title = {Shotgun Assembly of Labeled Graphs},
journal = {{IEEE} Trans. Netw. Sci. Eng.},
volume = {6},
number = {2},
pages = {145--157},
year = {2019},
url = {https://doi.org/10.1109/TNSE.2017.2776913},
doi = {10.1109/TNSE.2017.2776913},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tnse/MosselR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/DeMN19,
author = {Anindya De and
Elchanan Mossel and
Joe Neeman},
title = {Noise Stability is Computable and Approximately Low-Dimensional},
journal = {Theory Comput.},
volume = {15},
pages = {1--47},
year = {2019},
url = {https://doi.org/10.4086/toc.2019.v015a006},
doi = {10.4086/TOC.2019.V015A006},
timestamp = {Tue, 09 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toc/DeMN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/DeMN19,
author = {Anindya De and
Elchanan Mossel and
Joe Neeman},
editor = {Alina Beygelzimer and
Daniel Hsu},
title = {Is your function low dimensional?},
booktitle = {Conference on Learning Theory, {COLT} 2019, 25-28 June 2019, Phoenix,
AZ, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {99},
pages = {979--993},
publisher = {{PMLR}},
year = {2019},
url = {http://proceedings.mlr.press/v99/de19a.html},
timestamp = {Mon, 08 Jul 2019 16:13:41 +0200},
biburl = {https://dblp.org/rec/conf/colt/DeMN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/HazlaJMR19,
author = {Jan Hazla and
Ali Jadbabaie and
Elchanan Mossel and
M. Amin Rahimian},
editor = {Alina Beygelzimer and
Daniel Hsu},
title = {Reasoning in Bayesian Opinion Exchange Networks Is PSPACE-Hard},
booktitle = {Conference on Learning Theory, {COLT} 2019, 25-28 June 2019, Phoenix,
AZ, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {99},
pages = {1614--1648},
publisher = {{PMLR}},
year = {2019},
url = {http://proceedings.mlr.press/v99/hazla19a.html},
timestamp = {Mon, 08 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/HazlaJMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/JainKLM19,
author = {Vishesh Jain and
Frederic Koehler and
Jingbo Liu and
Elchanan Mossel},
editor = {Alina Beygelzimer and
Daniel Hsu},
title = {Accuracy-Memory Tradeoffs and Phase Transitions in Belief Propagation},
booktitle = {Conference on Learning Theory, {COLT} 2019, 25-28 June 2019, Phoenix,
AZ, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {99},
pages = {1756--1771},
publisher = {{PMLR}},
year = {2019},
url = {http://proceedings.mlr.press/v99/jain19b.html},
timestamp = {Mon, 08 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/JainKLM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ec/EcklesEMR19,
author = {Dean Eckles and
Hossein Esfandiari and
Elchanan Mossel and
M. Amin Rahimian},
editor = {Anna R. Karlin and
Nicole Immorlica and
Ramesh Johari},
title = {Seeding with Costly Network Information},
booktitle = {Proceedings of the 2019 {ACM} Conference on Economics and Computation,
{EC} 2019, Phoenix, AZ, USA, June 24-28, 2019},
pages = {421--422},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3328526.3329651},
doi = {10.1145/3328526.3329651},
timestamp = {Thu, 04 Apr 2024 16:56:10 +0200},
biburl = {https://dblp.org/rec/conf/ec/EcklesEMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DeMN19,
author = {Anindya De and
Elchanan Mossel and
Joe Neeman},
editor = {David Zuckerman},
title = {Junta Correlation is Testable},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1549--1563},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00090},
doi = {10.1109/FOCS.2019.00090},
timestamp = {Tue, 07 Jan 2020 13:25:31 +0100},
biburl = {https://dblp.org/rec/conf/focs/DeMN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/JinMR19,
author = {Yan Jin and
Elchanan Mossel and
Govind Ramnarayan},
editor = {Avrim Blum},
title = {Being Corrupt Requires Being Clever, But Detecting Corruption Doesn't},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {45:1--45:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.45},
doi = {10.4230/LIPICS.ITCS.2019.45},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/innovations/JinMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/MakurMP19,
author = {Anuran Makur and
Elchanan Mossel and
Yury Polyanskiy},
title = {Broadcasting on Random Networks},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2019,
Paris, France, July 7-12, 2019},
pages = {1632--1636},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/ISIT.2019.8849393},
doi = {10.1109/ISIT.2019.8849393},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/MakurMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/KimKMMR19,
author = {Younhun Kim and
Frederic Koehler and
Ankur Moitra and
Elchanan Mossel and
Govind Ramnarayan},
editor = {Lenore J. Cowen},
title = {How Many Subpopulations Is Too Many? Exponential Lower Bounds for
Inferring Population Histories},
booktitle = {Research in Computational Molecular Biology - 23rd Annual International
Conference, {RECOMB} 2019, Washington, DC, USA, May 5-8, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11467},
pages = {136--157},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17083-7\_9},
doi = {10.1007/978-3-030-17083-7\_9},
timestamp = {Mon, 13 May 2019 09:30:09 +0200},
biburl = {https://dblp.org/rec/conf/recomb/KimKMMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MosselX19,
author = {Elchanan Mossel and
Jiaming Xu},
editor = {Timothy M. Chan},
title = {Seeded Graph Matching via Large Neighborhood Statistics},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {1005--1014},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.62},
doi = {10.1137/1.9781611975482.62},
timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
biburl = {https://dblp.org/rec/conf/soda/MosselX19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-04216,
author = {Anindya De and
Elchanan Mossel and
Joe Neeman},
title = {Junta correlation is testable},
journal = {CoRR},
volume = {abs/1904.04216},
year = {2019},
url = {http://arxiv.org/abs/1904.04216},
eprinttype = {arXiv},
eprint = {1904.04216},
timestamp = {Thu, 25 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-04216.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-05483,
author = {Ankur Moitra and
Elchanan Mossel and
Colin Sandon},
title = {The Circuit Complexity of Inference},
journal = {CoRR},
volume = {abs/1904.05483},
year = {2019},
url = {http://arxiv.org/abs/1904.05483},
eprinttype = {arXiv},
eprint = {1904.05483},
timestamp = {Thu, 25 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-05483.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-04325,
author = {Dean Eckles and
Hossein Esfandiari and
Elchanan Mossel and
M. Amin Rahimian},
title = {Seeding with Costly Network Information},
journal = {CoRR},
volume = {abs/1905.04325},
year = {2019},
url = {http://arxiv.org/abs/1905.04325},
eprinttype = {arXiv},
eprint = {1905.04325},
timestamp = {Mon, 27 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-04325.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-10031,
author = {Vishesh Jain and
Frederic Koehler and
Jingbo Liu and
Elchanan Mossel},
title = {Accuracy-Memory Tradeoffs and Phase Transitions in Belief Propagation},
journal = {CoRR},
volume = {abs/1905.10031},
year = {2019},
url = {http://arxiv.org/abs/1905.10031},
eprinttype = {arXiv},
eprint = {1905.10031},
timestamp = {Wed, 29 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-10031.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-05274,
author = {Jan Hazla and
Yan Jin and
Elchanan Mossel and
Govind Ramnarayan},
title = {A Geometric Model of Opinion Polarization},
journal = {CoRR},
volume = {abs/1910.05274},
year = {2019},
url = {http://arxiv.org/abs/1910.05274},
eprinttype = {arXiv},
eprint = {1910.05274},
timestamp = {Wed, 16 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-05274.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-00159,
author = {Yuval Filmus and
Noam Lifshitz and
Dor Minzer and
Elchanan Mossel},
title = {{AND} Testing and Robust Judgement Aggregation},
journal = {CoRR},
volume = {abs/1911.00159},
year = {2019},
url = {http://arxiv.org/abs/1911.00159},
eprinttype = {arXiv},
eprint = {1911.00159},
timestamp = {Mon, 11 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-00159.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/MosselNS18,
author = {Elchanan Mossel and
Joe Neeman and
Allan Sly},
title = {A Proof of the Block Model Threshold Conjecture},
journal = {Comb.},
volume = {38},
number = {3},
pages = {665--708},
year = {2018},
url = {https://doi.org/10.1007/s00493-016-3238-8},
doi = {10.1007/S00493-016-3238-8},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/MosselNS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/FilmusKMW18,
author = {Yuval Filmus and
Guy Kindler and
Elchanan Mossel and
Karl Wimmer},
title = {Invariance Principle on the Slice},
journal = {{ACM} Trans. Comput. Theory},
volume = {10},
number = {3},
pages = {11:1--11:37},
year = {2018},
url = {https://doi.org/10.1145/3186590},
doi = {10.1145/3186590},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/FilmusKMW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KannanMSY18,
author = {Sampath Kannan and
Elchanan Mossel and
Swagato Sanyal and
Grigory Yaroslavtsev},
editor = {Rocco A. Servedio},
title = {Linear Sketching over F{\_}2},
booktitle = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
2018, San Diego, CA, {USA}},
series = {LIPIcs},
volume = {102},
pages = {8:1--8:37},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.CCC.2018.8},
doi = {10.4230/LIPICS.CCC.2018.8},
timestamp = {Thu, 02 Feb 2023 13:27:04 +0100},
biburl = {https://dblp.org/rec/conf/coco/KannanMSY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/JainKM18,
author = {Vishesh Jain and
Frederic Koehler and
Elchanan Mossel},
editor = {S{\'{e}}bastien Bubeck and
Vianney Perchet and
Philippe Rigollet},
title = {The Mean-Field Approximation: Information Inequalities, Algorithms,
and Complexity},
booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9
July 2018},
series = {Proceedings of Machine Learning Research},
volume = {75},
pages = {1326--1347},
publisher = {{PMLR}},
year = {2018},
url = {http://proceedings.mlr.press/v75/jain18b.html},
timestamp = {Wed, 03 Apr 2019 18:17:23 +0200},
biburl = {https://dblp.org/rec/conf/colt/JainKM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/JainKM18a,
author = {Vishesh Jain and
Frederic Koehler and
Elchanan Mossel},
editor = {S{\'{e}}bastien Bubeck and
Vianney Perchet and
Philippe Rigollet},
title = {The Vertex Sample Complexity of Free Energy is Polynomial},
booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9
July 2018},
series = {Proceedings of Machine Learning Research},
volume = {75},
pages = {1395--1419},
publisher = {{PMLR}},
year = {2018},
url = {http://proceedings.mlr.press/v75/jain18c.html},
timestamp = {Wed, 03 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/JainKM18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/DeshpandeSMM18,
author = {Yash Deshpande and
Subhabrata Sen and
Andrea Montanari and
Elchanan Mossel},
editor = {Samy Bengio and
Hanna M. Wallach and
Hugo Larochelle and
Kristen Grauman and
Nicol{\`{o}} Cesa{-}Bianchi and
Roman Garnett},
title = {Contextual Stochastic Block Models},
booktitle = {Advances in Neural Information Processing Systems 31: Annual Conference
on Neural Information Processing Systems 2018, NeurIPS 2018, December
3-8, 2018, Montr{\'{e}}al, Canada},
pages = {8590--8602},
year = {2018},
url = {https://proceedings.neurips.cc/paper/2018/hash/08fc80de8121419136e443a70489c123-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/DeshpandeSMM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/MosselMST18,
author = {Elchanan Mossel and
Manuel Mueller{-}Frank and
Allan Sly and
Omer Tamuz},
editor = {{\'{E}}va Tardos and
Edith Elkind and
Rakesh Vohra},
title = {Social Learning Equilibria},
booktitle = {Proceedings of the 2018 {ACM} Conference on Economics and Computation,
Ithaca, NY, USA, June 18-22, 2018},
pages = {639},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3219166.3219207},
doi = {10.1145/3219166.3219207},
timestamp = {Tue, 27 Nov 2018 11:56:48 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/MosselMST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DeMN18,
author = {Anindya De and
Elchanan Mossel and
Joe Neeman},
editor = {Artur Czumaj},
title = {Non interactive simulation of correlated distributions is decidable},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {2728--2746},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.174},
doi = {10.1137/1.9781611975031.174},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/DeMN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-06126,
author = {Vishesh Jain and
Frederic Koehler and
Elchanan Mossel},
title = {The Mean-Field Approximation: Information Inequalities, Algorithms,
and Complexity},
journal = {CoRR},
volume = {abs/1802.06126},
year = {2018},
url = {http://arxiv.org/abs/1802.06126},
eprinttype = {arXiv},
eprint = {1802.06126},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-06126.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-06129,
author = {Vishesh Jain and
Frederic Koehler and
Elchanan Mossel},
title = {The Vertex Sample Complexity of Free Energy is Polynomial},
journal = {CoRR},
volume = {abs/1802.06129},
year = {2018},
url = {http://arxiv.org/abs/1802.06129},
eprinttype = {arXiv},
eprint = {1802.06129},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-06129.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-07527,
author = {Anuran Makur and
Elchanan Mossel and
Yury Polyanskiy},
title = {Broadcasting on Bounded Degree DAGs},
journal = {CoRR},
volume = {abs/1803.07527},
year = {2018},
url = {http://arxiv.org/abs/1803.07527},
eprinttype = {arXiv},
eprint = {1803.07527},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-07527.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-10262,
author = {Guy Bresler and
Frederic Koehler and
Ankur Moitra and
Elchanan Mossel},
title = {Learning Restricted Boltzmann Machines via Influence Maximization},
journal = {CoRR},
volume = {abs/1805.10262},
year = {2018},
url = {http://arxiv.org/abs/1805.10262},
eprinttype = {arXiv},
eprint = {1805.10262},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-10262.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-10057,
author = {Anindya De and
Elchanan Mossel and
Joe Neeman},
title = {Is your data low-dimensional?},
journal = {CoRR},
volume = {abs/1806.10057},
year = {2018},
url = {http://arxiv.org/abs/1806.10057},
eprinttype = {arXiv},
eprint = {1806.10057},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-10057.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-09596,
author = {Yash Deshpande and
Andrea Montanari and
Elchanan Mossel and
Subhabrata Sen},
title = {Contextual Stochastic Block Models},
journal = {CoRR},
volume = {abs/1807.09596},
year = {2018},
url = {http://arxiv.org/abs/1807.09596},
eprinttype = {arXiv},
eprint = {1807.09596},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-09596.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-10262,
author = {Elchanan Mossel and
Jiaming Xu},
title = {Seeded Graph Matching via Large Neighborhood Statistics},
journal = {CoRR},
volume = {abs/1807.10262},
year = {2018},
url = {http://arxiv.org/abs/1807.10262},
eprinttype = {arXiv},
eprint = {1807.10262},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-10262.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1809-01077,
author = {Jan Hazla and
Ali Jadbabaie and
Elchanan Mossel and
M. Amin Rahimian},
title = {Reasoning in Bayesian Opinion Exchange Networks Is PSPACE-Hard},
journal = {CoRR},
volume = {abs/1809.01077},
year = {2018},
url = {http://arxiv.org/abs/1809.01077},
eprinttype = {arXiv},
eprint = {1809.01077},
timestamp = {Fri, 05 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1809-01077.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1809-10325,
author = {Yan Jin and
Elchanan Mossel and
Govind Ramnarayan},
title = {Being Corrupt Requires Being Clever, But Detecting Corruption Doesn't},
journal = {CoRR},
volume = {abs/1809.10325},
year = {2018},
url = {http://arxiv.org/abs/1809.10325},
eprinttype = {arXiv},
eprint = {1809.10325},
timestamp = {Fri, 05 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1809-10325.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-03579,
author = {Dean Eckles and
Elchanan Mossel and
M. Amin Rahimian and
Subhabrata Sen},
title = {Long ties accelerate noisy threshold-based contagions},
journal = {CoRR},
volume = {abs/1810.03579},
year = {2018},
url = {http://arxiv.org/abs/1810.03579},
eprinttype = {arXiv},
eprint = {1810.03579},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-03579.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-03946,
author = {Anuran Makur and
Elchanan Mossel and
Yury Polyanskiy},
title = {Broadcasting on Random Directed Acyclic Graphs},
journal = {CoRR},
volume = {abs/1811.03946},
year = {2018},
url = {http://arxiv.org/abs/1811.03946},
eprinttype = {arXiv},
eprint = {1811.03946},
timestamp = {Fri, 23 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-03946.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AntunovicDMP17,
author = {Tonci Antunovic and
Yael Dekel and
Elchanan Mossel and
Yuval Peres},
title = {Competing first passage percolation on random regular graphs},
journal = {Random Struct. Algorithms},
volume = {50},
number = {4},
pages = {534--583},
year = {2017},
url = {https://doi.org/10.1002/rsa.20699},
doi = {10.1002/RSA.20699},
timestamp = {Thu, 22 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AntunovicDMP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cdc/RahimianJM17,
author = {M. Amin Rahimian and
Ali Jadbabaie and
Elchanan Mossel},
title = {Complexity of Bayesian belief exchange over a network},
booktitle = {56th {IEEE} Annual Conference on Decision and Control, {CDC} 2017,
Melbourne, Australia, December 12-15, 2017},
pages = {2611--2616},
publisher = {{IEEE}},
year = {2017},
url = {https://doi.org/10.1109/CDC.2017.8264038},
doi = {10.1109/CDC.2017.8264038},
timestamp = {Fri, 04 Mar 2022 13:29:55 +0100},
biburl = {https://dblp.org/rec/conf/cdc/RahimianJM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DeMN17,
author = {Anindya De and
Elchanan Mossel and
Joe Neeman},
editor = {Ryan O'Donnell},
title = {Noise Stability Is Computable and Approximately Low-Dimensional},
booktitle = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
Riga, Latvia},
series = {LIPIcs},
volume = {79},
pages = {10:1--10:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.CCC.2017.10},
doi = {10.4230/LIPICS.CCC.2017.10},
timestamp = {Thu, 02 Feb 2023 13:27:05 +0100},
biburl = {https://dblp.org/rec/conf/coco/DeMN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DeMN17a,
author = {Anindya De and
Elchanan Mossel and
Joe Neeman},
title = {Noise Stability is computable and low dimensional},
journal = {CoRR},
volume = {abs/1701.01483},
year = {2017},
url = {http://arxiv.org/abs/1701.01483},
eprinttype = {arXiv},
eprint = {1701.01483},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DeMN17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DeMN17,
author = {Anindya De and
Elchanan Mossel and
Joe Neeman},
title = {Non interactive simulation of correlated distributions is decidable},
journal = {CoRR},
volume = {abs/1701.01485},
year = {2017},
url = {http://arxiv.org/abs/1701.01485},
eprinttype = {arXiv},
eprint = {1701.01485},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DeMN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JadbabaieMR17,
author = {Ali Jadbabaie and
Elchanan Mossel and
M. Amin Rahimian},
title = {Bayesian Group Decisions: Algorithms and Complexity},
journal = {CoRR},
volume = {abs/1705.04770},
year = {2017},
url = {http://arxiv.org/abs/1705.04770},
eprinttype = {arXiv},
eprint = {1705.04770},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JadbabaieMR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DasarathyMNR17,
author = {Gautam Dasarathy and
Elchanan Mossel and
Robert D. Nowak and
Sebastien Roch},
title = {Coalescent-based species tree estimation: a stochastic Farris transform},
journal = {CoRR},
volume = {abs/1707.04300},
year = {2017},
url = {http://arxiv.org/abs/1707.04300},
eprinttype = {arXiv},
eprint = {1707.04300},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DasarathyMNR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-01655,
author = {Vishesh Jain and
Frederic Koehler and
Elchanan Mossel},
title = {Approximating Partition Functions in Constant Time},
journal = {CoRR},
volume = {abs/1711.01655},
year = {2017},
url = {http://arxiv.org/abs/1711.01655},
eprinttype = {arXiv},
eprint = {1711.01655},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-01655.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/AntunovicMR16,
author = {Tonci Antunovic and
Elchanan Mossel and
Mikl{\'{o}}s Z. R{\'{a}}cz},
title = {Coexistence in Preferential Attachment Networks},
journal = {Comb. Probab. Comput.},
volume = {25},
number = {6},
pages = {797--822},
year = {2016},
url = {https://doi.org/10.1017/S0963548315000383},
doi = {10.1017/S0963548315000383},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/AntunovicMR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KalaiKM16,
author = {Gil Kalai and
Nathan Keller and
Elchanan Mossel},
title = {On the correlation of increasing families},
journal = {J. Comb. Theory {A}},
volume = {144},
pages = {250--276},
year = {2016},
url = {https://doi.org/10.1016/j.jcta.2016.06.012},
doi = {10.1016/J.JCTA.2016.06.012},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/KalaiKM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ArlottoMS16,
author = {Alessandro Arlotto and
Elchanan Mossel and
J. Michael Steele},
title = {Quickest online selection of an increasing subsequence of specified
size},
journal = {Random Struct. Algorithms},
volume = {49},
number = {2},
pages = {235--252},
year = {2016},
url = {https://doi.org/10.1002/rsa.20634},
doi = {10.1002/RSA.20634},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ArlottoMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/KanadeMS16,
author = {Varun Kanade and
Elchanan Mossel and
Tselil Schramm},
title = {Global and Local Information in Clustering Labeled Block Models},
journal = {{IEEE} Trans. Inf. Theory},
volume = {62},
number = {10},
pages = {5906--5917},
year = {2016},
url = {https://doi.org/10.1109/TIT.2016.2516564},
doi = {10.1109/TIT.2016.2516564},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/KanadeMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/DeMN16,
author = {Anindya De and
Elchanan Mossel and
Joe Neeman},
title = {Majority is Stablest: Discrete and SoS},
journal = {Theory Comput.},
volume = {12},
number = {1},
pages = {1--50},
year = {2016},
url = {https://doi.org/10.4086/toc.2016.v012a004},
doi = {10.4086/TOC.2016.V012A004},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/DeMN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/allerton/MosselOT16,
author = {Elchanan Mossel and
Noah Olsman and
Omer Tamuz},
title = {Efficient Bayesian Learning in Social Networks with Gaussian Estimators},
booktitle = {54th Annual Allerton Conference on Communication, Control, and Computing,
Allerton 2016, Monticello, IL, USA, September 27-30, 2016},
pages = {425--432},
publisher = {{IEEE}},
year = {2016},
url = {https://doi.org/10.1109/ALLERTON.2016.7852262},
doi = {10.1109/ALLERTON.2016.7852262},
timestamp = {Wed, 16 Oct 2019 14:14:55 +0200},
biburl = {https://dblp.org/rec/conf/allerton/MosselOT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/HazlaHM16,
author = {Jan Hazla and
Thomas Holenstein and
Elchanan Mossel},
editor = {Klaus Jansen and
Claire Mathieu and
Jos{\'{e}} D. P. Rolim and
Chris Umans},
title = {Lower Bounds on Same-Set Inner Product in Correlated Spaces},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2016, September 7-9, 2016, Paris,
France},
series = {LIPIcs},
volume = {60},
pages = {34:1--34:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.34},
doi = {10.4230/LIPICS.APPROX-RANDOM.2016.34},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/HazlaHM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FilmusKMW16,
author = {Yuval Filmus and
Guy Kindler and
Elchanan Mossel and
Karl Wimmer},
editor = {Ran Raz},
title = {Invariance Principle on the Slice},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {15:1--15:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.15},
doi = {10.4230/LIPICS.CCC.2016.15},
timestamp = {Thu, 02 Feb 2023 13:27:05 +0100},
biburl = {https://dblp.org/rec/conf/coco/FilmusKMW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FilmusM16,
author = {Yuval Filmus and
Elchanan Mossel},
editor = {Ran Raz},
title = {Harmonicity and Invariance on Slices of the Boolean Cube},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {16:1--16:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.16},
doi = {10.4230/LIPICS.CCC.2016.16},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FilmusM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/MosselX16,
author = {Elchanan Mossel and
Jiaming Xu},
editor = {Vitaly Feldman and
Alexander Rakhlin and
Ohad Shamir},
title = {Density Evolution in the Degree-correlated Stochastic Block Model},
booktitle = {Proceedings of the 29th Conference on Learning Theory, {COLT} 2016,
New York, USA, June 23-26, 2016},
series = {{JMLR} Workshop and Conference Proceedings},
volume = {49},
pages = {1319--1356},
publisher = {JMLR.org},
year = {2016},
url = {http://proceedings.mlr.press/v49/mossel16.html},
timestamp = {Wed, 29 May 2019 08:41:47 +0200},
biburl = {https://dblp.org/rec/conf/colt/MosselX16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/MosselX16,
author = {Elchanan Mossel and
Jiaming Xu},
editor = {Madhu Sudan},
title = {Local Algorithms for Block Models with Side Information},
booktitle = {Proceedings of the 2016 {ACM} Conference on Innovations in Theoretical
Computer Science, Cambridge, MA, USA, January 14-16, 2016},
pages = {71--80},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2840728.2840749},
doi = {10.1145/2840728.2840749},
timestamp = {Tue, 14 Jun 2022 13:12:41 +0200},
biburl = {https://dblp.org/rec/conf/innovations/MosselX16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/GangulyMR16,
author = {Shirshendu Ganguly and
Elchanan Mossel and
Mikl{\'{o}}s Z. R{\'{a}}cz},
title = {Sequence assembly from corrupted shotgun reads},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2016,
Barcelona, Spain, July 10-15, 2016},
pages = {265--269},
publisher = {{IEEE}},
year = {2016},
url = {https://doi.org/10.1109/ISIT.2016.7541302},
doi = {10.1109/ISIT.2016.7541302},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/GangulyMR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GangulyMR16,
author = {Shirshendu Ganguly and
Elchanan Mossel and
Mikl{\'{o}}s Z. R{\'{a}}cz},
title = {Sequence assembly from corrupted shotgun reads},
journal = {CoRR},
volume = {abs/1601.07086},
year = {2016},
url = {http://arxiv.org/abs/1601.07086},
eprinttype = {arXiv},
eprint = {1601.07086},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GangulyMR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MosselN16,
author = {Elchanan Mossel and
Joe Neeman},
title = {Noise Stability and Correlation with Half Spaces},
journal = {CoRR},
volume = {abs/1603.01799},
year = {2016},
url = {http://arxiv.org/abs/1603.01799},
eprinttype = {arXiv},
eprint = {1603.01799},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MosselN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BordenaveFM16,
author = {Charles Bordenave and
Uriel Feige and
Elchanan Mossel},
title = {Shotgun Assembly of Random Jigsaw Puzzles},
journal = {CoRR},
volume = {abs/1605.03086},
year = {2016},
url = {http://arxiv.org/abs/1605.03086},
eprinttype = {arXiv},
eprint = {1605.03086},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BordenaveFM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KannanMY16,
author = {Sampath Kannan and
Elchanan Mossel and
Grigory Yaroslavtsev},
title = {Linear Sketching over {\textdollar}{\textbackslash}mathbb F{\_}2{\textdollar}},
journal = {CoRR},
volume = {abs/1611.01879},
year = {2016},
url = {http://arxiv.org/abs/1611.01879},
eprinttype = {arXiv},
eprint = {1611.01879},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KannanMY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Mossel16,
author = {Elchanan Mossel},
title = {Deep Learning and Hierarchal Generative Models},
journal = {CoRR},
volume = {abs/1612.09057},
year = {2016},
url = {http://arxiv.org/abs/1612.09057},
eprinttype = {arXiv},
eprint = {1612.09057},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Mossel16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MosselKY16,
author = {Elchanan Mossel and
Sampath Kannan and
Grigory Yaroslavtsev},
title = {Linear Sketching over {\(\mathbb{F}\)}\({}_{\mbox{2}}\)},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-174}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/174},
eprinttype = {ECCC},
eprint = {TR16-174},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MosselKY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/MosselR15,
author = {Elchanan Mossel and
Mikl{\'{o}}s Z. R{\'{a}}cz},
title = {A quantitative Gibbard-Satterthwaite theorem without neutrality},
journal = {Comb.},
volume = {35},
number = {3},
pages = {317--387},
year = {2015},
url = {https://doi.org/10.1007/s00493-014-2979-5},
doi = {10.1007/S00493-014-2979-5},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/MosselR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/KalaiM15,
author = {Gil Kalai and
Elchanan Mossel},
title = {Sharp Thresholds for Monotone Non-Boolean Functions and Social Choice
Theory},
journal = {Math. Oper. Res.},
volume = {40},
number = {4},
pages = {915--925},
year = {2015},
url = {https://doi.org/10.1287/moor.2014.0703},
doi = {10.1287/MOOR.2014.0703},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/KalaiM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tnse/BubeckMR15,
author = {S{\'{e}}bastien Bubeck and
Elchanan Mossel and
Mikl{\'{o}}s Z. R{\'{a}}cz},
title = {On the Influence of the Seed Graph in the Preferential Attachment
Model},
journal = {{IEEE} Trans. Netw. Sci. Eng.},
volume = {2},
number = {1},
pages = {30--39},
year = {2015},
url = {https://doi.org/10.1109/TNSE.2015.2397592},
doi = {10.1109/TNSE.2015.2397592},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tnse/BubeckMR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/MosselR15,
author = {Elchanan Mossel and
S{\'{e}}bastien Roch},
editor = {Naveen Garg and
Klaus Jansen and
Anup Rao and
Jos{\'{e}} D. P. Rolim},
title = {Distance-based Species Tree Estimation: Information-Theoretic Trade-off
between Number of Loci and Sequence Length under the Coalescent},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {40},
pages = {931--942},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.931},
doi = {10.4230/LIPICS.APPROX-RANDOM.2015.931},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/MosselR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/KanadeM15,
author = {Varun Kanade and
Elchanan Mossel},
editor = {Peter Gr{\"{u}}nwald and
Elad Hazan and
Satyen Kale},
title = {{MCMC} Learning},
booktitle = {Proceedings of The 28th Conference on Learning Theory, {COLT} 2015,
Paris, France, July 3-6, 2015},
series = {{JMLR} Workshop and Conference Proceedings},
volume = {40},
pages = {1101--1128},
publisher = {JMLR.org},
year = {2015},
url = {http://proceedings.mlr.press/v40/Kanade15.html},
timestamp = {Wed, 29 May 2019 08:41:46 +0200},
biburl = {https://dblp.org/rec/conf/colt/KanadeM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/HeilmanMN15,
author = {Steven Heilman and
Elchanan Mossel and
Joe Neeman},
editor = {Tim Roughgarden},
title = {Standard Simplices and Pluralities are Not the Most Noise Stable},
booktitle = {Proceedings of the 2015 Conference on Innovations in Theoretical Computer
Science, {ITCS} 2015, Rehovot, Israel, January 11-13, 2015},
pages = {255},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2688073.2688076},
doi = {10.1145/2688073.2688076},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/HeilmanMN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MosselNS15,
author = {Elchanan Mossel and
Joe Neeman and
Allan Sly},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {Consistency Thresholds for the Planted Bisection Model},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {69--75},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746603},
doi = {10.1145/2746539.2746603},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MosselNS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MosselO15,
author = {Elchanan Mossel and
Mesrob I. Ohannessian},
title = {On the Impossibility of Learning the Missing Mass},
journal = {CoRR},
volume = {abs/1503.03613},
year = {2015},
url = {http://arxiv.org/abs/1503.03613},
eprinttype = {arXiv},
eprint = {1503.03613},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MosselO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MosselR15,
author = {Elchanan Mossel and
S{\'{e}}bastien Roch},
title = {Distance-based species tree estimation: information-theoretic trade-off
between number of loci and sequence length under the coalescent},
journal = {CoRR},
volume = {abs/1504.05289},
year = {2015},
url = {http://arxiv.org/abs/1504.05289},
eprinttype = {arXiv},
eprint = {1504.05289},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MosselR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MosselR15a,
author = {Elchanan Mossel and
Nathan Ross},
title = {Shotgun assembly of labeled graphs},
journal = {CoRR},
volume = {abs/1504.07682},
year = {2015},
url = {http://arxiv.org/abs/1504.07682},
eprinttype = {arXiv},
eprint = {1504.07682},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MosselR15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlonMP15,
author = {Noga Alon and
Elchanan Mossel and
Robin Pemantle},
title = {Corruption Detection on Networks},
journal = {CoRR},
volume = {abs/1505.05637},
year = {2015},
url = {http://arxiv.org/abs/1505.05637},
eprinttype = {arXiv},
eprint = {1505.05637},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlonMP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MosselX15,
author = {Elchanan Mossel and
Jiaming Xu},
title = {Local Algorithms for Block Models with Side Information},
journal = {CoRR},
volume = {abs/1508.02344},
year = {2015},
url = {http://arxiv.org/abs/1508.02344},
eprinttype = {arXiv},
eprint = {1508.02344},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MosselX15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MosselX15a,
author = {Elchanan Mossel and
Jiaming Xu},
title = {Density Evolution in the Degree-correlated Stochastic Block Model},
journal = {CoRR},
volume = {abs/1509.03281},
year = {2015},
url = {http://arxiv.org/abs/1509.03281},
eprinttype = {arXiv},
eprint = {1509.03281},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MosselX15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HazlaHM15,
author = {Jan Hazla and
Thomas Holenstein and
Elchanan Mossel},
title = {Lower Bounds on Same-Set Inner Product in Correlated Spaces},
journal = {CoRR},
volume = {abs/1509.06191},
year = {2015},
url = {http://arxiv.org/abs/1509.06191},
eprinttype = {arXiv},
eprint = {1509.06191},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HazlaHM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aamas/MosselNT14,
author = {Elchanan Mossel and
Joe Neeman and
Omer Tamuz},
title = {Majority dynamics and aggregation of information in social networks},
journal = {Auton. Agents Multi Agent Syst.},
volume = {28},
number = {3},
pages = {408--429},
year = {2014},
url = {https://doi.org/10.1007/s10458-013-9230-4},
doi = {10.1007/S10458-013-9230-4},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aamas/MosselNT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/ChanMN14,
author = {Siu On Chan and
Elchanan Mossel and
Joe Neeman},
title = {On Extracting Common Random Bits From Correlated Sources on Large
Alphabets},
journal = {{IEEE} Trans. Inf. Theory},
volume = {60},
number = {3},
pages = {1630--1637},
year = {2014},
url = {https://doi.org/10.1109/TIT.2014.2301155},
doi = {10.1109/TIT.2014.2301155},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/ChanMN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KanadeMS14,
author = {Varun Kanade and
Elchanan Mossel and
Tselil Schramm},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Nikhil R. Devanur and
Cristopher Moore},
title = {Global and Local Information in Clustering Labeled Block Models},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
Spain},
series = {LIPIcs},
volume = {28},
pages = {779--792},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.779},
doi = {10.4230/LIPICS.APPROX-RANDOM.2014.779},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/KanadeMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/MosselNS14,
author = {Elchanan Mossel and
Joe Neeman and
Allan Sly},
editor = {Maria{-}Florina Balcan and
Vitaly Feldman and
Csaba Szepesv{\'{a}}ri},
title = {Belief propagation, robust reconstruction and optimal recovery of
block models},
booktitle = {Proceedings of The 27th Conference on Learning Theory, {COLT} 2014,
Barcelona, Spain, June 13-15, 2014},
series = {{JMLR} Workshop and Conference Proceedings},
volume = {35},
pages = {356--370},
publisher = {JMLR.org},
year = {2014},
url = {http://proceedings.mlr.press/v35/mossel14.html},
timestamp = {Wed, 29 May 2019 08:41:46 +0200},
biburl = {https://dblp.org/rec/conf/colt/MosselNS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MosselT14,
author = {Elchanan Mossel and
Omer Tamuz},
title = {Opinion Exchange Dynamics},
journal = {CoRR},
volume = {abs/1401.4770},
year = {2014},
url = {http://arxiv.org/abs/1401.4770},
eprinttype = {arXiv},
eprint = {1401.4770},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MosselT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BubeckMR14,
author = {S{\'{e}}bastien Bubeck and
Elchanan Mossel and
Mikl{\'{o}}s Z. R{\'{a}}cz},
title = {On the influence of the seed graph in the preferential attachment
model},
journal = {CoRR},
volume = {abs/1401.4849},
year = {2014},
url = {http://arxiv.org/abs/1401.4849},
eprinttype = {arXiv},
eprint = {1401.4849},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BubeckMR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HeilmanMN14,
author = {Steven Heilman and
Elchanan Mossel and
Joe Neeman},
title = {Standard Simplices and Pluralities are Not the Most Noise Stable},
journal = {CoRR},
volume = {abs/1403.0885},
year = {2014},
url = {http://arxiv.org/abs/1403.0885},
eprinttype = {arXiv},
eprint = {1403.0885},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HeilmanMN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KanadeMS14,
author = {Varun Kanade and
Elchanan Mossel and
Tselil Schramm},
title = {Global and Local Information in Clustering Labeled Block Models},
journal = {CoRR},
volume = {abs/1404.6325},
year = {2014},
url = {http://arxiv.org/abs/1404.6325},
eprinttype = {arXiv},
eprint = {1404.6325},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KanadeMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HeilmanMO14,
author = {Steven Heilman and
Elchanan Mossel and
Krzysztof Oleszkiewicz},
title = {Strong Contraction and Influences in Tail Spaces},
journal = {CoRR},
volume = {abs/1406.7855},
year = {2014},
url = {http://arxiv.org/abs/1406.7855},
eprinttype = {arXiv},
eprint = {1406.7855},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HeilmanMO14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MosselNS14,
author = {Elchanan Mossel and
Joe Neeman and
Allan Sly},
title = {Consistency Thresholds for Binary Symmetric Block Models},
journal = {CoRR},
volume = {abs/1407.1591},
year = {2014},
url = {http://arxiv.org/abs/1407.1591},
eprinttype = {arXiv},
eprint = {1407.1591},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MosselNS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BubeckEMR14,
author = {S{\'{e}}bastien Bubeck and
Ronen Eldan and
Elchanan Mossel and
Mikl{\'{o}}s Z. R{\'{a}}cz},
title = {From trees to seeds: on the inference of the seed from large trees
in the uniform attachment model},
journal = {CoRR},
volume = {abs/1409.7685},
year = {2014},
url = {http://arxiv.org/abs/1409.7685},
eprinttype = {arXiv},
eprint = {1409.7685},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BubeckEMR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HarelMST14,
author = {Matan Harel and
Elchanan Mossel and
Philipp Strack and
Omer Tamuz},
title = {On the Speed of Social Learning},
journal = {CoRR},
volume = {abs/1412.7172},
year = {2014},
url = {http://arxiv.org/abs/1412.7172},
eprinttype = {arXiv},
eprint = {1412.7172},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HarelMST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/MosselPR13,
author = {Elchanan Mossel and
Ariel D. Procaccia and
Mikl{\'{o}}s Z. R{\'{a}}cz},
title = {A Smooth Transition from Powerlessness to Absolute Power},
journal = {J. Artif. Intell. Res.},
volume = {48},
pages = {923--951},
year = {2013},
url = {https://doi.org/10.1613/jair.4125},
doi = {10.1613/JAIR.4125},
timestamp = {Mon, 21 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/MosselPR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/order/BhatnagarCMS13,
author = {Nayantara Bhatnagar and
Nick Crawford and
Elchanan Mossel and
Arnab Sen},
title = {Scaling Limits for Width Two Partially Ordered Sets: The Incomparability
Window},
journal = {Order},
volume = {30},
number = {1},
pages = {289--311},
year = {2013},
url = {https://doi.org/10.1007/s11083-011-9244-y},
doi = {10.1007/S11083-011-9244-Y},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/order/BhatnagarCMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BreslerMS13,
author = {Guy Bresler and
Elchanan Mossel and
Allan Sly},
title = {Reconstruction of Markov Random Fields from Samples: Some Observations
and Algorithms},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {2},
pages = {563--578},
year = {2013},
url = {https://doi.org/10.1137/100796029},
doi = {10.1137/100796029},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BreslerMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/MosselT13,
author = {Elchanan Mossel and
Omer Tamuz},
title = {Making Consensus Tractable},
journal = {{ACM} Trans. Economics and Comput.},
volume = {1},
number = {4},
pages = {20:1--20:19},
year = {2013},
url = {https://doi.org/10.1145/2542174.2542176},
doi = {10.1145/2542174.2542176},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/teco/MosselT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/MosselRS13,
author = {Elchanan Mossel and
S{\'{e}}bastien Roch and
Allan Sly},
title = {Robust Estimation of Latent Tree Graphical Models: Inferring Hidden
States With Inexact Parameters},
journal = {{IEEE} Trans. Inf. Theory},
volume = {59},
number = {7},
pages = {4357--4373},
year = {2013},
url = {https://doi.org/10.1109/TIT.2013.2251927},
doi = {10.1109/TIT.2013.2251927},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/MosselRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/MosselO13,
author = {Elchanan Mossel and
Ryan O'Donnell},
title = {Special Issue on Analysis of Boolean Functions: Guest Editors' Foreword},
journal = {Theory Comput.},
volume = {9},
pages = {579--585},
year = {2013},
url = {https://doi.org/10.4086/toc.2013.v009a016},
doi = {10.4086/TOC.2013.V009A016},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/MosselO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/FeigeMV13,
author = {Uriel Feige and
Elchanan Mossel and
Dan Vilenchik},
title = {Complete Convergence of Message Passing Algorithms for Some Satisfiability
Problems},
journal = {Theory Comput.},
volume = {9},
pages = {617--651},
year = {2013},
url = {https://doi.org/10.4086/toc.2013.v009a019},
doi = {10.4086/TOC.2013.V009A019},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/FeigeMV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/DeM13,
author = {Anindya De and
Elchanan Mossel},
title = {Explicit Optimal Hardness via Gaussian Stability Results},
journal = {{ACM} Trans. Comput. Theory},
volume = {5},
number = {4},
pages = {14:1--14:26},
year = {2013},
url = {https://doi.org/10.1145/2505766},
doi = {10.1145/2505766},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/DeM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DeMN13,
author = {Anindya De and
Elchanan Mossel and
Joe Neeman},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Majority is stablest: discrete and SoS},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {477--486},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488668},
doi = {10.1145/2488608.2488668},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DeMN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MosselPV13,
author = {Elchanan Mossel and
Anupam Prakash and
Gregory Valiant},
title = {Computation in anonymous networks},
journal = {CoRR},
volume = {abs/1306.4151},
year = {2013},
url = {http://arxiv.org/abs/1306.4151},
eprinttype = {arXiv},
eprint = {1306.4151},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MosselPV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KrzakalaMMNSZZ13,
author = {Florent Krzakala and
Cristopher Moore and
Elchanan Mossel and
Joe Neeman and
Allan Sly and
Lenka Zdeborov{\'{a}} and
Pan Zhang},
title = {Spectral redemption: clustering sparse networks},
journal = {CoRR},
volume = {abs/1306.5550},
year = {2013},
url = {http://arxiv.org/abs/1306.5550},
eprinttype = {arXiv},
eprint = {1306.5550},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KrzakalaMMNSZZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AntunovicMR13,
author = {Tonci Antunovic and
Elchanan Mossel and
Mikl{\'{o}}s Z. R{\'{a}}cz},
title = {Coexistence in preferential attachment networks},
journal = {CoRR},
volume = {abs/1307.2893},
year = {2013},
url = {http://arxiv.org/abs/1307.2893},
eprinttype = {arXiv},
eprint = {1307.2893},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AntunovicMR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KanadeM13,
author = {Varun Kanade and
Elchanan Mossel},
title = {{MCMC} Learning},
journal = {CoRR},
volume = {abs/1307.3617},
year = {2013},
url = {http://arxiv.org/abs/1307.3617},
eprinttype = {arXiv},
eprint = {1307.3617},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KanadeM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MosselNS13,
author = {Elchanan Mossel and
Joe Neeman and
Allan Sly},
title = {Belief Propagation, Robust Reconstruction, and Optimal Recovery of
Block Models},
journal = {CoRR},
volume = {abs/1309.1380},
year = {2013},
url = {http://arxiv.org/abs/1309.1380},
eprinttype = {arXiv},
eprint = {1309.1380},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MosselNS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MosselNS13a,
author = {Elchanan Mossel and
Joe Neeman and
Allan Sly},
title = {A Proof Of The Block Model Threshold Conjecture},
journal = {CoRR},
volume = {abs/1311.4115},
year = {2013},
url = {http://arxiv.org/abs/1311.4115},
eprinttype = {arXiv},
eprint = {1311.4115},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MosselNS13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/IsakssonKM12,
author = {Marcus Isaksson and
Guy Kindler and
Elchanan Mossel},
title = {The geometry of manipulation - {A} quantitative proof of the Gibbard-Satterthwaite
theorem},
journal = {Comb.},
volume = {32},
number = {2},
pages = {221--250},
year = {2012},
url = {https://doi.org/10.1007/s00493-012-2704-1},
doi = {10.1007/S00493-012-2704-1},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/IsakssonKM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GottliebKM12,
author = {Lee{-}Ad Gottlieb and
Aryeh Kontorovich and
Elchanan Mossel},
title = {{VC} bounds on the cardinality of nearly orthogonal function classes},
journal = {Discret. Math.},
volume = {312},
number = {10},
pages = {1766--1775},
year = {2012},
url = {https://doi.org/10.1016/j.disc.2012.01.030},
doi = {10.1016/J.DISC.2012.01.030},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GottliebKM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KellerMS12,
author = {Nathan Keller and
Elchanan Mossel and
Tomer Schlank},
title = {A note on the Entropy/Influence conjecture},
journal = {Discret. Math.},
volume = {312},
number = {22},
pages = {3364--3372},
year = {2012},
url = {https://doi.org/10.1016/j.disc.2012.07.031},
doi = {10.1016/J.DISC.2012.07.031},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/KellerMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scw/MosselT12,
author = {Elchanan Mossel and
Omer Tamuz},
title = {Complete characterization of functions satisfying the conditions of
Arrow's theorem},
journal = {Soc. Choice Welf.},
volume = {39},
number = {1},
pages = {127--140},
year = {2012},
url = {https://doi.org/10.1007/s00355-011-0547-0},
doi = {10.1007/S00355-011-0547-0},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scw/MosselT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigecom/MosselR12,
author = {Elchanan Mossel and
Mikl{\'{o}}s Z. R{\'{a}}cz},
title = {Election manipulation: the average case},
journal = {SIGecom Exch.},
volume = {11},
number = {2},
pages = {22--24},
year = {2012},
url = {https://doi.org/10.1145/2509002.2509007},
doi = {10.1145/2509002.2509007},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigecom/MosselR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MosselR12,
author = {Elchanan Mossel and
Mikl{\'{o}}s Z. R{\'{a}}cz},
editor = {Howard J. Karloff and
Toniann Pitassi},
title = {A quantitative gibbard-satterthwaite theorem without neutrality},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference,
{STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
pages = {1041--1060},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2213977.2214071},
doi = {10.1145/2213977.2214071},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MosselR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-0969,
author = {Elchanan Mossel and
Omer Tamuz},
title = {Bundling Customers: How to Exploit Trust Among Customers to Maximize
Seller Profit},
journal = {CoRR},
volume = {abs/1202.0969},
year = {2012},
url = {http://arxiv.org/abs/1202.0969},
eprinttype = {arXiv},
eprint = {1202.0969},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-0969.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-5258,
author = {Anindya De and
Elchanan Mossel},
title = {Explicit Optimal Hardness via Gaussian stability results},
journal = {CoRR},
volume = {abs/1202.5258},
year = {2012},
url = {http://arxiv.org/abs/1202.5258},
eprinttype = {arXiv},
eprint = {1202.5258},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-5258.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1205-2074,
author = {Elchanan Mossel and
Ariel D. Procaccia and
Mikl{\'{o}}s Z. R{\'{a}}cz},
title = {A Smooth Transition from Powerlessness to Absolute Power},
journal = {CoRR},
volume = {abs/1205.2074},
year = {2012},
url = {http://arxiv.org/abs/1205.2074},
eprinttype = {arXiv},
eprint = {1205.2074},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1205-2074.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-0893,
author = {Elchanan Mossel and
Joe Neeman and
Omer Tamuz},
title = {Majority Dynamics and Aggregation of Information in Social Networks},
journal = {CoRR},
volume = {abs/1207.0893},
year = {2012},
url = {http://arxiv.org/abs/1207.0893},
eprinttype = {arXiv},
eprint = {1207.0893},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-0893.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1208-5946,
author = {Siu On Chan and
Elchanan Mossel and
Joe Neeman},
title = {On extracting common random bits from correlated sources on large
alphabets},
journal = {CoRR},
volume = {abs/1208.5946},
year = {2012},
url = {http://arxiv.org/abs/1208.5946},
eprinttype = {arXiv},
eprint = {1208.5946},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1208-5946.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1209-5527,
author = {Elchanan Mossel and
Allan Sly and
Omer Tamuz},
title = {Strategic Learning and the Topology of Social Networks},
journal = {CoRR},
volume = {abs/1209.5527},
year = {2012},
url = {http://arxiv.org/abs/1209.5527},
eprinttype = {arXiv},
eprint = {1209.5527},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1209-5527.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-1001,
author = {Anindya De and
Elchanan Mossel and
Joe Neeman},
title = {Majority is Stablest : Discrete and SoS},
journal = {CoRR},
volume = {abs/1211.1001},
year = {2012},
url = {http://arxiv.org/abs/1211.1001},
eprinttype = {arXiv},
eprint = {1211.1001},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-1001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DeM12,
author = {Anindya De and
Elchanan Mossel},
title = {Explicit Optimal hardness via Gaussian stability results},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-016}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/016},
eprinttype = {ECCC},
eprint = {TR12-016},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DeM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DaskalakisKMRV11,
author = {Constantinos Daskalakis and
Richard M. Karp and
Elchanan Mossel and
Samantha J. Riesenfeld and
Elad Verbin},
title = {Sorting and Selection in Posets},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {3},
pages = {597--622},
year = {2011},
url = {https://doi.org/10.1137/070697720},
doi = {10.1137/070697720},
timestamp = {Wed, 25 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/DaskalakisKMRV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DaskalakisMR11,
author = {Constantinos Daskalakis and
Elchanan Mossel and
S{\'{e}}bastien Roch},
title = {Phylogenies without Branch Bounds: Contracting the Short, Pruning
the Deep},
journal = {{SIAM} J. Discret. Math.},
volume = {25},
number = {2},
pages = {872--893},
year = {2011},
url = {https://doi.org/10.1137/09075576X},
doi = {10.1137/09075576X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DaskalakisMR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/TullerM11,
author = {Tamir Tuller and
Elchanan Mossel},
title = {Co-evolution Is Incompatible with the Markov Assumption in Phylogenetics},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {8},
number = {6},
pages = {1667--1670},
year = {2011},
url = {https://doi.org/10.1109/TCBB.2010.124},
doi = {10.1109/TCBB.2010.124},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/TullerM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/BogdanovM11,
author = {Andrej Bogdanov and
Elchanan Mossel},
title = {On Extracting Common Random Bits From Correlated Sources},
journal = {{IEEE} Trans. Inf. Theory},
volume = {57},
number = {10},
pages = {6351--6355},
year = {2011},
url = {https://doi.org/10.1109/TIT.2011.2134067},
doi = {10.1109/TIT.2011.2134067},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/BogdanovM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BhatnagarBM11,
author = {Nayantara Bhatnagar and
Andrej Bogdanov and
Elchanan Mossel},
editor = {Leslie Ann Goldberg and
Klaus Jansen and
R. Ravi and
Jos{\'{e}} D. P. Rolim},
title = {The Computational Complexity of Estimating {MCMC} Convergence Time},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
17-19, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6845},
pages = {424--435},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22935-0\_36},
doi = {10.1007/978-3-642-22935-0\_36},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BhatnagarBM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-2651,
author = {Nathan Keller and
Elchanan Mossel and
Tomer Schlank},
title = {A Note on the Entropy/Influence Conjecture},
journal = {CoRR},
volume = {abs/1105.2651},
year = {2011},
url = {http://arxiv.org/abs/1105.2651},
eprinttype = {arXiv},
eprint = {1105.2651},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-2651.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MosselR11,
author = {Elchanan Mossel and
Sebastien Roch},
title = {Identifiability and inference of non-parametric rates-across-sites
models on large-scale phylogenies},
journal = {CoRR},
volume = {abs/1108.0129},
year = {2011},
url = {http://arxiv.org/abs/1108.0129},
eprinttype = {arXiv},
eprint = {1108.0129},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MosselR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MosselR11a,
author = {Elchanan Mossel and
Sebastien Roch},
title = {Phylogenetic mixtures: Concentration of measure in the large-tree
limit},
journal = {CoRR},
volume = {abs/1108.3112},
year = {2011},
url = {http://arxiv.org/abs/1108.3112},
eprinttype = {arXiv},
eprint = {1108.3112},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MosselR11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-4668,
author = {Elchanan Mossel and
S{\'{e}}bastien Roch and
Allan Sly},
title = {Robust estimation of latent tree graphical models: Inferring hidden
states with inexact parameters},
journal = {CoRR},
volume = {abs/1109.4668},
year = {2011},
url = {http://arxiv.org/abs/1109.4668},
eprinttype = {arXiv},
eprint = {1109.4668},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1109-4668.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-5888,
author = {Elchanan Mossel and
Mikl{\'{o}}s Z. R{\'{a}}cz},
title = {A quantitative Gibbard-Satterthwaite theorem without neutrality},
journal = {CoRR},
volume = {abs/1110.5888},
year = {2011},
url = {http://arxiv.org/abs/1110.5888},
eprinttype = {arXiv},
eprint = {1110.5888},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-5888.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aam/MosselT10,
author = {Elchanan Mossel and
Omer Tamuz},
title = {Iterative maximum likelihood on networks},
journal = {Adv. Appl. Math.},
volume = {45},
number = {1},
pages = {36--49},
year = {2010},
url = {https://doi.org/10.1016/j.aam.2009.11.004},
doi = {10.1016/J.AAM.2009.11.004},
timestamp = {Thu, 28 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aam/MosselT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/ArpeM10,
author = {Jan Arpe and
Elchanan Mossel},
title = {Application of a Generalization of Russo's Formula to Learning from
Multiple Random Oracles},
journal = {Comb. Probab. Comput.},
volume = {19},
number = {2},
pages = {183--199},
year = {2010},
url = {https://doi.org/10.1017/S0963548309990277},
doi = {10.1017/S0963548309990277},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/ArpeM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MosselR10,
author = {Elchanan Mossel and
S{\'{e}}bastien Roch},
title = {Submodularity of Influence in Social Networks: From Local to Global},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {6},
pages = {2176--2188},
year = {2010},
url = {https://doi.org/10.1137/080714452},
doi = {10.1137/080714452},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MosselR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/MosselR10,
author = {Elchanan Mossel and
S{\'{e}}bastien Roch},
title = {Incomplete Lineage Sorting: Consistent Phylogeny Estimation from Multiple
Loci},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {7},
number = {1},
pages = {166--171},
year = {2010},
url = {https://doi.org/10.1109/TCBB.2008.66},
doi = {10.1109/TCBB.2008.66},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/MosselR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/IsakssonKM10,
author = {Marcus Isaksson and
Guy Kindler and
Elchanan Mossel},
title = {The Geometry of Manipulation: {A} Quantitative Proof of the Gibbard-Satterthwaite
Theorem},
booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
pages = {319--328},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/FOCS.2010.37},
doi = {10.1109/FOCS.2010.37},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/IsakssonKM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/MosselS10,
author = {Elchanan Mossel and
Grant Schoenebeck},
editor = {Andrew Chi{-}Chih Yao},
title = {Reaching Consensus on Social Networks},
booktitle = {Innovations in Computer Science - {ICS} 2010, Tsinghua University,
Beijing, China, January 5-7, 2010. Proceedings},
pages = {214--229},
publisher = {Tsinghua University Press},
year = {2010},
url = {http://conference.iiis.tsinghua.edu.cn/ICS2010/content/papers/18.html},
timestamp = {Wed, 04 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/MosselS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/MosselT10,
author = {Elchanan Mossel and
Omer Tamuz},
editor = {Spyros C. Kontogiannis and
Elias Koutsoupias and
Paul G. Spirakis},
title = {Truthful Fair Division},
booktitle = {Algorithmic Game Theory - Third International Symposium, {SAGT} 2010,
Athens, Greece, October 18-20, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6386},
pages = {288--299},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16170-4\_25},
doi = {10.1007/978-3-642-16170-4\_25},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sagt/MosselT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BuchfuhrerDFKMPSSU10,
author = {David Buchfuhrer and
Shaddin Dughmi and
Hu Fu and
Robert Kleinberg and
Elchanan Mossel and
Christos H. Papadimitriou and
Michael Schapira and
Yaron Singer and
Christopher Umans},
editor = {Moses Charikar},
title = {Inapproximability for VCG-Based Combinatorial Auctions},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {518--536},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.45},
doi = {10.1137/1.9781611973075.45},
timestamp = {Mon, 30 Oct 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BuchfuhrerDFKMPSSU10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MosselRS10,
author = {Elchanan Mossel and
Sebastien Roch and
Allan Sly},
title = {On the inference of large phylogenies with long branches: How long
is too long?},
journal = {CoRR},
volume = {abs/1001.3480},
year = {2010},
url = {http://arxiv.org/abs/1001.3480},
eprinttype = {arXiv},
eprint = {1001.3480},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MosselRS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1002-0747,
author = {Elchanan Mossel and
Omer Tamuz},
title = {Efficient Bayesian Learning in Social Networks with Gaussian Estimators},
journal = {CoRR},
volume = {abs/1002.0747},
year = {2010},
url = {http://arxiv.org/abs/1002.0747},
eprinttype = {arXiv},
eprint = {1002.0747},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1002-0747.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1003-5480,
author = {Elchanan Mossel and
Omer Tamuz},
title = {Truthful Fair Division},
journal = {CoRR},
volume = {abs/1003.5480},
year = {2010},
url = {http://arxiv.org/abs/1003.5480},
eprinttype = {arXiv},
eprint = {1003.5480},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1003-5480.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-0089,
author = {Nayantara Bhatnagar and
Andrej Bogdanov and
Elchanan Mossel},
title = {The Computational Complexity of Estimating Convergence Time},
journal = {CoRR},
volume = {abs/1007.0089},
year = {2010},
url = {http://arxiv.org/abs/1007.0089},
eprinttype = {arXiv},
eprint = {1007.0089},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-0089.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-2315,
author = {Andrej Bogdanov and
Elchanan Mossel},
title = {On extracting common random bits from correlated sources},
journal = {CoRR},
volume = {abs/1007.2315},
year = {2010},
url = {http://arxiv.org/abs/1007.2315},
eprinttype = {arXiv},
eprint = {1007.2315},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-2315.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1008-0322,
author = {Tamir Tuller and
Elchanan Mossel},
title = {Co-evolution is Incompatible with the Markov Assumption in Phylogenetics},
journal = {CoRR},
volume = {abs/1008.0322},
year = {2010},
url = {http://arxiv.org/abs/1008.0322},
eprinttype = {arXiv},
eprint = {1008.0322},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1008-0322.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AustrinM09,
author = {Per Austrin and
Elchanan Mossel},
title = {Approximation Resistant Predicates from Pairwise Independence},
journal = {Comput. Complex.},
volume = {18},
number = {2},
pages = {249--271},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0272-6},
doi = {10.1007/S00037-009-0272-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AustrinM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Coja-OghlanMV09,
author = {Amin Coja{-}Oghlan and
Elchanan Mossel and
Dan Vilenchik},
title = {A Spectral Approach to Analysing Belief Propagation for 3-Colouring},
journal = {Comb. Probab. Comput.},
volume = {18},
number = {6},
pages = {881--912},
year = {2009},
url = {https://doi.org/10.1017/S096354830900981X},
doi = {10.1017/S096354830900981X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Coja-OghlanMV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MosselS09,
author = {Elchanan Mossel and
Allan Sly},
title = {Rapid mixing of Gibbs sampling on graphs that are sparse on average},
journal = {Random Struct. Algorithms},
volume = {35},
number = {2},
pages = {250--270},
year = {2009},
url = {https://doi.org/10.1002/rsa.20276},
doi = {10.1002/RSA.20276},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MosselS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DinurMR09,
author = {Irit Dinur and
Elchanan Mossel and
Oded Regev},
title = {Conditional Hardness for Approximate Coloring},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {3},
pages = {843--873},
year = {2009},
url = {https://doi.org/10.1137/07068062X},
doi = {10.1137/07068062X},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DinurMR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/MosselRS09,
author = {Elchanan Mossel and
S{\'{e}}bastien Roch and
Mike A. Steel},
title = {Shrinkage Effect in Ancestral Maximum Likelihood},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {6},
number = {1},
pages = {126--133},
year = {2009},
url = {https://doi.org/10.1109/TCBB.2008.107},
doi = {10.1109/TCBB.2008.107},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/MosselRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/allerton/MosselT09,
author = {Elchanan Mossel and
Omer Tamuz},
title = {Iterative maximum likelihood on networks},
booktitle = {47th Annual Allerton Conference on Communication, Control, and Computing,
Allerton 2009, Monticello, IL, USA, September 30 - October 2, 2009},
pages = {416--423},
publisher = {{IEEE}},
year = {2009},
url = {https://doi.org/10.1109/ALLERTON.2009.5394795},
doi = {10.1109/ALLERTON.2009.5394795},
timestamp = {Sun, 17 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/allerton/MosselT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/DaskalakisMR09,
author = {Constantinos Daskalakis and
Elchanan Mossel and
S{\'{e}}bastien Roch},
editor = {Serafim Batzoglou},
title = {Phylogenies without Branch Bounds: Contracting the Short, Pruning
the Deep},
booktitle = {Research in Computational Molecular Biology, 13th Annual International
Conference, {RECOMB} 2009, Tucson, AZ, USA, May 18-21, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5541},
pages = {451--465},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02008-7\_32},
doi = {10.1007/978-3-642-02008-7\_32},
timestamp = {Mon, 13 May 2019 09:30:09 +0200},
biburl = {https://dblp.org/rec/conf/recomb/DaskalakisMR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DaskalakisKMRV09,
author = {Constantinos Daskalakis and
Richard M. Karp and
Elchanan Mossel and
Samantha J. Riesenfeld and
Elad Verbin},
editor = {Claire Mathieu},
title = {Sorting and selection in posets},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {392--401},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.44},
doi = {10.1137/1.9781611973068.44},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/DaskalakisKMRV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0901-4727,
author = {Elchanan Mossel},
title = {Arrow's Impossibility Theorem Without Unanimity},
journal = {CoRR},
volume = {abs/0901.4727},
year = {2009},
url = {http://arxiv.org/abs/0901.4727},
eprinttype = {arXiv},
eprint = {0901.4727},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0901-4727.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0905-1995,
author = {Elchanan Mossel and
Christos H. Papadimitriou and
Michael Schapira and
Yaron Singer},
title = {{VC} v. {VCG:} Inapproximability of Combinatorial Auctions via Generalizations
of the {VC} Dimension},
journal = {CoRR},
volume = {abs/0905.1995},
year = {2009},
url = {http://arxiv.org/abs/0905.1995},
eprinttype = {arXiv},
eprint = {0905.1995},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0905-1995.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0910-1191,
author = {Mark Braverman and
Elchanan Mossel},
title = {Sorting from Noisy Information},
journal = {CoRR},
volume = {abs/0910.1191},
year = {2009},
url = {http://arxiv.org/abs/0910.1191},
eprinttype = {arXiv},
eprint = {0910.1191},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0910-1191.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BogdanovMV08,
author = {Andrej Bogdanov and
Elchanan Mossel and
Salil P. Vadhan},
editor = {Ashish Goel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Ronitt Rubinfeld},
title = {The Complexity of Distinguishing Markov Random Fields},
booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms
and Techniques, 11th International Workshop, {APPROX} 2008, and 12th
International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5171},
pages = {331--342},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85363-3\_27},
doi = {10.1007/978-3-540-85363-3\_27},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BogdanovMV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BreslerMS08,
author = {Guy Bresler and
Elchanan Mossel and
Allan Sly},
editor = {Ashish Goel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Ronitt Rubinfeld},
title = {Reconstruction of Markov Random Fields from Samples: Some Observations
and Algorithms},
booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms
and Techniques, 11th International Workshop, {APPROX} 2008, and 12th
International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5171},
pages = {343--356},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85363-3\_28},
doi = {10.1007/978-3-540-85363-3\_28},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/BreslerMS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AustrinM08,
author = {Per Austrin and
Elchanan Mossel},
title = {Approximation Resistant Predicates from Pairwise Independence},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {249--258},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.20},
doi = {10.1109/CCC.2008.20},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AustrinM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Mossel08,
author = {Elchanan Mossel},
title = {Gaussian Bounds for Noise Correlation of Functions and Tight Analysis
of Long Codes},
booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2008, October 25-28, 2008, Philadelphia, PA, {USA}},
pages = {156--165},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/FOCS.2008.44},
doi = {10.1109/FOCS.2008.44},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Mossel08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/MontanariM08,
author = {Andrea Montanari and
Elchanan Mossel},
editor = {Frank R. Kschischang and
En{-}Hui Yang},
title = {Smooth compression, Gallager bound and nonlinear sparse-graph codes},
booktitle = {2008 {IEEE} International Symposium on Information Theory, {ISIT}
2008, Toronto, ON, Canada, July 6-11, 2008},
pages = {2474--2478},
publisher = {{IEEE}},
year = {2008},
url = {https://doi.org/10.1109/ISIT.2008.4595436},
doi = {10.1109/ISIT.2008.4595436},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/MontanariM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MosselS08,
author = {Elchanan Mossel and
Allan Sly},
editor = {Shang{-}Hua Teng},
title = {Rapid mixing of Gibbs sampling on graphs that are sparse on average},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {238--247},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347109},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/MosselS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BravermanM08,
author = {Mark Braverman and
Elchanan Mossel},
editor = {Shang{-}Hua Teng},
title = {Noisy sorting without resampling},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {268--276},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347112},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BravermanM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DaskalakisMR08,
author = {Constantinos Daskalakis and
Elchanan Mossel and
Sebastien Roch},
title = {Phylogenies without Branch Bounds: Contracting the Short, Pruning
the Deep},
journal = {CoRR},
volume = {abs/0801.4190},
year = {2008},
url = {http://arxiv.org/abs/0801.4190},
eprinttype = {arXiv},
eprint = {0801.4190},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DaskalakisMR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0802-0914,
author = {Elchanan Mossel and
Sebastien Roch and
Mike A. Steel},
title = {Shrinkage Effect in Ancestral Maximum Likelihood},
journal = {CoRR},
volume = {abs/0802.0914},
year = {2008},
url = {http://arxiv.org/abs/0802.0914},
eprinttype = {arXiv},
eprint = {0802.0914},
timestamp = {Tue, 09 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-0802-0914.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0802-2300,
author = {Per Austrin and
Elchanan Mossel},
title = {Approximation Resistant Predicates From Pairwise Independence},
journal = {CoRR},
volume = {abs/0802.2300},
year = {2008},
url = {http://arxiv.org/abs/0802.2300},
eprinttype = {arXiv},
eprint = {0802.2300},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0802-2300.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0804-3817,
author = {Jan Arpe and
Elchanan Mossel},
title = {Multiple Random Oracles Are Better Than One},
journal = {CoRR},
volume = {abs/0804.3817},
year = {2008},
url = {http://arxiv.org/abs/0804.3817},
eprinttype = {arXiv},
eprint = {0804.3817},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0804-3817.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0806-4210,
author = {Jan Arpe and
Elchanan Mossel},
title = {Agnostically Learning Juntas from Random Walks},
journal = {CoRR},
volume = {abs/0806.4210},
year = {2008},
url = {http://arxiv.org/abs/0806.4210},
eprinttype = {arXiv},
eprint = {0806.4210},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0806-4210.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AustrinM08,
author = {Per Austrin and
Elchanan Mossel},
title = {Approximation Resistant Predicates From Pairwise Independence},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR08-009}},
year = {2008},
url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-009/index.html},
eprinttype = {ECCC},
eprint = {TR08-009},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AustrinM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ManevaMW07,
author = {Elitza N. Maneva and
Elchanan Mossel and
Martin J. Wainwright},
title = {A new look at survey propagation and its generalizations},
journal = {J. {ACM}},
volume = {54},
number = {4},
pages = {17},
year = {2007},
url = {https://doi.org/10.1145/1255443.1255445},
doi = {10.1145/1255443.1255445},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ManevaMW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ml/MosselR07,
author = {Elchanan Mossel and
S{\'{e}}bastien Roch},
title = {Slow emergence of cooperation for win-stay lose-shift on trees},
journal = {Mach. Learn.},
volume = {67},
number = {1-2},
pages = {7--22},
year = {2007},
url = {https://doi.org/10.1007/s10994-006-9713-5},
doi = {10.1007/S10994-006-9713-5},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ml/MosselR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenFKLMMPSSWW07,
author = {Ke Chen and
Amos Fiat and
Haim Kaplan and
Meital Levy and
Jir{\'{\i}} Matousek and
Elchanan Mossel and
J{\'{a}}nos Pach and
Micha Sharir and
Shakhar Smorodinsky and
Uli Wagner and
Emo Welzl},
title = {Online Conflict-Free Coloring for Intervals},
journal = {{SIAM} J. Comput.},
volume = {36},
number = {5},
pages = {1342--1359},
year = {2007},
url = {https://doi.org/10.1137/S0097539704446682},
doi = {10.1137/S0097539704446682},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChenFKLMMPSSWW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KhotKMO07,
author = {Subhash Khot and
Guy Kindler and
Elchanan Mossel and
Ryan O'Donnell},
title = {Optimal Inapproximability Results for {MAX-CUT} and Other 2-Variable
CSPs?},
journal = {{SIAM} J. Comput.},
volume = {37},
number = {1},
pages = {319--357},
year = {2007},
url = {https://doi.org/10.1137/S0097539705447372},
doi = {10.1137/S0097539705447372},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/KhotKMO07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/Mossel07,
author = {Elchanan Mossel},
title = {Distorted Metrics on Trees and Phylogenetic Forests},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {4},
number = {1},
pages = {108--116},
year = {2007},
url = {https://doi.org/10.1109/TCBB.2007.1010},
doi = {10.1109/TCBB.2007.1010},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/Mossel07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MosselR07,
author = {Elchanan Mossel and
S{\'{e}}bastien Roch},
editor = {David S. Johnson and
Uriel Feige},
title = {On the submodularity of influence in social networks},
booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
San Diego, California, USA, June 11-13, 2007},
pages = {128--134},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250790.1250811},
doi = {10.1145/1250790.1250811},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MosselR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/ox/07/MosselS07,
author = {Elchanan Mossel and
Mike A. Steel},
editor = {Olivier Gascuel},
title = {How much can evolved characters tell us about the tree that generated
them?},
booktitle = {Mathematics of Evolution and Phylogeny},
publisher = {Oxford University Press},
year = {2007},
timestamp = {Tue, 09 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/ox/07/MosselS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0707-1051,
author = {Mark Braverman and
Elchanan Mossel},
title = {Noisy Sorting Without Resampling},
journal = {CoRR},
volume = {abs/0707.1051},
year = {2007},
url = {http://arxiv.org/abs/0707.1051},
eprinttype = {arXiv},
eprint = {0707.1051},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0707-1051.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0707-1532,
author = {Constantinos Daskalakis and
Richard M. Karp and
Elchanan Mossel and
Samantha J. Riesenfeld and
Elad Verbin},
title = {Sorting and Selection in Posets},
journal = {CoRR},
volume = {abs/0707.1532},
year = {2007},
url = {http://arxiv.org/abs/0707.1532},
eprinttype = {arXiv},
eprint = {0707.1532},
timestamp = {Wed, 25 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-0707-1532.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MosselR07,
author = {Elchanan Mossel and
S{\'{e}}bastien Roch},
title = {Incomplete Lineage Sorting: Consistent Phylogeny Estimation From Multiple
Loci},
journal = {CoRR},
volume = {abs/0710.0262},
year = {2007},
url = {http://arxiv.org/abs/0710.0262},
eprinttype = {arXiv},
eprint = {0710.0262},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MosselR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0712-0171,
author = {Amin Coja{-}Oghlan and
Elchanan Mossel and
Dan Vilenchik},
title = {A Spectral Approach to Analyzing Belief Propagation for 3-Coloring},
journal = {CoRR},
volume = {abs/0712.0171},
year = {2007},
url = {http://arxiv.org/abs/0712.0171},
eprinttype = {arXiv},
eprint = {0712.0171},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0712-0171.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0712-1402,
author = {Guy Bresler and
Elchanan Mossel and
Allan Sly},
title = {Reconstruction of Markov Random Fields from Samples: Some Easy Observations
and Algorithms},
journal = {CoRR},
volume = {abs/0712.1402},
year = {2007},
url = {http://arxiv.org/abs/0712.1402},
eprinttype = {arXiv},
eprint = {0712.1402},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0712-1402.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-math-0703902,
author = {Constantinos Daskalakis and
Alexandros G. Dimakis and
Elchanan Mossel},
title = {Connectivity and Equilibrium in Random Games},
journal = {CoRR},
volume = {abs/math/0703902},
year = {2007},
url = {http://arxiv.org/abs/math/0703902},
eprinttype = {arXiv},
eprint = {math/0703902},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-math-0703902.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aam/HaggstromKM06,
author = {Olle H{\"{a}}ggstr{\"{o}}m and
Gil Kalai and
Elchanan Mossel},
title = {A law of large numbers for weighted majority},
journal = {Adv. Appl. Math.},
volume = {37},
number = {1},
pages = {112--123},
year = {2006},
url = {https://doi.org/10.1016/j.aam.2005.08.002},
doi = {10.1016/J.AAM.2005.08.002},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aam/HaggstromKM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MosselST06,
author = {Elchanan Mossel and
Amir Shpilka and
Luca Trevisan},
title = {On epsilon-biased generators in NC\({}^{\mbox{0}}\)},
journal = {Random Struct. Algorithms},
volume = {29},
number = {1},
pages = {56--81},
year = {2006},
url = {https://doi.org/10.1002/rsa.20112},
doi = {10.1002/RSA.20112},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MosselST06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FeigeMV06,
author = {Uriel Feige and
Elchanan Mossel and
Dan Vilenchik},
editor = {Josep D{\'{\i}}az and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Uri Zwick},
title = {Complete Convergence of Message Passing Algorithms for Some Satisfiability
Problems},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 9th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2006 and 10th International
Workshop on Randomization and Computation, {RANDOM} 2006, Barcelona,
Spain, August 28-30 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4110},
pages = {339--350},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11830924\_32},
doi = {10.1007/11830924\_32},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/FeigeMV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BorgsCMR06,
author = {Christian Borgs and
Jennifer T. Chayes and
Elchanan Mossel and
S{\'{e}}bastien Roch},
title = {The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric
Binary Channels},
booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
pages = {518--530},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/FOCS.2006.76},
doi = {10.1109/FOCS.2006.76},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BorgsCMR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/DaskalakisHJMMR06,
author = {Constantinos Daskalakis and
Cameron Hill and
Alexander Jaffe and
Radu Mihaescu and
Elchanan Mossel and
Satish Rao},
editor = {Alberto Apostolico and
Concettina Guerra and
Sorin Istrail and
Pavel A. Pevzner and
Michael S. Waterman},
title = {Maximal Accurate Forests from Distance Matrices},
booktitle = {Research in Computational Molecular Biology, 10th Annual International
Conference, {RECOMB} 2006, Venice, Italy, April 2-5, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3909},
pages = {281--295},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11732990\_24},
doi = {10.1007/11732990\_24},
timestamp = {Mon, 13 May 2019 09:30:09 +0200},
biburl = {https://dblp.org/rec/conf/recomb/DaskalakisHJMMR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DaskalakisMR06,
author = {Constantinos Daskalakis and
Elchanan Mossel and
S{\'{e}}bastien Roch},
editor = {Jon M. Kleinberg},
title = {Optimal phylogenetic reconstruction},
booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
Seattle, WA, USA, May 21-23, 2006},
pages = {159--168},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1132516.1132540},
doi = {10.1145/1132516.1132540},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DaskalakisMR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DinurMR06,
author = {Irit Dinur and
Elchanan Mossel and
Oded Regev},
editor = {Jon M. Kleinberg},
title = {Conditional hardness for approximate coloring},
booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
Seattle, WA, USA, May 21-23, 2006},
pages = {344--353},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1132516.1132567},
doi = {10.1145/1132516.1132567},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DinurMR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BorgsCMR06,
author = {Christian Borgs and
Jennifer T. Chayes and
Elchanan Mossel and
Sebastien Roch},
title = {The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric
Binary Channels},
journal = {CoRR},
volume = {abs/math/0604366},
year = {2006},
url = {http://arxiv.org/abs/math/0604366},
eprinttype = {arXiv},
eprint = {math/0604366},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BorgsCMR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MosselR06,
author = {Elchanan Mossel and
Sebastien Roch},
title = {On the Submodularity of Influence in Social Networks},
journal = {CoRR},
volume = {abs/math/0612046},
year = {2006},
url = {http://arxiv.org/abs/math/0612046},
eprinttype = {arXiv},
eprint = {math/0612046},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MosselR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/MosselP05,
author = {Elchanan Mossel and
Yuval Peres},
title = {New Coins From Old: Computing With Unknown Bias},
journal = {Comb.},
volume = {25},
number = {6},
pages = {707--724},
year = {2005},
url = {https://doi.org/10.1007/s00493-005-0043-1},
doi = {10.1007/S00493-005-0043-1},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/MosselP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BshoutyMOS05,
author = {Nader H. Bshouty and
Elchanan Mossel and
Ryan O'Donnell and
Rocco A. Servedio},
title = {Learning {DNF} from random walks},
journal = {J. Comput. Syst. Sci.},
volume = {71},
number = {3},
pages = {250--265},
year = {2005},
url = {https://doi.org/10.1016/j.jcss.2004.10.010},
doi = {10.1016/J.JCSS.2004.10.010},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BshoutyMOS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MosselO05,
author = {Elchanan Mossel and
Ryan O'Donnell},
title = {Coin flipping from a cosmic source: On error correction of truly random
bits},
journal = {Random Struct. Algorithms},
volume = {26},
number = {4},
pages = {418--436},
year = {2005},
url = {https://doi.org/10.1002/rsa.20062},
doi = {10.1002/RSA.20062},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MosselO05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MosselOO05,
author = {Elchanan Mossel and
Ryan O'Donnell and
Krzysztof Oleszkiewicz},
title = {Noise stability of functions with low in.uences invariance and optimality},
booktitle = {46th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings},
pages = {21--30},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/SFCS.2005.53},
doi = {10.1109/SFCS.2005.53},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MosselOO05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FiatLMMPSSWW05,
author = {Amos Fiat and
Meital Levy and
Jir{\'{\i}} Matousek and
Elchanan Mossel and
J{\'{a}}nos Pach and
Micha Sharir and
Shakhar Smorodinsky and
Uli Wagner and
Emo Welzl},
title = {Online conflict-free coloring for intervals},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {545--554},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070506},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/FiatLMMPSSWW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ManevaMW05,
author = {Elitza N. Maneva and
Elchanan Mossel and
Martin J. Wainwright},
title = {A new look at survey propagation and its generalizations},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {1089--1098},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070588},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ManevaMW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MosselR05,
author = {Elchanan Mossel and
S{\'{e}}bastien Roch},
editor = {Harold N. Gabow and
Ronald Fagin},
title = {Learning nonsingular phylogenies and hidden Markov models},
booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
Baltimore, MD, USA, May 22-24, 2005},
pages = {366--375},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1060590.1060645},
doi = {10.1145/1060590.1060645},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MosselR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0502076,
author = {Elchanan Mossel and
S{\'{e}}bastien Roch},
title = {Learning nonsingular phylogenies and hidden Markov models},
journal = {CoRR},
volume = {abs/cs/0502076},
year = {2005},
url = {http://arxiv.org/abs/cs/0502076},
eprinttype = {arXiv},
eprint = {cs/0502076},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0502076.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0504062,
author = {Irit Dinur and
Elchanan Mossel and
Oded Regev},
title = {Conditional Hardness for Approximate Coloring},
journal = {CoRR},
volume = {abs/cs/0504062},
year = {2005},
url = {http://arxiv.org/abs/cs/0504062},
eprinttype = {arXiv},
eprint = {cs/0504062},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0504062.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-math-0503503,
author = {Elchanan Mossel and
Ryan O'Donnell and
Krzysztof Oleszkiewicz},
title = {Noise stability of functions with low influences: invariance and optimality},
journal = {CoRR},
volume = {abs/math/0503503},
year = {2005},
url = {http://arxiv.org/abs/math/0503503},
eprinttype = {arXiv},
eprint = {math/0503503},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-math-0503503.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DaskalakisMR05,
author = {Constantinos Daskalakis and
Elchanan Mossel and
Sebastien Roch},
title = {Evolutionary Trees and the Ising Model on the Bethe Lattice: a Proof
of Steel's Conjecture},
journal = {CoRR},
volume = {abs/math/0509575},
year = {2005},
url = {http://arxiv.org/abs/math/0509575},
eprinttype = {arXiv},
eprint = {math/0509575},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DaskalakisMR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-039,
author = {Irit Dinur and
Elchanan Mossel and
Oded Regev},
title = {Conditional Hardness for Approximate Coloring},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-039}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-039/index.html},
eprinttype = {ECCC},
eprint = {TR05-039},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-039.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-101,
author = {Guy Kindler and
Ryan O'Donnell and
Subhash Khot and
Elchanan Mossel},
title = {Optimal Inapproximability Results for {MAX-CUT} and Other 2-Variable
CSPs?},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-101}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-101/index.html},
eprinttype = {ECCC},
eprint = {TR05-101},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-101.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MosselOS04,
author = {Elchanan Mossel and
Ryan O'Donnell and
Rocco A. Servedio},
title = {Learning functions of k relevant variables},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {3},
pages = {421--434},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.04.002},
doi = {10.1016/J.JCSS.2004.04.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/MosselOS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KhotKMO04,
author = {Subhash Khot and
Guy Kindler and
Elchanan Mossel and
Ryan O'Donnell},
title = {Optimal Inapproximability Results for Max-Cut and Other 2-Variable
CSPs?},
booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
October 2004, Rome, Italy, Proceedings},
pages = {146--154},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/FOCS.2004.49},
doi = {10.1109/FOCS.2004.49},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KhotKMO04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MosselPS04,
author = {Elchanan Mossel and
Yuval Peres and
Alistair Sinclair},
title = {Shuffling by Semi-Random Transpositions},
booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
October 2004, Rome, Italy, Proceedings},
pages = {572--581},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/FOCS.2004.60},
doi = {10.1109/FOCS.2004.60},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MosselPS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/LiptonMMS04,
author = {Richard J. Lipton and
Evangelos Markakis and
Elchanan Mossel and
Amin Saberi},
editor = {Jack S. Breese and
Joan Feigenbaum and
Margo I. Seltzer},
title = {On approximately fair allocations of indivisible goods},
booktitle = {Proceedings 5th {ACM} Conference on Electronic Commerce (EC-2004),
New York, NY, USA, May 17-20, 2004},
pages = {125--131},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/988772.988792},
doi = {10.1145/988772.988792},
timestamp = {Tue, 27 Nov 2018 11:56:48 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/LiptonMMS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0409012,
author = {Elitza N. Maneva and
Elchanan Mossel and
Martin J. Wainwright},
title = {A New Look at Survey Propagation and its Generalizations},
journal = {CoRR},
volume = {cs.CC/0409012},
year = {2004},
url = {http://arxiv.org/abs/cs.CC/0409012},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0409012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/Mossel03,
author = {Elchanan Mossel},
title = {On the Impossibility of Reconstructing Ancestral Data and Phylogenies},
journal = {J. Comput. Biol.},
volume = {10},
number = {5},
pages = {669--676},
year = {2003},
url = {https://doi.org/10.1089/106652703322539015},
doi = {10.1089/106652703322539015},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/Mossel03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MosselO03,
author = {Elchanan Mossel and
Ryan O'Donnell},
title = {On the noise sensitivity of monotone functions},
journal = {Random Struct. Algorithms},
volume = {23},
number = {3},
pages = {333--350},
year = {2003},
url = {https://doi.org/10.1002/rsa.10097},
doi = {10.1002/RSA.10097},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MosselO03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MosselST03,
author = {Elchanan Mossel and
Amir Shpilka and
Luca Trevisan},
title = {On e-Biased Generators in {NC0}},
booktitle = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14
October 2003, Cambridge, MA, USA, Proceedings},
pages = {136--145},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/SFCS.2003.1238188},
doi = {10.1109/SFCS.2003.1238188},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/MosselST03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BshoutyMOS03,
author = {Nader H. Bshouty and
Elchanan Mossel and
Ryan O'Donnell and
Rocco A. Servedio},
title = {Learning {DNF} from Random Walks},
booktitle = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14
October 2003, Cambridge, MA, USA, Proceedings},
pages = {189--198},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/SFCS.2003.1238193},
doi = {10.1109/SFCS.2003.1238193},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BshoutyMOS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MosselOS03,
author = {Elchanan Mossel and
Ryan O'Donnell and
Rocco A. Servedio},
editor = {Lawrence L. Larmore and
Michel X. Goemans},
title = {Learning juntas},
booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing,
June 9-11, 2003, San Diego, CA, {USA}},
pages = {206--212},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/780542.780574},
doi = {10.1145/780542.780574},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MosselOS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-043,
author = {Elchanan Mossel and
Amir Shpilka and
Luca Trevisan},
title = {On epsilon-Biased Generators in {NC0}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR03-043}},
year = {2003},
url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-043/index.html},
eprinttype = {ECCC},
eprint = {TR03-043},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-043.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Mossel02,
author = {Elchanan Mossel},
title = {The Minesweeper Game: Percolation And Complexity},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {5},
pages = {487--499},
year = {2002},
url = {https://doi.org/10.1017/S096354830200528X},
doi = {10.1017/S096354830200528X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Mossel02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MosselU02,
author = {Elchanan Mossel and
Christopher Umans},
title = {On the complexity of approximating the {VC} dimension},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {4},
pages = {660--671},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00022-3},
doi = {10.1016/S0022-0000(02)00022-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/MosselU02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/MosselU01,
author = {Elchanan Mossel and
Christopher Umans},
title = {On the Complexity of Approximating the {VC} Dimension},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {220--225},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933889},
doi = {10.1109/CCC.2001.933889},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/MosselU01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/Mossel01,
author = {Elchanan Mossel},
editor = {Jaroslav Nesetril and
Peter Winkler},
title = {Survey: Information Flow on Trees},
booktitle = {Graphs, Morphisms and Statistical Physics, Proceedings of a {DIMACS}
Workshop, New Brunswick, New Jersey, USA, March 19-21, 2001},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {63},
pages = {155--170},
publisher = {{DIMACS/AMS}},
year = {2001},
url = {https://doi.org/10.1090/dimacs/063/12},
doi = {10.1090/DIMACS/063/12},
timestamp = {Mon, 22 May 2023 16:07:34 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/Mossel01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KenyonMP01,
author = {Claire Kenyon and
Elchanan Mossel and
Yuval Peres},
title = {Glauber Dynamics on Trees and Hyperbolic Graphs},
booktitle = {42nd Annual Symposium on Foundations of Computer Science, {FOCS} 2001,
14-17 October 2001, Las Vegas, Nevada, {USA}},
pages = {568--578},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/SFCS.2001.959933},
doi = {10.1109/SFCS.2001.959933},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KenyonMP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BenjaminiHM00,
author = {Itai Benjamini and
Olle H{\"{a}}ggstr{\"{o}}m and
Elchanan Mossel},
title = {On Random Graph Homomorphisms into {Z}},
journal = {J. Comb. Theory {B}},
volume = {78},
number = {1},
pages = {86--114},
year = {2000},
url = {https://doi.org/10.1006/jctb.1999.1931},
doi = {10.1006/JCTB.1999.1931},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/BenjaminiHM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JonassonMP00,
author = {Johan Jonasson and
Elchanan Mossel and
Yuval Peres},
title = {Percolation in a dependent random environment},
journal = {Random Struct. Algorithms},
volume = {16},
number = {4},
pages = {333--343},
year = {2000},
url = {https://doi.org/10.1002/1098-2418(200007)16:4\&\#60;333::AID-RSA3\&\#62;3.0.CO;2-C},
doi = {10.1002/1098-2418(200007)16:4\&\#60;333::AID-RSA3\&\#62;3.0.CO;2-C},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JonassonMP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Mossel98,
author = {Elchanan Mossel},
title = {Recursive reconstruction on periodic trees},
journal = {Random Struct. Algorithms},
volume = {13},
number = {1},
pages = {81--97},
year = {1998},
url = {https://doi.org/10.1002/(SICI)1098-2418(199808)13:1\&\#60;81::AID-RSA5\&\#62;3.0.CO;2-O},
doi = {10.1002/(SICI)1098-2418(199808)13:1\&\#60;81::AID-RSA5\&\#62;3.0.CO;2-O},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Mossel98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-08-05 20:25 CEST 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:
