Comparator networks for binary heap construction (Q1589657): Difference between revisions

@@ 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 @@
+Q5615724
@@ Property / cites work: Q5615724 / rank @@
+Normal rank
@@ Property / cites work @@
+Time bounds for selection
@@ Property / cites work: Time bounds for selection / rank @@
+Normal rank
@@ Property / cites work @@
+Heap construction in the parallel comparison tree model
+Normal rank
@@ Property / cites work @@
+Q4886030
@@ Property / cites work: Q4886030 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the \(\alpha n\)-th largest element
@@ Property / cites work: Finding the \(\alpha n\)-th largest element / rank @@
+Normal rank
@@ Property / cites work @@
+Median Selection Requires $(2+\epsilon)n$ Comparisons
+Normal rank
@@ Property / cites work @@
+A Method of Constructing Selection Networks with $O(\log n)$ Depth
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+The asymptotic complexity of merging networks
@@ Property / cites work: The asymptotic complexity of merging networks / rank @@
+Normal rank
@@ Property / cites work @@
+Selection Networks
@@ Property / cites work: Selection Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the median
@@ Property / cites work: Finding the median / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds on Merging Networks
@@ Property / cites work: Lower Bounds on Merging Networks / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q127330231
@@ Property / Wikidata QID: Q127330231 / rank @@
+Normal rank