Pages that link to "Item:Q1957651"
From MaRDI portal
The following pages link to Analysis of the expected number of bit comparisons required by quickselect (Q1957651):
Displaying 8 items.
- Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm (Q261384) (← links)
- Towards a realistic analysis of the QuickSelect algorithm (Q290901) (← links)
- Process convergence for the complexity of radix selection on Markov sources (Q1713466) (← links)
- Distributional convergence for the number of symbol comparisons used by QuickSort (Q1950265) (← links)
- Non-asymptotic distributional bounds for the Dickman approximation of the running time of the Quickselect algorithm (Q1994506) (← links)
- Distributional Convergence for the Number of Symbol Comparisons Used by Quickselect (Q2837754) (← links)
- Analysis of swaps in radix selection (Q3021249) (← links)
- QuickSelect Tree Process Convergence, With an Application to Distributional Convergence for the Number of Symbol Comparisons Used by Worst-Case Find (Q3191202) (← links)
