Selection in X+Y and matrices with sorted rows and columns
From MaRDI portal
Publication:761793
DOI10.1016/0020-0190(85)90123-1zbMATH Open0557.68040OpenAlexW2079849501MaRDI QIDQ761793FDOQ761793
Authors: D. Kharzeev 
Publication date: 1985
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(85)90123-1
Recommendations
Cites Work
- Estimates of Location Based on Rank Tests
- Title not available (Why is that?)
- Generalized Selection and Ranking: Sorted Matrices
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- Time bounds for selection
- Lower Bounds for Selection in X + Y and Other Multisets
- Sorting X + Y
- Title not available (Why is that?)
- Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $
Cited In (17)
- River routing in VLSI
- Scheduling with gaps: new models and algorithms
- Optimal algorithms for generalized searching in sorted matrices
- Title not available (Why is that?)
- Cache-oblivious selection in sorted \(X+Y\) matrices
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
