Randomized selection in \(n+C+o(n)\) comparisons (Q1028991): Difference between revisions

@@ Property / cites work @@
+Fast probabilistic algorithms for Hamiltonian circuits and matchings
+Normal rank
@@ Property / cites work @@
+Time bounds for selection
@@ Property / cites work: Time bounds for selection / 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 @@
+Merging on the BSP model
@@ Property / cites work: Merging on the BSP model / rank @@
+Normal rank
@@ Property / cites work @@
+A Unified Lower Bound for Selection and Set Partitioning Problems
+Normal rank
@@ Property / cites work @@
+Q5585020
@@ Property / cites work: Q5585020 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the median
@@ Property / cites work: Finding the median / rank @@
+Normal rank