6 citations · 11 across the 20 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.CG2021
Online Search for a Hyperplane in High-Dimensional Euclidean Space
Antonios Antoniadis, Ruben Hoeksma, Sándor Kisfaludi-Bak +1
We consider the online search problem in which a server starting at the origin of a -dimensional Euclidean space has to find an arbitrary hyperplane. The best-possible competiti…
cs.DS2021
A Stronger Impossibility for Fully Online Matching
Alexander Eckl, Anja Kirschbaum, Marilena Leichter +1
We revisit the fully online matching model (Huang et al., J.\ ACM, 2020), an extension of the classic online matching model due to Karp, Vazirani, and Vazirani (STOC 1990), which h…