Pages that link to "Item:Q1028991"
From MaRDI portal
The following pages link to Randomized selection in \(n+C+o(n)\) comparisons (Q1028991):
Displaying 8 items.
- Comments on ``Performance analysis for ordered selection combining schemes in Nakagami-m environments'' (Q834166) (← links)
- A randomized algorithm for finding maximum with \(O((\log n)^2)\) polynomial tests (Q1313712) (← links)
- Can a randomized binary search have an \(O(1)\) complexity at least in practice? (Q2383711) (← links)
- On Floyd and Rivest's SELECT algorithm (Q2576874) (← links)
- Selection via the bogo-method -- more on the analysis of perversely awful randomized algorithms (Q3301012) (← links)
- On the cost of algorithms for random selection (Q4254585) (← links)
- Artificial Intelligence and Soft Computing - ICAISC 2004 (Q4666457) (← links)
- Linear-time in-place selection in less than 3n comparisons (Q6487970) (← links)