Ilan Reuven Cohen

MaRDI QIDQ2085742zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Online two-dimensional load balancing	2026-03-18	Paper
Tight bounds for online edge coloring	2025-08-12	Paper
Online algorithms for covering and packing problems with convex objectives	2025-08-06	Paper
Primal-dual schemes for online matching in bounded degree graphs	2025-01-06	Paper
A general framework for learning-augmented online allocation	2024-11-14	Paper
A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines Annals of Operations Research	2024-08-15	Paper
scientific article; zbMATH DE number 7768353 (Why is no real title available?) (available as arXiv preprint)	2023-11-20	Paper
Stochastic graph exploration with limited resources Approximation and Online Algorithms	2023-07-25	Paper
Dynamic pricing of servers on trees	2023-02-03	Paper
The loss of serving in the dark Information Processing Letters	2023-01-30	Paper
Weighted completion time minimization for capacitated parallel machines (available as arXiv preprint)	2022-10-19	Paper
Contention resolution, matrix scaling and fair allocation	2022-10-19	Paper
Stochastic graph exploration	2022-07-21	Paper
Weighted completion time minimization for capacitated parallel machines (available as arXiv preprint)	2021-05-02	Paper
Packing small vectors Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms	2018-07-16	Paper
Online lower bounds via duality Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms	2018-07-16	Paper
scientific article; zbMATH DE number 6850371 (Why is no real title available?)	2018-03-15	Paper
Randomized algorithms for online vector load balancing	2018-03-15	Paper
Pricing online decisions: beyond auctions Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms	2017-10-05	Paper
Serving in the dark should be done non-uniformly Automata, Languages, and Programming	2015-10-27	Paper
The loss of serving in the dark Proceedings of the forty-eighth annual ACM symposium on Theory of Computing	2014-08-07	Paper
Tight bounds for online vector bin packing Proceedings of the forty-eighth annual ACM symposium on Theory of Computing	2014-08-07	Paper

Research outcomes over time

This page was built for person: Ilan Reuven Cohen