3 citations · 6 across the 8 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.DS2024★ 1 cited
Lookback Prophet Inequalities
Ziyad Benomar, Dorian Baudry, Vianney Perchet
Prophet inequalities are fundamental optimal stopping problems, where a decision-maker observes sequentially items with values sampled independently from known distributions, and m…
cs.DS2024
Learning-Augmented Priority Queues
Ziyad Benomar, Christian Coester
Priority queues are one of the most fundamental and widely used data structures in computer science. Their primary objective is to efficiently support the insertion of new elements…
cs.LG2024★ 1 cited
Non-clairvoyant Scheduling with Partial Predictions
Ziyad Benomar, Vianney Perchet
The non-clairvoyant scheduling problem has gained new interest within learning-augmented algorithms, where the decision-maker is equipped with predictions without any quality guara…