Probabilistic analysis of an election algorithm in a tree

DOI10.1007/BFB0017485MaRDI QIDQ4954453zbMATH OpenFDO

Authors Nasser Saheb, Yves Métivier

Publication date 7 June 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0017485

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42)

Recommendations

• A probabilistic analysis of some tree algorithms
• scientific article; zbMATH DE number 6909297
• A probabilistic analysis of a leader election algorithm
• scientific article; zbMATH DE number 4104976
• Probabilistic analysis of bucket recursive trees
• scientific article; zbMATH DE number 15993
• Random Trees and the Analysis of Branch and Bound Procedures
• scientific article; zbMATH DE number 4205985
• scientific article; zbMATH DE number 4049028
• scientific article; zbMATH DE number 4047070

Cited in

(2)

• Locally guided randomized elections in trees: The totally fair case
• Uniform election in trees and polyominoids

This page was built for publication: Probabilistic analysis of an election algorithm in a tree

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