Lap-Kei Lee, H. F. Ting. A simpler and more efficient deterministic scheme for finding frequent items over sliding windows. In Stijn Vansummeren, editor, Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois, USA. pages 290-297, ACM, 2006. [doi]
@inproceedings{LeeT06:1,
title = {A simpler and more efficient deterministic scheme for finding frequent items over sliding windows},
author = {Lap-Kei Lee and H. F. Ting},
year = {2006},
doi = {10.1145/1142351.1142393},
url = {http://doi.acm.org/10.1145/1142351.1142393},
researchr = {https://researchr.org/publication/LeeT06%3A1},
cites = {0},
citedby = {0},
pages = {290-297},
booktitle = {Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois, USA},
editor = {Stijn Vansummeren},
publisher = {ACM},
isbn = {1-59593-318-2},
}