1. Aggarwal G, Datar M, Rajagopalan S, Ruhl M. On the streaming model augmented with a sorting primitive. In: Proceedings of the IEEE Symposium on Foundations of Computer Science; 2004. p. 540–9.
2. Bar-Yossef Z, Kumar R, Sivakumar D. Reductions in streaming algorithms, with an application to counting triangles in graphs. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms; 2002. p. 623–32.
3. Buchsbaum AL, Giancarlo R, Westbrook J. On finding common neighborhoods in massive graphs. Theor Comput Sci. 2003;1–3(299):707–18.
4. Buriol LS, Frahling G, Leonardi S, Marchetti-Spaccamela A, Sohler C. Counting triangles in data streams. In: Proceedings of the 25th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 2006. p. 253–62.
5. Chakrabarti A, Cormode G, McGregor A. A near-optimal algorithm for computing the entropy of a stream. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms; 2007. p. 328–35.