Faster Treasure Hunt and Better Strongly Universal Exploration Sequences

Qin Xin

In this paper, we investigate the explicit deterministic treasure hunt problem in a $n$-vertex network. This problem was firstly introduced by Ta-Shma and Zwick in \cite{TZ07} [SOD…