The following pages link to Find (Q33419):
Displaying 35 items.
- Range selection and predecessor queries in data aware space and time (Q2397147) (← links)
- Fast perfect simulation of Vervaat perpetuities (Q2402417) (← links)
- On smoothed analysis of quicksort and Hoare's find (Q2428694) (← links)
- The quicksort process (Q2434753) (← links)
- Tardiness bounds under global EDF scheduling on a multiprocessor (Q2479886) (← links)
- Axiomatic approach to total correctness of programs (Q2561482) (← links)
- Probabilistic analysis of algorithms for the Dutch national flag problem (Q2566022) (← links)
- On Floyd and Rivest's SELECT algorithm (Q2576874) (← links)
- A simple expected running time analysis for randomized ``divide and conquer'' algorithms (Q2581554) (← links)
- Near-optimal online multiselection in internal and external memory (Q2634712) (← links)
- Fringe analysis for extquick: An in situ distributive external sorting algorithm (Q2639632) (← links)
- Hierarchical a posteriori error estimation of Bank-Weiser type in the FEniCS project (Q2679373) (← links)
- Automatically Splitting a Two-Stage Lambda Calculus (Q2802484) (← links)
- Distributional convergence for the number of symbol comparisons used by QuickSelect (Q2837754) (← links)
- Performance Estimation Using Symbolic Data (Q2842645) (← links)
- Selection by rank in K-dimensional binary search trees (Q2877767) (← links)
- The Orc Programming Language (Q3634722) (← links)
- Current methods for proving program correctness (Q3911363) (← links)
- On compound statements in a conversational language (Q4160369) (← links)
- Verification of a program complex (Q4194415) (← links)
- On the median-of-k version of Hoare's selection algorithm (Q4265537) (← links)
- Automatic construction of test sets: Practical approach (Q4560360) (← links)
- An improved master theorem for divide-and-conquer recurrences (Q4571976) (← links)
- Max-Plus Algebraic Statistical Leverage Scores (Q4598335) (← links)
- An efficient external sorting with minimal space requirement (Q4747522) (← links)
- (Q4944851) (← links)
- Selection Algorithms with Small Groups (Q4983545) (← links)
- CodedSketch: A Coding Scheme for Distributed Computation of Approximated Matrix Multiplication (Q5001784) (← links)
- Dörfler marking with minimal cardinality is a linear complexity problem (Q5118851) (← links)
- On Smoothed Analysis of Quicksort and Hoare’s Find (Q5323060) (← links)
- A random algorithm for multiselection (Q5424050) (← links)
- An experiment in structured programming (Q5643572) (← links)
- HIFIR: Hybrid Incomplete Factorization with Iterative Refinement for Preconditioning Ill-Conditioned and Singular Systems (Q5882948) (← links)
- Finding a mediocre player (Q5925497) (← links)
- Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses (Q5943320) (← links)
