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

How to cite

top

Rueschendorf, 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 ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.