Cites work
- scientific article; zbMATH DE number 3475523 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 3232846 (Why is no real title available?)
- scientific article; zbMATH DE number 3327321 (Why is no real title available?)
- scientific article; zbMATH DE number 3047573 (Why is no real title available?)
- An asymptotic solution of the difference equation \(a_{n+1} - a_n = a_{[n/2]}\)
- On Mahler's partition problem
Cited in
(17)- Recurrence relations based on minimization and maximization
- Identities and periodic oscillations of divide-and-conquer recurrences splitting at half
- Exact balancing is not always good
- A family of restricted subadditive recursions
- On the design of a constructive algorithm to solve the multi-peg towers of Hanoi problem
- Asymptotic analysis of dichotomous search with search and travel costs
- The maximal solution of a restricted subadditive inequality in numerical analysis
- An asymptotic theory for recurrence relations based on minimization and maximization.
- An elementary approach to some analytic asymptotics
- Solutions of two minmax recurrences in parallel processing with variable recombination overhead
- Optimal point-to-point broadcast algorithms via lopsided trees
- Recursively rotated orders and implicit data structures: A lower bound
- Mellin transforms and asymptotics: Harmonic sums
- On uniqueness of solution to the multi-peg towers of hanoi
- An analytic approach to the asymptotic variance of trie statistics and related structures
- scientific article; zbMATH DE number 6902897 (Why is no real title available?)
- On the cost of optimal alphabetic code trees with unequal letter costs
This page was built for publication: Recurrence relations based on minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1219673)
