..and its generalization [2], which finds the (at most) k elements whose frequency is more than 1/(k+1) in the unsorted stream (k=1 being the majority algorithm

..and its generalization [2], which finds the (at most) k elements whose frequency is more than 1/(k+1) in the unsorted stream (k=1 being the majority algorithm in [1].) [2] https://www.cs.bgu.ac.il/~dinitz/Course/SS-12/Karp-frequent-el.pdf https://www.cs.bgu.ac.il/~dinitz/Course/SS-12/Karp-frequent-...