72 citations · 119 across the 18 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2016
ARRIVAL: A zero-player graph game in NP coNP
Jérôme Dohrau, Bernd Gärtner, Manuel Kohler +2
Suppose that a train is running along a railway network, starting from a designated origin, with the goal of reaching a designated destination. The network, however, is of a specia…
cs.CC2010★ 7 cited
Optimal Lower Bounds for Projective List Update Algorithms
Christoph Ambuehl, Bernd Gaertner, Bernhard von Stengel
The list update problem is a classical online problem, with an optimal competitive ratio that is still open, known to be somewhere between 1.5 and 1.6. An algorithm with competitiv…