The following pages link to Average case selection (Q3829069):
Displaying 12 items.
- Further analysis of the remedian algorithm (Q391134) (← links)
- Determining the majority: The biased case (Q1364402) (← links)
- Architecture independent parallel selection with applications to parallel priority queues (Q1399984) (← links)
- A stochastically quasi-optimal search algorithm for the maximum of the simple random walk (Q1429105) (← links)
- Finding the \(\alpha n\)-th largest element (Q1912751) (← links)
- On partial sorting in restricted rounds (Q2013879) (← links)
- A selectable sloppy heap (Q2312418) (← links)
- On constant factors in comparison-based geometric algorithms and data structures (Q2349854) (← links)
- On Floyd and Rivest's SELECT algorithm (Q2576874) (← links)
- Closing a Long-Standing Complexity Gap for Selection: V 3(42) = 50 (Q2848968) (← links)
- (Q6087214) (← links)
- Heap construction: Optimal in both worst and average cases? (Q6487971) (← links)
