LATIN 2004: Theoretical Informatics

DOI10.1007/b95852zbMath1196.68021OpenAlexW2475444492MaRDI QIDQ5901678

Danny Krizanc, Paola Flocchini, Cindy Sawchuk, Nicola Santoro, Evangelos Kranakis

Publication date: 7 May 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b95852

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)

Related Items

A symbolic programming approach to the rendezvous search problem ⋮ Bike assisted evacuation on a line ⋮ Asynchronous deterministic rendezvous in graphs ⋮ Rendezvous in networks in spite of delay faults ⋮ Price of asynchrony in mobile agents computing ⋮ Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings ⋮ Gathering asynchronous oblivious agents with local vision in regular bipartite graphs ⋮ Almost universal anonymous rendezvous in the plane ⋮ Fast rendezvous with advice ⋮ How to meet when you forget: log-space rendezvous in arbitrary graphs ⋮ Gathering identical autonomous systems on a circle using stigmergy ⋮ Deterministic rendezvous in infinite trees ⋮ Uniform multi-agent deployment on a ring ⋮ Self-stabilizing gathering with strong multiplicity detection ⋮ Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains ⋮ Partial gathering of mobile agents in asynchronous unidirectional rings ⋮ Deterministic network exploration by a single agent with Byzantine tokens ⋮ On deterministic rendezvous at a node of agents with arbitrary velocities ⋮ Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs ⋮ Searching for a black hole in arbitrary networks: optimal mobile agents protocols ⋮ Asynchronous deterministic rendezvous in bounded terrains ⋮ How to meet in anonymous network ⋮ Gathering of robots in a ring with mobile faults ⋮ Map construction of unknown graphs by multiple agents ⋮ Use of information, memory and randomization in asynchronous gathering ⋮ Search-and-rescue rendezvous ⋮ Gathering asynchronous oblivious mobile robots in a ring ⋮ Leader election for anonymous asynchronous agents in arbitrary networks ⋮ Time versus space trade-offs for rendezvous in trees ⋮ Move-optimal gossiping among mobile agents ⋮ Deterministic symmetric rendezvous with tokens in a synchronous torus ⋮ How to meet asynchronously at polynomial cost ⋮ Asynchronous Deterministic Rendezvous on the Line ⋮ Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring ⋮ Mobile Agent Rendezvous in a Ring Using Faulty Tokens ⋮ Gathering in dynamic rings ⋮ Time versus cost tradeoffs for deterministic rendezvous in networks ⋮ Deterministic Meeting of Sniffing Agents in the Plane ⋮ Unnamed Item ⋮ Deterministic polynomial approach in the plane ⋮ Anonymous meeting in networks ⋮ Fast rendezvous on a cycle by agents with different speeds

This page was built for publication: LATIN 2004: Theoretical Informatics