Distances in random digital search trees
type: Item
instance of: scholarly article
title: Distances in random digital search trees
zbMATH Open document ID: 1102.60020
author: Rafik Aguech
author: Nabil Lasmar
author: Hosam M. Mahmoud
published in: Acta Informatica
publication date: 2006-11-27T00:00:00Z
Mathematics Subject Classification ID: 60F05
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 60C05
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P20
zbMATH DE Number: 5076273
zbMATH Keywords: Random trees
zbMATH Keywords: Recurrence
zbMATH Keywords: Mellin transform
zbMATH Keywords: Poissonization
zbMATH Keywords: Fixed point
zbMATH Keywords: Contraction method
MaRDI profile type: Publication
full work available at URL: s00236-006-0019-7
OpenAlex ID: W2162074286
cites work: Limit distribution of distances in biased random tries
cites work: An asymptotic theory for Cauchy–Euler differential equations with applications to the analysis of algorithms
cites work: The oscillatory distribution of distances in random tries
cites work: File structures using hashing functions
cites work: Distances and Finger Search in Random Binary Search Trees
cites work: Digital Search Trees Revisited
cites work: Mellin transforms and asymptotics: Harmonic sums
cites work: Q3807048
cites work: Analytical depoissonization and its applications
cites work: Further results on digital search trees
cites work: Digital Search Trees Again Revisited: The Internal Path Length Perspective
cites work: Linear probing and graphs
cites work: Exact and asymptotic distributions in digital and binary search trees
cites work: Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
cites work: Average Profile of the Generalized Digital Search Tree and the Generalized Lempel--Ziv Algorithm
cites work: Q4004056
cites work: Distribution of distances in random binary search trees.
cites work: &lt;tex&gt;Q&lt;/tex&gt;-ary collision resolution algorithms in random-access systems with free or blocked channel access
cites work: On a multivariate contraction method for random recursive structures with applications to quicksort
cites work: Q4792912
cites work: A general limit theorem for recursive algorithms and combinatorial structures
cites work: Spanning tree size in random binary search trees.
cites work: Asymptotical growth of a class of random trees
cites work: Probability metrics and recursive algorithms
cites work: A limit theorem for “quicksort”
cites work: On the analysis of stochastic divide and conquer algorithms
cites work: The contraction method for recursive algorithms
cites work: A characterization of digital search trees from the successful search viewpoint
cites work: Average case analysis of algorithms on sequences. With a foreword by Philippe Flajolet
DOI: 10.1007/S00236-006-0019-7
description: scientific article; zbMATH DE number 5076273