11 citations · 26 across the 13 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.OC2019
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…
cs.DS2019
Online Computation with Untrusted Advice
Spyros Angelopoulos, Christoph Dürr, Shendan Jin +2
We study a generalization of the advice complexity model of online computation in which the advice is provided by an untrusted source. Our objective is to quantify the impact of un…