Locally guided randomized elections in trees: The totally fair case
type: Item
instance of: scholarly article
title: Locally guided randomized elections in trees: The totally fair case
zbMATH Open document ID: 1067.68175
author: Yves Métivier
author: N. Saheb-Djahromi
author: A. Zemmari
published in: Information and Computation
publication date: 2005-05-04T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 2165065
zbMATH Keywords: Distributed algorithm
zbMATH Keywords: Election
zbMATH Keywords: Probabilistic analysis
zbMATH Keywords: Randomized algorithm
zbMATH Keywords: Stochastic process
MaRDI profile type: Publication
full work available at URL: j.ic.2005.01.005
OpenAlex ID: W2104584622
cites work: Q3941433
cites work: Q5512461
cites work: Q4846463
cites work: Q4954453
cites work: Distributed Computing: A Locality-Sensitive Approach
cites work: Q4239067
cites work: Introduction to Distributed Algorithms
DOI: 10.1016/J.IC.2005.01.005
Recommended article: Experimental and Efficient Algorithms
Recommended article: Q3176602
Recommended article: On asymptotic fairness in voting with greedy sampling
Recommended article: Foundations of Software Science and Computation Structures
Recommended article: Q4954453
Recommended article: Derandomizing random walks in undirected graphs using locally fair exploration strategies
Recommended article: Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
Recommended article: RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES
Recommended article: Q4938673
Recommended article: Relaxed voting and competitive location under monotonous gain functions on trees
description: scientific article; zbMATH DE number 2165065