Ilan Reuven Cohen

According to our database, Ilan Reuven Cohen authored at least 22 papers between 2013 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

The loss of serving in the dark.

Yossi Azar, Ilan Reuven Cohen, Iftah Gamzu

Inf. Process. Lett., 2023

A General Framework for Learning-Augmented Online Allocation.

Ilan Reuven Cohen, Debmalya Panigrahi

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Primal-Dual Schemes for Online Matching in Bounded Degree Graphs.

Ilan Reuven Cohen, Binghui Peng

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Stochastic Graph Exploration with Limited Resources.

Ilan Reuven Cohen

Proceedings of the Approximation and Online Algorithms - 20th International Workshop, 2022

2021

Weighted Completion Time Minimization for Capacitated Parallel Machines.

Ilan Reuven Cohen, Izack Cohen, Iyar Zaks

Proceedings of the Approximation and Online Algorithms - 19th International Workshop, 2021

Contention Resolution, Matrix Scaling and Fair Allocation.

Nikhil Bansal, Ilan Reuven Cohen

Proceedings of the Approximation and Online Algorithms - 19th International Workshop, 2021

Truly Asymptotic Lower Bounds for Online Vector Bin Packing.

János Balogh, Ilan Reuven Cohen, Leah Epstein, Asaf Levin

Proceedings of the Approximation, 2021

2020

An Asymptotic Lower Bound for Online Vector Bin Packing.

Nikhil Bansal, Ilan Reuven Cohen

CoRR, 2020

Online Two-Dimensional Load Balancing.

Ilan Reuven Cohen, Sungjin Im, Debmalya Panigrahi

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

Stochastic Graph Exploration.

Aris Anagnostopoulos, Ilan Reuven Cohen, Stefano Leonardi, Jakub Lacki

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Tight Bounds for Online Edge Coloring.

Ilan Reuven Cohen, Binghui Peng, David Wajc

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Dynamic Pricing of Servers on Trees.

Ilan Reuven Cohen, Alon Eden, Amos Fiat, Lukasz Jez

Proceedings of the Approximation, 2019

2018

Randomized Online Matching in Regular Graphs.

Ilan Reuven Cohen, David Wajc

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Randomized Algorithms for Online Vector Load Balancing.

Yossi Azar, Ilan Reuven Cohen, Debmalya Panigrahi

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Online Lower Bounds via Duality.

Yossi Azar, Ilan Reuven Cohen, Alan Roytman

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Online Packing and Covering Problems

Ilan Reuven Cohen

PhD thesis, 2016

Packing Small Vectors.

Yossi Azar, Ilan Reuven Cohen, Amos Fiat, Alan Roytman

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Online Algorithms for Covering and Packing Problems with Convex Objectives.

Yossi Azar, Niv Buchbinder, T.-H. Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang, Ning Kang, Viswanath Nagarajan, Joseph Naor, Debmalya Panigrahi

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

Pricing Online Decisions: Beyond Auctions.

Ilan Reuven Cohen, Alon Eden, Amos Fiat, Lukasz Jez

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Serving in the Dark should be done Non-Uniformly.

Yossi Azar, Ilan Reuven Cohen

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Online Covering with Convex Objectives and Applications.

Yossi Azar, Ilan Reuven Cohen, Debmalya Panigrahi

CoRR, 2014

2013

Tight bounds for online vector bin packing.

Yossi Azar, Ilan Reuven Cohen, Seny Kamara, F. Bruce Shepherd

Proceedings of the Symposium on Theory of Computing Conference, 2013