1 citations · 1 across the 2 of their papers we have counts for
4 papers
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…
Amplified Pruning and Path Selectors for Deterministic Radio Gossiping
Qin Xin
We study deterministic gossiping in unknown strongly connected directed radio networks with vertices, arcs, and distinct identifiers in , where .…
Latency Optimal Broadcasting in Noisy Wireless Mesh Networks
Qin Xin, Yan Xia
In this paper, we adopt a new noisy wireless network model introduced very recently by Censor-Hillel et al. in [ACM PODC 2017, CHHZ17]. More specifically, for a given noise paramet…
Faster Treasure Hunt and Better Strongly Universal Exploration Sequences
Qin Xin
In this paper, we investigate the explicit deterministic treasure hunt problem in a -vertex network. This problem was firstly introduced by Ta-Shma and Zwick in \cite{TZ07} [SOD…