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:
P. Hennequin
RAIRO-Theor. Inf. Appl., 23 3 (1989) 317-333
Published online: 2017-02-01
This article has been cited by the following article(s):
35 articles
Hybrid Movie Recommendation Based On Recent User Sequential Preferences and Sequential Profiles Using HMMs
J. Chiasseup Keudjeu, O. Kengni Ngangmo, Sylvain Iloga and T. Bouetou Bouetou IEEE Access 13 192330 (2025) https://doi.org/10.1109/ACCESS.2025.3630634
EC-MASS: Towards an efficient edge computing-based multi-video scheduling system
Shu Yang, Qingzhen Dong, Laizhong Cui, Xun Chen, Siyu Lei, Yulei Wu and Chengwen Luo Computer Communications 193 355 (2022) https://doi.org/10.1016/j.comcom.2022.07.002
QuickXsort: A Fast Sorting Scheme in Theory and Practice
Stefan Edelkamp, Armin Weiß and Sebastian Wild Algorithmica 82 (3) 509 (2020) https://doi.org/10.1007/s00453-019-00634-0
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
Arbres pour l’Algorithmique
Brigitte Chauvin, Julien Clément and Danièle Gardy Mathématiques et Applications, Arbres pour l’Algorithmique 83 61 (2018) https://doi.org/10.1007/978-3-319-93725-0_3
Analysis of Quickselect Under Yaroslavskiy’s Dual-Pivoting Algorithm
Sebastian Wild, Markus E. Nebel and Hosam Mahmoud Algorithmica 74 (1) 485 (2016) https://doi.org/10.1007/s00453-014-9953-x
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
(2014) https://doi.org/10.1002/9781118445112.stat00449
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
Algorithms – ESA 2012
Sebastian Wild and Markus E. Nebel Lecture Notes in Computer Science, Algorithms – ESA 2012 7501 825 (2012) https://doi.org/10.1007/978-3-642-33090-2_71
(2005) https://doi.org/10.1002/0471667196.ess1142.pub2
(2004) https://doi.org/10.1002/0471667196.ess1142
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) https://doi.org/10.1214/aop/1048516530
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) https://doi.org/10.1016/S0196-6774(02)00208-0
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
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
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
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
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
Phase changes in random m‐ary search trees and generalized quicksort
Hua‐Huai Chern and Hsien‐Kuei Hwang Random Structures & Algorithms 19 (3-4) 316 (2001) https://doi.org/10.1002/rsa.10005
520 (2001) https://doi.org/10.1002/9781118032770.biblio
On the analysis of stochastic divide and conquer algorithms
U. Rösler Algorithmica 29 (1-2) 238 (2001) https://doi.org/10.1007/BF02679621
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) https://doi.org/10.1007/BF02679613
373 (2000) https://doi.org/10.1002/9781118032886.biblio
Mathematics and Computer Science
James Allen Fill and Svante Janson Mathematics and Computer Science 53 (2000) https://doi.org/10.1007/978-3-0348-8405-1_5
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
A note concerning the limit distribution of the quicksort algorithm
Michael Cramer RAIRO - 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. Mahmoud Statistics & Probability Letters 28 (4) 299 (1996) https://doi.org/10.1016/0167-7152(95)00139-5
Some properties of a limiting distribution in Quicksort
Kok Hooi Tan and Petros Hadjicostas Statistics & Probability Letters 25 (1) 87 (1995) https://doi.org/10.1016/0167-7152(94)00209-Q
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
General combinatorial schemas: Gaussian limit distributions and exponential tails
Philippe Flajolet and Michèle Soria Discrete Mathematics 114 (1-3) 159 (1993) https://doi.org/10.1016/0012-365X(93)90364-Y
CAAP '92
François Bergeron, Philippe Flajolet and Bruno Salvy Lecture Notes in Computer Science, CAAP '92 581 24 (1992) https://doi.org/10.1007/3-540-55251-0_2
Automatic average-case analysis of algorithms
Philippe Flajolet, Bruno Salvy and Paul Zimmermann Theoretical Computer Science 79 (1) 37 (1991) https://doi.org/10.1016/0304-3975(91)90145-R
A limit theorem for “quicksort”
Uwe Rösler RAIRO - Theoretical Informatics and Applications 25 (1) 85 (1991) https://doi.org/10.1051/ita/1991250100851