4 citations · 4 across the 3 of their papers we have counts for
8 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…
Online Search with Maximum Clearance
Spyros Angelopoulos, Malachi Voss
We study the setting in which a mobile agent must locate a hidden target in a bounded or unbounded environment, with no information about the hider's position. In particular, we co…
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…
Online Search With a Hint
Spyros Angelopoulos
The linear search problem, informally known as the cow path problem, is one of the fundamental problems in search theory. In this problem, an immobile target is hidden at some unkn…
Competitive Search in a Network
Spyros Angelopoulos, Thomas Lidbetter
We study the classic problem in which a Searcher must locate a hidden point, also called the Hider in a network, starting from a root point. The network may be either bounded or un…
Interruptible Algorithms for Multiproblem Solving
Spyros Angelopoulos, Alejandro Lopez-Ortiz
In this paper we address the problem of designing an interruptible system in a setting in which problem instances, all equally important, must be solved concurrently. The syste…