Open Access
2006 Exponential tail bounds for max-recursive sequences
Ludger Rueschendorf, Eva-Maria Schopp
Author Affiliations +
Electron. Commun. Probab. 11: 266-277 (2006). DOI: 10.1214/ECP.v11-1227


Exponential tail bounds are derived for solutions of max-recursive equations and for max-recursive random sequences, which typically arise as functionals of recursive structures, of random trees or in recursive algorithms. In particular they arise in the worst case analysis of divide and conquer algorithms, in parallel search algorithms or in the height of random tree models. For the proof we determine asymptotic bounds for the moments or for the Laplace transforms and apply a characterization of exponential tail bounds due to Kasahara (1978).


Download Citation

Ludger Rueschendorf. Eva-Maria Schopp. "Exponential tail bounds for max-recursive sequences." Electron. Commun. Probab. 11 266 - 277, 2006.


Accepted: 11 November 2006; Published: 2006
First available in Project Euclid: 4 June 2016

zbMATH: 1128.60011
MathSciNet: MR2266717
Digital Object Identifier: 10.1214/ECP.v11-1227

Primary: 60705
Secondary: 68Q25 , 68W40

Keywords: divide and conquer algorithm , Exponential bounds , Probabilistic analysis of algorithms , recursive algorithm

Back to Top