2 citations · 3 across the 3 of their papers we have counts for
9 papers
Competitive Sequencing with Noisy Advice
Spyros Angelopoulos, Diogo Arsénio, Shahin Kamali
Several well-studied online resource allocation problems can be formulated in terms of infinite, increasing sequences of positive values, in which each element is associated with a…
An improved bound on the burning number of graphs
Anthony Bonato, Shahin Kamali
The burning number conjecture states that the burning number of a connected graph is at most While the conjecture is unresolved, Land and Lu proved that t…
On the Fault-Tolerant Online Bin Packing Problem
Shahin Kamali, Pooya Nikbakht
We study the fault-tolerant variant of the online bin packing problem. Similar to the classic bin packing problem, an online sequence of items of various sizes should be packed int…
Contract Scheduling With Predictions
Spyros Angelopoulos, Shahin Kamali
Contract scheduling is a general technique that allows to design a system with interruptible capabilities, given an algorithm that is not necessarily interruptible. Previous work o…
Beyond Worst-case Analysis of Multicore Caching Strategies
Shahin Kamali, Helen Xu
Every processor with multiple cores sharing a cache needs to implement a cache-replacement algorithm. Previous work demonstrated that the competitive ratio of a large class of onli…
Randomized Two-Valued Bounded Delay Online Buffer Management
Christoph Dürr, Shahin Kamali
In the bounded delay buffer management problem unit size packets arrive online to be sent over a network link. The objective is to maximize the total weight of packets sent before…