Optimal algorithms for generalized searching in sorted matrices
From MaRDI portal
Publication:1389660
Recommendations
Cites work
- scientific article; zbMATH DE number 3740740 (Why is no real title available?)
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Complexity of selection in \(X+Y\)
- Estimates of Location Based on Rank Tests
- Generalized Selection and Ranking: Sorted Matrices
- Lower Bounds for Selection in X + Y and Other Multisets
- On parallel selection and searching in partial orders: Sorted matrices
- Optimal parallel selection in sorted matrices
- Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $
- Selection in \(X+Y\) and matrices with sorted rows and columns
- The complexity of searching in \(X+Y\) and other multisets
Cited in
(6)- Parallel multiple search
- A faster parallel algorithm for a matrix searching problem
- An optimal algorithm with unknown time complexity for convex matrix searching
- scientific article; zbMATH DE number 7120968 (Why is no real title available?)
- The complexity of searching in \(X+Y\) and other multisets
- scientific article; zbMATH DE number 2101003 (Why is no real title available?)
This page was built for publication: Optimal algorithms for generalized searching in sorted matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389660)
