Database Paper Browser

Back to papers

Variance Estimation over Sliding Windows

Summary: First work to close the complexity gap for ε-approximate variance over sliding windows, improving on prior O(1/ε^2 · log N) space vs. the Ω(1/ε · log N) lower bound. Achieves optimal O(1/ε · log N) space and O(1) worst-case update time. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1432
Venue
PODS
Year
2007
Pagerank
4.1945683e-05
Overall Rank
12,435 | 13.50%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers