Solution of a Divide-and-Conquer Maximin Recurrence

DOI10.1137/0218079MaRDI QIDQ3034823zbMATH OpenOpenAlexFDO

Authors Edward M. Reingold, Zhiyuan Li

Publication date 1989

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0218079

zbMATH Keywords

algorithmic analysisdivide-and-conquerrecurrence relations

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Rate of growth of functions, orders of infinity, slowly varying functions (26A12) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Recommendations

• Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence
• Multidimensional Divide-and-Conquer Maximin Recurrences
• Exact and asymptotic solutions of a divide-and-conquer recurrence dividing at half: theory and applications
• Exact asymptotics of divide-and-conquer recurrences
• Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences

Cited in

(18)

• Recurrence relations based on minimization and maximization
• A calculus for the random generation of labelled combinatorial structures
• Linear-time construction of treaps and Cartesian trees
• An asymptotic theory for recurrence relations based on minimization and maximization.
• Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences
• Divide-and-conquer recurrences -- classification of asymptotics
• Solutions of two minmax recurrences in parallel processing with variable recombination overhead
• Competitive graph searches
• A generic approach for the unranking of labeled combinatorial classes
• scientific article; zbMATH DE number 6378818 (Why is no real title available?)
• Exact solution of a minimal recurrence
• On the number of hypercubic bipartitions of an integer
• The Number of 1’s in Binary Integers: Bounds and Extremal Properties
• Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence
• Exact and asymptotic solutions of a divide-and-conquer recurrence dividing at half: theory and applications
• Analysis of a Recurrence Arising from a Construction for Nonblocking Networks
• Multidimensional Divide-and-Conquer Maximin Recurrences
• Identities and periodic oscillations of divide-and-conquer recurrences splitting at half

This page was built for publication: Solution of a Divide-and-Conquer Maximin Recurrence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3034823)