Multidimensional Divide-and-conquer Maximin Recurrences

Abstract: "Bounds are obtained for the solution to the divide- and-conquer recurrence M(n) = [formula], for nondecreasing functions f. Similar bounds are found for the recurrence with 'min' replaced by 'sum-of- all-but-the-max.' Such recurrences appear in the analysis of various algorithms."