Pages that link to "Item:Q1872734"

The following pages link to Universal traversal sequences with backtracking. (Q1872734):

Displaying 14 items.

• Deterministic network exploration by a single agent with Byzantine tokens (Q436569) (← links)
• How much memory is needed for leader election (Q661049) (← links)
• Derandomizing random walks in undirected graphs using locally fair exploration strategies (Q661051) (← links)
• Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers (Q820530) (← links)
• How to meet when you forget: log-space rendezvous in arbitrary graphs (Q1938363) (← links)
• The isomorphism problem for planar 3-connected graphs is in unambiguous logspace (Q1959391) (← links)
• Rendezvous in networks in spite of delay faults (Q2629214) (← links)
• Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences (Q2799477) (← links)
• Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty (Q2961404) (← links)
• Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs (Q2971126) (← links)
• Randomized and Symmetric Catalytic Computation (Q5042242) (← links)
• Memory Efficient Anonymous Graph Exploration (Q5302040) (← links)
• Deterministic Rendezvous with Detection Using Beeps (Q5890529) (← links)
• Almost universal anonymous rendezvous in the plane (Q6046947) (← links)