Quicksort
From MaRDI portal
Cited in
(only showing first 100 items - show all)- An optimization algorithm for a penalized knapsack problem
- An efficient external sorting with minimal space requirement
- Computing inversion pair cardinality through partition-based sorting
- Probabilistic analysis of algorithms for the Dutch national flag problem
- On the total length of the random minimal directed spanning tree
- Sortieren bei virtuellem Speicher
- A minimal algorithm for the bounded knapsack problem
- A note on the Quicksort asymptotics
- Limit distribution of the coefficients of polynomials with only unit roots
- The total path length of split trees
- Cost-sensitive active learning with a label uniform distribution model
- Verifying OpenJDK's sort method for generic collections
- Permutations in binary trees and split trees
- Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm
- A language for generic programming in the large
- Second phase changes in random \(m\)-ary search trees and generalized quicksort: Convergence rates
- QuickhullDisk: a faster convex hull algorithm for disks
- On the median-of-k version of Hoare's selection algorithm
- Using nonlinear difference equations to study Quicksort algorithms
- Sorting a linked list with equal keys
- Weighted height of random trees
- BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)
- The quicksort process
- A fixed point theorem for distributions
- Local polynomial Fourier transform: a review on recent developments and applications
- Dual-pivot quicksort: optimality, analysis and zeros of associated lattice paths
- A VLSI partition algorithm
- A note on dominance relation in unbounded knapsack problems
- An efficient algorithm for the collapsing knapsack problem
- Height balance distribution of search trees
- A limit theorem for “quicksort”
- On smoothed analysis of quicksort and Hoare's find
- New method in information processing for maintaining an efficient dynamic ordered set
- Quicksort algorithm: application of a fixed point theorem in intuitionistic fuzzy quasi-metric spaces at a domain of words
- Proof pearl: The KeY to correct and stable sorting
- scientific article; zbMATH DE number 7453193 (Why is no real title available?)
- Distributional analysis of swaps in quick select
- Moves and displacements of particular elements in quicksort
- Uniform distribution modulo one and binary search trees
- The analysis of Quicksort programs
- Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge
- Fifty years of Hoare's logic
- Some properties of a limiting distribution in Quicksort
- On the complexity of project scheduling to minimize exposed time
- Towards a realistic analysis of the QuickSelect algorithm
- Experiments in program verification using Event-B
- Fast parallel GPU-sorting using a hybrid algorithm
- Implementation of samplesort: A minimal storage tree sort
- The Orc Programming Language
- An algorithm for \(\ell^\infty\) regression with quadratic complexity
- Algorithms from THE BOOK
- Efficient sample sort and the average case analysis of PEsort
- Local intrinsic dimension estimation by generalized linear modeling
- A study on interleaving versus segmentation
- Limit distribution of the quartet balance index for Aldous's \((\beta \ge 0)\)-model
- Asymptotic distributions for random median quicksort
- A note concerning the limit distribution of the quicksort algorithm
- 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
- The weak-heap data structure: variants and applications
- Comments on a paper by Neuhold and Studer
- Volumetric geometry for DSMC and the Voldipar code
- New applications of random sampling in computational geometry
- A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries
- Smoothed and average-case approximation ratios of mechanisms: beyond the worst-case analysis
- Partial sorting: A large vector technique and its application
- An intuitive and simple bounding argument for Quicksort
- Re-describing an algorithm by Hopcroft
- Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
- Distributional convergence for the number of symbol comparisons used by QuickSort
- Logarithmic integrals, zeta values, and tiered binomial coefficients
- A simple expected running time analysis for randomized ``divide and conquer algorithms
- Data clustering. Theory, algorithms, and applications
- On a reciprocity law for finite multiple zeta values
- Analysis of swaps in radix selection
- Stable in situ sorting and minimum data movement
- Sorting by distributive partitioning
- Divide and conquer for linear expected time
- Approximate calculation of Tukey's depth and median with high-dimensional data
- The saga of minimum spanning trees
- Cooperative and geometric learning algorithm (CGLA) for path planning of UAVs with limited information
- Grail
- CONFID
- PARTITION
- Knapsack
- MahonianStat
- MCSTL
- BPEL2oWFN
- RACT
- Orc
- HISTABRUT
- VTune
- EditorArrow
- Sparkle
- 2D triangulations
- EKHAD
- FSDA
- SMCper
- CMU Benchmarks
- GPU Quicksort
This page was built for software: Quicksort
