8 citations · 23 across the 7 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021★ 1 cited
A Characterization of the Realizable Matoušek Unique Sink Orientations
Simon Weber, Bernd Gärtner
The Matoušek LP-type problems were used by Matoušek to show that the Sharir-Welzl algorithm may require at least subexponential time. Later, Gärtner translated this result into the…
cs.DS2021★ 3 cited
A Subexponential Algorithm for ARRIVAL
Bernd Gärtner, Sebastian Haslebacher, Hung P. Hoang
The ARRIVAL problem is to decide the fate of a train moving along the edges of a directed graph, according to a simple (deterministic) pseudorandom walk. The problem is in $NP \cap…