default search action
Dror Chawin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Dror Chawin, Ishay Haviv
:
Hardness of Linear Index Coding on Perturbed Instances. IEEE Trans. Inf. Theory 70(2): 1388-1396 (2024) - [j4]Dror Chawin, Ishay Haviv
Improved Approximation Algorithms for Index Coding. IEEE Trans. Inf. Theory 70(11): 8266-8275 (2024) - [c4]Dror Chawin, Ishay Haviv:
Nearly Orthogonal Sets over Finite Fields. SoCG 2024: 39:1-39:11 - [i6]Dror Chawin, Ishay Haviv:
Nearly Orthogonal Sets over Finite Fields. CoRR abs/2402.08274 (2024) - [i5]Dror Chawin, Ishay Haviv:
Improved Approximation Algorithms for Index Coding. CoRR abs/2408.08382 (2024) - 2023
- [j3]Dror Chawin, Ishay Haviv
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank. SIAM J. Discret. Math. 37(4): 2670-2688 (2023) - [c3]Dror Chawin, Ishay Haviv:
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank. STACS 2023: 20:1-20:14 - [i4]Dror Chawin, Ishay Haviv:
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank. CoRR abs/2301.00732 (2023) - 2022
- [j2]Dror Chawin, Ishay Haviv:
On the Subspace Choosability in Graphs. Electron. J. Comb. 29(2) (2022) - [c2]Dror Chawin, Ishay Haviv:
Hardness of Linear Index Coding on Perturbed Instances. Allerton 2022: 1-7 - 2021
- [j1]Dror Chawin, Uri B. Rom
Sliding-Window Pitch-Class Histograms as a Means of Modeling Musical Form. Trans. Int. Soc. Music. Inf. Retr. 4(1): 223-235 (2021) - [i3]Dror Chawin, Iftach Haitner, Noam Mazor:
Lower Bounds on the Time/Memory Tradeoff of Function Inversion. CoRR abs/2105.00761 (2021) - 2020
- [c1]Dror Chawin, Iftach Haitner, Noam Mazor:
Lower Bounds on the Time/Memory Tradeoff of Function Inversion. TCC (3) 2020: 305-334 - [i2]Dror Chawin, Iftach Haitner, Noam Mazor:
Lower Bounds on the Time/Memory Tradeoff of Function Inversion. Electron. Colloquium Comput. Complex. TR20 (2020) - [i1]Dror Chawin, Iftach Haitner, Noam Mazor:
Lower Bounds on the Time/Memory Tradeoff of Function Inversion. IACR Cryptol. ePrint Arch. 2020: 687 (2020)
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 2024-12-02 21:32 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: