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 2026Show all

2 papers · 1 filter

cs.CC2026

Faster Treasure Hunt via Strongly Universal Exploration with Polylogarithmic Overhead

Qin Xin

We study deterministic exploration and delayed-activation treasure hunt in anonymous undirected port-labeled graphs with incoming-port information. From polynomial-time constructib…

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)}$ .…