3 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.DS2026
Revisiting Real-Time Interval and Throughput Maximization
Allan Borodin, Changdao He, Nadim Mottu
Job throughput maximization is the central maximization problem in scheduling. Interval scheduling is the special case of throughput maximization when jobs are intervals and theref…
cs.DS2025
Deterministically Simulating Barely Random Algorithms in the Random-Order Arrival Model
Allan Borodin, Christodoulos Karavasilis, David Zhang
Interest in the random-order model (ROM) leads us to initiate a study of utilizing random-order arrivals to extract random bits with the goal of derandomizing algorithms. Besides p…
cs.DS2020★ 3 cited
Bipartite Stochastic Matching: Online, Random Order, and I.I.D. Models
Allan Borodin, Calum MacRury, Akash Rakheja
Within the context of stochastic probing with commitment, we consider the online stochastic matching problem; that is, the one sided online bipartite matching problem where edges a…