Q6087214 (Q6087214): Difference between revisions

@@ Property / cites work @@
+Q3948568
@@ Property / cites work: Q3948568 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal parallel selection has complexity O(log log N)
+Normal rank
@@ Property / cites work @@
+Fast Deterministic Selection
@@ Property / cites work: Fast Deterministic Selection / rank @@
+Normal rank
@@ Property / cites work @@
+Q4194455
@@ Property / cites work: Q4194455 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2728905
@@ Property / cites work: Q2728905 / rank @@
+Normal rank
@@ Property / cites work @@
+Time bounds for selection
@@ Property / cites work: Time bounds for selection / rank @@
+Normal rank
@@ Property / cites work @@
+Selection Algorithms with Small Groups
@@ Property / cites work: Selection Algorithms with Small Groups / rank @@
+Normal rank
@@ Property / cites work @@
+An improved algorithm for finding the median distributively
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Average case selection
@@ Property / cites work: Average case selection / rank @@
+Normal rank
@@ Property / cites work @@
+On Lower Bounds for Selecting the Median
@@ Property / cites work: On Lower Bounds for Selecting the Median / 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 @@
+Selecting the Median
@@ Property / cites work: Selecting the Median / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a mediocre player
@@ Property / cites work: Finding a mediocre player / rank @@
+Normal rank
@@ Property / cites work @@
+A selectable sloppy heap
@@ Property / cites work: A selectable sloppy heap / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-Case Efficient Sorting with QuickMergesort
@@ Property / cites work: Worst-Case Efficient Sorting with QuickMergesort / 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 @@
+A Counting Approach to Lower Bounds for Selection Problems
+Normal rank
@@ Property / cites work @@
+Q5625177
@@ Property / cites work: Q5625177 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds for Selection
@@ Property / cites work: Bounds for Selection / rank @@
+Normal rank
@@ Property / cites work @@
+A New Lower Bound for the Set-Partitioning Problem
+Normal rank
@@ Property / cites work @@
+A Unified Lower Bound for Selection and Set Partitioning Problems
+Normal rank
@@ Property / cites work @@
+Q4344097
@@ Property / cites work: Q4344097 / rank @@
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On ``An improved algorithm for finding the median distributively''
+Normal rank
@@ Property / cites work @@
+Optimal Sampling Strategies in Quicksort and Quickselect
+Normal rank
@@ Property / cites work @@
+Optimal sampling strategies for quicksort
@@ Property / cites work: Optimal sampling strategies for quicksort / rank @@
+Normal rank
@@ Property / cites work @@
+Progress in selection
@@ Property / cites work: Progress in selection / rank @@
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the median
@@ Property / cites work: Finding the median / rank @@
+Normal rank
@@ Property / cites work @@
+New upper bounds for selection
@@ Property / cites work: New upper bounds for selection / rank @@
+Normal rank