Pages that link to "Item:Q1277380"
From MaRDI portal
The following pages link to Asymptotics of divide-and-conquer recurrences: Batcher's sorting algorithm and a minimum Euclidean matching heuristic (Q1277380):
Displaying 4 items.
- Batcher's odd-even exchange revisited: a generating functions approach (Q290531) (← links)
- Asymptotic expansions for linear homogeneous divide-and-conquer recurrences: algebraic and analytic approaches collated (Q401474) (← links)
- Moments for the multidimensional Mönkemeyer algorithm (Q2931150) (← links)
- On the total length of the random minimal directed spanning tree (Q5480003) (← links)