3 papers
cs.DS2023
Zero-Memory Graph Exploration with Unknown Inports
Hans-Joachim Böckenhauer, Fabian Frei, Walter Unger +1
We study a very restrictive graph exploration problem. In our model, an agent without persistent memory is placed on a vertex of a graph and only sees the adjacent vertices. The go…
cs.DS2023
Bounds for c-Ideal Hashing
Fabian Frei, David Wehner
In this paper, we analyze hashing from a worst-case perspective. To this end, we study a new property of hash families that is strongly related to d-perfect hashing, namely c-ideal…
cs.CC2019
Finding Optimal Solutions With Neighborly Help
Elisabet Burjons, Fabian Frei, Edith Hemaspaandra +2
Can we efficiently compute optimal solutions to instances of a hard problem from optimal solutions to neighboring (i.e., locally modified) instances? For example, can we efficientl…