Publications
- Viderman’s algorithm for quantum LDPC codes Anirudh Krishna, Inbal Livni Navon and Mary Wootters. Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, and The international conference on Quantum Information Processing, QIP 2024.
- Generative Models of Huge Objects. Lunjia Hu, Inbal Livni Navon, and Omer Reingold. Computational Complexity Conference, CCC 2023.
- Omnipredictors for Constrained Optimization. Lunjia Hu, Inbal Livni-Navon, Omer Reingold, Chutong Yang. International Conference on Machine Learning, ICML 2023.
- Bidding Strategies for Proportional Representation in Advertisement Campaigns. Inbal Livni Navon, Charlotte Peale, Omer Reingold, Judy Hanwen Shen. The 4th annual Symposium on Foundations of Responsible Computing, FORC 2023.
- On Hardness of Approximation of Parameterized Set Cover and Label Cover: Threshold Graphs from Error Correcting Codes. Karthik C.S. and Inbal Livni Navon. ACM-SIAM Symposium on Simplicity in Algorithms, SOSA 2021.
- List decoding with double samplers. Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, and Amnon Ta-Shma. Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019.
- Exponentially small soundness for the direct product z-test. Irit Dinur and Inbal Livni Navon. Computational Complexity Conference, CCC 2017.
- Cube vs. cube low degree test. Amey Bhangale, Irit Dinur, and Inbal Livni Navon. Innovations in Theoretical Computer Science Conference, ITCS 2017.