Pages that link to "Item:Q3638078"
From MaRDI portal
The following pages link to The Number of Symbol Comparisons in QuickSort and QuickSelect (Q3638078):
Displaying 12 items.
- Towards a realistic analysis of the QuickSelect algorithm (Q290901) (← links)
- Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme (Q308946) (← links)
- Multikey quickselect (Q472494) (← 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)
- Distributional Convergence for the Number of Symbol Comparisons Used by Quickselect (Q2837754) (← links)
- Generic properties of subgroups of free groups and finite presentations (Q2975245) (← links)
- Analysis of swaps in radix selection (Q3021249) (← links)
- Dichotomic Selection on Words: A Probabilistic Analysis (Q5088910) (← links)
- Gaussian Distribution of Trie Depth for Strongly Tame Sources (Q5364227) (← links)
- Towards a Realistic Analysis of Some Popular Sorting Algorithms (Q5364228) (← links)