Publications:
- Amey Bhangale, Irit Dinur, and Inbal Livni Navon. Cube vs. cube low degree test. In 8th
Innovations in Theoretical Computer Science Conference, ITCS 2017, January 9-11, 2017, Berkeley,
CA. Lecture recording.
- Irit Dinur and Inbal Livni Navon. Exponentially small soundness for the direct product z-test.
In 32nd Computational Complexity Conference, CCC 2017, July 6-9, 2017, Riga, Latvia.
- Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, and Amnon Ta-Shma. List decoding
with double samplers. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete
Algorithms, SODA 2019.
- Karthik C.S. and Inbal Livni Navon. On Hardness of Approximation of Parameterized Set Cover and
Label Cover: Threshold Graphs from Error Correcting Codes. Accepted to ACM-SIAM Symposium on
Simplicity in Algorithms, SOSA.