Prati
Inbal Livni Navon
Inbal Livni Navon
Potvrđena adresa e-pošte na stanford.edu - Početna stranica
Naslov
Citirano
Citirano
Godina
List-decoding with double samplers
I Dinur, P Harsha, T Kaufman, IL Navon, A Ta-Shma
SIAM journal on computing 50 (2), 301-349, 2021
422021
Cube vs. cube low degree test
A Bhangale, I Dinur, IL Navon
arXiv preprint arXiv:1612.07491, 2016
162016
Exponentially small soundness for the direct product z-test
I Dinur, I Livni Navon
32nd Computational Complexity Conference (CCC 2017), 2017
152017
Omnipredictors for constrained optimization
L Hu, IRL Navon, O Reingold, C Yang
International Conference on Machine Learning, 13497-13527, 2023
142023
On hardness of approximation of parameterized set cover and label cover: Threshold graphs from error correcting codes
CS Karthik, LN Inbal
Symposium on Simplicity in Algorithms (SOSA), 210-223, 2021
92021
Zsim: A fast architectural simulator for isa design-space exploration
Y Lifshitz, R Cohn, I Livni, O Tabach, M Charney, K Hazelwood
Workshop on Infrastructures for Software/Hardware Co-Design (WISH), 2011
72011
Viderman's algorithm for quantum LDPC codes
A Krishna, IL Navon, M Wootters
arXiv preprint arXiv:2310.07868, 2023
2023
Exponentially Small Soundness for the Direct Product Z-test
I Dinur, I Livni Navon
Theory of Computing 19 (1), 1-56, 2023
2023
Bidding Strategies for Proportional Representation in Advertisement Campaigns
I Livni Navon, C Peale, O Reingold, J Hanwen Shen
arXiv e-prints, arXiv: 2305.13542, 2023
2023
Generative Models of Huge Objects
L Hu, I Livni-Navon, O Reingold
arXiv preprint arXiv:2302.12823, 2023
2023
On Hardness of Approximation of Parameterized Set Cover and Label Cover: Threshold Graphs from Error Correcting Codes
I Livni-Navon
arXiv preprint arXiv:2009.02778, 2020
2020
Lecturer: Tali Kaufman Preliminary Scriber: Karthik CS Scribe Upgraders: Inbal Livni and David Mass
CS Karthik
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–12