Perfect information leader election in \(\log^*n+O(1)\) rounds
type: Item
instance of: scholarly article
title: Perfect information leader election in \(\log^*n+O(1)\) rounds
zbMATH Open document ID: 1006.68012
author: Alexander Russell
author: David Zuckerman
published in: Journal of Computer and System Sciences
publication date: 2002-07-04T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M12
zbMATH DE Number: 1763412
zbMATH Keywords: distributed computing
zbMATH Keywords: leader election
zbMATH Keywords: collective sampling
zbMATH Keywords: collective coinflipping
MaRDI profile type: Publication
full work available at URL: jcss.2001.1776
OpenAlex ID: W1994659270
cites work: The influence of large coalitions
cites work: Coin-Flipping Games Immune against Linear-Sized Coalitions
cites work: Q4004078
cites work: Weighted sums of certain dependent random variables
cites work: Q3830840
cites work: Perfect-Information Leader Election with Optimal Resilience
cites work: Fast perfect-information leader-election protocols with linear immunity
cites work: An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Efficient construction of a small hitting set for combinatorial rectangles in high dimension
cites work: Simple and efficient leader election in the full information model
cites work: A Robust Noncryptographic Protocol for Collective Coin Flipping
cites work: Q5581566
cites work: Q4372786
DOI: 10.1006/JCSS.2001.1776
description: scientific article; zbMATH DE number 1763412