1. Arasu, A., Manku, G.: Approximate counts and quantiles over sliding windows. In: Proc. ACM Symposium on Principles of Database Systems (PODS), pp. 286–296. ACM Press, New York (2004)
2. Babcock, B., et al.: Maintaining variance and k-medians over data stream windows. In: Proc. 22nd ACM Symp. on Principles of Database Systems (PODS), June 2003, pp. 234–243. ACM Press, New York (2003)
3. Busch, C., Tirthapura, S.: A deterministic algorithm for summarizing asynchronous streams over a sliding window. Technical report, Iowa State University (2006), Available at
http://archives.ece.iastate.edu/view/year/2006.html
4. Cormode, G., et al.: Space- and time-efficient deterministic algorithms for biased quantiles over data streams. In: Proc. ACM Symposium on Principles of Database Systems, pp. 263–272. ACM Press, New York (2006)
5. Datar, M., et al.: Maintaining stream statistics over sliding windows. SIAM Journal on Computing 31(6), 1794–1813 (2002)