Exponential tail bounds for max-recursive sequences

DOI10.1214/ECP.V11-1227MaRDI QIDQ2460997zbMATH OpenOpenAlexFDO

Authors Eva-Maria Schopp, Ludger Rüschendorf

Publication date 19 November 2007

Published in Electronic Communications in Probability (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/128276

zbMATH Keywords

worst case analysisexponential tail boundsdivide and conquer algorithmsparallel search algorithms

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Combinatorial probability (60C05)

Recommendations

• Exponential bounds and tails for additive random recursive sequences
• scientific article; zbMATH DE number 6683491
• On tail bounds for random recursive trees
• Tail behaviour and martingale convergence of random recursive structures and algorithms
• Maximums on trees

Cited in

(4)

• Tail behaviour and martingale convergence of random recursive structures and algorithms
• Exponential bounds and tails for additive random recursive sequences
• scientific article; zbMATH DE number 3981175 (Why is no real title available?)
• Tails for (max, plus) recursions under subexponentiality

This page was built for publication: Exponential tail bounds for max-recursive sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2460997)