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:

A note concerning the limit distribution of the quicksort algorithm

Michael Cramer

RAIRO-Theor. Inf. Appl., 30 3 (1996) 195-207

Published online: 2017-02-01

DOI: https://doi.org/10.1051/ita/1996300301951

This article has been cited by the following article(s):

Using nonlinear difference equations to study Quicksort algorithms

Yukun Yao
Journal of Difference Equations and Applications 26 (2) 275 (2020)
https://doi.org/10.1080/10236198.2020.1720665

On the silhouette of binary search trees

Rudolf Grübel
The Annals of Applied Probability 19 (5) (2009)
https://doi.org/10.1214/08-AAP593

The contraction method for recursive algorithms

U. Rösler and L. Rüschendorf
Algorithmica 29 (1-2) 3 (2001)
https://doi.org/10.1007/BF02679611

520 (2001)
https://doi.org/10.1002/9781118032770.biblio

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