Pages that link to "Item:Q2424687"
From MaRDI portal
The following pages link to Two parallel algorithms for finding all minimal maximum subsequences (Q2424687):
Displaying 5 items.
- Finding least-weight subsequences with fewer processors (Q2366242) (← links)
- Special issue: Selected papers of the 9th international conference on language and automata theory and applications, LATA 2015 (Q2424669) (← links)
- APPLICATION OF BROADCASTING WITH SELECTIVE REDUCTION TO THE MAXIMAL SUM SUBSEGMENT PROBLEM (Q3991015) (← links)
- (Q4763420) (← links)
- Finding the maximum subsequence sum on interconnection networks (Q5421615) (← links)