The analysis of Quicksort programs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3471564 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3584897 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- scientific article; zbMATH DE number 3388535 (Why is no real title available?)
- Implementing Quicksort programs
- Increasing the efficiency of quicksort
- Quicksort
- Quicksort with Equal Keys
- Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
- Some Theorems on Sorting
- Sorting in a paging environment
Cited in
(31)- Sorting numbers in linear expected time and optimal extra space
- Sorting a linked list with equal keys
- A fixed point theorem for distributions
- Sorting by distributive partitioning
- Some properties of a limiting distribution in Quicksort
- A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries
- QuickXsort: a fast sorting scheme in theory and practice
- Asymptotic distributions for random median quicksort
- Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm
- Optimizing sorting algorithms by using sorting networks
- On a multivariate contraction method for random recursive structures with applications to quicksort
- Analysis of swaps in radix selection
- The impact of random initialization on the runtime of randomized search heuristics
- Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme
- Parallel distributive partitioned sorting methods
- Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise
- A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq
- A limiting distribution for quicksort
- QuickSort Cost
- BlockQuicksort: avoiding branch mispredictions in Quicksort
- An efficient external sorting with minimal space requirement
- Analysis of quickselect : an algorithm for order statistics
- On Smoothed Analysis of Quicksort and Hoare’s Find
- Applying sorting networks to synthesize optimized sorting libraries
- A limit theorem for “quicksort”
- Verified analysis of random binary tree structures
- Optimal subsampling for the Cox proportional hazards model with massive survival data
- On the (k, r)-Quicksort on the fly process
- BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)
- Tony Hoare: his path to the ACM Turing Award
- Polynomials that encode depth and node information for the binary trees created by QuickSort
This page was built for publication: The analysis of Quicksort programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1225454)
