The complexity of selection and ranking in X+Y and matrices with sorted columns (Q1161291): Difference between revisions

@@ Property / cites work @@
+An almost optimal algorithm for unbounded searching
+Normal rank
@@ Property / cites work @@
+Time bounds for selection
@@ Property / cites work: Time bounds for selection / rank @@
+Normal rank
@@ Property / cites work @@
+Discrete Optimization Via Marginal Analysis
@@ Property / cites work: Discrete Optimization Via Marginal Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Selection in             <i>X</i>             +             <i>Y</i>             and Other Multisets
+Normal rank
@@ Property / cites work @@
+Selecting the <i>K</i>th Element in $X + Y$ and $X_1  + X_2  +  \cdots  + X_m $
+Normal rank
@@ Property / cites work @@
+Proving simultaneous positivity of linear forms
@@ Property / cites work: Proving simultaneous positivity of linear forms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4176809
@@ Property / cites work: Q4176809 / rank @@
+Normal rank