Randomized Quicksort and the entropy of the random source

DOI10.1007/11533719_46MaRDI QIDQ5716964zbMATH OpenOpenAlexFDO

Authors Beatrice List, Markus Maucher, Rainer Schuler, Uwe Schöning

Publication date 11 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11533719, https://drops.dagstuhl.de/opus/volltexte/2005/104/

zbMATH Keywords

EntropyQuickSortRandomized Algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Randomized algorithms (68W20)

Recommendations

• scientific article; zbMATH DE number 5568413
• Revisiting calculation of moments of number of comparisons used by the randomized quick sort algorithm
• Large Deviations for Quicksort
• A note concerning the limit distribution of the quicksort algorithm
• A note on the Quicksort asymptotics
• Quicksort asymptotics
• Approximating the limiting quicksort distribution
• Refined quicksort asymptotics
• Entropy, Randomization, Derandomization, and Discrepancy

Cited in

(3)

• Revisiting calculation of moments of number of comparisons used by the randomized quick sort algorithm
• scientific article; zbMATH DE number 5568413 (Why is no real title available?)
• The entropy of backwards analysis

This page was built for publication: Randomized Quicksort and the entropy of the random source

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716964)