Solution of a Divide-and-Conquer Maximin Recurrence

DOI10.1137/0218079zbMath0692.68038OpenAlexW1986428580MaRDI QIDQ3034823

Edward M. Reingold, Zhi-yuan 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

recurrence relationsdivide-and-conqueralgorithmic analysis

Mathematics Subject Classification ID

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

Related Items

A calculus for the random generation of labelled combinatorial structures ⋮ Linear-time construction of treaps and Cartesian trees ⋮ Exact solution of a minimal recurrence ⋮ Solutions of two minmax recurrences in parallel processing with variable recombination overhead ⋮ On the number of hypercubic bipartitions of an integer ⋮ An asymptotic theory for recurrence relations based on minimization and maximization. ⋮ Competitive graph searches ⋮ A generic approach for the unranking of labeled combinatorial classes ⋮ Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences