Pages that link to "Item:Q5176086"
From MaRDI portal
The following pages link to How to meet asynchronously at polynomial cost (Q5176086):
Displaying 34 items.
- Anonymous meeting in networks (Q262278) (← links)
- Gathering of oblivious robots on infinite grids with minimum traveled distance (Q528200) (← links)
- Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers (Q820530) (← links)
- Rendezvous and election of mobile agents: Impact of sense of direction (Q866916) (← 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 asynchronous rendezvous in general graphs (Q1625604) (← links)
- On deterministic rendezvous at a node of agents with arbitrary velocities (Q1705703) (← links)
- Byzantine gathering in polynomial time (Q2146872) (← links)
- Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings (Q2182313) (← links)
- Meeting in a polygon by anonymous oblivious robots (Q2204780) (← links)
- Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
- Asynchronous approach in the plane: a deterministic polynomial algorithm (Q2318113) (← links)
- Rendezvous in planar environments with obstacles and unknown initial distance (Q2321296) (← links)
- Deterministic polynomial approach in the plane (Q2353250) (← links)
- Fast rendezvous on a cycle by agents with different speeds (Q2357150) (← links)
- Byzantine gathering in networks (Q2359766) (← links)
- Rendezvous in networks in spite of delay faults (Q2629214) (← links)
- Price of asynchrony in mobile agents computing (Q2637351) (← links)
- Deterministic Meeting of Sniffing Agents in the Plane (Q2835027) (← links)
- Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs (Q2971126) (← links)
- (Q5002836) (← links)
- Linear rendezvous with asymmetric clocks (Q5091103) (← links)
- How to meet asynchronously at polynomial cost (Q5176086) (← links)
- (Q5258918) (redirect page) (← links)
- Deterministic Rendezvous with Detection Using Beeps (Q5890529) (← links)
- Time versus cost tradeoffs for deterministic rendezvous in networks (Q5964898) (← links)
- Almost universal anonymous rendezvous in the plane (Q6046947) (← links)
- Deterministic rendezvous in infinite trees (Q6140349) (← links)
- Optimally reordering mobile agents on parallel rows (Q6185843) (← links)
- Deterministic treasure hunt and rendezvous in arbitrary connected graphs (Q6195335) (← links)
- Time versus cost tradeoffs for deterministic rendezvous in networks (Q6483581) (← links)
- Want to gather? No need to chatter! (Q6663095) (← links)
