Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

QuickSort: improved right-tail asymptotics for the limiting distribution, and large deviations

James Allen Fill and Wei-Chun Hung
Electronic Journal of Probability 24 (none) (2019)
https://doi.org/10.1214/19-EJP331

Cost functionals for large (uniform and simply generated) random trees

Jean-François Delmas, Jean-Stéphane Dhersin and Marion Sciauveau
Electronic Journal of Probability 23 (none) (2018)
https://doi.org/10.1214/18-EJP213

General Edgeworth expansions with applications to profiles of random trees

Zakhar Kabluchko, Alexander Marynych and Henning Sulzbach
The Annals of Applied Probability 27 (6) (2017)
https://doi.org/10.1214/17-AAP1285

Analysis of the Multi-Pivot Quicksort Process

Mahmoud Ragab, Beih El-Sayed El-Desouky and Nora Nader
Open Journal of Modelling and Simulation 05 (01) 47 (2017)
https://doi.org/10.4236/ojmsi.2017.51004

On the Convergence of the Dual-Pivot Quicksort Process

Mahmoud Ragab, Beih El-Sayed El-Desouky and Nora Nader
Open Journal of Modelling and Simulation 04 (01) 1 (2016)
https://doi.org/10.4236/ojmsi.2016.41001

A functional central limit theorem for branching random walks, almost sure weak convergence and applications to random trees

Rudolf Grübel and Zakhar Kabluchko
The Annals of Applied Probability 26 (6) (2016)
https://doi.org/10.1214/16-AAP1188

Average Case and Distributional Analysis of Dual-Pivot Quicksort

Sebastian Wild, Markus E. Nebel and Ralph Neininger
ACM Transactions on Algorithms 11 (3) 1 (2015)
https://doi.org/10.1145/2629340

Mathematical and Engineering Methods in Computer Science

Colin McDiarmid
Lecture Notes in Computer Science, Mathematical and Engineering Methods in Computer Science 7721 43 (2013)
https://doi.org/10.1007/978-3-642-36046-6_5

Distributional convergence for the number of symbol comparisons used by QuickSort

James Allen Fill
The Annals of Applied Probability 23 (3) (2013)
https://doi.org/10.1214/12-AAP866

Distributional Convergence for the Number of Symbol Comparisons Used by Quickselect

James Allen Fill and Takehiko Nakama
Advances in Applied Probability 45 (2) 425 (2013)
https://doi.org/10.1239/aap/1370870125

Distributional Convergence for the Number of Symbol Comparisons Used by Quickselect

James Allen Fill and Takehiko Nakama
Advances in Applied Probability 45 (02) 425 (2013)
https://doi.org/10.1017/S000186780000639X

On the Asymptotic Internal Path Length and the Asymptotic Wiener Index of Random Split Trees

Goetz Olaf Munsonius
Electronic Journal of Probability 16 (none) (2011)
https://doi.org/10.1214/EJP.v16-889

Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh–Hadamard transform

Paweł Hitczenko, Jeremy R. Johnson and Hung-Jen Huang
Theoretical Computer Science 352 (1-3) 8 (2006)
https://doi.org/10.1016/j.tcs.2005.09.074

Minimal clade size and external branch length under the neutral coalescent

Michael G. B. Blum and Olivier François
Advances in Applied Probability 37 (03) 647 (2005)
https://doi.org/10.1017/S0001867800000409

Minimal clade size and external branch length under the neutral coalescent

Michael G. B. Blum and Olivier François
Advances in Applied Probability 37 (3) 647 (2005)
https://doi.org/10.1239/aap/1127483740

Stochastic analysis of tree–like data structures

Michael Drmota
Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 460 (2041) 271 (2004)
https://doi.org/10.1098/rspa.2003.1243

Density approximation and exact simulation of random variables that are solutions of fixed-point equations

Luc Devroye and Ralph Neininger
Advances in Applied Probability 34 (2) 441 (2002)
https://doi.org/10.1239/aap/1025131226

Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions

Hsien-Kuei Hwang and Ralph Neininger
SIAM Journal on Computing 31 (6) 1687 (2002)
https://doi.org/10.1137/S009753970138390X

Density approximation and exact simulation of random variables that are solutions of fixed-point equations

Luc Devroye and Ralph Neininger
Advances in Applied Probability 34 (02) 441 (2002)
https://doi.org/10.1017/S0001867800011642

On a multivariate contraction method for random recursive structures with applications to Quicksort

Ralph Neininger
Random Structures & Algorithms 19 (3-4) 498 (2001)
https://doi.org/10.1002/rsa.10010

Approximating the limiting Quicksort distribution

James Allen Fill and Svante Janson
Random Structures & Algorithms 19 (3-4) 376 (2001)
https://doi.org/10.1002/rsa.10007

Perfect Simulation from the Quicksort Limit Distribution

Luc Devroye, James Fill and Ralph Neininger
Electronic Communications in Probability 5 (none) (2000)
https://doi.org/10.1214/ECP.v5-1024

Randomization and Approximation Techniques in Computer Science

Charles Knessl and Wojciech Szpankowski
Lecture Notes in Computer Science, Randomization and Approximation Techniques in Computer Science 1518 346 (1998)
https://doi.org/10.1007/3-540-49543-6_27

Analysis of quickselect : an algorithm for order statistics

Hosam M. Mahmoud, Reza Modarres and Robert T. Smythe
RAIRO - Theoretical Informatics and Applications 29 (4) 255 (1995)
https://doi.org/10.1051/ita/1995290402551