Randomized Rendez-Vous with Limited Memory

DOI10.1007/978-3-540-78773-0_52MaRDI QIDQ5458563zbMATH OpenOpenAlexFDO

Authors Pat Morin, Evangelos Kranakis, D. 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) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Sums of independent random variables; random walks (60G50)

Recommendations

• Randomized rendezvous 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

Cited in

(18)

• scientific article; zbMATH DE number 1552336 (Why is no real title available?)
• Deterministic polynomial approach in the plane
• Fast rendezvous with advice
• Deterministic rendezvous in infinite trees
• A note on randomized mutual search.
• How much memory is needed for leader election
• scientific article; zbMATH DE number 7650368 (Why is no real title available?)
• Use of information, memory and randomization in asynchronous gathering
• Almost universal anonymous rendezvous in the plane
• Gathering despite mischief
• Random permutations on distributed, external and hierarchical memory
• Markovian hitters and the complexity of blind rendezvous
• How to meet when you forget: log-space rendezvous in arbitrary graphs
• Rendezvous in networks in spite of delay faults
• Continuous rendezvous algorithm for memoryless agents with limited visibility in the Euclidean space
• Randomized rendezvous with limited memory
• Want to gather? No need to chatter!
• Deterministic meeting of sniffing agents in the plane

This page was built for publication: Randomized Rendez-Vous with Limited Memory

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