swMATH21614MaRDI QIDQ33419FDOQ33419
Author name not available (Why is that?)
Official website: https://dl.acm.org/citation.cfm?id=362489
Cited In (only showing first 100 items - show all)
- Exponential bounds for the running time of a selection algorithm
- Selection from read-only memory and sorting with minimum data movement
- Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm
- On sorting, heaps, and minimum spanning trees
- Formal proof of a program: find
- Multiple Quickselect -- Hoare's Find algorithm for several elements
- Title not available (Why is that?)
- Moves and displacements of particular elements in quicksort
- Distributional analysis of swaps in quick select
- Axiomatic approach to total correctness of programs
- The analysis of Quicksort programs
- The Orc Programming Language
- Computing the Burrows-Wheeler transform in place and in small space
- A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks
- Fast parallel GPU-sorting using a hybrid algorithm
- An \(O(mn)\) algorithm for the anti-cent-dian problem
- Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme
- Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses
- A simple expected running time analysis for randomized ``divide and conquer algorithms
- Distributional convergence for the number of symbol comparisons used by QuickSort
- A calculus of refinements for program derivations
- Weighted median algorithms for \(L_ 1\) approximation
- The saga of minimum spanning trees
- Randomized algorithm for the sum selection problem
- On proving the termination of algorithms by machine
- Hierarchical development of programming languages
- A random algorithm for multiselection
- The use of Hoare's method of program verification for the Quicksort algorithm
- PARTITION
- FSDA
- GPU Quicksort
- GPUSort
- Analysis of multiple quickselect variants.
- Selection by distributive partitioning
- KDTREE
- GPU-ABiSort
- Quicksort
- QuickHeapsort
- mural
- C-HiLasso
- robcor
- MaLiJAn
- MoMQuickMergesort
- WikiSort
- MedianOfNinthers
- heapsort
- Automatic construction of test sets: Practical approach
- CodedSketch: A Coding Scheme for Distributed Computation of Approximated Matrix Multiplication
- An experiment in structured programming
- Time bounds for selection
- Algorithm 489
- Algorithm 347
- CodedSketch
- OverSketch
- Sorting numbers in linear expected time and optimal extra space
- The validity of return address schemes
- Space-efficient geometric divide-and-conquer algorithms
- Tardiness bounds under global EDF scheduling on a multiprocessor
- Reasoning about programs
- A logical basis for programming methodology
- Mixed Poisson approximation of node depth distributions in random binary search trees
- The analysis of range quickselect and related problems
- Automatic program verification. I: A logical basis and its implementation
- On quickselect, partial sorting and multiple Quickselect
- Distributional convergence for the number of symbol comparisons used by QuickSelect
- QuickHeapsort, an efficient mix of classical sorting algorithms
- On Floyd and Rivest's SELECT algorithm
- Analysis of the performance of the parallel quicksort method
- Selection by rank in K-dimensional binary search trees
- An efficient external sorting with minimal space requirement
- Discrete rigid registration: a local graph-search approach
- Probabilistic analysis of algorithms for the Dutch national flag problem
- linlearn
- Dörfler marking with minimal cardinality is a linear complexity problem
- On the median-of-k version of Hoare's selection algorithm
- Hierarchical compressed sensing
- Non-asymptotic distributional bounds for the Dickman approximation of the running time of the Quickselect algorithm
- The quicksort process
- On smoothed analysis of quicksort and Hoare's find
- Fast highly efficient and robust one-step \(M\)-estimators of scale based on \(Q_n\)
- Automatically splitting a two-stage lambda calculus
- Turing's 1949 paper in context
- Fast perfect simulation of Vervaat perpetuities
- Selection Algorithms with Small Groups
- Fifty years of Hoare's logic
- Near-optimal online multiselection in internal and external memory
- Performance estimation using symbolic data
- HIFIR: Hybrid Incomplete Factorization with Iterative Refinement for Preconditioning Ill-Conditioned and Singular Systems
- Computing and estimating the volume of the solution space of SMT(LA) constraints
- Sever
- Current methods for proving program correctness
- Finding a mediocre player
- EGC: entropy-based gradient compression for distributed deep learning
- HIFIR
- Range selection and predecessor queries in data aware space and time
- On compound statements in a conversational language
- On Smoothed Analysis of Quicksort and Hoare’s Find
- Hierarchical a posteriori error estimation of Bank-Weiser type in the FEniCS project
- QuickXsort: a fast sorting scheme in theory and practice
- The \(m\)-version of binary search trees: an average case analysis
This page was built for software: Find
