Optimal algorithms for generalized searching in sorted matrices
From MaRDI portal
Publication:1389660
DOI10.1016/S0304-3975(97)00027-3zbMath0894.68040MaRDI QIDQ1389660
Publication date: 30 June 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Optimal parallel selection in sorted matrices
- Selection in \(X+Y\) and matrices with sorted rows and columns
- The complexity of searching in \(X+Y\) and other multisets
- Complexity of selection in \(X+Y\)
- On parallel selection and searching in partial orders: Sorted matrices
- Generalized Selection and Ranking: Sorted Matrices
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $
- Lower Bounds for Selection in X + Y and Other Multisets
- Estimates of Location Based on Rank Tests
This page was built for publication: Optimal algorithms for generalized searching in sorted matrices