Find

swMATH21614MaRDI QIDQ33419

No author found.

Related Items (85)

HIFIR: Hybrid Incomplete Factorization with Iterative Refinement for Preconditioning Ill-Conditioned and Singular Systems ⋮ Fast highly efficient and robust one-step \(M\)-estimators of scale based on \(Q_n\) ⋮ A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks ⋮ On the median-of-k version of Hoare's selection algorithm ⋮ On proving the termination of algorithms by machine ⋮ Unnamed Item ⋮ Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme ⋮ On quickselect, partial sorting and multiple Quickselect ⋮ Near-optimal online multiselection in internal and external memory ⋮ Fringe analysis for extquick: An in situ distributive external sorting algorithm ⋮ Formal proof of a program: find ⋮ Automatic construction of test sets: Practical approach ⋮ A calculus of refinements for program derivations ⋮ An \(O(mn)\) algorithm for the anti-cent-dian problem ⋮ Range selection and predecessor queries in data aware space and time ⋮ Computing and estimating the volume of the solution space of SMT(LA) constraints ⋮ On Smoothed Analysis of Quicksort and Hoare’s Find ⋮ Fast perfect simulation of Vervaat perpetuities ⋮ An improved master theorem for divide-and-conquer recurrences ⋮ Space-efficient geometric divide-and-conquer algorithms ⋮ Randomized algorithm for the sum selection problem ⋮ An experiment in structured programming ⋮ The validity of return address schemes ⋮ Time bounds for selection ⋮ Hierarchical a posteriori error estimation of Bank-Weiser type in the FEniCS project ⋮ Selection by distributive partitioning ⋮ Analysis of multiple quickselect variants. ⋮ Max-Plus Algebraic Statistical Leverage Scores ⋮ On smoothed analysis of quicksort and Hoare's find ⋮ Dörfler marking with minimal cardinality is a linear complexity problem ⋮ The quicksort process ⋮ Distributional convergence for the number of symbol comparisons used by QuickSort ⋮ Fast parallel GPU-sorting using a hybrid algorithm ⋮ A logical basis for programming methodology ⋮ The \(m\)-version of binary search trees: an average case analysis ⋮ Hierarchical development of programming languages ⋮ Analysis of the expected number of bit comparisons required by quickselect ⋮ Weighted median algorithms for \(L_ 1\) approximation ⋮ The saga of minimum spanning trees ⋮ Sorting numbers in linear expected time and optimal extra space ⋮ The analysis of range quickselect and related problems ⋮ Selection from read-only memory and sorting with minimum data movement ⋮ Multiple Quickselect -- Hoare's Find algorithm for several elements ⋮ Non-asymptotic distributional bounds for the Dickman approximation of the running time of the Quickselect algorithm ⋮ Better size estimation for sparse matrix products ⋮ Discrete rigid registration: a local graph-search approach ⋮ Tardiness bounds under global EDF scheduling on a multiprocessor ⋮ Distributional analysis of swaps in quick select ⋮ A random algorithm for multiselection ⋮ Reasoning about programs ⋮ On sorting, heaps, and minimum spanning trees ⋮ Turing's 1949 paper in context ⋮ Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses ⋮ Mixed Poisson approximation of node depth distributions in random binary search trees ⋮ The analysis of Quicksort programs ⋮ The use of Hoare's method of program verification for the Quicksort algorithm ⋮ Fifty years of Hoare's logic ⋮ On compound statements in a conversational language ⋮ Automatically Splitting a Two-Stage Lambda Calculus ⋮ QuickXsort: a fast sorting scheme in theory and practice ⋮ Finding a mediocre player ⋮ The Orc Programming Language ⋮ EGC: entropy-based gradient compression for distributed deep learning ⋮ Moves and displacements of particular elements in quicksort ⋮ Verification of a program complex ⋮ A selectable sloppy heap ⋮ Exponential bounds for the running time of a selection algorithm ⋮ Selection Algorithms with Small Groups ⋮ Current methods for proving program correctness ⋮ Distributional Convergence for the Number of Symbol Comparisons Used by Quickselect ⋮ Axiomatic approach to total correctness of programs ⋮ Performance Estimation Using Symbolic Data ⋮ Linear sorting with O(log n) processors ⋮ Probabilistic analysis of algorithms for the Dutch national flag problem ⋮ CodedSketch: A Coding Scheme for Distributed Computation of Approximated Matrix Multiplication ⋮ Automatic program verification. I: A logical basis and its implementation ⋮ An efficient external sorting with minimal space requirement ⋮ On Floyd and Rivest's SELECT algorithm ⋮ A simple expected running time analysis for randomized ``divide and conquer algorithms ⋮ Computing the Burrows-Wheeler transform in place and in small space ⋮ Hierarchical compressed sensing ⋮ Analysis of the performance of the parallel quicksort method ⋮ QuickHeapsort, an efficient mix of classical sorting algorithms ⋮ Selection by rank inK-dimensional binary search trees ⋮ Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm

This page was built for software: Find