Randomized Rendez-Vous with Limited Memory
DOI10.1007/978-3-540-78773-0_52zbMATH Open1136.68353OpenAlexW1535538796MaRDI QIDQ5458563FDOQ5458563
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
Recommendations
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)
Cited In (18)
- Deterministic polynomial approach in the plane
- Deterministic rendezvous in infinite trees
- Fast rendezvous with advice
- A note on randomized mutual search.
- How much memory is needed for leader election
- Title not available (Why is that?)
- Almost universal anonymous rendezvous in the plane
- Use of information, memory and randomization in asynchronous gathering
- 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
- Title not available (Why is that?)
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)
