Pages that link to "Item:Q2369001"
From MaRDI portal
The following pages link to Asynchronous deterministic rendezvous in graphs (Q2369001):
Displaying 50 items.
- Anonymous meeting in networks (Q262278) (← links)
- Gathering asynchronous oblivious agents with local vision in regular bipartite graphs (Q392198) (← links)
- Deterministic symmetric rendezvous with tokens in a synchronous torus (Q540154) (← links)
- Asynchronous deterministic rendezvous in bounded terrains (Q650932) (← links)
- Fast rendezvous with advice (Q896137) (← links)
- Rendezvous of heterogeneous mobile agents in edge-weighted networks (Q896142) (← links)
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring (Q986558) (← links)
- Classifying rendezvous tasks of arbitrary dimension (Q1019731) (← links)
- On asynchronous rendezvous in general graphs (Q1625604) (← links)
- A general framework for searching on a line (Q1676358) (← links)
- Move-optimal partial gathering of mobile agents in asynchronous trees (Q1680543) (← 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)
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains (Q1946493) (← links)
- The topology of look-compute-move robot wait-free algorithms with hard termination (Q2002056) (← links)
- Byzantine gathering in polynomial time (Q2146872) (← links)
- Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
- Time versus space trade-offs for rendezvous in trees (Q2251152) (← 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)
- Byzantine gathering in networks (Q2359766) (← links)
- Gathering asynchronous oblivious mobile robots in a ring (Q2474070) (← links)
- Move-optimal gossiping among mobile agents (Q2481955) (← links)
- Searching on a line: a complete characterization of the optimal solution (Q2513671) (← links)
- Rendezvous in networks in spite of delay faults (Q2629214) (← links)
- Price of asynchrony in mobile agents computing (Q2637351) (← links)
- Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences (Q2799477) (← links)
- Rendezvous Problem (Q2961403) (← links)
- Ten Open Problems in Rendezvous Search (Q2961406) (← links)
- Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs (Q2971126) (← links)
- Synchronous Rendezvous for Location-Aware Agents (Q3095348) (← links)
- ASYMPTOTICALLY OPTIMAL DETERMINISTIC RENDEZVOUS (Q3173941) (← links)
- Asynchronous Deterministic Rendezvous on the Line (Q3599098) (← links)
- (Q5002836) (← links)
- Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults (Q5056052) (← links)
- Optimal rendezvous on a line by location-aware robots in the presence of spies* (Q5057736) (← links)
- Beyond Rings: Gathering in 1-Interval Connected Graphs (Q5087065) (← links)
- Linear rendezvous with asymmetric clocks (Q5091103) (← links)
- How to meet asynchronously at polynomial cost (Q5176086) (← links)
- On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous (Q5245013) (← links)
- Faster Treasure Hunt and Better Strongly Universal Exploration Sequences (Q5387786) (← links)
- Mobile Agent Rendezvous in a Ring Using Faulty Tokens (Q5445769) (← links)
- (Q5743418) (← links)
- Connected reconfiguration of lattice-based cellular structures by finite-memory robots (Q5918539) (← links)
- Gathering in the plane of location-aware robots in the presence of spies (Q5918903) (← links)
- Gathering in dynamic rings (Q5919424) (← 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)
