Quicksort

MaRDI QIDQ32511swMATHFDO

Official website https://en.wikipedia.org/wiki/Quicksort

Described by source

• On the adaptiveness of Quicksort
• Proof of a recursive program: Quicksort
• Quicksort

Cited in

(only showing first 100 items - show all)

• The price of resiliency: a case study on sorting with memory faults
• Moves and displacements of particular elements in quicksort
• Quicksort algorithm: application of a fixed point theorem in intuitionistic fuzzy quasi-metric spaces at a domain of words
• A note on iterative marginal optimization: a simple algorithm for maximum rank correlation estimation
• Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm
• Sorting in linear expected time
• Analysis of the performance of the parallel quicksort method
• A one-way, stackless quicksort algorithm
• A generalized, one-way, stackless quicksort
• A VLSI partition algorithm
• Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge
• An algorithm for the solution of the 0-1 knapsack problem
• Usort: An efficient hybrid of distributive partitioning sorting
• Sorting numbers in linear expected time and optimal extra space
• Sorting a linked list with equal keys
• A note on dominance relation in unbounded knapsack problems
• Height balance distribution of search trees
• A fixed point theorem for distributions
• The analysis of Quicksort programs
• Sortieren bei virtuellem Speicher
• An augmenting path method for solving linear bottleneck assignment problems
• Sorting by distributive partitioning
• Insertion merge sorting
• An augmenting path method for solving linear bottleneck transportation problems
• Divide and conquer for linear expected time
• Grail
• The analysis of heuristics for search trees
• CONFID
• A minimal algorithm for the multiple-choice knapsack problem
• Second phase changes in random \(m\)-ary search trees and generalized quicksort: Convergence rates
• Analysis of multiple quickselect variants.
• Re-describing an algorithm by Hopcroft
• An algorithm for \(\ell^\infty\) regression with quadratic complexity
• QuickHeapsort, an efficient mix of classical sorting algorithms
• Volumetric geometry for DSMC and the Voldipar code
• A fast algorithm for two-dimensional Kolmogorov-Smirnov two sample tests
• PARTITION
• Knapsack
• An efficient threshold dynamics method for wetting on rough surfaces
• Convex-hull algorithms: implementation, testing, and experimentation
• Verifying OpenJDK's sort method for generic collections
• Cost-sensitive active learning with a label uniform distribution model
• Integrating Pareto optimization into dynamic programming
• Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem
• Mixed Poisson approximation of node depth distributions in random binary search trees
• On weighted depths in random binary search trees
• Computing with pipelined block transfer
• New applications of random sampling in computational geometry
• MahonianStat
• Linear sorting with O(log n) processors
• Asymptotic analysis of an optimized quicksort algorithm.
• Reporting intersections among thick objects.
• MCSTL
• RACT
• BPEL2oWFN
• Some properties of a limiting distribution in Quicksort
• Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
• The weak-heap data structure: variants and applications
• Orc
• Fast neighbor lists for adaptive-resolution particle simulations
• Distributional convergence for the number of symbol comparisons used by QuickSort
• Preference-based learning to rank
• HISTABRUT
• VTune
• On resampling schemes for particle filters with weakly informative observations
• A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries
• Optimal full ranking from pairwise comparisons
• Sparkle
• EditorArrow
• Robust classification via MOM minimization
• Time adaptive conservative finite volume method
• Milestones from the Pure Lisp Theorem Prover to ACL2
• Fifty years of Hoare's logic
• QuickhullDisk: a faster convex hull algorithm for disks
• QuickXsort: a fast sorting scheme in theory and practice
• Embedding small digraphs and permutations in binary trees and split trees
• 2D triangulations
• EKHAD
• Executable rewriting logic semantics of Orc and formal analysis of Orc programs
• Proof pearl: The KeY to correct and stable sorting
• SMCper
• FSDA
• CMU Benchmarks
• Range selection and predecessor queries in data aware space and time
• Thin tails of fixed points of the nonhomogeneous smoothing transform
• On smoothed analysis of quicksort and Hoare's find
• The quicksort process
• An intuitive and simple bounding argument for Quicksort
• GPU Quicksort
• Faster suffix sorting
• Asymptotic distributions for random median quicksort
• An optimization algorithm for a penalized knapsack problem
• An efficient algorithm for the collapsing knapsack problem
• Monte Carlo and Las Vegas randomized algorithms for systems and control. An introduction
• On the complexity of project scheduling to minimize exposed time
• SynchAADL2Maude
• Snugglebug
• Probabilistic analysis of algorithms for the Dutch national flag problem
• On Floyd and Rivest's SELECT algorithm
• A simple expected running time analysis for randomized ``divide and conquer algorithms

This page was built for software: Quicksort