Pages that link to "Item:Q1225454"
From MaRDI portal
The following pages link to The analysis of Quicksort programs (Q1225454):
Displaying 27 items.
- Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm (Q261384) (← links)
- The impact of random initialization on the runtime of randomized search heuristics (Q306492) (← links)
- Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme (Q308946) (← links)
- BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small) (Q688722) (← links)
- Sorting numbers in linear expected time and optimal extra space (Q1167543) (← links)
- Sorting a linked list with equal keys (Q1171387) (← links)
- A fixed point theorem for distributions (Q1194594) (← links)
- Sorting by distributive partitioning (Q1244813) (← links)
- Some properties of a limiting distribution in Quicksort (Q1907894) (← links)
- A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries (Q2143136) (← links)
- QuickXsort: a fast sorting scheme in theory and practice (Q2292860) (← links)
- Asymptotic distributions for random median quicksort (Q2466023) (← links)
- Optimizing sorting algorithms by using sorting networks (Q2628305) (← links)
- On a multivariate contraction method for random recursive structures with applications to quicksort (Q2772929) (← links)
- Analysis of swaps in radix selection (Q3021249) (← links)
- Parallel distributive partitioned sorting methods (Q3318123) (← links)
- Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise (Q3599150) (← links)
- A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq (Q3638257) (← links)
- A limiting distribution for quicksort (Q3833634) (← links)
- BlockQuicksort (Q4629535) (← links)
- An efficient external sorting with minimal space requirement (Q4747522) (← links)
- Analysis of quickselect : an algorithm for order statistics (Q4858843) (← links)
- On Smoothed Analysis of Quicksort and Hoare’s Find (Q5323060) (← links)
- Applying Sorting Networks to Synthesize Optimized Sorting Libraries (Q5743589) (← links)
- A limit theorem for “quicksort” (Q5750394) (← links)
- Verified analysis of random binary tree structures (Q5919010) (← links)
- Optimal subsampling for the Cox proportional hazards model with massive survival data (Q6541937) (← links)
