A simple algorithm for finding frequent elements in streams and bags

We present a simple, exact algorithm for identifying in a multiset the items with frequency more than a threshold . The algorithm requires two passes, linear time, and space 1/. The first pass is a...