Name
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.ipl.2014.09.009 | Information Processing Letters |
Keywords | Field | DocType |
Sliding window,Associative aggregation operator,On-line algorithms,Complexity,Optimality | Discrete mathematics,Combinatorics,Sliding window protocol,Associative property,Theoretical computer science,Operator (computer programming),Mathematics | Journal |
Volume | Issue | ISSN |
115 | 2 | 0020-0190 |
Citations | PageRank | References |
3 | 0.54 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| David A. Basin | 1 | 4930 | 281.93 |
| Felix Klaedtke | 2 | 403 | 23.65 |
| Eugen Zalinescu | 3 | 130 | 9.40 |