Pages that link to "Item:Q1389660"
From MaRDI portal
The following pages link to Optimal algorithms for generalized searching in sorted matrices (Q1389660):
Displaying 8 items.
- Optimal parallel selection in sorted matrices (Q671400) (← links)
- Parallel multiple search (Q750158) (← links)
- The complexity of searching in \(X+Y\) and other multisets (Q911276) (← links)
- An optimal algorithm with unknown time complexity for convex matrix searching (Q917275) (← links)
- A faster parallel algorithm for a matrix searching problem (Q1206437) (← links)
- On parallel selection and searching in partial orders: Sorted matrices (Q1356983) (← links)
- (Q4817726) (← links)
- (Q5239684) (← links)