The following pages link to New upper bounds for selection (Q4099208):
Displaying 10 items.
- Producing posets (Q1151047) (← links)
- A note on upper bounds for the selection problem (Q1171384) (← links)
- Finding the \(\alpha n\)-th largest element (Q1912751) (← links)
- On partial sorting in restricted rounds (Q2013879) (← links)
- A selectable sloppy heap (Q2312418) (← links)
- Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers (Q4805931) (← links)
- Selection Algorithms with Small Groups (Q4983545) (← links)
- Progress in selection (Q5054828) (← links)
- Finding a mediocre player (Q5925497) (← links)
- (Q6087214) (← links)
