scientific article; zbMATH DE number 5855082

zbMATH Open1224.68214MaRDI QIDQ3077352FDOQ3077352

Authors Abdelaaziz El Hibaoui, Yves Métivier, John Michael Robson, N. Saheb-Djahromi, A. Zemmari

Publication date 22 February 2011

zbMATH Keywords

matchingdistributed algorithmrandom graphsprobabilistic analysishandshake algorithm

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• Analysis of a randomized rendezvous algorithm
• Randomized algorithm for agreeable deadlines packet scheduling
• Analysis of timing-based mutual exclusion with random times
• Time versus cost tradeoffs for deterministic rendezvous in networks
• Time versus cost tradeoffs for deterministic rendezvous in networks
• A Time-Randomness Trade-Off for Oblivious Routing
• Analysis of communication systems with timed token protocols using the power-series algorithm
• Analysis of randomized protocols for conflict-free distributed access
• A universal randomized packet scheduling algorithm

Cited in

(3)

• Mobile Agents Implementing Local Computations in Graphs
• Analysis of a randomized rendezvous algorithm
• On handshakes in random graphs

This page was built for publication:

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