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 2026 · cs.CCShow all

1 paper · 2 filters

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…