Pages that link to "Item:Q4339010"
From MaRDI portal
The following pages link to More Efficient Parallel Totally Monotone Matrix Searching (Q4339010):
Displaying 10 items.
- Geometric applications of a matrix-searching algorithm (Q1101223) (← links)
- A faster parallel algorithm for a matrix searching problem (Q1206437) (← links)
- On parallel selection and searching in partial orders: Sorted matrices (Q1356983) (← links)
- Parallel searching in generalized Monge arrays (Q1386363) (← links)
- Packing two disks in a polygon (Q1614067) (← links)
- (Q3128924) (← links)
- Superlinear bounds for matrix searching problems (Q3990615) (← links)
- (Q4281601) (← links)
- Efficient Matrix Chain Ordering in Polylog Time (Q4388882) (← links)
- A faster parallel algorithm for a matrix searching problem (Q5056103) (← links)