Processor-time tradeoffs in PRAM simulations (Q1185246): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0022-0000(92)90006-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2090612648
@@ Property / OpenAlex ID: W2090612648 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3941433
@@ Property / cites work: Q3941433 / rank @@
+Normal rank
@@ Property / cites work @@
+Intersection Theorems for Systems of Sets
@@ Property / cites work: Intersection Theorems for Systems of Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Relations between Concurrent-Write Models of Parallel Computation
+Normal rank
@@ Property / cites work @@
+Simulations among concurrent-write PRAMs
@@ Property / cites work: Simulations among concurrent-write PRAMs / rank @@
+Normal rank
@@ Property / cites work @@
+A universal interconnection pattern for parallel computers
+Normal rank
@@ Property / cites work @@
+Large parallel machines can be extremely slow for small problems
+Normal rank
@@ Property / cites work @@
+Parallel computation and conflicts in memory access
+Normal rank
@@ Property / cites work @@
+The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$
+Normal rank
@@ Property / cites work @@
+Finding the maximum, merging, and sorting in a parallel computation model
+Normal rank
@@ Property / cites work @@
+An O(logn) parallel connectivity algorithm
@@ Property / cites work: An O(logn) parallel connectivity algorithm / rank @@
+Normal rank