Constructing sorting networks from k-sorters (Q582119): 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/0020-0190(89)90196-8
+Normal rank
@@ Property / OpenAlex ID @@
+W1968119892
@@ Property / OpenAlex ID: W1968119892 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q38772864
@@ Property / Wikidata QID: Q38772864 / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting in \(c \log n\) parallel steps
@@ Property / cites work: Sorting in \(c \log n\) parallel steps / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Divide/Sort/Merge Sorting Networks
@@ Property / cites work: Improved Divide/Sort/Merge Sorting Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q5585020
@@ Property / cites work: Q5585020 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight Bounds on the Complexity of Parallel Sorting
+Normal rank
@@ Property / cites work @@
+A parallel sorting scheme whose basic operation sortsN elements
+Normal rank