Asymptotic normality of recursive algorithms via martingale difference arrays.

Schachinger, Werner

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (2001)

  • Volume: 4, Issue: 2, page 363-398
  • ISSN: 1365-8050

How to cite

top

Schachinger, Werner. "Asymptotic normality of recursive algorithms via martingale difference arrays.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 4.2 (2001): 363-398. <http://eudml.org/doc/121933>.

@article{Schachinger2001,
author = {Schachinger, Werner},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {trie; martingales; central limit theorem},
language = {eng},
number = {2},
pages = {363-398},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {Asymptotic normality of recursive algorithms via martingale difference arrays.},
url = {http://eudml.org/doc/121933},
volume = {4},
year = {2001},
}

TY - JOUR
AU - Schachinger, Werner
TI - Asymptotic normality of recursive algorithms via martingale difference arrays.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 2001
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 4
IS - 2
SP - 363
EP - 398
LA - eng
KW - trie; martingales; central limit theorem
UR - http://eudml.org/doc/121933
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.