Solutions of two minmax recurrences in parallel processing with variable recombination overhead

DOI10.1016/0096-3003(95)00158-1zbMath0846.68046OpenAlexW2003283181MaRDI QIDQ1914668

Arindam Saha, Meghanad D. Wagh

Publication date: 22 September 1996

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(95)00158-1

zbMATH Keywords

parallel algorithmsrecurrence relations

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (1)

Solutions of two minmax recurrences in parallel processing with variable recombination overhead

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recurrence relations based on minimization
• Solutions of two minmax recurrences in parallel processing with variable recombination overhead
• Solution of a Divide-and-Conquer Maximin Recurrence
• Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
• Some Maximal Solutions of the Generalized Subadditive Inequality
• Some Recurrence Relations of Recursive Minimization
• Optimum lopsided binary trees

This page was built for publication: Solutions of two minmax recurrences in parallel processing with variable recombination overhead