Exponential tail bounds for max-recursive sequences.
Rueschendorf, Ludger; Schopp, Eva-Maria
Electronic Communications in Probability [electronic only] (2006)
- Volume: 11, page 266-277
- ISSN: 1083-589X
Access Full Article
topHow to cite
topRueschendorf, Ludger, and Schopp, Eva-Maria. "Exponential tail bounds for max-recursive sequences.." Electronic Communications in Probability [electronic only] 11 (2006): 266-277. <http://eudml.org/doc/128276>.
@article{Rueschendorf2006,
author = {Rueschendorf, Ludger, Schopp, Eva-Maria},
journal = {Electronic Communications in Probability [electronic only]},
keywords = {worst case analysis; divide and conquer algorithms; parallel search algorithms; exponential tail bounds},
language = {eng},
pages = {266-277},
publisher = {University of Washington},
title = {Exponential tail bounds for max-recursive sequences.},
url = {http://eudml.org/doc/128276},
volume = {11},
year = {2006},
}
TY - JOUR
AU - Rueschendorf, Ludger
AU - Schopp, Eva-Maria
TI - Exponential tail bounds for max-recursive sequences.
JO - Electronic Communications in Probability [electronic only]
PY - 2006
PB - University of Washington
VL - 11
SP - 266
EP - 277
LA - eng
KW - worst case analysis; divide and conquer algorithms; parallel search algorithms; exponential tail bounds
UR - http://eudml.org/doc/128276
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.