default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYaron Fairstein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Yaron Fairstein, Joseph (Seffi) Naor, Tomer Tsachor:
Distributional Online Weighted Paging with Limited Horizon. APPROX/RANDOM 2024: 15:1-15:15- [c10]Nachshon Cohen, Hedda Cohen Indelman, Yaron Fairstein, Guy Kushilevitz:
InDi: Informative and Diverse Sampling for Dense Retrieval. ECIR (3) 2024: 243-258 - [c9]Royi Rassin, Yaron Fairstein, Oren Kalinsky, Guy Kushilevitz, Nachshon Cohen, Alexander Libov, Yoav Goldberg:
Evaluating D-MERIT of Partial-annotation on Information Retrieval. EMNLP 2024: 2913-2932 - [c8]Nachshon Cohen, Yaron Fairstein, Guy Kushilevitz:
Extremely efficient online query encoding for dense retrieval. NAACL-HLT (Findings) 2024: 43-50 - [i5]Royi Rassin, Yaron Fairstein, Oren Kalinsky, Guy Kushilevitz, Nachshon Cohen, Alexander Libov, Yoav Goldberg:
Evaluating D-MERIT of Partial-annotation on Information Retrieval. CoRR abs/2406.16048 (2024) - 2022
- [b1]Yaron Fairstein:
Dynamicity and Multi-Commodity in Networks. Technion - Israel Institute of Technology, Israel, 2022 - [j1]Yaron Fairstein, Ariel Kulik
, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai:
An almost optimal approximation algorithm for monotone submodular multiple knapsack. J. Comput. Syst. Sci. 125: 149-165 (2022) - [c7]Yaron Fairstein, Elad Haramaty, Arnon Lazerson, Liane Lewin-Eytan:
External Evaluation of Ranking Models under Extreme Position-Bias. WSDM 2022: 252-261 - 2021
- [c6]Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz:
General Knapsack Problems in a Dynamic Setting. APPROX-RANDOM 2021: 15:1-15:18 - [c5]Yaron Fairstein, Ariel Kulik, Hadas Shachnai:
Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping. ESA 2021: 41:1-41:16 - [c4]Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, Joseph (Seffi) Naor:
Online Virtual Machine Allocation with Lifetime and Load Predictions. SIGMETRICS (Abstracts) 2021: 9-10 - [i4]Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz:
General Knapsack Problems in a Dynamic Setting. CoRR abs/2105.00882 (2021) - 2020
- [c3]Yaron Fairstein, Dor Harris, Joseph Naor, Danny Raz:
NFV Placement in Resource-Scarce Edge Nodes. CCGRID 2020: 51-60 - [c2]Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai:
A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. ESA 2020: 44:1-44:19 - [i3]Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz, Hadas Shachnai:
A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. CoRR abs/2004.12224 (2020) - [i2]Yaron Fairstein, Ariel Kulik, Hadas Shachnai:
tight approximations for modular and submodular optimization with d-resource multiple knapsack constraints. CoRR abs/2007.10470 (2020) - [i1]Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, Joseph Naor:
Online Virtual Machine Allocation with Predictions. CoRR abs/2011.06250 (2020)
2010 – 2019
- 2018
- [c1]Yaron Fairstein, Seffi Naor, Danny Raz:
Algorithms for Dynamic NFV Workload. WAOA 2018: 238-258
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 2024-11-15 20:37 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:
