Analysis of a randomized rendezvous algorithm

DOI10.1016/S0890-5401(03)00054-3MaRDI QIDQ1398376zbMATH OpenOpenAlexFDO

Authors Yves Métivier, Nasser Saheb, A. Zemmari

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)

Recommendations

• Randomized rendezvous with limited memory
• Validation of Stochastic Systems
• Asymptotically optimal deterministic rendezvous
• Realistic analysis of some randomized algorithms
• scientific article; zbMATH DE number 5855082
• scientific article; zbMATH DE number 1552336
• On the probability of rendezvous in graphs
• Time versus cost tradeoffs for deterministic rendezvous in networks
• Time versus cost tradeoffs for deterministic rendezvous in networks

Cites work

• scientific article; zbMATH DE number 3841894 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3176450 (Why is no real title available?)
• scientific article; zbMATH DE number 16479 (Why is no real title available?)
• scientific article; zbMATH DE number 1277120 (Why is no real title available?)
• scientific article; zbMATH DE number 1111371 (Why is no real title available?)
• scientific article; zbMATH DE number 1552336 (Why is no real title available?)
• scientific article; zbMATH DE number 815575 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Distributed Computing: A Locality-Sensitive Approach
• Introduction to Distributed Algorithms
• Solvability of the asynchronous ranking problem

Cited in

(9)

• STACS 2004
• Mobile Agents Implementing Local Computations in Graphs
• Certified impossibility results and analyses in Coq of some randomised distributed algorithms
• Résolution du problème du multi-rendezvous à l'aide d'un modèle d'algorithme distribué
• Markovian hitters and the complexity of blind rendezvous
• On handshakes in random graphs
• scientific article; zbMATH DE number 5855082 (Why is no real title available?)
• scientific article; zbMATH DE number 1979487 (Why is no real title available?)
• scientific article; zbMATH DE number 1552336 (Why is no real title available?)

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

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