Randomized Rendez-Vous with Limited Memory

DOI10.1007/978-3-540-78773-0_52zbMath1136.68353OpenAlexW1535538796MaRDI QIDQ5458563

Pat Morin, Evangelos Kranakis, Danny Krizanc

Publication date: 15 April 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_52

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Sums of independent random variables; random walks (60G50) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Rendezvous in networks in spite of delay faults ⋮ Almost universal anonymous rendezvous in the plane ⋮ Fast rendezvous with advice ⋮ How to meet when you forget: log-space rendezvous in arbitrary graphs ⋮ Deterministic rendezvous in infinite trees ⋮ How much memory is needed for leader election ⋮ Use of information, memory and randomization in asynchronous gathering ⋮ Deterministic Meeting of Sniffing Agents in the Plane ⋮ Unnamed Item ⋮ Deterministic polynomial approach in the plane