On a recurrence equation arising in the analysis of conflict resolution algorithms

DOI10.1080/15326348708807048zbMath0624.94006OpenAlexW2090663318MaRDI QIDQ3026903

Wojciech Szpankowski

Publication date: 1987

Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1473&context=cstech

zbMATH Keywords

Mellin transformasymptotic approximationexponential generating functionsrecurrence equationmaximum throughputconflict resolution algorithms

Mathematics Subject Classification ID

Characteristic functions; other transforms (60E10) Special integral transforms (Legendre, Hilbert, etc.) (44A15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Iteration theory, iterative and composite equations (39B12) Communication theory (94A05)

Related Items (5)

The evaluation of an alternative sum with applications to the analysis of some data structures ⋮ Analytical depoissonization and its applications ⋮ On tries, contention trees and their analysis ⋮ A note on binomial recurrences arising in the analysis of algorithms ⋮ Yet another application of a binomial recurrence. Order statistics

This page was built for publication: On a recurrence equation arising in the analysis of conflict resolution algorithms