The following pages link to Ilan Reuven Cohen (Q2085742):
Displaying 14 items.
- Weighted completion time minimization for capacitated parallel machines (Q2085744) (← links)
- Contention resolution, matrix scaling and fair allocation (Q2085755) (← links)
- The loss of serving in the dark (Q2680226) (← links)
- Serving in the Dark should be done Non-Uniformly (Q3448776) (← links)
- Packing Small Vectors (Q4575687) (← links)
- Online Lower Bounds via Duality (Q4575806) (← links)
- (Q4607945) (← links)
- (Q4607946) (← links)
- Stochastic graph exploration (Q5092339) (← links)
- Pricing Online Decisions: Beyond Auctions (Q5363022) (← links)
- The loss of serving in the dark (Q5495867) (← links)
- Tight bounds for online vector bin packing (Q5495868) (← links)
- Dynamic pricing of servers on trees (Q5875461) (← links)
- (Q6090878) (← links)
