Solutions of two minmax recurrences in parallel processing with variable recombination overhead
From MaRDI portal
Publication:1914668
DOI10.1016/0096-3003(95)00158-1zbMath0846.68046MaRDI QIDQ1914668
Meghanad D. Wagh, Arindam Saha
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
68W15: Distributed algorithms
Related Items
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item