@article{BASIN2015186,
title = "Greedily computing associative aggregations on sliding windows",
journal = "Information Processing Letters",
volume = "115",
number = "2",
pages = "186 - 192",
year = "2015",
issn = "0020-0190",
doi = "https://doi.org/10.1016/j.ipl.2014.09.009",
url = "http://www.sciencedirect.com/science/article/pii/S0020019014001859",
author = "David Basin and Felix Klaedtke and Eugen Z{\u{a}}linescu",
keywords = "Sliding window, Associative aggregation operator, On-line algorithms, Complexity, Optimality",
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."
}
