default search action
Inbal Livni Navon
Person information
- affiliation: Weizmann Institute of Science, Department of Mathematics, Rehovot, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c8]Anirudh Krishna, Inbal Livni Navon, Mary Wootters:
Viderman's algorithm for quantum LDPC codes. SODA 2024: 2481-2507 - 2023
- [j2]Irit Dinur
, Inbal Livni Navon:
Exponentially Small Soundness for the Direct Product Z-test. Theory Comput. 19: 1-56 (2023) - [c7]Lunjia Hu
Generative Models of Huge Objects. CCC 2023: 5:1-5:20 - [c6]Inbal Livni Navon, Charlotte Peale, Omer Reingold, Judy Hanwen Shen:
Bidding Strategies for Proportional Representation in Advertisement Campaigns. FORC 2023: 3:1-3:22 - [c5]Lunjia Hu
Omnipredictors for Constrained Optimization. ICML 2023: 13497-13527 - [i9]Lunjia Hu, Inbal Livni Navon, Omer Reingold:
Generative Models of Huge Objects. CoRR abs/2302.12823 (2023) - [i8]Inbal Livni Navon, Charlotte Peale, Omer Reingold, Judy Hanwen Shen:
Bidding Strategies for Proportional Representation in Advertisement Campaigns. CoRR abs/2305.13542 (2023) - 2022
- [i7]Lunjia Hu, Inbal Livni Navon, Omer Reingold, Chutong Yang:
Omnipredictors for Constrained Optimization. CoRR abs/2209.07463 (2022) - 2021
- [j1]Irit Dinur
List-Decoding with Double Samplers. SIAM J. Comput. 50(2): 301-349 (2021) - [c4]Karthik C. S.
On Hardness of Approximation of Parameterized Set Cover and Label Cover: Threshold Graphs from Error Correcting Codes. SOSA 2021: 210-223 - 2020
- [i6]Karthik C. S., Inbal Livni Navon:
On Hardness of Approximation of Parameterized Set Cover and Label Cover: Threshold Graphs from Error Correcting Codes. CoRR abs/2009.02778 (2020)
2010 – 2019
- 2019
- [c3]Irit Dinur
List Decoding with Double Samplers. SODA 2019: 2134-2153 - 2018
- [i5]Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma:
List Decoding with Double Samplers. CoRR abs/1808.00425 (2018) - [i4]Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma:
List Decoding with Double Samplers. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c2]Irit Dinur
Exponentially Small Soundness for the Direct Product Z-Test. CCC 2017: 29:1-29:50 - [c1]Amey Bhangale, Irit Dinur
Cube vs. Cube Low Degree Test. ITCS 2017: 40:1-40:31 - [i3]Irit Dinur, Inbal Livni Navon:
Exponentially Small Soundness for the Direct Product Z-test. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i2]Amey Bhangale, Irit Dinur, Inbal Livni Navon:
Cube vs. Cube Low Degree Test. CoRR abs/1612.07491 (2016) - [i1]Amey Bhangale, Irit Dinur, Inbal Livni Navon:
Cube vs. Cube Low Degree Test. Electron. Colloquium Comput. Complex. TR16 (2016)
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-07 01:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: