Sie haben noch keine Produkte im Warenkorb.

Probabilistic Analysis of Radix Algorithms on Markov Sources

SFr. 75,00

0
Ihre Kundenmeinung hinzufügen Artikelnummer 995078
Versand per:
Deutsche Post DHL UPS pin MAIL
Verlag Südwestdeutscher Verlag für Hochschulschriften Bindung Taschenbuch Interpret Kevin Leckey

Produktbeschreibung

This book is about the analysis of radix sort, radix select and the path length of digital trees under a stochastic input assumption known as the Markov model. The main results are about the asymptotic expansions of mean and variance as well as a central limit theorem for the complexity of radix sort and the path length of tries, PATRICIA tries and digital search trees. Concerning radix select, a variety of different models for ranks are discussed including a law of large numbers for the worst case behavior, a limit theorem for the grand averages model and the first order asymptotic of the average complexity in the quantile model. Some of the results are achieved by moment transfer techniques, the limit laws are based on a novel use of the contraction method adjusted to systems of stochastic recurrences.


Bewertungen

0

Schreiben Sie als erster eine Rezension

Ihre Meinung interessiert uns – und hilft anderen Kunden bei der Auswahl.

-