Algorithm 489
From MaRDI portal
Software:51976
swMATH36274MaRDI QIDQ51976FDOQ51976
Author name not available (Why is that?)
Cited In (11)
- Exponential bounds for the running time of a selection algorithm
- Computing halfspace depth contours based on the idea of a circular sequence
- Determining the mode
- Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
- Weighted median algorithms for \(L_ 1\) approximation
- Selection by distributive partitioning
- A time warping approach to multiple sequence alignment
- Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time
- Computing projection depth and its associated estimators
- Efficient sorting during repetitive statistical computations: Algorithms and an application
- On Floyd and Rivest's SELECT algorithm
This page was built for software: Algorithm 489
