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