| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10331884 | Information Processing Letters | 2015 | 7 Pages |
Abstract
We present an algorithm for combining the elements of subsequences of a sequence with an associative operator. The subsequences are given by a sliding window of varying size. Our algorithm is greedy and computes the result with the minimal number of operator applications.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
David Basin, Felix Klaedtke, Eugen ZÄlinescu,