1. Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 319–327 (1990)
2. Cormode, G., Hadjieleftheriou, M.: Methods for finding frequent items in data streams. VLDB J. (2009).
https://doi.org/10.10007/s00778-009-0172-z
. Unpaginated
3. Boyer, S., Moore, J.: A fast majority vote algorithm. Technical report ICSCA-CMP-32, Institute for Computer Science, University of Texas (1981)
4. Lecture Notes in Computer Science;ED Demaine,2002
5. Karp, R., Papadimitriou, C., Shenker, S.: A simple algorithm for finding frequent elements in sets and bags. ACM Trans. Database Syst. 28, 51–55 (2003)