Recurrence relations based on minimization

DOI10.1016/0022-247X(74)90176-0zbMath0312.65091MaRDI QIDQ1219673

Donald E. Knuth, Michael L. Fredman

Publication date: 1974

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Recurrences (11B37) Elementary theory of partitions (11P81) Enumerative combinatorics (05A99) General topics in the theory of software (68N01) Tauberian theorems (40E05)

Related Items (17)

Recurrence relations based on minimization and maximization ⋮ The maximal solution of a restricted subadditive inequality in numerical analysis ⋮ An elementary approach to some analytic asymptotics ⋮ Solutions of two minmax recurrences in parallel processing with variable recombination overhead ⋮ An asymptotic theory for recurrence relations based on minimization and maximization. ⋮ Identities and periodic oscillations of divide-and-conquer recurrences splitting at half ⋮ An analytic approach to the asymptotic variance of trie statistics and related structures ⋮ Mellin transforms and asymptotics: Harmonic sums ⋮ On the cost of optimal alphabetic code trees with unequal letter costs ⋮ Asymptotic analysis of dichotomous search with search and travel costs ⋮ On uniqueness of solution to the multi-peg towers of hanoi ⋮ Unnamed Item ⋮ On the design of a constructive algorithm to solve the multi-peg towers of Hanoi problem ⋮ Optimal point-to-point broadcast algorithms via lopsided trees ⋮ Recursively rotated orders and implicit data structures: A lower bound ⋮ A family of restricted subadditive recursions ⋮ Exact balancing is not always good

Cites Work

• An asymptotic solution of the difference equation \(a_{n+1} - a_n = a_{[n/2}\)]
• On Mahler's partition problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recurrence relations based on minimization