Finding the maximum subsequence sum on interconnection networks (Q5421615): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A group-theoretic model for symmetric interconnection networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: APPLICATION OF BROADCASTING WITH SELECTIVE REDUCTION TO THE MAXIMAL SUM SUBSEGMENT PROBLEM / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A novel routing scheme on the star and pancake networks and its applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3992623 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on a standard strategy for developing loop invariants and loops / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4864245 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast parallel algorithms for the maximum sum problem / rank | |||
Normal rank | |||
Latest revision as of 10:50, 27 June 2024
scientific article; zbMATH DE number 5204523
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the maximum subsequence sum on interconnection networks |
scientific article; zbMATH DE number 5204523 |
Statements
Finding the maximum subsequence sum on interconnection networks (English)
0 references
24 October 2007
0 references
Interconnection networks
0 references
Max subsequence sum problem
0 references
prefix sums
0 references
PRAM
0 references
0 references
