Ilan Reuven Cohen

Orcid: 0000-0001-7870-6319

According to our database1, Ilan Reuven Cohen authored at least 24 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
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., July, 2024

Plant-and-Steal: Truthful Fair Allocations via Predictions.
CoRR, 2024

2023
The loss of serving in the dark.
Inf. Process. Lett., 2023

A General Framework for Learning-Augmented Online Allocation.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Primal-Dual Schemes for Online Matching in Bounded Degree Graphs.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Stochastic Graph Exploration with Limited Resources.
Proceedings of the Approximation and Online Algorithms - 20th International Workshop, 2022

2021
Weighted Completion Time Minimization for Capacitated Parallel Machines.
Proceedings of the Approximation and Online Algorithms - 19th International Workshop, 2021

Contention Resolution, Matrix Scaling and Fair Allocation.
Proceedings of the Approximation and Online Algorithms - 19th International Workshop, 2021

Truly Asymptotic Lower Bounds for Online Vector Bin Packing.
Proceedings of the Approximation, 2021

2020
An Asymptotic Lower Bound for Online Vector Bin Packing.
CoRR, 2020

Online Two-Dimensional Load Balancing.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
Stochastic Graph Exploration.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Tight Bounds for Online Edge Coloring.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Dynamic Pricing of Servers on Trees.
Proceedings of the Approximation, 2019

2018
Randomized Online Matching in Regular Graphs.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Randomized Algorithms for Online Vector Load Balancing.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
Online Lower Bounds via Duality.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Online Packing and Covering Problems
PhD thesis, 2016

Packing Small Vectors.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Online Algorithms for Covering and Packing Problems with Convex Objectives.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
Pricing Online Decisions: Beyond Auctions.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Serving in the Dark should be done Non-Uniformly.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Online Covering with Convex Objectives and Applications.
CoRR, 2014

2013
Tight bounds for online vector bin packing.
Proceedings of the Symposium on Theory of Computing Conference, 2013


  Loading...