Renewals for exponentially increasing lifetimes, with an application to digital search trees
From MaRDI portal
Publication:2455061
DOI10.1214/105051606000000862zbMath1125.60089arXiv0704.0398OpenAlexW2017684662MaRDI QIDQ2455061
Florian Dennert, Rudolf Grübel
Publication date: 22 October 2007
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0704.0398
Related Items (3)
Pruned Discrete Random Samples ⋮ On the silhouette of binary search trees ⋮ Renewal theory in the analysis of tries and strings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rounding of continuous random variables and oscillatory asymptotics
- Approximate counting: a detailed analysis
- On the multiplicity of the maximum in a discrete random sample
- Functional limit theorems for multitype branching processes and generalized Pólya urns.
- On the number of iterations required by Von Neumann addition
- Exact and asymptotic distributions in digital and binary search trees
This page was built for publication: Renewals for exponentially increasing lifetimes, with an application to digital search trees