Quicksort
From MaRDI portal
Software:32511
swMATH20694MaRDI QIDQ32511FDOQ32511
Author name not available (Why is that?)
Cited In (only showing first 100 items - show all)
- On the total length of the random minimal directed spanning tree
- The total path length of split trees
- Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm
- A language for generic programming in the large
- QuickhullDisk: a faster convex hull algorithm for disks
- Weighted height of random trees
- BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)
- A fixed point theorem for distributions
- Local polynomial Fourier transform: a review on recent developments and applications
- A limit theorem for “quicksort”
- Quicksort algorithm: application of a fixed point theorem in intuitionistic fuzzy quasi-metric spaces at a domain of words
- Moves and displacements of particular elements in quicksort
- Distributional analysis of swaps in quick select
- Uniform distribution modulo one and binary search trees
- The analysis of Quicksort programs
- Some properties of a limiting distribution in Quicksort
- The Orc Programming Language
- Towards a realistic analysis of the QuickSelect algorithm
- Experiments in program verification using Event-B
- Fast parallel GPU-sorting using a hybrid algorithm
- A study on interleaving versus segmentation
- The weak-heap data structure: variants and applications
- 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
- Comments on a paper by Neuhold and Studer
- New applications of random sampling in computational geometry
- Re-describing an algorithm by Hopcroft
- Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
- A simple expected running time analysis for randomized ``divide and conquer algorithms
- Distributional convergence for the number of symbol comparisons used by QuickSort
- On a reciprocity law for finite multiple zeta values
- Stable in situ sorting and minimum data movement
- Sorting by distributive partitioning
- Divide and conquer for linear expected time
- The saga of minimum spanning trees
- Cooperative and geometric learning algorithm (CGLA) for path planning of UAVs with limited information
- Fast neighbor lists for adaptive-resolution particle simulations
- The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance
- A minimal algorithm for the multiple-choice knapsack problem
- An efficient implementation of the Min-Min heuristic
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons
- Faster suffix sorting
- Improving multikey Quicksort for sorting strings with many equal elements
- A limiting distribution for quicksort
- GPU computing of compressible flow problems by a meshless method with space-filling curves
- Asymptotic analysis of an optimized quicksort algorithm.
- Applying Sorting Networks to Synthesize Optimized Sorting Libraries
- Algorithms for the minimum diameter terminal Steiner tree problem
- A note on iterative marginal optimization: a simple algorithm for maximum rank correlation estimation
- Classification of time series by shapelet transformation
- Exact algorithms for the solution of the grey pattern quadratic assignment problem
- Mixed Poisson approximation of node depth distributions in random binary search trees
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable
- Optimal full ranking from pairwise comparisons
- Optimizing sorting algorithms by using sorting networks
- The analysis of range quickselect and related problems
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
- An algorithm for the solution of the 0-1 knapsack problem
- On quickselect, partial sorting and multiple Quickselect
- A social learning particle swarm optimization algorithm for scalable optimization
- Engineering parallel string sorting
- Combinatorial analysis of quicksort algorithm
- QuickHeapsort, an efficient mix of classical sorting algorithms
- On Floyd and Rivest's SELECT algorithm
- Monte Carlo and Las Vegas randomized algorithms for systems and control. An introduction
- An augmenting path method for solving linear bottleneck assignment problems
- The price of resiliency: a case study on sorting with memory faults
- An efficient external sorting with minimal space requirement
- Using synthetic perturbations and statistical screening to assay shared-memory programs
- Stories about groups and sequences
- An optimization algorithm for a penalized knapsack problem
- Computing inversion pair cardinality through partition-based sorting
- Sortieren bei virtuellem Speicher
- Cost-sensitive active learning with a label uniform distribution model
- Verifying OpenJDK's sort method for generic collections
- On the median-of-k version of Hoare's selection algorithm
- Second phase changes in random \(m\)-ary search trees and generalized quicksort: Convergence rates
- Sorting a linked list with equal keys
- The quicksort process
- Embedding small digraphs and permutations in binary trees and split trees
- An efficient algorithm for the collapsing knapsack problem
- A VLSI partition algorithm
- A note on dominance relation in unbounded knapsack problems
- Height balance distribution of search trees
- New method in information processing for maintaining an efficient dynamic ordered set
- Proof pearl: The KeY to correct and stable sorting
- Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge
- An algorithm for \(\ell^\infty\) regression with quadratic complexity
- Efficient sample sort and the average case analysis of PEsort
- Sorting Algorithms in MOQA
- A note concerning the limit distribution of the quicksort algorithm
- Volumetric geometry for DSMC and the Voldipar code
- An intuitive and simple bounding argument for Quicksort
- Approximate calculation of Tukey's depth and median with high-dimensional data
- Query-competitive sorting with uncertainty
- The parallel quicksort algorithm part i–run time analysis
- A fast algorithm for two-dimensional Kolmogorov-Smirnov two sample tests
- Insertion merge sorting
- A space efficient distributive sort
- Statistical analysis of steady-state simulations: Survey of recent progress
This page was built for software: Quicksort