The following pages link to Quicksort (Q32511):
Displaying 50 items.
- Fifty years of Hoare's logic (Q2280214) (← links)
- QuickhullDisk: a faster convex hull algorithm for disks (Q2286150) (← links)
- QuickXsort: a fast sorting scheme in theory and practice (Q2292860) (← links)
- Embedding small digraphs and permutations in binary trees and split trees (Q2292861) (← links)
- Executable rewriting logic semantics of Orc and formal analysis of Orc programs (Q2348797) (← links)
- Proof pearl: The KeY to correct and stable sorting (Q2351413) (← links)
- Range selection and predecessor queries in data aware space and time (Q2397147) (← links)
- Thin tails of fixed points of the nonhomogeneous smoothing transform (Q2402433) (← links)
- On smoothed analysis of quicksort and Hoare's find (Q2428694) (← links)
- The quicksort process (Q2434753) (← links)
- An intuitive and simple bounding argument for Quicksort (Q2445402) (← links)
- Faster suffix sorting (Q2465058) (← links)
- Asymptotic distributions for random median quicksort (Q2466023) (← links)
- An optimization algorithm for a penalized knapsack problem (Q2466588) (← links)
- An efficient algorithm for the collapsing knapsack problem (Q2489216) (← links)
- Monte Carlo and Las Vegas randomized algorithms for systems and control. An introduction (Q2512100) (← links)
- On the complexity of project scheduling to minimize exposed time (Q2514874) (← links)
- Probabilistic analysis of algorithms for the Dutch national flag problem (Q2566022) (← links)
- On Floyd and Rivest's SELECT algorithm (Q2576874) (← links)
- A simple expected running time analysis for randomized ``divide and conquer'' algorithms (Q2581554) (← links)
- Optimizing sorting algorithms by using sorting networks (Q2628305) (← links)
- Fringe analysis for extquick: An in situ distributive external sorting algorithm (Q2639632) (← links)
- Query-competitive sorting with uncertainty (Q2663045) (← links)
- Logarithmic integrals, zeta values, and tiered binomial coefficients (Q2664019) (← links)
- Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design (Q2672280) (← links)
- Halting time is predictable for large models: a universality property and average-case analysis (Q2697399) (← links)
- Proving Quicksort Correct in Event-B (Q2994490) (← links)
- Analysis of swaps in radix selection (Q3021249) (← links)
- Being and Change: Reasoning About Invariance (Q3449632) (← links)
- The Orc Programming Language (Q3634722) (← links)
- A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq (Q3638257) (← links)
- A limiting distribution for quicksort (Q3833634) (← links)
- The parallel quicksort algorithm part i–run time analysis (Q3949977) (← links)
- Implementation of samplesort: A minimal storage tree sort (Q4055240) (← links)
- Recursive samplesort (Q4155827) (← links)
- Combinatorial analysis of quicksort algorithm (Q4203824) (← links)
- On the median-of-k version of Hoare's selection algorithm (Q4265537) (← links)
- An improved master theorem for divide-and-conquer recurrences (Q4571976) (← links)
- A note concerning the limit distribution of the quicksort algorithm (Q4717040) (← links)
- An efficient external sorting with minimal space requirement (Q4747522) (← links)
- Using nonlinear difference equations to study Quicksort algorithms (Q4960142) (← links)
- Sorting Algorithms in MOQA (Q4982076) (← links)
- Refined quicksort asymptotics (Q4982619) (← links)
- Approximate calculation of Tukey's depth and median with high-dimensional data (Q4987798) (← links)
- Embedding small digraphs and permutations in binary trees and split trees (Q4993531) (← links)
- (Q5009630) (← links)
- (Q5020652) (← links)
- Efficient Verified Implementation of Introsort and Pdqsort (Q5049010) (← links)
- The fluctuations of the giant cluster for percolation on random split trees (Q5093986) (← links)
- A minimal algorithm for the Bounded Knapsack Problem (Q5101408) (← links)
