Locally guided randomized elections in trees: The totally fair case
From MaRDI portal
Publication:1775889
Recommendations
- Experimental and Efficient Algorithms
- scientific article; zbMATH DE number 6909297
- 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
Cites work
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 1277120 (Why is no real title available?)
- scientific article; zbMATH DE number 790246 (Why is no real title available?)
- scientific article; zbMATH DE number 1456964 (Why is no real title available?)
- scientific article; zbMATH DE number 3223982 (Why is no real title available?)
- Distributed Computing: A Locality-Sensitive Approach
- Introduction to Distributed Algorithms
Cited in
(5)
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)