Analysis of a randomized rendezvous algorithm

DOI10.1016/S0890-5401(03)00054-3zbMath1028.68226OpenAlexW2088310932MaRDI QIDQ1398376

Yves Métivier, Akka Zemmari, Nasser Saheb

Publication date: 29 July 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0890-5401(03)00054-3

zbMATH Keywords

EfficiencyGraphRandomized algorithmAnalysis of algorithmRendezvous

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Related Items (3)

Certified Impossibility Results and Analyses in Coq of Some Randomised Distributed Algorithms ⋮ Mobile Agents Implementing Local Computations in Graphs ⋮ On handshakes in random graphs

Cites Work

• Solvability of the asynchronous ranking problem
• Distributed Computing: A Locality-Sensitive Approach
• Introduction to Distributed Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Analysis of a randomized rendezvous algorithm