Pages that link to "Item:Q4330236"
From MaRDI portal
The following pages link to Rendezvous search when marks are left at the starting points (Q4330236):
Displayed 27 items.
- Anonymous meeting in networks (Q262278) (← links)
- Deterministic symmetric rendezvous with tokens in a synchronous torus (Q540154) (← links)
- Fast rendezvous with advice (Q896137) (← links)
- Rendezvous of heterogeneous mobile agents in edge-weighted networks (Q896142) (← links)
- How to meet in anonymous network (Q930910) (← links)
- On deterministic rendezvous at a node of agents with arbitrary velocities (Q1705703) (← links)
- Use of information, memory and randomization in asynchronous gathering (Q1745729) (← links)
- How to meet when you forget: log-space rendezvous in arbitrary graphs (Q1938363) (← links)
- A symbolic programming approach to the rendezvous search problem (Q2120120) (← links)
- Search-and-rescue rendezvous (Q2242258) (← links)
- Time versus space trade-offs for rendezvous in trees (Q2251152) (← links)
- Deterministic rendezvous with different maps (Q2323344) (← links)
- Fast rendezvous on a cycle by agents with different speeds (Q2357150) (← links)
- Asynchronous deterministic rendezvous in graphs (Q2369001) (← links)
- Line-of-sight rendezvous (Q2475830) (← links)
- Rendezvous in networks in spite of delay faults (Q2629214) (← links)
- Price of asynchrony in mobile agents computing (Q2637351) (← links)
- Synchronous Rendezvous for Location-Aware Agents (Q3095348) (← links)
- Rendezvous search with markers that can be dropped at chosen times (Q3120081) (← links)
- Asynchronous Deterministic Rendezvous on the Line (Q3599098) (← links)
- How to meet asynchronously at polynomial cost (Q5176086) (← links)
- Rendezvous Search with Revealed Information: Applications to the Line (Q5443698) (← links)
- (Q5743418) (← links)
- Time versus cost tradeoffs for deterministic rendezvous in networks (Q5964898) (← links)
- Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks (Q6042397) (← links)
- Deterministic rendezvous in infinite trees (Q6140349) (← links)
- Overcoming probabilistic faults in disoriented linear search (Q6148081) (← links)