The following pages link to Quicksort (Q32511):
Displayed 50 items.
- Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm (Q261384) (← links)
- Towards a realistic analysis of the QuickSelect algorithm (Q290901) (← links)
- A study on interleaving versus segmentation (Q293277) (← links)
- The impact of random initialization on the runtime of randomized search heuristics (Q306492) (← links)
- Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme (Q308946) (← links)
- An efficient implementation of the Min-Min heuristic (Q336601) (← links)
- GPU computing of compressible flow problems by a meshless method with space-filling curves (Q348900) (← links)
- Experiments in program verification using Event-B (Q432154) (← links)
- Fast parallel GPU-sorting using a hybrid algorithm (Q436896) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Cooperative and geometric learning algorithm (CGLA) for path planning of UAVs with limited information (Q462353) (← links)
- Classification of time series by shapelet transformation (Q468669) (← links)
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons (Q476439) (← links)
- Algorithms for the minimum diameter terminal Steiner tree problem (Q489734) (← links)
- Exact algorithms for the solution of the grey pattern quadratic assignment problem (Q494699) (← links)
- A social learning particle swarm optimization algorithm for scalable optimization (Q508791) (← links)
- Engineering parallel string sorting (Q513306) (← links)
- A language for generic programming in the large (Q532409) (← links)
- Local polynomial Fourier transform: a review on recent developments and applications (Q548849) (← links)
- Uniform distribution modulo one and binary search trees (Q558117) (← links)
- Comments on a paper by Neuhold and Studer (Q598797) (← links)
- On a reciprocity law for finite multiple zeta values (Q606422) (← links)
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable (Q645559) (← links)
- The analysis of range quickselect and related problems (Q650886) (← links)
- Using synthetic perturbations and statistical screening to assay shared-memory programs (Q673609) (← links)
- Stories about groups and sequences (Q677164) (← links)
- BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small) (Q688722) (← links)
- The total path length of split trees (Q691101) (← links)
- A space efficient distributive sort (Q758207) (← links)
- Statistical analysis of steady-state simulations: Survey of recent progress (Q759472) (← links)
- Efficient sorting during repetitive statistical computations: Algorithms and an application (Q804105) (← links)
- On quickselect, partial sorting and multiple Quickselect (Q845716) (← links)
- New method in information processing for maintaining an efficient dynamic ordered set (Q848256) (← links)
- Efficient sample sort and the average case analysis of PEsort (Q861251) (← links)
- Stable in situ sorting and minimum data movement (Q911311) (← links)
- Qos-aware service evaluation and selection (Q932236) (← links)
- Weighted height of random trees (Q934911) (← links)
- Computing inversion pair cardinality through partition-based sorting (Q956693) (← links)
- Distributional analysis of swaps in quick select (Q964394) (← links)
- Improving multikey Quicksort for sorting strings with many equal elements (Q987791) (← links)
- The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance (Q997423) (← links)
- The price of resiliency: a case study on sorting with memory faults (Q1016529) (← links)
- Moves and displacements of particular elements in quicksort (Q1019745) (← links)
- Quicksort algorithm: application of a fixed point theorem in intuitionistic fuzzy quasi-metric spaces at a domain of words (Q1019790) (← links)
- A note on iterative marginal optimization: a simple algorithm for maximum rank correlation estimation (Q1019910) (← links)
- Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm (Q1040789) (← links)
- Sorting in linear expected time (Q1064785) (← links)
- Analysis of the performance of the parallel quicksort method (Q1070824) (← links)
- A one-way, stackless quicksort algorithm (Q1082079) (← links)
- A generalized, one-way, stackless quicksort (Q1094881) (← links)