The following pages link to (Q5671622):
Displaying 17 items.
- Combinatorial sums through Riordan arrays (Q408959) (← links)
- The analysis of range quickselect and related problems (Q650886) (← links)
- Selection from read-only memory and sorting with minimum data movement (Q671520) (← links)
- Multiple Quickselect -- Hoare's Find algorithm for several elements (Q672250) (← links)
- Strictly in-place algorithms for permuting and inverting permutations (Q832874) (← links)
- Cost distribution of the Chang-Roberts leader election algorithm and related problems (Q861286) (← links)
- Stable in situ sorting and minimum data movement (Q911311) (← links)
- The area above the Dyck path of a permutation (Q972852) (← links)
- Sortieren bei virtuellem Speicher (Q1240558) (← links)
- The analysis of double hashing (Q1243123) (← links)
- A calculus for the random generation of labelled combinatorial structures (Q1334654) (← links)
- An asymptotic theory for recurrence relations based on minimization and maximization. (Q1401173) (← links)
- A heuristic to accelerate in-situ permutation algorithms (Q1603509) (← links)
- Non-asymptotic distributional bounds for the Dickman approximation of the running time of the Quickselect algorithm (Q1994506) (← links)
- Density functions for \texttt{QuickQuant} and \texttt{QuickVal} (Q2679697) (← links)
- Distributional Convergence for the Number of Symbol Comparisons Used by Quickselect (Q2837754) (← links)
- The limiting common distribution of two leaf heights in a random binary tree (Q3991290) (← links)
