Randomized rendezvous with limited memory

DOI10.1145/1978782.1978789zbMATH Open1295.68050OpenAlexW2086702855MaRDI QIDQ3189017FDOQ3189017

Authors: Pat Morin, Evangelos Kranakis, D. Krizanc 

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1978782.1978789

Recommendations

• Randomized Rendez-Vous with Limited Memory
• Time versus space trade-offs for rendezvous in trees
• How to meet when you forget: log-space rendezvous in arbitrary graphs
• How to meet when you forget: log-space rendezvous in arbitrary graphs
• Deterministic Rendezvous in Trees with Little Memory

zbMATH Keywords

distributed computingrendezvous

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Agent technology and artificial intelligence (68T42) Distributed systems (68M14)

Cited In (5)

• Time versus space trade-offs for rendezvous in trees
• Anonymous meeting in networks
• Time versus cost tradeoffs for deterministic rendezvous in networks
• Analysis of a randomized rendezvous algorithm
• Randomized Rendez-Vous with Limited Memory

This page was built for publication: Randomized rendezvous with limited memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189017)