Multidimensional Divide-and-Conquer Maximin Recurrences

DOI10.1137/S0895480192232862zbMath0834.68053OpenAlexW1966276700MaRDI QIDQ4847365

Laurent Alonso, Edward M. Reingold, René Schott

Publication date: 20 September 1995

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

divide-and-conquer recurrencealgorithmic analysispartition trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Combinatorial aspects of partitions of integers (05A17) Combinatorics in computer science (68R05) Combinatorial inequalities (05A20) Rate of growth of functions, orders of infinity, slowly varying functions (26A12)

Related Items (5)

Exact solution of a minimal recurrence ⋮ A General Framework for Static Cost Analysis of Parallel Logic Programs ⋮ An asymptotic theory for recurrence relations based on minimization and maximization. ⋮ Competitive graph searches ⋮ Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences

This page was built for publication: Multidimensional Divide-and-Conquer Maximin Recurrences