On the distribution for the duration of a randomized leader election algorithm
type: Item
instance of: scholarly article
title: On the distribution for the duration of a randomized leader election algorithm
zbMATH Open document ID: 0870.60018
author: James Allen Fill
author: Hosam M. Mahmoud
author: Wojciech Szpankowski
published in: The Annals of Applied Probability
publication date: 1997-06-12T00:00:00Z
Mathematics Subject Classification ID: 60F05
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 60G70
zbMATH DE Number: 1008584
zbMATH Keywords: random trees
zbMATH Keywords: tries
zbMATH Keywords: height
zbMATH Keywords: distributed computing
zbMATH Keywords: leader election
zbMATH Keywords: asymptotic distribution
zbMATH Keywords: Poissonization
zbMATH Keywords: de-Poissonization
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1214/aoap/1035463332
OpenAlex ID: W2035490304
cites work: Q3331506
cites work: Probability approximations via the Poisson clumping heuristic
cites work: Extreme value theory for a class of discrete distributions with applications to some stochastic processes
cites work: Independent process approximations for random combinatorial structures
cites work: Q3218192
cites work: Q4040055
cites work: Q3476055
cites work: Q3723577
cites work: A study of trie-like structures under the density model
cites work: On the performance evaluation of extendible hashing and trie searching
cites work: Mellin transforms and asymptotics: Harmonic sums
cites work: Probabilistic counting algorithms for data base applications
cites work: Mellin transforms and asymptotics: Finite differences and Rice's integrals
cites work: Q4040329
cites work: The analysis of linear probing sort by the use of a new mathematical transform
cites work: Searching for losers
cites work: On Birthday, Collectors', Occupancy and Other Classical Urn Problems
cites work: Q3742733
cites work: Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation
cites work: Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
cites work: On Deviations between Theoretical and Empirical Distributions
cites work: Q4767350
cites work: Q4004056
cites work: Analysis of Extendible Hashing
cites work: Asymptotical growth of a class of random trees
cites work: Paths in a random digital tree: limiting distributions
cites work: How many random questions are necessary to identify \(n\) distinct objects?
cites work: Approximating functions by their Poisson transform
cites work: How to select a loser
cites work: Limiting Distribution for the Depth in PATRICIA Tries
cites work: New results on the size of tries
cites work: Q5511767
cites work: Solution of a Linear Recurrence Equation Arising in the Analysis of Some Algorithms
DOI: 10.1214/AOAP/1035463332
description: scientific article; zbMATH DE number 1008584