Pages that link to "Item:Q5009618"
From MaRDI portal
The following pages link to Searching a Tree with Permanently Noisy Advice (Q5009618):
Displaying 9 items.
- Binary search in graphs revisited (Q1741841) (← links)
- An efficient noisy binary search in graphs via Median approximation (Q2115863) (← links)
- Pebble guided near optimal treasure hunt in anonymous graphs (Q2117728) (← links)
- Slowdown for the geodesic-biased random walk (Q2279090) (← links)
- Search for an immobile hider on a stochastic network (Q2286995) (← links)
- Pebble guided optimal treasure hunt in anonymous graphs (Q2672573) (← links)
- (Q5091040) (← links)
- Binary Search in Graphs Revisited (Q5111234) (← links)
- The faulty Satnav (GPS) problem: search for home in networks with unreliable directions (Q6076348) (← links)
