Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Irit Dinur
@article{DBLP:journals/corr/abs-2402-01078, author = {Yotam Dikstein and Irit Dinur and Alexander Lubotzky}, title = {Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs}, journal = {CoRR}, volume = {abs/2402.01078}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2402.01078}, doi = {10.48550/ARXIV.2402.01078}, eprinttype = {arXiv}, eprint = {2402.01078}, timestamp = {Fri, 09 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2402-01078.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2402-07476, author = {Irit Dinur and Ting{-}Chun Lin and Thomas Vidick}, title = {Expansion of higher-dimensional cubical complexes with application to quantum locally testable codes}, journal = {CoRR}, volume = {abs/2402.07476}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2402.07476}, doi = {10.48550/ARXIV.2402.07476}, eprinttype = {arXiv}, eprint = {2402.07476}, timestamp = {Fri, 16 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2402-07476.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DiksteinDL24, author = {Yotam Dikstein and Irit Dinur and Alexander Lubotzky}, title = {Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs}, journal = {Electron. Colloquium Comput. Complex.}, pages = {TR24--019}, year = {2024}, url = {https://eccc.weizmann.ac.il/report/2024/019}, timestamp = {Tue, 05 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eccc/DiksteinDL24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DinurHLV23, author = {Irit Dinur and Min{-}Hsiu Hsieh and Ting{-}Chun Lin and Thomas Vidick}, editor = {Barna Saha and Rocco A. Servedio}, title = {Good Quantum {LDPC} Codes with Linear Time Decoders}, booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing, {STOC} 2023, Orlando, FL, USA, June 20-23, 2023}, pages = {905--918}, publisher = {{ACM}}, year = {2023}, url = {https://doi.org/10.1145/3564246.3585101}, doi = {10.1145/3564246.3585101}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/DinurHLV23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2301-03072, author = {Ron Asherov and Irit Dinur}, title = {Bipartite unique-neighbour expanders via Ramanujan graphs}, journal = {CoRR}, volume = {abs/2301.03072}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2301.03072}, doi = {10.48550/ARXIV.2301.03072}, eprinttype = {arXiv}, eprint = {2301.03072}, timestamp = {Tue, 10 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2301-03072.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2304-01608, author = {Yotam Dikstein and Irit Dinur}, title = {Coboundary and cosystolic expansion without dependence on dimension or degree}, journal = {CoRR}, volume = {abs/2304.01608}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2304.01608}, doi = {10.48550/ARXIV.2304.01608}, eprinttype = {arXiv}, eprint = {2304.01608}, timestamp = {Thu, 20 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2304-01608.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2308-09582, author = {Yotam Dikstein and Irit Dinur}, title = {Agreement theorems for high dimensional expanders in the small soundness regime: the role of covers}, journal = {CoRR}, volume = {abs/2308.09582}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2308.09582}, doi = {10.48550/ARXIV.2308.09582}, eprinttype = {arXiv}, eprint = {2308.09582}, timestamp = {Fri, 25 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2308-09582.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2308-15563, author = {Irit Dinur and Siqi Liu and Rachel Yun Zhang}, title = {New Codes on High Dimensional Expanders}, journal = {CoRR}, volume = {abs/2308.15563}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2308.15563}, doi = {10.48550/ARXIV.2308.15563}, eprinttype = {arXiv}, eprint = {2308.15563}, timestamp = {Mon, 04 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2308-15563.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2312-15325, author = {Yotam Dikstein and Irit Dinur}, title = {Swap cosystolic expansion}, journal = {CoRR}, volume = {abs/2312.15325}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2312.15325}, doi = {10.48550/ARXIV.2312.15325}, eprinttype = {arXiv}, eprint = {2312.15325}, timestamp = {Wed, 10 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2312-15325.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2312-16125, author = {Yotam Dikstein and Irit Dinur and Shiri Sivan}, title = {The linear time encoding scheme fails to encode}, journal = {CoRR}, volume = {abs/2312.16125}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2312.16125}, doi = {10.48550/ARXIV.2312.16125}, eprinttype = {arXiv}, eprint = {2312.16125}, timestamp = {Thu, 18 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2312-16125.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DiksteinD23, author = {Yotam Dikstein and Irit Dinur}, title = {Coboundary and cosystolic expansion without dependence on dimension or degree}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR23-043}}, year = {2023}, url = {https://eccc.weizmann.ac.il/report/2023/043}, eprinttype = {ECCC}, eprint = {TR23-043}, timestamp = {Tue, 13 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DiksteinD23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DiksteinD23a, author = {Yotam Dikstein and Irit Dinur}, title = {Agreement theorems for high dimensional expanders in the small soundness regime: the role of covers}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR23-119}}, year = {2023}, url = {https://eccc.weizmann.ac.il/report/2023/119}, eprinttype = {ECCC}, eprint = {TR23-119}, timestamp = {Wed, 30 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DiksteinD23a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DiksteinD23b, author = {Yotam Dikstein and Irit Dinur}, title = {Swap cosystolic expansion}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR23-209}}, year = {2023}, url = {https://eccc.weizmann.ac.il/report/2023/209}, eprinttype = {ECCC}, eprint = {TR23-209}, timestamp = {Wed, 10 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eccc/DiksteinD23b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurLZ23, author = {Irit Dinur and Siqi Liu and Rachel Yun Zhang}, title = {New Codes on High Dimensional Expanders}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR23-127}}, year = {2023}, url = {https://eccc.weizmann.ac.il/report/2023/127}, eprinttype = {ECCC}, eprint = {TR23-127}, timestamp = {Mon, 04 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurLZ23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/DinurHKR22, author = {Irit Dinur and Prahladh Harsha and Tali Kaufman and Noga Ron{-}Zewi}, title = {From Local to Robust Testing via Agreement Testing}, journal = {Theory Comput.}, volume = {18}, pages = {1--25}, year = {2022}, url = {https://theoryofcomputing.org/articles/v018a012/}, timestamp = {Thu, 02 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/toc/DinurHKR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/BrukhimCDMY22, author = {Nataly Brukhim and Daniel Carmon and Irit Dinur and Shay Moran and Amir Yehudayoff}, title = {A Characterization of Multiclass Learnability}, booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2022, Denver, CO, USA, October 31 - November 3, 2022}, pages = {943--955}, publisher = {{IEEE}}, year = {2022}, url = {https://doi.org/10.1109/FOCS54457.2022.00093}, doi = {10.1109/FOCS54457.2022.00093}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/focs/BrukhimCDMY22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/Dinur22, author = {Irit Dinur}, editor = {Anuj Dawar and Venkatesan Guruswami}, title = {Expanders in Higher Dimensions (Invited Talk)}, booktitle = {42nd {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2022, December 18-20, 2022, {IIT} Madras, Chennai, India}, series = {LIPIcs}, volume = {250}, pages = {4:1--4:1}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2022.4}, doi = {10.4230/LIPICS.FSTTCS.2022.4}, timestamp = {Wed, 14 Dec 2022 11:57:55 +0100}, biburl = {https://dblp.org/rec/conf/fsttcs/Dinur22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DinurELLM22, author = {Irit Dinur and Shai Evra and Ron Livne and Alexander Lubotzky and Shahar Mozes}, editor = {Stefano Leonardi and Anupam Gupta}, title = {Locally testable codes with constant rate, distance, and locality}, booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022}, pages = {357--374}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3519935.3520024}, doi = {10.1145/3519935.3520024}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/DinurELLM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2203-01550, author = {Nataly Brukhim and Daniel Carmon and Irit Dinur and Shay Moran and Amir Yehudayoff}, title = {A Characterization of Multiclass Learnability}, journal = {CoRR}, volume = {abs/2203.01550}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2203.01550}, doi = {10.48550/ARXIV.2203.01550}, eprinttype = {arXiv}, eprint = {2203.01550}, timestamp = {Wed, 16 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2203-01550.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2207-11929, author = {Irit Dinur and Shai Evra and Ron Livne and Alexander Lubotzky and Shahar Mozes}, title = {Good Locally Testable Codes}, journal = {CoRR}, volume = {abs/2207.11929}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2207.11929}, doi = {10.48550/ARXIV.2207.11929}, eprinttype = {arXiv}, eprint = {2207.11929}, timestamp = {Mon, 01 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2207-11929.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BrukhimCDMY22, author = {Nataly Brukhim and Daniel Carmon and Irit Dinur and Shay Moran and Amir Yehudayoff}, title = {A Characterization of Multiclass Learnability}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR22-035}}, year = {2022}, url = {https://eccc.weizmann.ac.il/report/2022/035}, eprinttype = {ECCC}, eprint = {TR22-035}, timestamp = {Mon, 11 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BrukhimCDMY22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DinurHKNT21, author = {Irit Dinur and Prahladh Harsha and Tali Kaufman and Inbal Livni Navon and Amnon Ta{-}Shma}, title = {List-Decoding with Double Samplers}, journal = {{SIAM} J. Comput.}, volume = {50}, number = {2}, pages = {301--349}, year = {2021}, url = {https://doi.org/10.1137/19M1276650}, doi = {10.1137/19M1276650}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/DinurHKNT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/DinurFHT21, author = {Irit Dinur and Yuval Filmus and Prahladh Harsha and Madhur Tulsiani}, editor = {James R. Lee}, title = {Explicit SoS Lower Bounds from High-Dimensional Expanders}, booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS} 2021, January 6-8, 2021, Virtual Conference}, series = {LIPIcs}, volume = {185}, pages = {38:1--38:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.38}, doi = {10.4230/LIPICS.ITCS.2021.38}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/DinurFHT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2111-04808, author = {Irit Dinur and Shai Evra and Ron Livne and Alexander Lubotzky and Shahar Mozes}, title = {Locally Testable Codes with constant rate, distance, and locality}, journal = {CoRR}, volume = {abs/2111.04808}, year = {2021}, url = {https://arxiv.org/abs/2111.04808}, eprinttype = {arXiv}, eprint = {2111.04808}, timestamp = {Wed, 10 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2111-04808.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurELLM21, author = {Irit Dinur and Shai Evra and Ron Livne and Alexander Lubotzky and Shahar Mozes}, title = {Locally Testable Codes with constant rate, distance, and locality}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR21-151}}, year = {2021}, url = {https://eccc.weizmann.ac.il/report/2021/151}, eprinttype = {ECCC}, eprint = {TR21-151}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurELLM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2005-01045, author = {Yotam Dikstein and Irit Dinur and Prahladh Harsha and Noga Ron{-}Zewi}, title = {Locally testable codes via high-dimensional expanders}, journal = {CoRR}, volume = {abs/2005.01045}, year = {2020}, url = {https://arxiv.org/abs/2005.01045}, eprinttype = {arXiv}, eprint = {2005.01045}, timestamp = {Fri, 08 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2005-01045.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2009-05218, author = {Irit Dinur and Yuval Filmus and Prahladh Harsha and Madhur Tulsiani}, title = {Explicit SoS lower bounds from high-dimensional expanders}, journal = {CoRR}, volume = {abs/2009.05218}, year = {2020}, url = {https://arxiv.org/abs/2009.05218}, eprinttype = {arXiv}, eprint = {2009.05218}, timestamp = {Thu, 17 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2009-05218.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DiksteinDHR20, author = {Yotam Dikstein and Irit Dinur and Prahladh Harsha and Noga Ron{-}Zewi}, title = {Locally testable codes via high-dimensional expanders}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR20-072}}, year = {2020}, url = {https://eccc.weizmann.ac.il/report/2020/072}, eprinttype = {ECCC}, eprint = {TR20-072}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DiksteinDHR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurFHT20, author = {Irit Dinur and Yuval Filmus and Prahladh Harsha and Madhur Tulsiani}, title = {Explicit and structured sum of squares lower bounds from high dimensional expanders}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR20-136}}, year = {2020}, url = {https://eccc.weizmann.ac.il/report/2020/136}, eprinttype = {ECCC}, eprint = {TR20-136}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurFHT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DinurMK19, author = {Irit Dinur and Or Meir and Swastik Kopparty}, title = {Special Section on the Fifty-Seventh Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS} 2016)}, journal = {{SIAM} J. Comput.}, volume = {48}, number = {2}, pages = {451}, year = {2019}, url = {https://doi.org/10.1137/19N974762}, doi = {10.1137/19N974762}, timestamp = {Thu, 23 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/DinurMK19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/DinurG19, author = {Irit Dinur and Konstantin Golubev}, editor = {Dimitris Achlioptas and L{\'{a}}szl{\'{o}} A. V{\'{e}}gh}, title = {Direct Sum Testing: The General Case}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, {USA}}, series = {LIPIcs}, volume = {145}, pages = {40:1--40:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.40}, doi = {10.4230/LIPICS.APPROX-RANDOM.2019.40}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/DinurG19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DiksteinD19, author = {Yotam Dikstein and Irit Dinur}, editor = {David Zuckerman}, title = {Agreement Testing Theorems on Layered Set Systems}, booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2019, Baltimore, Maryland, USA, November 9-12, 2019}, pages = {1495--1524}, publisher = {{IEEE} Computer Society}, year = {2019}, url = {https://doi.org/10.1109/FOCS.2019.00088}, doi = {10.1109/FOCS.2019.00088}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/focs/DiksteinD19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/DinurHKR19, author = {Irit Dinur and Prahladh Harsha and Tali Kaufman and Noga Ron{-}Zewi}, editor = {Avrim Blum}, title = {From Local to Robust Testing via Agreement Testing}, booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS} 2019, January 10-12, 2019, San Diego, California, {USA}}, series = {LIPIcs}, volume = {124}, pages = {29:1--29:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.29}, doi = {10.4230/LIPICS.ITCS.2019.29}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/DinurHKR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/Dinur0G19, author = {Irit Dinur and Oded Goldreich and Tom Gur}, editor = {Avrim Blum}, title = {Every Set in {P} Is Strongly Testable Under a Suitable Encoding}, booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS} 2019, January 10-12, 2019, San Diego, California, {USA}}, series = {LIPIcs}, volume = {124}, pages = {30:1--30:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.30}, doi = {10.4230/LIPICS.ITCS.2019.30}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/Dinur0G19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/DinurFH19, author = {Irit Dinur and Yuval Filmus and Prahladh Harsha}, editor = {Timothy M. Chan}, title = {Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract]}, booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9, 2019}, pages = {2124--2133}, publisher = {{SIAM}}, year = {2019}, url = {https://doi.org/10.1137/1.9781611975482.128}, doi = {10.1137/1.9781611975482.128}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/DinurFH19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/DinurHKNT19, author = {Irit Dinur and Prahladh Harsha and Tali Kaufman and Inbal Livni Navon and Amnon Ta{-}Shma}, editor = {Timothy M. Chan}, title = {List Decoding with Double Samplers}, booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9, 2019}, pages = {2134--2153}, publisher = {{SIAM}}, year = {2019}, url = {https://doi.org/10.1137/1.9781611975482.129}, doi = {10.1137/1.9781611975482.129}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/DinurHKNT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1904-12747, author = {Irit Dinur and Konstantin Golubev}, title = {Testing tensor products}, journal = {CoRR}, volume = {abs/1904.12747}, year = {2019}, url = {http://arxiv.org/abs/1904.12747}, eprinttype = {arXiv}, eprint = {1904.12747}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1904-12747.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1909-00638, author = {Yotam Dikstein and Irit Dinur}, title = {Agreement testing theorems on layered set systems}, journal = {CoRR}, volume = {abs/1909.00638}, year = {2019}, url = {http://arxiv.org/abs/1909.00638}, eprinttype = {arXiv}, eprint = {1909.00638}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1909-00638.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DiksteinD19, author = {Yotam Dikstein and Irit Dinur}, title = {Agreement testing theorems on layered set systems}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR19-112}}, year = {2019}, url = {https://eccc.weizmann.ac.il/report/2019/112}, eprinttype = {ECCC}, eprint = {TR19-112}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DiksteinD19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurG19, author = {Irit Dinur and Konstantin Golubev}, title = {Direct sum testing - the general case}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR19-139}}, year = {2019}, url = {https://eccc.weizmann.ac.il/report/2019/139}, eprinttype = {ECCC}, eprint = {TR19-139}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurG19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurM19, author = {Irit Dinur and Roy Meshulam}, title = {Near Coverings and Cosystolic Expansion - an example of topological property testing}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR19-126}}, year = {2019}, url = {https://eccc.weizmann.ac.il/report/2019/126}, eprinttype = {ECCC}, eprint = {TR19-126}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/DinurM18, author = {Irit Dinur and Or Meir}, title = {Toward the {KRW} Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity}, journal = {Comput. Complex.}, volume = {27}, number = {3}, pages = {375--462}, year = {2018}, url = {https://doi.org/10.1007/s00037-017-0159-x}, doi = {10.1007/S00037-017-0159-X}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/DinurM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/DiksteinDFH18, author = {Yotam Dikstein and Irit Dinur and Yuval Filmus and Prahladh Harsha}, editor = {Eric Blais and Klaus Jansen and Jos{\'{e}} D. P. Rolim and David Steurer}, title = {Boolean Function Analysis on High-Dimensional Expanders}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2018, August 20-22, 2018 - Princeton, NJ, {USA}}, series = {LIPIcs}, volume = {116}, pages = {38:1--38:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.38}, doi = {10.4230/LIPICS.APPROX-RANDOM.2018.38}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/approx/DiksteinDFH18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/DinurM18, author = {Irit Dinur and Pasin Manurangsi}, editor = {Anna R. Karlin}, title = {ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network}, booktitle = {9th Innovations in Theoretical Computer Science Conference, {ITCS} 2018, January 11-14, 2018, Cambridge, MA, {USA}}, series = {LIPIcs}, volume = {94}, pages = {36:1--36:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2018.36}, doi = {10.4230/LIPICS.ITCS.2018.36}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/innovations/DinurM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DinurKKMS18, author = {Irit Dinur and Subhash Khot and Guy Kindler and Dor Minzer and Muli Safra}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Towards a proof of the 2-to-1 games conjecture?}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {376--389}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188804}, doi = {10.1145/3188745.3188804}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/DinurKKMS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DinurKKMS18a, author = {Irit Dinur and Subhash Khot and Guy Kindler and Dor Minzer and Muli Safra}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {On non-optimally expanding sets in Grassmann graphs}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {940--951}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188806}, doi = {10.1145/3188745.3188806}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/DinurKKMS18a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1804-08155, author = {Yotam Dikstein and Irit Dinur and Yuval Filmus and Prahladh Harsha}, title = {Boolean functions on high-dimensional expanders}, journal = {CoRR}, volume = {abs/1804.08155}, year = {2018}, url = {http://arxiv.org/abs/1804.08155}, eprinttype = {arXiv}, eprint = {1804.08155}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1804-08155.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1805-03867, author = {Irit Dinur and Pasin Manurangsi}, title = {ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network}, journal = {CoRR}, volume = {abs/1805.03867}, year = {2018}, url = {http://arxiv.org/abs/1805.03867}, eprinttype = {arXiv}, eprint = {1805.03867}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1805-03867.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1808-00425, author = {Irit Dinur and Prahladh Harsha and Tali Kaufman and Inbal Livni Navon and Amnon Ta{-}Shma}, title = {List Decoding with Double Samplers}, journal = {CoRR}, volume = {abs/1808.00425}, year = {2018}, url = {http://arxiv.org/abs/1808.00425}, eprinttype = {arXiv}, eprint = {1808.00425}, timestamp = {Sun, 02 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1808-00425.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurDFH18, author = {Irit Dinur and Yotam Dikstein and Yuval Filmus and Prahladh Harsha}, title = {Boolean function analysis on high-dimensional expanders}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-075}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/075}, eprinttype = {ECCC}, eprint = {TR18-075}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurDFH18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurGG18, author = {Irit Dinur and Oded Goldreich and Tom Gur}, title = {Every set in {P} is strongly testable under a suitable encoding}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-050}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/050}, eprinttype = {ECCC}, eprint = {TR18-050}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurGG18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurHKNT18, author = {Irit Dinur and Prahladh Harsha and Tali Kaufman and Inbal Livni Navon and Amnon Ta{-}Shma}, title = {List Decoding with Double Samplers}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-136}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/136}, eprinttype = {ECCC}, eprint = {TR18-136}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurHKNT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurKR18, author = {Irit Dinur and Tali Kaufman and Noga Ron{-}Zewi}, title = {From Local to Robust Testing via Agreement Testing}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-198}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/198}, eprinttype = {ECCC}, eprint = {TR18-198}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurKR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurM18, author = {Irit Dinur and Pasin Manurangsi}, title = {ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-093}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/093}, eprinttype = {ECCC}, eprint = {TR18-093}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DavidDGKS17, author = {Roee David and Irit Dinur and Elazar Goldenberg and Guy Kindler and Igor Shinkar}, title = {Direct Sum Testing}, journal = {{SIAM} J. Comput.}, volume = {46}, number = {4}, pages = {1336--1369}, year = {2017}, url = {https://doi.org/10.1137/16M1061655}, doi = {10.1137/16M1061655}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/DavidDGKS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/DinurN17, author = {Irit Dinur and Inbal Livni Navon}, editor = {Ryan O'Donnell}, title = {Exponentially Small Soundness for the Direct Product Z-Test}, booktitle = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017, Riga, Latvia}, series = {LIPIcs}, volume = {79}, pages = {29:1--29:50}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CCC.2017.29}, doi = {10.4230/LIPICS.CCC.2017.29}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/coco/DinurN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DinurK17, author = {Irit Dinur and Tali Kaufman}, editor = {Chris Umans}, title = {High Dimensional Expanders Imply Agreement Expanders}, booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2017, Berkeley, CA, USA, October 15-17, 2017}, pages = {974--985}, publisher = {{IEEE} Computer Society}, year = {2017}, url = {https://doi.org/10.1109/FOCS.2017.94}, doi = {10.1109/FOCS.2017.94}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/focs/DinurK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/DinurHVY17, author = {Irit Dinur and Prahladh Harsha and Rakesh Venkat and Henry Yuen}, editor = {Christos H. Papadimitriou}, title = {Multiplayer Parallel Repetition for Expanding Games}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {37:1--37:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.37}, doi = {10.4230/LIPICS.ITCS.2017.37}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/DinurHVY17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/BhangaleDN17, author = {Amey Bhangale and Irit Dinur and Inbal Livni Navon}, editor = {Christos H. Papadimitriou}, title = {Cube vs. Cube Low Degree Test}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {40:1--40:31}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.40}, doi = {10.4230/LIPICS.ITCS.2017.40}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/BhangaleDN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1711-09426, author = {Irit Dinur and Yuval Filmus and Prahladh Harsha}, title = {Agreement tests on graphs and hypergraphs}, journal = {CoRR}, volume = {abs/1711.09426}, year = {2017}, url = {http://arxiv.org/abs/1711.09426}, eprinttype = {arXiv}, eprint = {1711.09426}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1711-09426.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1711-09428, author = {Irit Dinur and Yuval Filmus and Prahladh Harsha}, title = {Low degree almost Boolean functions are sparse juntas}, journal = {CoRR}, volume = {abs/1711.09428}, year = {2017}, url = {http://arxiv.org/abs/1711.09428}, eprinttype = {arXiv}, eprint = {1711.09428}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1711-09428.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurFH17, author = {Irit Dinur and Yuval Filmus and Prahladh Harsha}, title = {Low degree almost Boolean functions are sparse juntas}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-180}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/180}, eprinttype = {ECCC}, eprint = {TR17-180}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurFH17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurFH17a, author = {Irit Dinur and Yuval Filmus and Prahladh Harsha}, title = {Agreement tests on graphs and hypergraphs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-181}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/181}, eprinttype = {ECCC}, eprint = {TR17-181}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurFH17a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurK17, author = {Irit Dinur and Tali Kaufman}, title = {High dimensional expanders imply agreement expanders}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-089}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/089}, eprinttype = {ECCC}, eprint = {TR17-089}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurKKMS17, author = {Irit Dinur and Subhash Khot and Guy Kindler and Dor Minzer and Muli Safra}, title = {On Non-Optimally Expanding Sets in Grassmann Graphs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-094}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/094}, eprinttype = {ECCC}, eprint = {TR17-094}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurKKMS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurN17, author = {Irit Dinur and Inbal Livni Navon}, title = {Exponentially Small Soundness for the Direct Product Z-test}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-096}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/096}, eprinttype = {ECCC}, eprint = {TR17-096}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/DinurM16, author = {Irit Dinur and Or Meir}, editor = {Ran Raz}, title = {Toward the {KRW} Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity}, booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to June 1, 2016, Tokyo, Japan}, series = {LIPIcs}, volume = {50}, pages = {3:1--3:51}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.CCC.2016.3}, doi = {10.4230/LIPICS.CCC.2016.3}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/coco/DinurM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/focs/2016, editor = {Irit Dinur}, title = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS} 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, {USA}}, publisher = {{IEEE} Computer Society}, year = {2016}, url = {https://ieeexplore.ieee.org/xpl/conhome/7781469/proceeding}, isbn = {978-1-5090-3933-3}, timestamp = {Wed, 16 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/focs/2016.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/DinurHVY16, author = {Irit Dinur and Prahladh Harsha and Rakesh Venkat and Henry Yuen}, title = {Multiplayer parallel repetition for expander games}, journal = {CoRR}, volume = {abs/1610.08349}, year = {2016}, url = {http://arxiv.org/abs/1610.08349}, eprinttype = {arXiv}, eprint = {1610.08349}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/DinurHVY16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BhangaleDN16, author = {Amey Bhangale and Irit Dinur and Inbal Livni Navon}, title = {Cube vs. Cube Low Degree Test}, journal = {CoRR}, volume = {abs/1612.07491}, year = {2016}, url = {http://arxiv.org/abs/1612.07491}, eprinttype = {arXiv}, eprint = {1612.07491}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BhangaleDN16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BhangaleDN16, author = {Amey Bhangale and Irit Dinur and Inbal Livni Navon}, title = {Cube vs. Cube Low Degree Test}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR16-205}}, year = {2016}, url = {https://eccc.weizmann.ac.il/report/2016/205}, eprinttype = {ECCC}, eprint = {TR16-205}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BhangaleDN16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Dinur16, author = {Irit Dinur}, title = {Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR16-128}}, year = {2016}, url = {https://eccc.weizmann.ac.il/report/2016/128}, eprinttype = {ECCC}, eprint = {TR16-128}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Dinur16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurHVY16, author = {Irit Dinur and Prahladh Harsha and Rakesh Venkat and Henry Yuen}, title = {Multiplayer parallel repetition for expander games}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR16-160}}, year = {2016}, url = {https://eccc.weizmann.ac.il/report/2016/160}, eprinttype = {ECCC}, eprint = {TR16-160}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurHVY16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurKKMS16, author = {Irit Dinur and Subhash Khot and Guy Kindler and Dor Minzer and Muli Safra}, title = {Towards a Proof of the 2-to-1 Games Conjecture?}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR16-198}}, year = {2016}, url = {https://eccc.weizmann.ac.il/report/2016/198}, eprinttype = {ECCC}, eprint = {TR16-198}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurKKMS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurM16, author = {Irit Dinur and Or Meir}, title = {Toward the {KRW} Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR16-035}}, year = {2016}, url = {https://eccc.weizmann.ac.il/report/2016/035}, eprinttype = {ECCC}, eprint = {TR16-035}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/DinurSV15, author = {Irit Dinur and David Steurer and Thomas Vidick}, title = {A parallel repetition theorem for entangled projection games}, journal = {Comput. Complex.}, volume = {24}, number = {2}, pages = {201--254}, year = {2015}, url = {https://doi.org/10.1007/s00037-015-0098-3}, doi = {10.1007/S00037-015-0098-3}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/DinurSV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/DinurGL15, author = {Irit Dinur and Shafi Goldwasser and Huijia Lin}, editor = {Tim Roughgarden}, title = {The Computational Benefit of Correlated Instances}, booktitle = {Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, {ITCS} 2015, Rehovot, Israel, January 11-13, 2015}, pages = {219--228}, publisher = {{ACM}}, year = {2015}, url = {https://doi.org/10.1145/2688073.2688082}, doi = {10.1145/2688073.2688082}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/DinurGL15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/DavidDGKS15, author = {Roee David and Irit Dinur and Elazar Goldenberg and Guy Kindler and Igor Shinkar}, editor = {Tim Roughgarden}, title = {Direct Sum Testing}, booktitle = {Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, {ITCS} 2015, Rehovot, Israel, January 11-13, 2015}, pages = {327--336}, publisher = {{ACM}}, year = {2015}, url = {https://doi.org/10.1145/2688073.2688078}, doi = {10.1145/2688073.2688078}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/DavidDGKS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/DinurHSV15, author = {Irit Dinur and Prahladh Harsha and Srikanth Srinivasan and Girish Varma}, editor = {Ernst W. Mayr and Nicolas Ollinger}, title = {Derandomized Graph Product Results Using the Low Degree Long Code}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science, {STACS} 2015, March 4-7, 2015, Garching, Germany}, series = {LIPIcs}, volume = {30}, pages = {275--287}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.STACS.2015.275}, doi = {10.4230/LIPICS.STACS.2015.275}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/DinurHSV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DinurHK15, author = {Irit Dinur and Prahladh Harsha and Guy Kindler}, editor = {Rocco A. Servedio and Ronitt Rubinfeld}, title = {Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition}, booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015}, pages = {267--276}, publisher = {{ACM}}, year = {2015}, url = {https://doi.org/10.1145/2746539.2746630}, doi = {10.1145/2746539.2746630}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/DinurHK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/DinurHK15, author = {Irit Dinur and Prahladh Harsha and Guy Kindler}, title = {Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition}, journal = {CoRR}, volume = {abs/1505.06362}, year = {2015}, url = {http://arxiv.org/abs/1505.06362}, eprinttype = {arXiv}, eprint = {1505.06362}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/DinurHK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurHK15, author = {Irit Dinur and Prahladh Harsha and Guy Kindler}, title = {Polynomially Low Error PCPs with polyloglogn Queries via Modular Composition}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR15-085}}, year = {2015}, url = {https://eccc.weizmann.ac.il/report/2015/085}, eprinttype = {ECCC}, eprint = {TR15-085}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurHK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/DinurS14, author = {Irit Dinur and David Steurer}, title = {Direct Product Testing}, booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver, BC, Canada, June 11-13, 2014}, pages = {188--196}, publisher = {{IEEE} Computer Society}, year = {2014}, url = {https://doi.org/10.1109/CCC.2014.27}, doi = {10.1109/CCC.2014.27}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/coco/DinurS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/DinurSV14, author = {Irit Dinur and David Steurer and Thomas Vidick}, title = {A Parallel Repetition Theorem for Entangled Projection Games}, booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver, BC, Canada, June 11-13, 2014}, pages = {197--208}, publisher = {{IEEE} Computer Society}, year = {2014}, url = {https://doi.org/10.1109/CCC.2014.28}, doi = {10.1109/CCC.2014.28}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/coco/DinurSV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DinurS14, author = {Irit Dinur and David Steurer}, editor = {David B. Shmoys}, title = {Analytical approach to parallel repetition}, booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA, May 31 - June 03, 2014}, pages = {624--633}, publisher = {{ACM}}, year = {2014}, url = {https://doi.org/10.1145/2591796.2591884}, doi = {10.1145/2591796.2591884}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/DinurS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/DinurHSV14, author = {Irit Dinur and Prahladh Harsha and Srikanth Srinivasan and Girish Varma}, title = {Derandomized Graph Product Results using the Low Degree Long Code}, journal = {CoRR}, volume = {abs/1411.3517}, year = {2014}, url = {http://arxiv.org/abs/1411.3517}, eprinttype = {arXiv}, eprint = {1411.3517}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/DinurHSV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DavidDGKS14, author = {Roee David and Irit Dinur and Elazar Goldenberg and Guy Kindler and Igor Shinkar}, title = {Direct Sum Testing}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-002}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/002}, eprinttype = {ECCC}, eprint = {TR14-002}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DavidDGKS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurGL14, author = {Irit Dinur and Shafi Goldwasser and Huijia Lin}, title = {The Computational Benefit of Correlated Instances}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-083}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/083}, eprinttype = {ECCC}, eprint = {TR14-083}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurGL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/BarakD13, author = {Boaz Barak and Irit Dinur}, title = {Special Issue "Conference on Computational Complexity 2012" Guest editors' foreword}, journal = {Comput. Complex.}, volume = {22}, number = {2}, pages = {215--217}, year = {2013}, url = {https://doi.org/10.1007/s00037-013-0070-z}, doi = {10.1007/S00037-013-0070-Z}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/BarakD13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DinurH13, author = {Irit Dinur and Prahladh Harsha}, title = {Composition of Low-Error 2-Query PCPs Using Decodable PCPs}, journal = {{SIAM} J. Comput.}, volume = {42}, number = {6}, pages = {2452--2486}, year = {2013}, url = {https://doi.org/10.1137/100788161}, doi = {10.1137/100788161}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/DinurH13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/DinurK13, author = {Irit Dinur and Gillat Kol}, title = {Covering CSPs}, booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC} 2013, K.lo Alto, California, USA, 5-7 June, 2013}, pages = {207--218}, publisher = {{IEEE} Computer Society}, year = {2013}, url = {https://doi.org/10.1109/CCC.2013.29}, doi = {10.1109/CCC.2013.29}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/coco/DinurK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DinurG13, author = {Irit Dinur and Venkatesan Guruswami}, title = {PCPs via Low-Degree Long Code and Hardness for Constrained Hypergraph Coloring}, booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2013, 26-29 October, 2013, Berkeley, CA, {USA}}, pages = {340--349}, publisher = {{IEEE} Computer Society}, year = {2013}, url = {https://doi.org/10.1109/FOCS.2013.44}, doi = {10.1109/FOCS.2013.44}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/focs/DinurG13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/DinurG13, author = {Irit Dinur and Elazar Goldenberg}, editor = {Fedor V. Fomin and Rusins Freivalds and Marta Z. Kwiatkowska and David Peleg}, title = {Clustering in the Boolean Hypercube in a List Decoding Regime}, booktitle = {Automata, Languages, and Programming - 40th International Colloquium, {ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {7965}, pages = {413--424}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-39206-1\_35}, doi = {10.1007/978-3-642-39206-1\_35}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/DinurG13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1305-1979, author = {Irit Dinur and David Steurer}, title = {Analytical Approach to Parallel Repetition}, journal = {CoRR}, volume = {abs/1305.1979}, year = {2013}, url = {http://arxiv.org/abs/1305.1979}, eprinttype = {arXiv}, eprint = {1305.1979}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1305-1979.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/DinurSV13, author = {Irit Dinur and David Steurer and Thomas Vidick}, title = {A parallel repetition theorem for entangled projection games}, journal = {CoRR}, volume = {abs/1310.4113}, year = {2013}, url = {http://arxiv.org/abs/1310.4113}, eprinttype = {arXiv}, eprint = {1310.4113}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/DinurSV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurG13, author = {Irit Dinur and Elazar Goldenberg}, title = {Clustering in the Boolean Hypercube in a List Decoding Regime}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR13-031}}, year = {2013}, url = {https://eccc.weizmann.ac.il/report/2013/031}, eprinttype = {ECCC}, eprint = {TR13-031}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurG13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurG13a, author = {Irit Dinur and Venkatesan Guruswami}, title = {PCPs via low-degree long code and hardness for constrained hypergraph coloring}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR13-122}}, year = {2013}, url = {https://eccc.weizmann.ac.il/report/2013/122}, eprinttype = {ECCC}, eprint = {TR13-122}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurG13a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurS13, author = {Irit Dinur and Igor Shinkar}, title = {On the Conditional Hardness of Coloring a 4-colorable Graph with Super-Constant Number of Colors}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR13-148}}, year = {2013}, url = {https://eccc.weizmann.ac.il/report/2013/148}, eprinttype = {ECCC}, eprint = {TR13-148}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurS13a, author = {Irit Dinur and David Steurer}, title = {Direct Product Testing}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR13-179}}, year = {2013}, url = {https://eccc.weizmann.ac.il/report/2013/179}, eprinttype = {ECCC}, eprint = {TR13-179}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurS13a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurK12, author = {Irit Dinur and Gillat Kol}, title = {Covering CSPs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR12-088}}, year = {2012}, url = {https://eccc.weizmann.ac.il/report/2012/088}, eprinttype = {ECCC}, eprint = {TR12-088}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurK12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/DinurM11, author = {Irit Dinur and Or Meir}, title = {Derandomized Parallel Repetition via Structured PCPs}, journal = {Comput. Complex.}, volume = {20}, number = {2}, pages = {207--327}, year = {2011}, url = {https://doi.org/10.1007/s00037-011-0013-5}, doi = {10.1007/S00037-011-0013-5}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/DinurM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/DinurFKRS11, author = {Irit Dinur and Eldar Fischer and Guy Kindler and Ran Raz and Shmuel Safra}, title = {{PCP} Characterizations of {NP:} Toward a Polynomially-Small Error-Probability}, journal = {Comput. Complex.}, volume = {20}, number = {3}, pages = {413--504}, year = {2011}, url = {https://doi.org/10.1007/s00037-011-0014-4}, doi = {10.1007/S00037-011-0014-4}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/DinurFKRS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/DinurK11, author = {Irit Dinur and Tali Kaufman}, editor = {Leslie Ann Goldberg and Klaus Jansen and R. Ravi and Jos{\'{e}} D. P. Rolim}, title = {Dense Locally Testable Codes Cannot Have Constant Rate and Distance}, 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 = {507--518}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-22935-0\_43}, doi = {10.1007/978-3-642-22935-0\_43}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/DinurK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurK11, author = {Irit Dinur and Tali Kaufman}, title = {Dense locally testable codes cannot have constant rate and distance}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-055}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/055}, eprinttype = {ECCC}, eprint = {TR11-055}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/DinurS10, author = {Irit Dinur and Igor Shinkar}, editor = {Maria J. Serna and Ronen Shaltiel and Klaus Jansen and Jos{\'{e}} D. P. Rolim}, title = {On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 13th International Workshop, {APPROX} 2010, and 14th International Workshop, {RANDOM} 2010, Barcelona, Spain, September 1-3, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6302}, pages = {138--151}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-15369-3\_11}, doi = {10.1007/978-3-642-15369-3\_11}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/DinurS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/DinurG10, author = {Irit Dinur and Elazar Goldenberg}, editor = {Maria J. Serna and Ronen Shaltiel and Klaus Jansen and Jos{\'{e}} D. P. Rolim}, title = {The Structure of Winning Strategies in Parallel Repetition Games}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 13th International Workshop, {APPROX} 2010, and 14th International Workshop, {RANDOM} 2010, Barcelona, Spain, September 1-3, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6302}, pages = {518--530}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-15369-3\_39}, doi = {10.1007/978-3-642-15369-3\_39}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/DinurG10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/DinurM10, author = {Irit Dinur and Or Meir}, title = {Derandomized Parallel Repetition of Structured PCPs}, booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12, 2010}, pages = {16--27}, publisher = {{IEEE} Computer Society}, year = {2010}, url = {https://doi.org/10.1109/CCC.2010.11}, doi = {10.1109/CCC.2010.11}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/coco/DinurM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DinurKPS10, author = {Irit Dinur and Subhash Khot and Will Perkins and Muli Safra}, title = {Hardness of Finding Independent Sets in Almost 3-Colorable Graphs}, booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2010, October 23-26, 2010, Las Vegas, Nevada, {USA}}, pages = {212--221}, publisher = {{IEEE} Computer Society}, year = {2010}, url = {https://doi.org/10.1109/FOCS.2010.84}, doi = {10.1109/FOCS.2010.84}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/focs/DinurKPS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:conf/propertytesting/DinurH10, author = {Irit Dinur and Prahladh Harsha}, editor = {Oded Goldreich}, title = {Composition of Low-Error 2-Query PCPs Using Decodable PCPs}, booktitle = {Property Testing - Current Research and Surveys}, series = {Lecture Notes in Computer Science}, volume = {6390}, pages = {280--288}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16367-8\_21}, doi = {10.1007/978-3-642-16367-8\_21}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/propertytesting/DinurH10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1002-1606, author = {Irit Dinur and Or Meir}, title = {Derandomized Parallel Repetition of Structured PCPs}, journal = {CoRR}, volume = {abs/1002.1606}, year = {2010}, url = {http://arxiv.org/abs/1002.1606}, eprinttype = {arXiv}, eprint = {1002.1606}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1002-1606.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1012-2738, author = {Irit Dinur and Tali Kaufman}, title = {Dense locally testable codes cannot have constant rate and distance}, journal = {CoRR}, volume = {abs/1012.2738}, year = {2010}, url = {http://arxiv.org/abs/1012.2738}, eprinttype = {arXiv}, eprint = {1012.2738}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1012-2738.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurM10, author = {Irit Dinur and Or Meir}, title = {Derandomized Parallel Repetition via Structured PCPs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-107}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/107}, eprinttype = {ECCC}, eprint = {TR10-107}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/DinurF09, author = {Irit Dinur and Ehud Friedgut}, title = {Intersecting Families are Essentially Contained in Juntas}, journal = {Comb. Probab. Comput.}, volume = {18}, number = {1-2}, pages = {107--122}, year = {2009}, url = {https://doi.org/10.1017/S0963548308009309}, doi = {10.1017/S0963548308009309}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/DinurF09.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} }
@inproceedings{DBLP:conf/focs/DinurH09, author = {Irit Dinur and Prahladh Harsha}, title = {Composition of Low-Error 2-Query PCPs Using Decodable PCPs}, booktitle = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2009, October 25-27, 2009, Atlanta, Georgia, {USA}}, pages = {472--481}, publisher = {{IEEE} Computer Society}, year = {2009}, url = {https://doi.org/10.1109/FOCS.2009.8}, doi = {10.1109/FOCS.2009.8}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/focs/DinurH09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/approx/2009, editor = {Irit Dinur and Klaus Jansen and Joseph Naor and Jos{\'{e}} D. P. Rolim}, title = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, {APPROX} 2009, and 13th International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5687}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-03685-9}, doi = {10.1007/978-3-642-03685-9}, isbn = {978-3-642-03684-2}, timestamp = {Tue, 21 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/2009.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurH09, author = {Irit Dinur and Prahladh Harsha}, title = {Composition of low-error 2-query PCPs using decodable PCPs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR09-042}}, year = {2009}, url = {https://eccc.weizmann.ac.il/report/2009/042}, eprinttype = {ECCC}, eprint = {TR09-042}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurH09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DinurT08, author = {Irit Dinur and {\'{E}}va Tardos}, title = {Special Issue on Foundations of Computer Science}, journal = {{SIAM} J. Comput.}, volume = {37}, number = {6}, year = {2008}, timestamp = {Fri, 20 Jun 2008 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/DinurT08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/Dinur08, author = {Irit Dinur}, title = {PCPs with small soundness error}, journal = {{SIGACT} News}, volume = {39}, number = {3}, pages = {41--57}, year = {2008}, url = {https://doi.org/10.1145/1412700.1412713}, doi = {10.1145/1412700.1412713}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigact/Dinur08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DinurG08, author = {Irit Dinur and Elazar Goldenberg}, title = {Locally Testing Direct Product in the Low Error Range}, booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2008, October 25-28, 2008, Philadelphia, PA, {USA}}, pages = {613--622}, publisher = {{IEEE} Computer Society}, year = {2008}, url = {https://doi.org/10.1109/FOCS.2008.26}, doi = {10.1109/FOCS.2008.26}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/focs/DinurG08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DinurGKS08, author = {Irit Dinur and Elena Grigorescu and Swastik Kopparty and Madhu Sudan}, editor = {Cynthia Dwork}, title = {Decodability of group homomorphisms beyond the johnson bound}, booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008}, pages = {275--284}, publisher = {{ACM}}, year = {2008}, url = {https://doi.org/10.1145/1374376.1374418}, doi = {10.1145/1374376.1374418}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/DinurGKS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurGKS08, author = {Irit Dinur and Elena Grigorescu and Swastik Kopparty and Madhu Sudan}, title = {Decodability of Group Homomorphisms beyond the Johnson Bound}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR08-020}}, year = {2008}, url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-020/index.html}, eprinttype = {ECCC}, eprint = {TR08-020}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurGKS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/Dinur07, author = {Irit Dinur}, title = {The {PCP} theorem by gap amplification}, journal = {J. {ACM}}, volume = {54}, number = {3}, pages = {12}, year = {2007}, url = {https://doi.org/10.1145/1236457.1236459}, doi = {10.1145/1236457.1236459}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jacm/Dinur07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorics/DinurF06, author = {Irit Dinur and Ehud Friedgut}, title = {Proof of an Intersection Theorem via Graph Homomorphisms}, journal = {Electron. J. Comb.}, volume = {13}, number = {1}, year = {2006}, url = {https://doi.org/10.37236/1144}, doi = {10.37236/1144}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorics/DinurF06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DinurR06, author = {Irit Dinur and Omer Reingold}, title = {Assignment Testers: Towards a Combinatorial Proof of the {PCP} Theorem}, journal = {{SIAM} J. Comput.}, volume = {36}, number = {4}, pages = {975--1024}, year = {2006}, url = {https://doi.org/10.1137/S0097539705446962}, doi = {10.1137/S0097539705446962}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/DinurR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/DinurSW06, author = {Irit Dinur and Madhu Sudan and Avi Wigderson}, editor = {Josep D{\'{\i}}az and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Uri Zwick}, title = {Robust Local Testability of Tensor Products of {LDPC} Codes}, 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 = {304--315}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11830924\_29}, doi = {10.1007/11830924\_29}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/DinurSW06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Dinur06, author = {Irit Dinur}, editor = {Jon M. Kleinberg}, title = {The {PCP} theorem by gap amplification}, booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006}, pages = {241--250}, publisher = {{ACM}}, year = {2006}, url = {https://doi.org/10.1145/1132516.1132553}, doi = {10.1145/1132516.1132553}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Dinur06.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} }
@inproceedings{DBLP:conf/stoc/DinurFKO06, author = {Irit Dinur and Ehud Friedgut and Guy Kindler and Ryan O'Donnell}, editor = {Jon M. Kleinberg}, title = {On the fourier tails of bounded functions over the discrete cube}, booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006}, pages = {437--446}, publisher = {{ACM}}, year = {2006}, url = {https://doi.org/10.1145/1132516.1132580}, doi = {10.1145/1132516.1132580}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/DinurFKO06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurSW06, author = {Irit Dinur and Madhu Sudan and Avi Wigderson}, title = {Robust Local Testability of Tensor Products of {LDPC} Codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR06-118}}, year = {2006}, url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-118/index.html}, eprinttype = {ECCC}, eprint = {TR06-118}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurSW06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/DinurRS05, author = {Irit Dinur and Oded Regev and Clifford D. Smyth}, title = {The Hardness of 3-Uniform Hypergraph Coloring}, journal = {Comb.}, volume = {25}, number = {5}, pages = {519--535}, year = {2005}, url = {https://doi.org/10.1007/s00493-005-0032-4}, doi = {10.1007/S00493-005-0032-4}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/DinurRS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DinurGKR05, author = {Irit Dinur and Venkatesan Guruswami and Subhash Khot and Oded Regev}, title = {A New Multilayered {PCP} and the Hardness of Hypergraph Vertex Cover}, journal = {{SIAM} J. Comput.}, volume = {34}, number = {5}, pages = {1129--1146}, year = {2005}, url = {https://doi.org/10.1137/S0097539704443057}, doi = {10.1137/S0097539704443057}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/DinurGKR05.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/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-046, author = {Irit Dinur}, title = {The {PCP} theorem by gap amplification}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR05-046}}, year = {2005}, url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-046/index.html}, eprinttype = {ECCC}, eprint = {TR05-046}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-046.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/DinurS04, author = {Irit Dinur and Shmuel Safra}, title = {On the hardness of approximating label-cover}, journal = {Inf. Process. Lett.}, volume = {89}, number = {5}, pages = {247--254}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2003.11.007}, doi = {10.1016/J.IPL.2003.11.007}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/DinurS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DinurR04, author = {Irit Dinur and Omer Reingold}, title = {Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem}, booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19 October 2004, Rome, Italy, Proceedings}, pages = {155--164}, publisher = {{IEEE} Computer Society}, year = {2004}, url = {https://doi.org/10.1109/FOCS.2004.16}, doi = {10.1109/FOCS.2004.16}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/DinurR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/DinurKRS03, author = {Irit Dinur and Guy Kindler and Ran Raz and Shmuel Safra}, title = {Approximating {CVP} to Within Almost-Polynomial Factors is NP-Hard}, journal = {Comb.}, volume = {23}, number = {2}, pages = {205--243}, year = {2003}, url = {https://doi.org/10.1007/s00493-003-0019-y}, doi = {10.1007/S00493-003-0019-Y}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/DinurKRS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/pods/DinurN03, author = {Irit Dinur and Kobbi Nissim}, editor = {Frank Neven and Catriel Beeri and Tova Milo}, title = {Revealing information while preserving privacy}, booktitle = {Proceedings of the Twenty-Second {ACM} {SIGACT-SIGMOD-SIGART} Symposium on Principles of Database Systems, June 9-12, 2003, San Diego, CA, {USA}}, pages = {202--210}, publisher = {{ACM}}, year = {2003}, url = {https://doi.org/10.1145/773153.773173}, doi = {10.1145/773153.773173}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/pods/DinurN03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DinurGKR03, author = {Irit Dinur and Venkatesan Guruswami and Subhash Khot and Oded Regev}, editor = {Lawrence L. Larmore and Michel X. Goemans}, title = {A new multilayered {PCP} and the hardness of hypergraph vertex cover}, booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, {USA}}, pages = {595--601}, publisher = {{ACM}}, year = {2003}, url = {https://doi.org/10.1145/780542.780629}, doi = {10.1145/780542.780629}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/DinurGKR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/cs-CC-0304026, author = {Irit Dinur and Venkatesan Guruswami and Subhash Khot and Oded Regev}, title = {A New Multilayered {PCP} and the Hardness of Hypergraph Vertex Cover}, journal = {CoRR}, volume = {cs.CC/0304026}, year = {2003}, url = {http://arxiv.org/abs/cs/0304026}, timestamp = {Fri, 10 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/cs-CC-0304026.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Dinur02, author = {Irit Dinur}, title = {Approximating SVP\({}_{\mbox{infinity}}\) to within almost-polynomial factors is NP-hard}, journal = {Theor. Comput. Sci.}, volume = {285}, number = {1}, pages = {55--71}, year = {2002}, url = {https://doi.org/10.1016/S0304-3975(01)00290-0}, doi = {10.1016/S0304-3975(01)00290-0}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Dinur02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DinurRS02, author = {Irit Dinur and Oded Regev and Clifford D. Smyth}, title = {The Hardness of 3 - Uniform Hypergraph Coloring}, booktitle = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings}, pages = {33}, publisher = {{IEEE} Computer Society}, year = {2002}, url = {https://doi.org/10.1109/SFCS.2002.1181880}, doi = {10.1109/SFCS.2002.1181880}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/DinurRS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DinurS02, author = {Irit Dinur and Shmuel Safra}, editor = {John H. Reif}, title = {The importance of being biased}, booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing, May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada}, pages = {33--42}, publisher = {{ACM}}, year = {2002}, url = {https://doi.org/10.1145/509907.509915}, doi = {10.1145/509907.509915}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/DinurS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR02-027, author = {Irit Dinur and Venkatesan Guruswami and Subhash Khot}, title = {Vertex Cover on k-Uniform Hypergraphs is Hard to Approximate within Factor (k-3-epsilon)}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR02-027}}, year = {2002}, url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-027/index.html}, eprinttype = {ECCC}, eprint = {TR02-027}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-027.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR01-104, author = {Irit Dinur and Shmuel Safra}, title = {The Importance of Being Biased}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR01-104}}, year = {2001}, url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-104/index.html}, eprinttype = {ECCC}, eprint = {TR01-104}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-104.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ciac/Dinur00, author = {Irit Dinur}, editor = {Gian Carlo Bongiovanni and Giorgio Gambosi and Rossella Petreschi}, title = {Approximating SVP\({}_{\mbox{infty}}\) to within Almost-Polynomial Factors Is NP-Hard}, booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome, Italy, March 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1767}, pages = {263--276}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-46521-9\_22}, doi = {10.1007/3-540-46521-9\_22}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/ciac/Dinur00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DinurFKRS99, author = {Irit Dinur and Eldar Fischer and Guy Kindler and Ran Raz and Shmuel Safra}, editor = {Jeffrey Scott Vitter and Lawrence L. Larmore and Frank Thomson Leighton}, title = {{PCP} Characterizations of {NP:} Towards a Polynomially-Small Error-Probability}, booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of Computing, May 1-4, 1999, Atlanta, Georgia, {USA}}, pages = {29--40}, publisher = {{ACM}}, year = {1999}, url = {https://doi.org/10.1145/301250.301265}, doi = {10.1145/301250.301265}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/DinurFKRS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR99-015, author = {Irit Dinur and Shmuel Safra}, title = {On the Hardness of Approximating Label Cover}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR99-015}}, year = {1999}, url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-015/index.html}, eprinttype = {ECCC}, eprint = {TR99-015}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-015.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR99-016, author = {Irit Dinur}, title = {Approximating SVP\({}_{\mbox{infty}}\) to within Almost-Polynomial Factors is NP-hard}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR99-016}}, year = {1999}, url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-016/index.html}, eprinttype = {ECCC}, eprint = {TR99-016}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-016.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DinurKS98, author = {Irit Dinur and Guy Kindler and Shmuel Safra}, title = {Approximating-CVP to Within Almost-Polynomial Factors is NP-Hard}, booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98, November 8-11, 1998, Palo Alto, California, {USA}}, pages = {99--111}, publisher = {{IEEE} Computer Society}, year = {1998}, url = {https://doi.org/10.1109/SFCS.1998.743433}, doi = {10.1109/SFCS.1998.743433}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/focs/DinurKS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR98-048, author = {Irit Dinur and Guy Kindler and Shmuel Safra}, title = {Approximating {CVP} to Within Almost Polynomial Factor is NP-Hard}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR98-048}}, year = {1998}, url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-048/index.html}, eprinttype = {ECCC}, eprint = {TR98-048}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-048.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR98-066, author = {Irit Dinur and Eldar Fischer and Guy Kindler and Ran Raz and Shmuel Safra}, title = {{PCP} Characterizations of {NP:} Towards a Polynomially-Small Error-Probability}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR98-066}}, year = {1998}, url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-066/index.html}, eprinttype = {ECCC}, eprint = {TR98-066}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-066.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.