default search action
Ilan Reuven Cohen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Ilan Reuven Cohen, Izack Cohen
, Iyar Zaks:
A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines. Ann. Oper. Res. 338(1): 429-452 (2024) - [i8]Ilan Reuven Cohen, Alon Eden, Talya Eden, Arsen Vasilyan:
Plant-and-Steal: Truthful Fair Allocations via Predictions. CoRR abs/2406.07024 (2024) - 2023
- [j1]Yossi Azar, Ilan Reuven Cohen, Iftah Gamzu:
The loss of serving in the dark. Inf. Process. Lett. 180: 106334 (2023) - [c19]Ilan Reuven Cohen, Binghui Peng:
Primal-Dual Schemes for Online Matching in Bounded Degree Graphs. ESA 2023: 35:1-35:17 - [c18]Ilan Reuven Cohen, Debmalya Panigrahi:
A General Framework for Learning-Augmented Online Allocation. ICALP 2023: 43:1-43:21 - [i7]Ilan Reuven Cohen, Debmalya Panigrahi:
A General Framework for Learning-Augmented Online Allocation. CoRR abs/2305.18861 (2023) - 2022
- [c17]Ilan Reuven Cohen
Stochastic Graph Exploration with Limited Resources. WAOA 2022: 172-189 - 2021
- [c16]János Balogh, Ilan Reuven Cohen, Leah Epstein, Asaf Levin:
Truly Asymptotic Lower Bounds for Online Vector Bin Packing. APPROX-RANDOM 2021: 8:1-8:18 - [c15]Ilan Reuven Cohen, Izack Cohen, Iyar Zaks:
Weighted Completion Time Minimization for Capacitated Parallel Machines. WAOA 2021: 130-143 - [c14]Nikhil Bansal, Ilan Reuven Cohen:
Contention Resolution, Matrix Scaling and Fair Allocation. WAOA 2021: 252-274 - [i6]Ilan Reuven Cohen, Izack Cohen, Iyar Zaks:
Weighted completion time minimization for capacitated parallel machines. CoRR abs/2105.00440 (2021) - 2020
- [c13]Ilan Reuven Cohen, Sungjin Im, Debmalya Panigrahi:
Online Two-Dimensional Load Balancing. ICALP 2020: 34:1-34:21 - [i5]Nikhil Bansal, Ilan Reuven Cohen:
An Asymptotic Lower Bound for Online Vector Bin Packing. CoRR abs/2007.15709 (2020)
2010 – 2019
- 2019
- [c12]Ilan Reuven Cohen, Alon Eden, Amos Fiat, Lukasz Jez:
Dynamic Pricing of Servers on Trees. APPROX-RANDOM 2019: 10:1-10:22 - [c11]Ilan Reuven Cohen, Binghui Peng, David Wajc
Tight Bounds for Online Edge Coloring. FOCS 2019: 1-25 - [c10]Aris Anagnostopoulos
Stochastic Graph Exploration. ICALP 2019: 136:1-136:14 - [i4]Ilan Reuven Cohen, Binghui Peng, David Wajc:
Tight Bounds for Online Edge Coloring. CoRR abs/1904.09222 (2019) - 2018
- [c9]Ilan Reuven Cohen, David Wajc
Randomized Online Matching in Regular Graphs. SODA 2018: 960-979 - [c8]Yossi Azar, Ilan Reuven Cohen, Debmalya Panigrahi:
Randomized Algorithms for Online Vector Load Balancing. SODA 2018: 980-991 - 2017
- [c7]Yossi Azar, Ilan Reuven Cohen, Alan Roytman:
Online Lower Bounds via Duality. SODA 2017: 1038-1050 - 2016
- [b1]Ilan Reuven Cohen:
Online Packing and Covering Problems. Tel Aviv University, Israel, 2016 - [c6]Yossi Azar, Niv Buchbinder
Online Algorithms for Covering and Packing Problems with Convex Objectives. FOCS 2016: 148-157 - [c5]Yossi Azar, Ilan Reuven Cohen, Amos Fiat, Alan Roytman:
Packing Small Vectors. SODA 2016: 1511-1525 - [i3]Yossi Azar, Ilan Reuven Cohen, Alan Roytman:
Online Lower Bounds via Duality. CoRR abs/1604.01697 (2016) - 2015
- [c4]Yossi Azar, Ilan Reuven Cohen:
Serving in the Dark should be done Non-Uniformly. ICALP (1) 2015: 91-102 - [c3]Ilan Reuven Cohen, Alon Eden, Amos Fiat, Lukasz Jez:
Pricing Online Decisions: Beyond Auctions. SODA 2015: 73-91 - [i2]Ilan Reuven Cohen, Alon Eden, Amos Fiat, Lukasz Jez:
Pricing Online Decisions: Beyond Auctions. CoRR abs/1504.01093 (2015) - 2014
- [i1]Yossi Azar, Ilan Reuven Cohen, Debmalya Panigrahi:
Online Covering with Convex Objectives and Applications. CoRR abs/1412.3507 (2014) - 2013
- [c2]Yossi Azar, Ilan Reuven Cohen, Iftah Gamzu:
The loss of serving in the dark. STOC 2013: 951-960 - [c1]Yossi Azar, Ilan Reuven Cohen, Seny Kamara, F. Bruce Shepherd:
Tight bounds for online vector bin packing. STOC 2013: 961-970
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-08-23 18:34 CEST 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: