scientific article

zbMATH Open1392.68441arXiv1507.04909MaRDI QIDQ3176602FDOQ3176602

Authors: Jean-François Marckert, N. Saheb-Djahromi, A. Zemmari 

Publication date: 23 July 2018

Full work available at URL: https://arxiv.org/abs/1507.04909

Title of this publication is not available (Why is that?)

Recommendations

• Locally guided randomized elections in trees: The totally fair case
• Ballots, queues and random graphs
• scientific article; zbMATH DE number 4050991
• Uniform election in trees and polyominoids
• On the distribution for the duration of a randomized leader election algorithm
• Random trees in queueing systems with deadlines
• Solving Election Problem in Asynchronous Distributed Systems
• Communication and time complexity of a distributed election protocol

zbMATH Keywords

distributed algorithmprobabilistic analysisrandom processelection algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Distributed algorithms (68W15)

Cited In (4)

• Title not available (Why is that?)
• Uniform election in trees and polyominoids
• Locally guided randomized elections in trees: The totally fair case
• Models of random subtrees of a graph

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 Q3176602)