A limit theorem for “quicksort”
RAIRO-Theor. Inf. Appl., 25 1 (1991) 85-100
Published online: 2017-02-01
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):
Mathematics and Computer Science III
Tämur Ali Khan and Ralph NeiningerMathematics and Computer Science III 163 (2004)
https://doi.org/10.1007/978-3-0348-7915-6_17
On the contraction method with degenerate limit equation
Ralph Neininger and Ludger RüschendorfThe Annals of Probability 32 (3B) (2004)
https://doi.org/10.1214/009117904000000171
Limiting distributions for additive functionals on Catalan trees
James Allen Fill and Nevin KapurTheoretical Computer Science 326 (1-3) 69 (2004)
https://doi.org/10.1016/j.tcs.2004.05.010
One-sided variations on interval trees
Yoshiaki Itoh and Hosam M. MahmoudJournal of Applied Probability 40 (3) 654 (2003)
https://doi.org/10.1239/jap/1059060894
An almost sure result for path lengths in binary search trees
F. M. Dekking and L. E. MeesterAdvances in Applied Probability 35 (2) 363 (2003)
https://doi.org/10.1239/aap/1051201652
An almost sure result for path lengths in binary search trees
F. M. Dekking and L. E. MeesterAdvances in Applied Probability 35 (02) 363 (2003)
https://doi.org/10.1017/S0001867800012295
One-sided variations on binary search trees
Hosam M. MahmoudAnnals of the Institute of Statistical Mathematics 55 (4) 885 (2003)
https://doi.org/10.1007/BF02523399
One-sided variations on interval trees
Yoshiaki Itoh and Hosam M. MahmoudJournal of Applied Probability 40 (03) 654 (2003)
https://doi.org/10.1017/S0021900200019628
Distribution of distances in random binary search trees
Hosam M. Mahmoud and Ralph NeiningerThe Annals of Applied Probability 13 (1) (2003)
https://doi.org/10.1214/aoap/1042765668
Density approximation and exact simulation of random variables that are solutions of fixed-point equations
Luc Devroye and Ralph NeiningerAdvances in Applied Probability 34 (02) 441 (2002)
https://doi.org/10.1017/S0001867800011642
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
Hsien-Kuei Hwang and Ralph NeiningerSIAM 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 NeiningerAdvances in Applied Probability 34 (2) 441 (2002)
https://doi.org/10.1239/aap/1025131226
On binary search tree recursions with monomials as toll functions
Ralph NeiningerJournal of Computational and Applied Mathematics 142 (1) 185 (2002)
https://doi.org/10.1016/S0377-0427(01)00468-X
Approximating the limiting Quicksort distribution
James Allen Fill and Svante JansonRandom Structures & Algorithms 19 (3-4) 376 (2001)
https://doi.org/10.1002/rsa.10007
https://doi.org/10.1002/9781118032770.biblio
On the total time spent in records by a discrete uniform sequence
Rudolf Grübel and Anke ReimersJournal of Applied Probability 38 (03) 768 (2001)
https://doi.org/10.1017/S0021900200018921
On the total time spent in records by a discrete uniform sequence
Rudolf Grübel and Anke ReimersJournal of Applied Probability 38 (3) 768 (2001)
https://doi.org/10.1239/jap/1005091040
The contraction method for recursive algorithms
U. Rösler and L. RüschendorfAlgorithmica 29 (1-2) 3 (2001)
https://doi.org/10.1007/BF02679611
On the analysis of stochastic divide and conquer algorithms
U. RöslerAlgorithmica 29 (1-2) 238 (2001)
https://doi.org/10.1007/BF02679621
On the number of iterations required by Von Neumann addition
Rudolf Grübel and Anke ReimersRAIRO - Theoretical Informatics and Applications 35 (2) 187 (2001)
https://doi.org/10.1051/ita:2001115
Probabilistic and Statistical Methods in Computer Science
Jean-François Mari and René SchottProbabilistic and Statistical Methods in Computer Science 57 (2001)
https://doi.org/10.1007/978-1-4757-6280-8_3
Limit laws for partial match queries in quadtrees
Ralph Neininger and Ludger RüschendorfThe Annals of Applied Probability 11 (2) (2001)
https://doi.org/10.1214/aoap/1015345300
On a multivariate contraction method for random recursive structures with applications to Quicksort
Ralph NeiningerRandom Structures & Algorithms 19 (3-4) 498 (2001)
https://doi.org/10.1002/rsa.10010
Mathematics and Computer Science
James Allen Fill and Svante JansonMathematics and Computer Science 53 (2000)
https://doi.org/10.1007/978-3-0348-8405-1_5
Asymptotic distributions for partial match queries inK-d trees
Ralph NeiningerRandom Structures and Algorithms 17 (3-4) 403 (2000)
https://doi.org/10.1002/1098-2418(200010/12)17:3/4<403::AID-RSA11>3.0.CO;2-K
Mathematics and Computer Science
Jochen GeigerMathematics and Computer Science 245 (2000)
https://doi.org/10.1007/978-3-0348-8405-1_21
Limiting distributions for the costs of partial match retrievals in multidimensional tries
Werner SchachingerRandom Structures and Algorithms 17 (3-4) 428 (2000)
https://doi.org/10.1002/1098-2418(200010/12)17:3/4<428::AID-RSA12>3.0.CO;2-6
A Characterization of the Set of Fixed Points of the Quicksort Transformation
James Fill and Svante JansonElectronic Communications in Probability 5 (none) (2000)
https://doi.org/10.1214/ECP.v5-1021
Mathematics and Computer Science
F. M. Dekking, S. De Graaf and L. E. MeesterMathematics and Computer Science 31 (2000)
https://doi.org/10.1007/978-3-0348-8405-1_3
Perfect Simulation from the Quicksort Limit Distribution
Luc Devroye, James Fill and Ralph NeiningerElectronic Communications in Probability 5 (none) (2000)
https://doi.org/10.1214/ECP.v5-1024
On the internal path length ofd-dimensional quad trees
Ralph Neininger and Ludger R�schendorfRandom Structures and Algorithms 15 (1) 25 (1999)
https://doi.org/10.1002/(SICI)1098-2418(199908)15:1<25::AID-RSA2>3.0.CO;2-R
Randomization and Approximation Techniques in Computer Science
Charles Knessl and Wojciech SzpankowskiLecture Notes in Computer Science, Randomization and Approximation Techniques in Computer Science 1518 346 (1998)
https://doi.org/10.1007/3-540-49543-6_27
A note concerning the limit distribution of the quicksort algorithm
Michael CramerRAIRO - Theoretical Informatics and Applications 30 (3) 195 (1996)
https://doi.org/10.1051/ita/1996300301951
Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
Janice Lent and Hosam M. MahmoudStatistics & Probability Letters 28 (4) 299 (1996)
https://doi.org/10.1016/0167-7152(95)00139-5
Asymptotic distribution theory for Hoare's selection algorithm
Rudolf Grübel and Uwe RöslerAdvances in Applied Probability 28 (01) 252 (1996)
https://doi.org/10.1017/S000186780002735X
Asymptotic distribution theory for Hoare's selection algorithm
Rudolf Grübel and Uwe RöslerAdvances in Applied Probability 28 (1) 252 (1996)
https://doi.org/10.2307/1427920
Some properties of a limiting distribution in Quicksort
Kok Hooi Tan and Petros HadjicostasStatistics & Probability Letters 25 (1) 87 (1995)
https://doi.org/10.1016/0167-7152(94)00209-Q
Probability metrics and recursive algorithms
S. T. Rachev and L. RüschendorfAdvances in Applied Probability 27 (03) 770 (1995)
https://doi.org/10.1017/S0001867800027142
Analysis of quickselect : an algorithm for order statistics
Hosam M. Mahmoud, Reza Modarres and Robert T. SmytheRAIRO - Theoretical Informatics and Applications 29 (4) 255 (1995)
https://doi.org/10.1051/ita/1995290402551
Probability metrics and recursive algorithms
S. T. Rachev and L. RüschendorfAdvances in Applied Probability 27 (3) 770 (1995)
https://doi.org/10.2307/1428133
General combinatorial schemas: Gaussian limit distributions and exponential tails
Philippe Flajolet and Michèle SoriaDiscrete Mathematics 114 (1-3) 159 (1993)
https://doi.org/10.1016/0012-365X(93)90364-Y
A fixed point theorem for distributions
Uwe RöslerStochastic Processes and their Applications 42 (2) 195 (1992)
https://doi.org/10.1016/0304-4149(92)90035-O