SORTING AND SELECTION ON DISTRIBUTED MEMORY BUS COMPUTERS (Q4820152): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/10637199608915552
+Normal rank
@@ Property / OpenAlex ID @@
+W3021634912
@@ Property / OpenAlex ID: W3021634912 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal bounds for decision problems on the CRCW PRAM
+Normal rank
@@ Property / cites work @@
+Parallel Merge Sort
@@ Property / cites work: Parallel Merge Sort / rank @@
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+Expected time bounds for selection
@@ Property / cites work: Expected time bounds for selection / rank @@
+Normal rank
@@ Property / cites work @@
+Q3885184
@@ Property / cites work: Q3885184 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight Bounds on the Complexity of Parallel Sorting
+Normal rank
@@ Property / cites work @@
+Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
+Normal rank
@@ Property / cites work @@
+Parallelism in Comparison Problems
@@ Property / cites work: Parallelism in Comparison Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting on PRAMs with reconfigurable buses
@@ Property / cites work: Sorting on PRAMs with reconfigurable buses / rank @@
+Normal rank