Qin Xin

activity

20122026

most citedFaster Treasure Hunt and Better Strongly Universal Exploration Sequences

1 citations · 1 across the 2 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2026

Amplified Pruning and Path Selectors for Deterministic Radio Gossiping

Qin Xin

We study deterministic gossiping in unknown strongly connected directed radio networks with $n$ vertices, $m$ arcs, and distinct identifiers in $[N]$ , where $N = n^{O (1)}$ .…

cs.DS2012★ 1 cited

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…