Selection via the bogo-method -- more on the analysis of perversely awful randomized algorithms

DOI10.4230/LIPICS.FUN.2018.23MaRDI QIDQ3301012zbMATHFDO

Authors Markus Holzer, Jan-Tobias Maurer

Publication date 11 August 2020

zbMATH Keywords

selectionbogo-methodcombinatorial sums and series

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Randomized algorithms (68W20) Analysis of algorithms (68W40) Searching and sorting (68P10)

Recommendations

• Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms
• scientific article; zbMATH DE number 1857638
• Randomized selection in \(n+C+o(n)\) comparisons
• Randomized algorithms and pseudorandom numbers
• A select and insert sorting algorithm

Cites work

• scientific article; zbMATH DE number 2186878 (Why is no real title available?)
• scientific article; zbMATH DE number 3747130 (Why is no real title available?)
• scientific article; zbMATH DE number 3443655 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• Interesting Series Involving the Central Binomial Coefficient
• Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms
• Sums of reciprocals of the central binomial coefficients

Cited in

(2)

• Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms
• scientific article; zbMATH DE number 1273640 (Why is no real title available?)

This page was built for publication: Selection via the bogo-method -- more on the analysis of perversely awful randomized algorithms

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