GoKawiilBlog post revives 'two-stack' algorithm for sliding-window aggregation
A developer's blog post explains a 'two-stack' method for computing sliding-window aggregations—such as minimum, maximum, or quantiles—that works even when the aggregation operator has no inverse. The technique, drawn from a paper by Tangwongsan et al. on low-latency sliding-window aggregation, achieves amortized constant-time updates using two stacks instead of a double-ended queue, and the author says it renders their own earlier six-year-old min/max algorithm obsolete.