Recurrence relations based on minimization
From MaRDI portal
Publication:1219673
DOI10.1016/0022-247X(74)90176-0zbMATH Open0312.65091MaRDI QIDQ1219673FDOQ1219673
Donald E. Knuth, Michael L. Fredman
Publication date: 1974
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Enumerative combinatorics (05A99) General topics in the theory of software (68N01) Tauberian theorems (40E05) Recurrences (11B37) Elementary theory of partitions (11P81)
Cites Work
Cited In (17)
- A family of restricted subadditive recursions
- The maximal solution of a restricted subadditive inequality in numerical analysis
- Title not available (Why is that?)
- An asymptotic theory for recurrence relations based on minimization and maximization.
- Mellin transforms and asymptotics: Harmonic sums
- Identities and periodic oscillations of divide-and-conquer recurrences splitting at half
- On uniqueness of solution to the multi-peg towers of hanoi
- On the design of a constructive algorithm to solve the multi-peg towers of Hanoi problem
- On the cost of optimal alphabetic code trees with unequal letter costs
- An elementary approach to some analytic asymptotics
- Recursively rotated orders and implicit data structures: A lower bound
- Optimal point-to-point broadcast algorithms via lopsided trees
- Solutions of two minmax recurrences in parallel processing with variable recombination overhead
- An analytic approach to the asymptotic variance of trie statistics and related structures
- Asymptotic analysis of dichotomous search with search and travel costs
- Exact balancing is not always good
- Recurrence relations based on minimization and maximization
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)
