Pages that link to "Item:Q1575559"
From MaRDI portal
The following pages link to Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences (Q1575559):
Displaying 4 items.
- The optimality of a certain purely recursive dissection for a sequentially \(n\)-divisible square (Q1869738) (← links)
- Solutions of two minmax recurrences in parallel processing with variable recombination overhead (Q1914668) (← links)
- Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence (Q4339007) (← links)
- A General Framework for Static Cost Analysis of Parallel Logic Programs (Q5097623) (← links)