Locally guided randomized elections in trees: The totally fair case

DOI10.1016/J.IC.2005.01.005zbMATH Open1067.68175OpenAlexW2104584622MaRDI QIDQ1775889FDOQ1775889

Yves Métivier, N. Saheb-Djahromi, A. Zemmari

Publication date: 4 May 2005

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

Full work available at URL: https://doi.org/10.1016/j.ic.2005.01.005

Recommendations

• Experimental and Efficient Algorithms
• scientific article
• On asymptotic fairness in voting with greedy sampling
• Foundations of Software Science and Computation Structures
• scientific article; zbMATH DE number 1456964
• Derandomizing random walks in undirected graphs using locally fair exploration strategies
• Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
• Randomized self-stabilizing leader election in preference-based anonymous trees
• Publication:4938673
• Relaxed voting and competitive location under monotonous gain functions on trees

zbMATH Keywords

Stochastic processDistributed algorithmRandomized algorithmProbabilistic analysisElection

Mathematics Subject Classification ID

Randomized algorithms (68W20) Distributed algorithms (68W15)

Cites Work

• Introduction to Distributed Algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Distributed Computing: A Locality-Sensitive Approach
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Title not available (Why is that?)
• Uniform election in trees and polyominoids
• Experimental and Efficient Algorithms
• Models of random subtrees of a graph

This page was built for publication: Locally guided randomized elections in trees: The totally fair case

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