arXiv Analytics

Sign in

arXiv:math/0312437 [math.PR]AbstractReferencesReviewsResources

Quicksort with unreliable comparisons: a probabilistic analysis

L. Alonso, P. Chassaing, F. Gillet, S. Janson, E. M. Reingold, R. Schott

Published 2003-12-24Version 1

We provide a probabilistic analysis of the output of Quicksort when comparisons can err.

Comments: 29 pages, 3 figures
Categories: math.PR
Subjects: 60F05, 68P10, 68M15
Related articles: Most relevant | Search more
arXiv:1409.4955 [math.PR] (Published 2014-09-17)
Probabilistic analysis of the (1+1)-evolutionary algorithm
arXiv:math/0405322 [math.PR] (Published 2004-05-17)
Probabilistic Analysis for Randomized Game Tree Evaluation
arXiv:math/0412188 [math.PR] (Published 2004-12-09, updated 2006-02-24)
A probabilistic analysis of some tree algorithms

Links

Toolbox