8 citations · 23 across the 7 of their papers we have counts for
10 papers
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…
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…
The Crossing Tverberg Theorem
Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii +2
Tverberg's theorem is one of the cornerstones of discrete geometry. It states that, given a set of at least points in , one can find a partition $X=…
ARRIVAL: Next Stop in CLS
Bernd Gärtner, Thomas Dueholm Hansen, Pavel Hubáček +3
We study the computational complexity of ARRIVAL, a zero-player game on -vertex switch graphs introduced by Dohrau, Gärtner, Kohler, Matoušek, and Welzl. They showed that the pr…
(Biased) Majority Rule Cellular Automata
Bernd Gärtner, Ahad N. Zehmakan
Consider a graph and a random initial vertex-coloring, where each vertex is blue independently with probability , and red with probability . In each ste…
Learning Sparse Additive Models with Interactions in High Dimensions
Hemant Tyagi, Anastasios Kyrillidis, Bernd Gärtner +1
A function is referred to as a Sparse Additive Model (SPAM), if it is of the form , whe…