Finding frequent items over sliding windows with constant update time
type: Item
instance of: scholarly article
title: Finding frequent items over sliding windows with constant update time
zbMATH Open document ID: 1209.68661
author: Regant Y. S. Hung
author: Lap-Kei Lee
author: Hing-Fung Ting
published in: Information Processing Letters
publication date: 2010-09-07T00:00:00Z
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5780812
zbMATH Keywords: approximation algorithms
zbMATH Keywords: on-line algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.01.027
OpenAlex ID: W2128785438
cites work: An improved data stream summary: the count-min sketch and its applications
cites work: Q4411371
cites work: CR-precis: A Deterministic Summary Structure for Update Data Streams
cites work: Finding repeated elements
DOI: 10.1016/J.IPL.2009.01.027
description: scientific article; zbMATH DE number 5780812