Pages that link to "Item:Q4630256"
From MaRDI portal
The following pages link to Exact asymptotics of divide-and-conquer recurrences (Q4630256):
Displaying 13 items.
- Maxima-finding algorithms for multidimensional samples: A two-phase approach (Q425621) (← links)
- Mellin transforms and asymptotics: Harmonic sums (Q672981) (← links)
- The design of divide and conquer algorithms (Q760206) (← links)
- How evenly should one divide to conquer quickly? (Q800084) (← links)
- Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform (Q818111) (← links)
- Asymptotic expansions of the mergesort recurrences (Q1127820) (← links)
- Asymptotics of divide-and-conquer recurrences: Batcher's sorting algorithm and a minimum Euclidean matching heuristic (Q1277380) (← links)
- Mellin transforms and asymptotics. The mergesort recurrence (Q1338908) (← links)
- Divide-and-conquer recurrences -- classification of asymptotics (Q1592813) (← links)
- Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures (Q1870561) (← links)
- Asymptotics of Mahler recurrences: The cyclotomic case (Q1919149) (← links)
- Asymptotics of divide-and-conquer recurrences via iterated function systems (Q2920844) (← links)
- The Cost Distribution of Queue-Mergesort, Optimal Mergesorts, and Power-of-2 Rules (Q4238537) (← links)
