Finding the maximum subsequence sum on interconnection networks

DOI10.1080/17445760701207611zbMath1125.68007OpenAlexW2028128008MaRDI QIDQ5421615

Selim G. Akl, Ke Qiu

Publication date: 24 October 2007

Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17445760701207611

zbMATH Keywords

PRAMprefix sumsInterconnection networksMax subsequence sum problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Unnamed Item
• Fast parallel algorithms for the maximum sum problem
• A note on a standard strategy for developing loop invariants and loops
• A novel routing scheme on the star and pancake networks and its applications
• A group-theoretic model for symmetric interconnection networks
• APPLICATION OF BROADCASTING WITH SELECTIVE REDUCTION TO THE MAXIMAL SUM SUBSEGMENT PROBLEM

This page was built for publication: Finding the maximum subsequence sum on interconnection networks