Irit Dinur - Research output - Israeli Research Community Portal

View Scopus Profile

Rehovot
Israel

Research activity per year

32 Conference contribution
28 Article
3 Paper
2 Chapter
More
- 1 Conference article
- 1 Editorial

32 results

Filter

2024
Agreement Theorems for High Dimensional Expanders in the Low Acceptance Regime: The Role of Covers
Dikstein, Y. & Dinur, I., 10 Jun 2024, STOC 2024 - Proceedings of the 56th Annual ACM Symposium on Theory of Computing. Mohar, B., Shinkar, I. & O�Donnell, R. (eds.). p. 1967-1977 11 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).
Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
Coboundary and Cosystolic Expansion Without Dependence on Dimension or Degree
Dikstein, Y. & Dinur, I., 16 Sep 2024, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2024. Kumar, A. & Ron-Zewi, N. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 24 p. 62. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 317).
Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
File
Expansion of High-Dimensional Cubical Complexes: with Application to Quantum Locally Testable Codes
Dinur, I., Lin, T. C. & Vidick, T., 2024, Proceedings - 2024 IEEE 65th Annual Symposium on Foundations of Computer Science, FOCS 2024. IEEE Computer Society, p. 379-385 7 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).
Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs
Dikstein, Y., Dinur, I. & Lubotzky, A., 2024, Proceedings - 2024 IEEE 65th Annual Symposium on Foundations of Computer Science, FOCS 2024. IEEE Computer Society, p. 826-861 36 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).
Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
Swap Cosystolic Expansion
Dikstein, Y. & Dinur, I., 10 Jun 2024, STOC 2024 - Proceedings of the 56th Annual ACM Symposium on Theory of Computing. Mohar, B., Shinkar, I. & O�Donnell, R. (eds.). p. 1956-1966 11 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).
Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
2023
Good Quantum LDPC Codes with Linear Time Decoders
Dinur, I., Hsieh, M. H., Lin, T. C. & Vidick, T., 2 Jun 2023, STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Saha, B. & Servedio, R. A. (eds.). p. 905-918 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).
Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
2022
A Characterization of Multiclass Learnability
Brukhim, N., Carmon, D., Dinur, I., Moran, S. & Yehudayoff, A., 2022, Proceedings - 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science, FOCS 2022. IEEE Computer Society, p. 943-955 13 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2022-October).
Weizmann Institute of Science, Technion - Israel Institute of Technology
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Open Access
File
2021
Explicit SoS lower bounds from high-dimensional expanders
Dinur, I., Filmus, Y., Harsha, P. & Tulsiani, M., Jan 2021, Leibniz International Proceedings in Informatics, LIPIcs. Lee, J. R. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 185. p. 1-16 16 p. 38. (185).
Weizmann Institute of Science, Technion - Israel Institute of Technology
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Open Access
File
2019
Agreement Testing Theorems on Layered Set Systems
Dikstein, Y. & Dinur, I., 1 Nov 2019, Proceedings - 2019 IEEE 60th Annual Symposium on Foundations of Computer Science, FOCS 2019. Vol. 2019. p. 1495-1524 30 p. (Annual IEEE Symposium on Foundations of Computer Science).
Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Open Access
Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract]
Dinur, I., Filmus, Y. & Harsha, P., 2019, Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Chan, T. M. (ed.). p. 2124-2133 10 p.
Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
File
Direct sum testing: The general case
Dinur, I. & Golubev, K., Sep 2019, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019. Achlioptas, D. & Vegh, L. A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 40. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 145).
Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Open Access
Every Set in P Is Strongly Testable Under a Suitable Encoding
Dinur, I., Goldreich, O. & Gur, T., 1 Jan 2019, 10th Innovations in Theoretical Computer Science, ITCS 2019. Blum, A. (ed.). Vol. 124. 17 p. 30. (Leibniz International Proceedings in Informatics (LIPIcs)).
Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Open Access
File
From Local to Robust Testing via Agreement Testing
Dinur, I., Harsha, P., Kaufman, T. & Ron-Zewi, N., 8 Jan 2019, 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Blum, A. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 124. 18 p. 29. (Leibniz International Proceedings in Informatics (LIPIcs)).
Weizmann Institute of Science, Bar-Ilan University, University of Haifa
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Open Access
List Decoding with Double Samplers
Dinur, I., Harsha, P., Kaufman, T., Livni Navon, I. & Ta-Shma, A., 2019, Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019). p. 2134-2153 20 p.
Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Open Access
File
2018
Boolean function analysis on high-dimensional expanders
Dikstein, Y., Dinur, I., Filmus, Y. & Harsha, P., 1 Aug 2018, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018). Blais, E., Rolim, J. D. P., Steurer, D. & Jansen, K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 38:1-38:20 20 p. 38. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 116).
Weizmann Institute of Science, Technion - Israel Institute of Technology
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
File
ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network
Dinur, I. & Manurangsi, P., Jan 2018, Leibniz International Proceedings in Informatics, LIPIcs. Vol. 94. 20 p. 36
Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Open Access
File
On non-optimally expanding sets in grassmann graphs
Dinur, I., Khot, S., Kindler, G., Minzer, D. & Safra, M., 20 Jun 2018, STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Henzinger, M., Kempe, D. & Diakonikolas, I. (eds.). p. 1193-1206 14 p. (Symposium on Theory of Computing (STOC)).
Weizmann Institute of Science, Tel Aviv University, The Hebrew University of Jerusalem
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Open Access
File
Towards a proof of the 2-to-1 games conjecture?
Dinur, I., Khot, S., Kindler, G., Minzer, D. & Safra, M., 20 Jun 2018, STOC 2018 Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. p. 376-389 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 50).
Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Open Access
File
2017
Cube vs. cube low degree test
Bhangale, A., Dinur, I. & Navon, I. L., 1 Nov 2017, 8th Innovations in Theoretical Computer Science Conference, ITCS 2017. Papadimitriou, C. H. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 67).
Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
Exponentially small soundness for the direct product z-test
Dinur, I. & Navon, I. L., 1 Aug 2017, 32nd Computational Complexity Conference, CCC 2017. O'Donnell, R. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 79. p. 29:1-29:50 50 p. 29. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 79).
Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
High Dimensional Expanders Imply Agreement Expanders
Dinur, I. & Kaufman, T., 13 Nov 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, p. 974-985 12 p. (Annual IEEE Symposium on Foundations of Computer Science).
Weizmann Institute of Science, Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Multiplayer parallel repetition for expander games
Dinur, I., Harsha, P., Venkat, R. & Yuen, H., Jan 2017, LIPIcs : Leibniz international proceedings in informatics. Vol. 67. 16 p. 37
Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Open Access
Multiplayer parallel repetition for expanding games
Dinu, I., Harsha, P., Venkat, R. & Yuen, H., 28 Nov 2017, 8th Innovations in Theoretical Computer Science Conference, ITCS 2017. Papadimitriou, C. H. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 37:1-37:16 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 67).
Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
2016
Toward the KRW composition conjecture: Cubic formula lower bounds via communication complexity
Dinur, I. & Meir, O., 19 May 2016, 31st Conference on Computational Complexity, CCC 2016. Raz, R. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 3:1-3:51 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 50).
Weizmann Institute of Science, University of Haifa
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Open Access
2015
Derandomized graph product results using the low degree long code
Dinur, I., Harsha, P., Srinivasan, S. & Varma, G., 1 Feb 2015, 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015. Mayr, E. W. & Ollinger, N. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 275-287 13 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 30).
Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Direct sum testing. [Extended abstract]
David, R., Dinur, I., Goldenberg, E., Kindler, G. & Shinkar, I., 11 Jan 2015, ITCS 2015 - Proceedings of the 6th Innovations in Theoretical Computer Science. p. 327-336 10 p. (ITCS 2015 - Proceedings of the 6th Innovations in Theoretical Computer Science).
Weizmann Institute of Science, The Hebrew University of Jerusalem
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Polynomially low error PCPs with polyloglog n queries via modular composition
Dinur, I., Harsha, P. & Kindler, G., 14 Jun 2015, STOC 2015 - Proceedings of the 2015 ACM Symposium on Theory of Computing. p. 267-276 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 14-17-June-2015).
Weizmann Institute of Science, The Hebrew University of Jerusalem
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Open Access
The computational benefit of correlated instances
Dinur, I., Goldwasser, S. & Lin, H., 11 Jan 2015, ITCS 2015 - Proceedings of the 6th Innovations in Theoretical Computer Science. p. 219-228 10 p. (ITCS 2015 - Proceedings of the 6th Innovations in Theoretical Computer Science).
Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
2014
Analytical approach to parallel repetition
Dinur, I. & Steurer, D., 2014, STOC 2014 - Proceedings of the 2014 ACM Symposium on Theory of Computing. p. 624-633 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).
Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Open Access
A parallel repetition theorem for entangled projection games
Dinur, I., Steurer, D. & Vidick, T., 2014, Proceedings - IEEE 29th Conference on Computational Complexity, CCC 2014. IEEE Computer Society, p. 197-208 12 p. 6875489. (Proceedings of the Annual IEEE Conference on Computational Complexity).
Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
2013
Covering CSPs
Dinur, I. & Kol, G., 2013, Proceedings - 2013 IEEE Conference on Computational Complexity, CCC 2013. p. 207-218 12 p. 6597763. (Proceedings of the Annual IEEE Conference on Computational Complexity).
Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
PCPs via low-degree long code and hardness for constrained hypergraph coloring
Dinur, I. & Guruswami, V., 2013, Proceedings - 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013. p. 340-349 10 p. 6686170. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).
Weizmann Institute of Science
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution