Pages that link to "Item:Q1219673"

The following pages link to Recurrence relations based on minimization (Q1219673):

Displaying 17 items.

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