EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues RAIRO-Theor. Inf. Appl., 23 3 (1989) 317-333 Article references

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:

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

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)
DOI: 10.1017/S0001867800011642
See this article

Transitional behaviors of the average cost of quicksort with median-of-(2t + 1)

H. -H. Chern and H. -K. Hwang
Algorithmica 29 (1-2) 44 (2001)
DOI: 10.1007/BF02679613
See this article

François Bergeron, Philippe Flajolet and Bruno Salvy
581 24 (1992)
DOI: 10.1007/3-540-55251-0_2
See this article

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)
DOI: 10.1145/2629340
See this article

A limit theorem for “quicksort”

Uwe Rösler
RAIRO - Theoretical Informatics and Applications 25 (1) 85 (1991)
DOI: 10.1051/ita/1991250100851
See this article

A note concerning the limit distribution of the quicksort algorithm

Michael Cramer
RAIRO - Theoretical Informatics and Applications 30 (3) 195 (1996)
DOI: 10.1051/ita/1996300301951
See this article

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)
DOI: 10.1051/ita/1995290402551
See this article

Automatic average-case analysis of algorithms

Philippe Flajolet, Bruno Salvy and Paul Zimmermann
Theoretical Computer Science 79 (1) 37 (1991)
DOI: 10.1016/0304-3975(91)90145-R
See this article

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)
DOI: 10.1239/aap/1025131226
See this article

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)
DOI: 10.1137/S009753970138390X
See this article

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

Ralph Neininger
Random Structures and Algorithms 19 (3-4) 498 (2001)
DOI: 10.1002/rsa.10010
See this article

Brigitte Chauvin, Julien Clément and Danièle Gardy
83 61 (2018)
DOI: 10.1007/978-3-319-93725-0_3
See this article

Average-case analysis of multiple Quickselect: An algorithm for finding order statistics

Janice Lent and Hosam M. Mahmoud
Statistics & Probability Letters 28 (4) 299 (1996)
DOI: 10.1016/0167-7152(95)00139-5
See this article

The contraction method for recursive algorithms

U. Rösler and L. Rüschendorf
Algorithmica 29 (1-2) 3 (2001)
DOI: 10.1007/BF02679611
See this article

Sebastian Wild and Markus E. Nebel
7501 825 (2012)
DOI: 10.1007/978-3-642-33090-2_71
See this article

QuickXsort: A Fast Sorting Scheme in Theory and Practice

Stefan Edelkamp, Armin Weiß and Sebastian Wild
Algorithmica 82 (3) 509 (2020)
DOI: 10.1007/s00453-019-00634-0
See this article

On the analysis of stochastic divide and conquer algorithms

U. Rösler
Algorithmica 29 (1-2) 238 (2001)
DOI: 10.1007/BF02679621
See this article

Charles Knessl and Wojciech Szpankowski
1518 346 (1998)
DOI: 10.1007/3-540-49543-6_27
See this article

Phase changes in randomm-ary search trees and generalized quicksort

Hua-Huai Chern and Hsien-Kuei Hwang
Random Structures and Algorithms 19 (3-4) 316 (2001)
DOI: 10.1002/rsa.10005
See this article

An asymptotic theory for Cauchy–Euler differential equations with applications to the analysis of algorithms

Hua-Huai Chern, Hsien-Kuei Hwang and Tsung-Hsi Tsai
Journal of Algorithms 44 (1) 177 (2002)
DOI: 10.1016/S0196-6774(02)00208-0
See this article

Some properties of a limiting distribution in Quicksort

Kok Hooi Tan and Petros Hadjicostas
Statistics & Probability Letters 25 (1) 87 (1995)
DOI: 10.1016/0167-7152(94)00209-Q
See this article

Second phase changes in random $\boldsymbol{m}$-ary search trees and generalized quicksort: Convergence rates

Hsien-Kuei Hwang
The Annals of Probability 31 (2) (2003)
DOI: 10.1214/aop/1048516530
See this article

General combinatorial schemas: Gaussian limit distributions and exponential tails

Philippe Flajolet and Michèle Soria
Discrete Mathematics 114 (1-3) 159 (1993)
DOI: 10.1016/0012-365X(93)90364-Y
See this article

Using nonlinear difference equations to study Quicksort algorithms

Yukun Yao
Journal of Difference Equations and Applications 26 (2) 275 (2020)
DOI: 10.1080/10236198.2020.1720665
See this article

Colin McDiarmid
7721 43 (2013)
DOI: 10.1007/978-3-642-36046-6_5
See this article

Analysis of Quickselect Under Yaroslavskiy’s Dual-Pivoting Algorithm

Sebastian Wild, Markus E. Nebel and Hosam Mahmoud
Algorithmica 74 (1) 485 (2016)
DOI: 10.1007/s00453-014-9953-x
See this article

James Allen Fill and Svante Janson
53 (2000)
DOI: 10.1007/978-3-0348-8405-1_5
See this article

Perfect Simulation from the Quicksort Limit Distribution

Luc Devroye, James Fill and Ralph Neininger
Electronic Communications in Probability 5 (none) (2000)
DOI: 10.1214/ECP.v5-1024
See this article