Quicksort
From MaRDI portal
Software:32511
No author found.
Related Items (only showing first 100 items - show all)
On the median-of-k version of Hoare's selection algorithm ⋮ Efficient Verified Implementation of Introsort and Pdqsort ⋮ Optimizing sorting algorithms by using sorting networks ⋮ Being and Change: Reasoning About Invariance ⋮ Fringe analysis for extquick: An in situ distributive external sorting algorithm ⋮ Range selection and predecessor queries in data aware space and time ⋮ On Smoothed Analysis of Quicksort and Hoare’s Find ⋮ Thin tails of fixed points of the nonhomogeneous smoothing transform ⋮ An improved master theorem for divide-and-conquer recurrences ⋮ Query-competitive sorting with uncertainty ⋮ Logarithmic integrals, zeta values, and tiered binomial coefficients ⋮ Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design ⋮ A minimal algorithm for the Bounded Knapsack Problem ⋮ On smoothed analysis of quicksort and Hoare's find ⋮ Unnamed Item ⋮ The quicksort process ⋮ Algorithms from THE BOOK ⋮ Limit distribution of the quartet balance index for Aldous’s $(\beta \ge 0)$-model ⋮ Halting time is predictable for large models: a universality property and average-case analysis ⋮ Implementation of samplesort: A minimal storage tree sort ⋮ Partial sorting: A large vector technique and its application ⋮ Unnamed Item ⋮ An intuitive and simple bounding argument for Quicksort ⋮ Local Intrinsic Dimension Estimation by Generalized Linear Modeling ⋮ Proving Quicksort Correct in Event-B ⋮ Data Clustering: Theory, Algorithms, and Applications, Second Edition ⋮ Faster suffix sorting ⋮ Asymptotic distributions for random median quicksort ⋮ An optimization algorithm for a penalized knapsack problem ⋮ Analysis of swaps in radix selection ⋮ Embedding small digraphs and permutations in binary trees and split trees ⋮ A limiting distribution for quicksort ⋮ The fluctuations of the giant cluster for percolation on random split trees ⋮ On martingale tail sums for the path length in random trees ⋮ An efficient algorithm for the collapsing knapsack problem ⋮ Applying Sorting Networks to Synthesize Optimized Sorting Libraries ⋮ A limit theorem for “quicksort” ⋮ Recursive samplesort ⋮ Fifty years of Hoare's logic ⋮ Verified analysis of random binary tree structures ⋮ QuickhullDisk: a faster convex hull algorithm for disks ⋮ Monte Carlo and Las Vegas randomized algorithms for systems and control. An introduction ⋮ On the complexity of project scheduling to minimize exposed time ⋮ Using nonlinear difference equations to study Quicksort algorithms ⋮ QuickXsort: a fast sorting scheme in theory and practice ⋮ Embedding small digraphs and permutations in binary trees and split trees ⋮ Unnamed Item ⋮ All solutions of the stochastic fixed point equation of the Quicksort process ⋮ Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths ⋮ The Orc Programming Language ⋮ Inversions in Split Trees and Conditional Galton–Watson Trees ⋮ A note concerning the limit distribution of the quicksort algorithm ⋮ A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq ⋮ On the total length of the random minimal directed spanning tree ⋮ Sorting Algorithms in MOQA ⋮ Refined quicksort asymptotics ⋮ Approximate calculation of Tukey's depth and median with high-dimensional data ⋮ Combinatorial analysis of quicksort algorithm ⋮ Probabilistic analysis of algorithms for the Dutch national flag problem ⋮ In-Place Parallel Super Scalar Samplesort (IPSSSSo) ⋮ An efficient external sorting with minimal space requirement ⋮ On Floyd and Rivest's SELECT algorithm ⋮ A simple expected running time analysis for randomized ``divide and conquer algorithms ⋮ The parallel quicksort algorithm part i–run time analysis ⋮ A note on the quicksort asymptotics ⋮ Limit distribution of the coefficients of polynomials with only unit roots ⋮ Executable rewriting logic semantics of Orc and formal analysis of Orc programs ⋮ Proof pearl: The KeY to correct and stable sorting ⋮ A one-way, stackless quicksort algorithm ⋮ Towards a realistic analysis of the QuickSelect algorithm ⋮ A study on interleaving versus segmentation ⋮ The impact of random initialization on the runtime of randomized search heuristics ⋮ A generalized, one-way, stackless quicksort ⋮ Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme ⋮ A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries ⋮ On quickselect, partial sorting and multiple Quickselect ⋮ New method in information processing for maintaining an efficient dynamic ordered set ⋮ Optimal full ranking from pairwise comparisons ⋮ Volumetric geometry for DSMC and the Voldipar code ⋮ A VLSI partition algorithm ⋮ An efficient implementation of the Min-Min heuristic ⋮ Efficient sample sort and the average case analysis of PEsort ⋮ Some properties of a limiting distribution in Quicksort ⋮ GPU computing of compressible flow problems by a meshless method with space-filling curves ⋮ A fast algorithm for two-dimensional Kolmogorov-Smirnov two sample tests ⋮ Comments on a paper by Neuhold and Studer ⋮ Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge ⋮ Average-case analysis of multiple Quickselect: An algorithm for finding order statistics ⋮ On a reciprocity law for finite multiple zeta values ⋮ A minimal algorithm for the multiple-choice knapsack problem ⋮ The weak-heap data structure: variants and applications ⋮ Second phase changes in random \(m\)-ary search trees and generalized quicksort: Convergence rates ⋮ An efficient threshold dynamics method for wetting on rough surfaces ⋮ Analysis of multiple quickselect variants. ⋮ Experiments in program verification using Event-B ⋮ Robust classification via MOM minimization ⋮ Fast neighbor lists for adaptive-resolution particle simulations ⋮ Distributional convergence for the number of symbol comparisons used by QuickSort ⋮ Fast parallel GPU-sorting using a hybrid algorithm ⋮ An algorithm for the solution of the 0-1 knapsack problem
This page was built for software: Quicksort
