Pages that link to "Item:Q5901678"
From MaRDI portal
The following pages link to LATIN 2004: Theoretical Informatics (Q5901678):
Displaying 46 items.
- Anonymous meeting in networks (Q262278) (← links)
- Gathering asynchronous oblivious agents with local vision in regular bipartite graphs (Q392198) (← links)
- Self-stabilizing gathering with strong multiplicity detection (Q418745) (← links)
- Deterministic network exploration by a single agent with Byzantine tokens (Q436569) (← links)
- Deterministic symmetric rendezvous with tokens in a synchronous torus (Q540154) (← links)
- Uniform multi-agent deployment on a ring (Q627178) (← links)
- Asynchronous deterministic rendezvous in bounded terrains (Q650932) (← links)
- Bike assisted evacuation on a line (Q831791) (← links)
- Fast rendezvous with advice (Q896137) (← links)
- Partial gathering of mobile agents in asynchronous unidirectional rings (Q905844) (← links)
- How to meet in anonymous network (Q930910) (← links)
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring (Q986558) (← links)
- On deterministic rendezvous at a node of agents with arbitrary velocities (Q1705703) (← links)
- Gathering of robots in a ring with mobile faults (Q1731510) (← 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)
- Gathering identical autonomous systems on a circle using stigmergy (Q1938388) (← links)
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains (Q1946493) (← links)
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols (Q1954192) (← links)
- A symbolic programming approach to the rendezvous search problem (Q2120120) (← links)
- Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings (Q2182313) (← links)
- Search-and-rescue rendezvous (Q2242258) (← links)
- Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
- Time versus space trade-offs for rendezvous in trees (Q2251152) (← links)
- Deterministic polynomial approach in the plane (Q2353250) (← links)
- Fast rendezvous on a cycle by agents with different speeds (Q2357150) (← links)
- Asynchronous deterministic rendezvous in graphs (Q2369001) (← links)
- Map construction of unknown graphs by multiple agents (Q2456354) (← links)
- Gathering asynchronous oblivious mobile robots in a ring (Q2474070) (← links)
- Move-optimal gossiping among mobile agents (Q2481955) (← 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)
- DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS (Q3444846) (← links)
- Asynchronous Deterministic Rendezvous on the Line (Q3599098) (← links)
- How to meet asynchronously at polynomial cost (Q5176086) (← links)
- Structural Information and Communication Complexity (Q5315223) (← links)
- Mobile Agent Rendezvous in a Ring Using Faulty Tokens (Q5445769) (← links)
- (Q5743418) (← links)
- Gathering in dynamic rings (Q5919424) (← 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)
- Partial Gathering of Mobile Agents in Dynamic Rings (Q6488456) (← links)
- An environment for specifying and model checking mobile ring robot algorithms (Q6536330) (← links)
