Pages that link to "Item:Q1957651"

The following pages link to Analysis of the expected number of bit comparisons required by quickselect (Q1957651):

Displaying 15 items.

• Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm (Q261384) (← links)
• Towards a realistic analysis of the QuickSelect algorithm (Q290901) (← links)
• The number of bit comparisons used by quicksort: an average-case analysis (Q428664) (← links)
• Multikey quickselect (Q472494) (← links)
• Probabilistic analysis of multiple quick select (Q1277384) (← 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)
• Analysis of the expected number of bit comparisons required by quickselect (Q1957651) (← 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)
• (Q3496340) (← links)
• The Number of Symbol Comparisons in QuickSort and QuickSelect (Q3638078) (← links)
• (Q5194651) (redirect page) (← links)