Solutions of two minmax recurrences in parallel processing with variable recombination overhead (Q1914668): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0096-3003(95)00158-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2003283181
@@ Property / OpenAlex ID: W2003283181 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3885184
@@ Property / cites work: Q3885184 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4001523
@@ Property / cites work: Q4001523 / rank @@
+Normal rank
@@ Property / cites work @@
+Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
+Normal rank
@@ Property / cites work @@
+Optimum lopsided binary trees
@@ Property / cites work: Optimum lopsided binary trees / rank @@
+Normal rank
@@ Property / cites work @@
+Recurrence relations based on minimization
@@ Property / cites work: Recurrence relations based on minimization / rank @@
+Normal rank
@@ Property / cites work @@
+Solution of a Divide-and-Conquer Maximin Recurrence
+Normal rank
@@ Property / cites work @@
+Q4042466
@@ Property / cites work: Q4042466 / rank @@
+Normal rank
@@ Property / cites work @@
+Some Recurrence Relations of Recursive Minimization
+Normal rank
@@ Property / cites work @@
+Some Maximal Solutions of the Generalized Subadditive Inequality
+Normal rank
@@ Property / cites work @@
+Solutions of two minmax recurrences in parallel processing with variable recombination overhead
+Normal rank