On the time required to sum n semigroup elements on a parallel machine with simultaneous writes (Q1101213): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(87)90058-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2051985991
@@ Property / OpenAlex ID: W2051985991 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallelism in random access machines
@@ Property / cites work: Parallelism in random access machines / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A universal interconnection pattern for parallel computers
+Normal rank
@@ Property / cites work @@
+Q3484350
@@ Property / cites work: Q3484350 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3746885
@@ Property / cites work: Q3746885 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3746884
@@ Property / cites work: Q3746884 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3677183
@@ Property / cites work: Q3677183 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3751010
@@ Property / cites work: Q3751010 / rank @@
+Normal rank
@@ Property / cites work @@
+Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
+Normal rank
@@ Property / cites work @@
+Finding the maximum, merging, and sorting in a parallel computation model
+Normal rank
@@ Property / Wikidata QID @@
+Q127203541
@@ Property / Wikidata QID: Q127203541 / rank @@
+Normal rank