Last update: Sat Oct 14 02:35:45 MDT 2017
@Article{McDiarmid:1996:LDQ,
author = "C. J. H. McDiarmid and R. B. Hayward",
title = "Large Deviations for {Quicksort}",
journal = j-J-ALG,
volume = "21",
number = "3",
pages = "476--507",
month = nov,
year = "1996",
CODEN = "JOALDV",
DOI = "https://doi.org/10.1006/jagm.1996.0055",
ISSN = "0196-6774 (print), 1090-2678 (electronic)",
ISSN-L = "0196-6774",
bibdate = "Tue Dec 11 09:16:22 MST 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jalg.bib",
note = "For other Quicksort bounds, see
\cite{Eddy:1995:HMC,Fill:2002:QA,Neininger:2002:RCQ}.",
URL = "http://www.sciencedirect.com/science/article/pii/S0196677496900553",
acknowledgement = ack-nhfb,
fjournal = "Journal of Algorithms",
journal-URL = "http://www.sciencedirect.com/science/journal/01966774",
remark = "The authors address how far the average number of
comparison in Quicksort can deviate from the mean with
random keys.",
}