![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "Dana Moshkovitz"
@inproceedings{DBLP:conf/coco/CookM24, author = {Joshua Cook and Dana Moshkovitz}, editor = {Rahul Santhanam}, title = {Explicit Time and Space Efficient Encoders Exist Only with Random Access}, booktitle = {39th Computational Complexity Conference, {CCC} 2024, July 22-25, 2024, Ann Arbor, MI, {USA}}, series = {LIPIcs}, volume = {300}, pages = {5:1--5:54}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2024}, url = {https://doi.org/10.4230/LIPIcs.CCC.2024.5}, doi = {10.4230/LIPICS.CCC.2024.5}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/coco/CookM24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/CookM24, author = {Joshua Cook and Dana Moshkovitz}, title = {Explicit Time and Space Efficient Encoders Exist Only With Random Access}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR24-032}}, year = {2024}, url = {https://eccc.weizmann.ac.il/report/2024/032}, eprinttype = {ECCC}, eprint = {TR24-032}, timestamp = {Thu, 08 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/CookM24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/CookM24a, author = {Joshua Cook and Dana Moshkovitz}, title = {Time and Space Efficient Deterministic Decoders}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR24-110}}, year = {2024}, url = {https://eccc.weizmann.ac.il/report/2024/110}, eprinttype = {ECCC}, eprint = {TR24-110}, timestamp = {Thu, 08 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/CookM24a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/CookM23, author = {Joshua Cook and Dana Moshkovitz}, editor = {Nicole Megow and Adam D. Smith}, title = {Tighter {MA/1} Circuit Lower Bounds from Verifier Efficient PCPs for {PSPACE}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta, Georgia, {USA}}, series = {LIPIcs}, volume = {275}, pages = {55:1--55:22}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.55}, doi = {10.4230/LIPICS.APPROX/RANDOM.2023.55}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/CookM23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HiraharaM23, author = {Shuichi Hirahara and Dana Moshkovitz}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Regularization of Low Error PCPs and an Application to {MCSP}}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {39:1--39:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.39}, doi = {10.4230/LIPICS.ISAAC.2023.39}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/HiraharaM23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DoronMOZ23, author = {Dean Doron and Dana Moshkovitz and Justin Oh and David Zuckerman}, editor = {Barna Saha and Rocco A. Servedio}, title = {Almost Chor-Goldreich Sources and Adversarial Random Walks}, booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing, {STOC} 2023, Orlando, FL, USA, June 20-23, 2023}, pages = {1--9}, publisher = {{ACM}}, year = {2023}, url = {https://doi.org/10.1145/3564246.3585134}, doi = {10.1145/3564246.3585134}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/DoronMOZ23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/MonMO23, author = {Geoffrey Mon and Dana Moshkovitz and Justin Oh}, title = {Approximate Locally Decodable Codes with Constant Query Complexity and Nearly Optimal Rate}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR23-056}}, year = {2023}, url = {https://eccc.weizmann.ac.il/report/2023/056}, eprinttype = {ECCC}, eprint = {TR23-056}, timestamp = {Tue, 13 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/MonMO23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/DoronMOZ22, author = {Dean Doron and Dana Moshkovitz and Justin Oh and David Zuckerman}, title = {Nearly Optimal Pseudorandomness from Hardness}, journal = {J. {ACM}}, volume = {69}, number = {6}, pages = {43:1--43:55}, year = {2022}, url = {https://doi.org/10.1145/3555307}, doi = {10.1145/3555307}, timestamp = {Sun, 25 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/DoronMOZ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/EldanM22, author = {Ronen Eldan and Dana Moshkovitz}, editor = {Mark Braverman}, title = {Reduction from Non-Unique Games to Boolean Unique Games}, booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS} 2022, January 31 - February 3, 2022, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {215}, pages = {64:1--64:25}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.64}, doi = {10.4230/LIPICS.ITCS.2022.64}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/EldanM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/CookM22, author = {Joshua Cook and Dana Moshkovitz}, title = {Tighter {MA/1} Circuit Lower Bounds From Verifier Efficient PCPs for {PSPACE}}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR22-014}}, year = {2022}, url = {https://eccc.weizmann.ac.il/report/2022/014}, eprinttype = {ECCC}, eprint = {TR22-014}, timestamp = {Wed, 16 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eccc/CookM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DoronMOZ22, author = {Dean Doron and Dana Moshkovitz and Justin Oh and David Zuckerman}, title = {Almost Chor-Goldreich Sources and Adversarial Random Walks}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR22-103}}, year = {2022}, url = {https://eccc.weizmann.ac.il/report/2022/103}, eprinttype = {ECCC}, eprint = {TR22-103}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DoronMOZ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/JalanM21, author = {Akhil Jalan and Dana Moshkovitz}, editor = {Mikolaj Bojanczyk and Chandra Chekuri}, title = {Near-Optimal Cayley Expanders for Abelian Groups}, booktitle = {41st {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2021, December 15-17, 2021, Virtual Conference}, series = {LIPIcs}, volume = {213}, pages = {24:1--24:23}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2021.24}, doi = {10.4230/LIPICS.FSTTCS.2021.24}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/JalanM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2105-01149, author = {Akhil Jalan and Dana Moshkovitz}, title = {Near-Optimal Cayley Expanders for Abelian Groups}, journal = {CoRR}, volume = {abs/2105.01149}, year = {2021}, url = {https://arxiv.org/abs/2105.01149}, eprinttype = {arXiv}, eprint = {2105.01149}, timestamp = {Wed, 12 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2105-01149.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Moshkovitz21, author = {Dana Moshkovitz}, title = {Strong Parallel Repetition for Unique Games on Small Set Expanders}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR21-042}}, year = {2021}, url = {https://eccc.weizmann.ac.il/report/2021/042}, eprinttype = {ECCC}, eprint = {TR21-042}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Moshkovitz21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/GrossmanM20, author = {Ofer Grossman and Dana Moshkovitz}, title = {Amplification and Derandomization without Slowdown}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {5}, pages = {959--998}, year = {2020}, url = {https://doi.org/10.1137/17M1110596}, doi = {10.1137/17M1110596}, timestamp = {Thu, 26 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/GrossmanM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DoronMOZ20, author = {Dean Doron and Dana Moshkovitz and Justin Oh and David Zuckerman}, editor = {Sandy Irani}, title = {Nearly Optimal Pseudorandomness From Hardness}, booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2020, Durham, NC, USA, November 16-19, 2020}, pages = {1057--1068}, publisher = {{IEEE}}, year = {2020}, url = {https://doi.org/10.1109/FOCS46700.2020.00102}, doi = {10.1109/FOCS46700.2020.00102}, timestamp = {Wed, 15 Dec 2021 10:49:16 +0100}, biburl = {https://dblp.org/rec/conf/focs/DoronMOZ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/MoshkovitzOZ20, author = {Dana Moshkovitz and Justin Oh and David Zuckerman}, editor = {Nitin Saxena and Sunil Simon}, title = {Randomness Efficient Noise Stability and Generalized Small Bias Sets}, booktitle = {40th {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2020, December 14-18, 2020, {BITS} Pilani, {K} {K} Birla Goa Campus, Goa, India (Virtual Conference)}, series = {LIPIcs}, volume = {182}, pages = {31:1--31:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2020.31}, doi = {10.4230/LIPICS.FSTTCS.2020.31}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/MoshkovitzOZ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2006-13073, author = {Ronen Eldan and Dana Moshkovitz}, title = {Reduction From Non-Unique Games To Boolean Unique Games}, journal = {CoRR}, volume = {abs/2006.13073}, year = {2020}, url = {https://arxiv.org/abs/2006.13073}, eprinttype = {arXiv}, eprint = {2006.13073}, timestamp = {Wed, 01 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2006-13073.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/EldanM20, author = {Ronen Eldan and Dana Moshkovitz}, title = {Reduction From Non-Unique Games To Boolean Unique Games}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR20-093}}, year = {2020}, url = {https://eccc.weizmann.ac.il/report/2020/093}, eprinttype = {ECCC}, eprint = {TR20-093}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/EldanM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/Moshkovitz19, author = {Dana Moshkovitz}, title = {Sliding Scale Conjectures in {PCP}}, journal = {{SIGACT} News}, volume = {50}, number = {3}, pages = {25--33}, year = {2019}, url = {https://doi.org/10.1145/3364626.3364632}, doi = {10.1145/3364626.3364632}, timestamp = {Mon, 14 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigact/Moshkovitz19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DoronMOZ19, author = {Dean Doron and Dana Moshkovitz and Justin Oh and David Zuckerman}, title = {Nearly Optimal Pseudorandomness From Hardness}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR19-099}}, year = {2019}, url = {https://eccc.weizmann.ac.il/report/2019/099}, eprinttype = {ECCC}, eprint = {TR19-099}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DoronMOZ19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/MoshkovitzM18, author = {Dana Moshkovitz and Michal Moshkovitz}, editor = {Anna R. Karlin}, title = {Entropy Samplers and Strong Generic Lower Bounds For Space Bounded Learning}, booktitle = {9th Innovations in Theoretical Computer Science Conference, {ITCS} 2018, January 11-14, 2018, Cambridge, MA, {USA}}, series = {LIPIcs}, volume = {94}, pages = {28:1--28:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2018.28}, doi = {10.4230/LIPICS.ITCS.2018.28}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/innovations/MoshkovitzM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KhotMMS18, author = {Subhash Khot and Dor Minzer and Dana Moshkovitz and Muli Safra}, title = {Small Set Expansion in The Johnson Graph}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-078}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/078}, eprinttype = {ECCC}, eprint = {TR18-078}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KhotMMS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/ManurangsiM17, author = {Pasin Manurangsi and Dana Moshkovitz}, title = {Improved Approximation Algorithms for Projection Games}, journal = {Algorithmica}, volume = {77}, number = {2}, pages = {555--594}, year = {2017}, url = {https://doi.org/10.1007/s00453-015-0088-5}, doi = {10.1007/S00453-015-0088-5}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/ManurangsiM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Moshkovitz17, author = {Dana Moshkovitz}, title = {Low-degree test with polynomially small error}, journal = {Comput. Complex.}, volume = {26}, number = {3}, pages = {531--582}, year = {2017}, url = {https://doi.org/10.1007/s00037-016-0149-4}, doi = {10.1007/S00037-016-0149-4}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Moshkovitz17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/LeviMRRS17, author = {Reut Levi and Guy Moshkovitz and Dana Ron and Ronitt Rubinfeld and Asaf Shapira}, title = {Constructing near spanning trees with few local inspections}, journal = {Random Struct. Algorithms}, volume = {50}, number = {2}, pages = {183--200}, year = {2017}, url = {https://doi.org/10.1002/rsa.20652}, doi = {10.1002/RSA.20652}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rsa/LeviMRRS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/MoshkovitzM17, author = {Dana Moshkovitz and Michal Moshkovitz}, editor = {Satyen Kale and Ohad Shamir}, title = {Mixing Implies Lower Bounds for Space Bounded Learning}, booktitle = {Proceedings of the 30th Conference on Learning Theory, {COLT} 2017, Amsterdam, The Netherlands, 7-10 July 2017}, series = {Proceedings of Machine Learning Research}, volume = {65}, pages = {1516--1566}, publisher = {{PMLR}}, year = {2017}, url = {http://proceedings.mlr.press/v65/moshkovitz17a.html}, timestamp = {Wed, 29 May 2019 08:41:46 +0200}, biburl = {https://dblp.org/rec/conf/colt/MoshkovitzM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ChlamtacMMV17, author = {Eden Chlamt{\'{a}}c and Pasin Manurangsi and Dana Moshkovitz and Aravindan Vijayaraghavan}, editor = {Philip N. Klein}, title = {Approximation Algorithms for Label Cover and The Log-Density Threshold}, booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19}, pages = {900--919}, publisher = {{SIAM}}, year = {2017}, url = {https://doi.org/10.1137/1.9781611974782.57}, doi = {10.1137/1.9781611974782.57}, timestamp = {Tue, 02 Feb 2021 17:07:33 +0100}, biburl = {https://dblp.org/rec/conf/soda/ChlamtacMMV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/MoshkovitzM17, author = {Michal Moshkovitz and Dana Moshkovitz}, title = {Mixing Implies Lower Bounds for Space Bounded Learning}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-017}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/017}, eprinttype = {ECCC}, eprint = {TR17-017}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/MoshkovitzM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/MoshkovitzM17a, author = {Michal Moshkovitz and Dana Moshkovitz}, title = {Mixing Implies Strong Lower Bounds for Space Bounded Learning}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-116}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/116}, eprinttype = {ECCC}, eprint = {TR17-116}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/MoshkovitzM17a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/MoshkovitzRY16, author = {Dana Moshkovitz and Govind Ramnarayan and Henry Yuen}, editor = {Klaus Jansen and Claire Mathieu and Jos{\'{e}} D. P. Rolim and Chris Umans}, title = {A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2016, September 7-9, 2016, Paris, France}, series = {LIPIcs}, volume = {60}, pages = {42:3--42:29}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.42}, doi = {10.4230/LIPICS.APPROX-RANDOM.2016.42}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/MoshkovitzRY16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/GrossmanM16, author = {Ofer Grossman and Dana Moshkovitz}, editor = {Irit Dinur}, title = {Amplification and Derandomization without Slowdown}, booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS} 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, {USA}}, pages = {770--779}, publisher = {{IEEE} Computer Society}, year = {2016}, url = {https://doi.org/10.1109/FOCS.2016.87}, doi = {10.1109/FOCS.2016.87}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/GrossmanM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KhotM16, author = {Subhash Khot and Dana Moshkovitz}, editor = {Daniel Wichs and Yishay Mansour}, title = {Candidate hard unique game}, booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016}, pages = {63--76}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2897518.2897531}, doi = {10.1145/2897518.2897531}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KhotM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/MoshkovitzRY16, author = {Dana Moshkovitz and Govind Ramnarayan and Henry Yuen}, title = {A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian}, journal = {CoRR}, volume = {abs/1607.07130}, year = {2016}, url = {http://arxiv.org/abs/1607.07130}, eprinttype = {arXiv}, eprint = {1607.07130}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/MoshkovitzRY16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/Moshkovitz15, author = {Dana Moshkovitz}, title = {The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover}, journal = {Theory Comput.}, volume = {11}, pages = {221--235}, year = {2015}, url = {https://doi.org/10.4086/toc.2015.v011a007}, doi = {10.4086/TOC.2015.V011A007}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/Moshkovitz15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/ManurangsiM15, author = {Pasin Manurangsi and Dana Moshkovitz}, editor = {Naveen Garg and Klaus Jansen and Anup Rao and Jos{\'{e}} D. P. Rolim}, title = {Approximating Dense Max 2-CSPs}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton, NJ, {USA}}, series = {LIPIcs}, volume = {40}, pages = {396--415}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.396}, doi = {10.4230/LIPICS.APPROX-RANDOM.2015.396}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/ManurangsiM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/GrossmanM15, author = {Ofer Grossman and Dana Moshkovitz}, title = {Amplification and Derandomization Without Slowdown}, journal = {CoRR}, volume = {abs/1509.08123}, year = {2015}, url = {http://arxiv.org/abs/1509.08123}, eprinttype = {arXiv}, eprint = {1509.08123}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/GrossmanM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/LeviMRRS15, author = {Reut Levi and Guy Moshkovitz and Dana Ron and Ronitt Rubinfeld and Asaf Shapira}, title = {Constructing Near Spanning Trees with Few Local Inspections}, journal = {CoRR}, volume = {abs/1502.00413}, year = {2015}, url = {http://arxiv.org/abs/1502.00413}, eprinttype = {arXiv}, eprint = {1502.00413}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/LeviMRRS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/ManurangsiM15, author = {Pasin Manurangsi and Dana Moshkovitz}, title = {Approximating Dense Max 2-CSPs}, journal = {CoRR}, volume = {abs/1507.08348}, year = {2015}, url = {http://arxiv.org/abs/1507.08348}, eprinttype = {arXiv}, eprint = {1507.08348}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/ManurangsiM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GrossmanM15, author = {Ofer Grossman and Dana Moshkovitz}, title = {Amplification and Derandomization Without Slowdown}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR15-158}}, year = {2015}, url = {https://eccc.weizmann.ac.il/report/2015/158}, eprinttype = {ECCC}, eprint = {TR15-158}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GrossmanM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LeviMRRS15, author = {Reut Levi and Guy Moshkovitz and Dana Ron and Ronitt Rubinfeld and Asaf Shapira}, title = {Constructing Near Spanning Trees with Few Local Inspections}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR15-019}}, year = {2015}, url = {https://eccc.weizmann.ac.il/report/2015/019}, eprinttype = {ECCC}, eprint = {TR15-019}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LeviMRRS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/AaronsonIM14, author = {Scott Aaronson and Russell Impagliazzo and Dana Moshkovitz}, title = {{AM} with Multiple Merlins}, booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver, BC, Canada, June 11-13, 2014}, pages = {44--55}, publisher = {{IEEE} Computer Society}, year = {2014}, url = {https://doi.org/10.1109/CCC.2014.13}, doi = {10.1109/CCC.2014.13}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/coco/AaronsonIM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Moshkovitz14, author = {Dana Moshkovitz}, title = {Parallel Repetition from Fortification}, booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2014, Philadelphia, PA, USA, October 18-21, 2014}, pages = {414--423}, publisher = {{IEEE} Computer Society}, year = {2014}, url = {https://doi.org/10.1109/FOCS.2014.51}, doi = {10.1109/FOCS.2014.51}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/Moshkovitz14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/AaronsonIM14, author = {Scott Aaronson and Russell Impagliazzo and Dana Moshkovitz}, title = {{AM} with Multiple Merlins}, journal = {CoRR}, volume = {abs/1401.6848}, year = {2014}, url = {http://arxiv.org/abs/1401.6848}, eprinttype = {arXiv}, eprint = {1401.6848}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/AaronsonIM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/ManurangsiM14, author = {Pasin Manurangsi and Dana Moshkovitz}, title = {Improved Approximation Algorithms for Projection Games}, journal = {CoRR}, volume = {abs/1408.4048}, year = {2014}, url = {http://arxiv.org/abs/1408.4048}, eprinttype = {arXiv}, eprint = {1408.4048}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/ManurangsiM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AaronsonIM14, author = {Scott Aaronson and Russell Impagliazzo and Dana Moshkovitz}, title = {{AM} with Multiple Merlins}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-012}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/012}, eprinttype = {ECCC}, eprint = {TR14-012}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AaronsonIM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KhotM14, author = {Subhash Khot and Dana Moshkovitz}, title = {Candidate Lasserre Integrality Gap For Unique Games}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-142}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/142}, eprinttype = {ECCC}, eprint = {TR14-142}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KhotM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Moshkovitz14, author = {Dana Moshkovitz}, title = {An Approach To The Sliding Scale Conjecture Via Parallel Repetition For Low Degree Testing}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-030}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/030}, eprinttype = {ECCC}, eprint = {TR14-030}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Moshkovitz14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Moshkovitz14a, author = {Dana Moshkovitz}, title = {Parallel Repetition of Fortified Games}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-054}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/054}, eprinttype = {ECCC}, eprint = {TR14-054}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Moshkovitz14a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Moshkovitz14b, author = {Dana Moshkovitz}, title = {Direct Product Testing With Nearly Identical Sets}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-182}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/182}, eprinttype = {ECCC}, eprint = {TR14-182}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Moshkovitz14b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/KhotM13, author = {Subhash Khot and Dana Moshkovitz}, title = {\emph{NP}-Hardness of Approximately Solving Linear Equations over Reals}, journal = {{SIAM} J. Comput.}, volume = {42}, number = {3}, pages = {752--791}, year = {2013}, url = {https://doi.org/10.1137/110846415}, doi = {10.1137/110846415}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/KhotM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/ManurangsiM13, author = {Pasin Manurangsi and Dana Moshkovitz}, editor = {Hans L. Bodlaender and Giuseppe F. Italiano}, title = {Improved Approximation Algorithms for Projection Games - (Extended Abstract)}, booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8125}, pages = {683--694}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-40450-4\_58}, doi = {10.1007/978-3-642-40450-4\_58}, timestamp = {Mon, 03 Jan 2022 22:19:39 +0100}, biburl = {https://dblp.org/rec/conf/esa/ManurangsiM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isit/AbdrashitovMM13, author = {Vitaly Abdrashitov and Muriel M{\'{e}}dard and Dana Moshkovitz}, title = {Matched filter decoding of random binary and Gaussian codes in broadband Gaussian channel}, booktitle = {Proceedings of the 2013 {IEEE} International Symposium on Information Theory, Istanbul, Turkey, July 7-12, 2013}, pages = {2528--2523}, publisher = {{IEEE}}, year = {2013}, url = {https://doi.org/10.1109/ISIT.2013.6620682}, doi = {10.1109/ISIT.2013.6620682}, timestamp = {Wed, 16 Oct 2019 14:14:48 +0200}, biburl = {https://dblp.org/rec/conf/isit/AbdrashitovMM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/crossroads/Moshkovitz12, author = {Dana Moshkovitz}, title = {The tale of the {PCP} theorem}, journal = {{XRDS}}, volume = {18}, number = {3}, pages = {23--26}, year = {2012}, url = {https://doi.org/10.1145/2090276.2090286}, doi = {10.1145/2090276.2090286}, timestamp = {Fri, 03 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/crossroads/Moshkovitz12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/Moshkovitz12, author = {Dana Moshkovitz}, title = {Guest column: algebraic construction of projection PCPs}, journal = {{SIGACT} News}, volume = {43}, number = {1}, pages = {62--81}, year = {2012}, url = {https://doi.org/10.1145/2160649.2160669}, doi = {10.1145/2160649.2160669}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/sigact/Moshkovitz12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/Moshkovitz12, author = {Dana Moshkovitz}, editor = {Anupam Gupta and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Rocco A. Servedio}, title = {The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, {APPROX} 2012, and 16th International Workshop, {RANDOM} 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7408}, pages = {276--287}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-32512-0\_24}, doi = {10.1007/978-3-642-32512-0\_24}, timestamp = {Sun, 04 Aug 2024 19:37:16 +0200}, biburl = {https://dblp.org/rec/conf/approx/Moshkovitz12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KhotM11, author = {Subhash Khot and Dana Moshkovitz}, editor = {Lance Fortnow and Salil P. Vadhan}, title = {NP-hardness of approximately solving linear equations over reals}, booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC} 2011, San Jose, CA, USA, 6-8 June 2011}, pages = {413--420}, publisher = {{ACM}}, year = {2011}, url = {https://doi.org/10.1145/1993636.1993692}, doi = {10.1145/1993636.1993692}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KhotM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Moshkovitz11, author = {Dana Moshkovitz}, title = {The Projection Games Conjecture and The NP-Hardness of ln n-Approximating Set-Cover}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-112}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/112}, eprinttype = {ECCC}, eprint = {TR11-112}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Moshkovitz11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/MoshkovitzR10, author = {Dana Moshkovitz and Ran Raz}, title = {Sub-Constant Error Probabilistically Checkable Proof of Almost-Linear Size}, journal = {Comput. Complex.}, volume = {19}, number = {3}, pages = {367--422}, year = {2010}, url = {https://doi.org/10.1007/s00037-009-0278-0}, doi = {10.1007/S00037-009-0278-0}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/MoshkovitzR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/MoshkovitzR10, author = {Dana Moshkovitz and Ran Raz}, title = {Two-query {PCP} with subconstant error}, journal = {J. {ACM}}, volume = {57}, number = {5}, pages = {29:1--29:29}, year = {2010}, url = {https://doi.org/10.1145/1754399.1754402}, doi = {10.1145/1754399.1754402}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jacm/MoshkovitzR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AkaviaGGM10, author = {Adi Akavia and Oded Goldreich and Shafi Goldwasser and Dana Moshkovitz}, editor = {Leonard J. Schulman}, title = {Erratum for: on basing one-way functions on NP-hardness}, booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC} 2010, Cambridge, Massachusetts, USA, 5-8 June 2010}, pages = {795--796}, publisher = {{ACM}}, year = {2010}, url = {https://doi.org/10.1145/1806689.1806798}, doi = {10.1145/1806689.1806798}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AkaviaGGM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1002-3864, author = {Prahladh Harsha and Moses Charikar and Matthew Andrews and Sanjeev Arora and Subhash Khot and Dana Moshkovitz and Lisa Zhang and Ashkan Aazami and Dev Desai and Igor Gorodezky and Geetha Jagannathan and Alexander S. Kulikov and Darakhshan J. Mir and Alantha Newman and Aleksandar Nikolov and David Pritchard and Gwen Spencer}, title = {Limits of Approximation Algorithms: PCPs and Unique Games {(DIMACS} Tutorial Lecture Notes)}, journal = {CoRR}, volume = {abs/1002.3864}, year = {2010}, url = {http://arxiv.org/abs/1002.3864}, eprinttype = {arXiv}, eprint = {1002.3864}, timestamp = {Thu, 04 Jul 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1002-3864.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KhotM10, author = {Subhash Khot and Dana Moshkovitz}, title = {NP-Hardness of Approximately Solving Linear Equations Over Reals}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-112}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/112}, eprinttype = {ECCC}, eprint = {TR10-112}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KhotM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Moshkovitz10, author = {Dana Moshkovitz}, title = {An Alternative Proof of The Schwartz-Zippel Lemma}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-096}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/096}, eprinttype = {ECCC}, eprint = {TR10-096}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Moshkovitz10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/MoshkovitzK10, author = {Dana Moshkovitz and Subhash Khot}, title = {Hardness of Approximately Solving Linear Equations Over Reals}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-053}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/053}, eprinttype = {ECCC}, eprint = {TR10-053}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/MoshkovitzK10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/MoshkovitzR08, author = {Dana Moshkovitz and Ran Raz}, title = {Sub-Constant Error Low Degree Test of Almost-Linear Size}, journal = {{SIAM} J. Comput.}, volume = {38}, number = {1}, pages = {140--180}, year = {2008}, url = {https://doi.org/10.1137/060656838}, doi = {10.1137/060656838}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/MoshkovitzR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/MoshkovitzR08, author = {Dana Moshkovitz and Ran Raz}, title = {Two Query {PCP} with Sub-Constant Error}, booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2008, October 25-28, 2008, Philadelphia, PA, {USA}}, pages = {314--323}, publisher = {{IEEE} Computer Society}, year = {2008}, url = {https://doi.org/10.1109/FOCS.2008.60}, doi = {10.1109/FOCS.2008.60}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/focs/MoshkovitzR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/MoshkovitzR08a, author = {Dana Moshkovitz and Ran Raz}, title = {Two Query {PCP} with Sub-Constant Error}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR08-071}}, year = {2008}, url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-071/index.html}, eprinttype = {ECCC}, eprint = {TR08-071}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/MoshkovitzR08a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/MoshkovitzR07, author = {Dana Moshkovitz and Ran Raz}, title = {Sub-Constant Error Probabilistically Checkable Proof of Almost Linear Size}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR07-026}}, year = {2007}, url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-026/index.html}, eprinttype = {ECCC}, eprint = {TR07-026}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/MoshkovitzR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/AlonMS06, author = {Noga Alon and Dana Moshkovitz and Shmuel Safra}, title = {Algorithmic construction of sets for \emph{k}-restrictions}, journal = {{ACM} Trans. Algorithms}, volume = {2}, number = {2}, pages = {153--177}, year = {2006}, url = {https://doi.org/10.1145/1150334.1150336}, doi = {10.1145/1150334.1150336}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/talg/AlonMS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AkaviaGGM06, author = {Adi Akavia and Oded Goldreich and Shafi Goldwasser and Dana Moshkovitz}, editor = {Jon M. Kleinberg}, title = {On basing one-way functions on NP-hardness}, booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006}, pages = {701--710}, publisher = {{ACM}}, year = {2006}, url = {https://doi.org/10.1145/1132516.1132614}, doi = {10.1145/1132516.1132614}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AkaviaGGM06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/MoshkovitzR06, author = {Dana Moshkovitz and Ran Raz}, editor = {Jon M. Kleinberg}, title = {Sub-constant error low degree test of almost-linear size}, booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006}, pages = {21--30}, publisher = {{ACM}}, year = {2006}, url = {https://doi.org/10.1145/1132516.1132520}, doi = {10.1145/1132516.1132520}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/MoshkovitzR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR05-086, author = {Dana Moshkovitz and Ran Raz}, title = {Sub-Constant Error Low Degree Test of Almost Linear Size}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR05-086}}, year = {2005}, url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-086/index.html}, eprinttype = {ECCC}, eprint = {TR05-086}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-086.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.