A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
List homomorphisms are functions which can be eciently computed in parallel since they ideally suit the divide-and-conquer paradigm. However, some interesting functions, e.g., the maximum segment sum problem, are not list homomorphisms. In this paper, we propose a systematic way of embedding them into list homomorphisms so that parallel programs are derived. We show, with an example, how a simple, and \obviously" correct, but possibly inecient solution to the problem can be successfully turneddoi:10.1007/3-540-61550-4_166 fatcat:hhmo67lgujckpohew7hz3t3jla