Selection in X+Y and matrices with sorted rows and columns
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3607502 (Why is no real title available?)
- scientific article; zbMATH DE number 3612276 (Why is no real title available?)
- Estimates of Location Based on Rank Tests
- Generalized Selection and Ranking: Sorted Matrices
- Lower Bounds for Selection in X + Y and Other Multisets
- Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $
- Sorting X + Y
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- Time bounds for selection
Cited in
(17)- River routing in VLSI
- Scheduling with gaps: new models and algorithms
- Optimal algorithms for generalized searching in sorted matrices
- Cache-oblivious selection in sorted \(X+Y\) matrices
- scientific article; zbMATH DE number 7205030 (Why is no real title available?)
- Selection from heaps, row-sorted matrices, and \(X+Y\) using soft heaps
- On finding connected balanced partitions of trees
- Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
- scientific article; zbMATH DE number 18528 (Why is no real title available?)
- scientific article; zbMATH DE number 3843148 (Why is no real title available?)
- Scheduling with gaps: new models and algorithms
- The complexity of searching in \(X+Y\) and other multisets
- An \(O(n^{lg\,k}\cdot 2^{n/2})\) time and \(O(k\cdot 2^{n/k})\) space algorithm for certain NP-complete problems
- Complexity of selection in \(X+Y\)
- Sorting the sums \((x_ i+y_ j)\) in \(O(n^ 2)\) comparisons
- IMPROVED SELECTION IN TOTALLY MONOTONE ARRAYS
- Generalized Selection and Ranking: Sorted Matrices
This page was built for publication: Selection in \(X+Y\) and matrices with sorted rows and columns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761793)
