R. Ahn, S. Guha, and A. Mcgregor, Graph sketches, Proceedings of the 31st symposium on Principles of Database Systems, PODS '12, pp.5-14
DOI : 10.1145/2213556.2213560

Y. Noga-alon, M. Matias, and . Szegedy, The space complexity of approximating the frequency moments, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, STOC '96, pp.20-29, 1996.

L. S. Buriol, G. Frahling, S. Leonardi, A. Marchetti-spaccamela, and C. Sohler, Counting triangles in data streams, Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '06, pp.253-262, 2006.
DOI : 10.1145/1142351.1142388

P. Beame and T. Huynh, The value of multiple read/write streams for approximating frequency moments, ACM Trans. Comput. Theory, vol.36, issue.2, pp.1-622, 2012.

P. Beame, T. S. Jayram, and A. Rudra, Lower bounds for randomized read/write stream algorithms, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , STOC '07, pp.689-698, 2007.
DOI : 10.1145/1250790.1250891

Z. Bar-yossef, R. Kumar, and D. Sivakumar, Reductions in streaming algorithms, with an application to counting triangles in graphs, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, SODA '02, pp.623-632, 2002.

A. Chakrabarti, G. Cormode, R. Kondapally, and A. Mcgregor, Information cost tradeoffs for augmented index and streaming language recognition, Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS '10, pp.387-396, 2010.

E. D. Demaine, A. López-ortiz, and J. I. Munro, Frequency Estimation of Internet Packet Streams with Limited Space, Proceedings of the 10th Annual European Symposium on Algorithms, ESA '02, pp.348-360, 2002.
DOI : 10.1007/3-540-45749-6_33

A. Das-sarma, R. J. Lipton, and D. Nanongkai, Best-order streaming model, Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation, TAMC '09, pp.178-191, 2009.

F. Feigenbaum, S. Kannan, A. Mcgregor, S. Suri, and J. Zhang, Graph distances in the streaming model: the value of space, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, SODA '05, pp.745-754, 2005.

P. Flajolet and G. Martin, Probabilistic counting, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983), pp.76-82, 1983.
DOI : 10.1109/SFCS.1983.46

URL : https://hal.archives-ouvertes.fr/inria-00076244

N. François and F. Magniez, Streaming complexity of checking priority queues, Proceedings of 30th Symposium on Theoretical Aspects of Computer Science, 2013.

M. Grohe, A. Hernich, and N. Schweikardt, Randomized computations on large data sets, Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '06, pp.243-252, 2006.
DOI : 10.1145/1142351.1142387

A. Goel, M. Kapralov, and S. Khanna, On the communication and streaming complexity of maximum bipartite matching, SODA, p.11, 2012.
DOI : 10.1137/1.9781611973099.41

S. Guha and A. Mcgregor, Stream Order and Order Statistics: Quantile Estimation in Random-Order Streams, SIAM Journal on Computing, vol.38, issue.5, pp.2044-2059, 2009.
DOI : 10.1137/07069328X

S. Guha, A. Mcgregor, and S. Venkatasubramanian, Streaming and sublinear approximation of entropy and information distances, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm , SODA '06, pp.733-742, 2006.
DOI : 10.1145/1109557.1109637

V. Guruswami and K. Onak, Superlinear lower bounds for multipass graph processing, 28th IEEE Conference on Computational Complexity, 2013.

J. Gantz and D. Reinsel, Extracting value from chaos, 2011.

M. Grohe and N. Schweikardt, Lower bounds for sorting with few random accesses to external memory, Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '05, pp.238-249, 2005.
DOI : 10.1145/1065167.1065197

V. Bjarni, M. M. Halldórsson, E. Halldórsson, M. Losievskaja, and . Szegedy, Streaming algorithms for independent sets, Proceedings of the 37th international colloquium conference on Automata, languages and programming, ICALP'10, pp.641-652, 2010.

M. R. Henzinger, P. Raghavan, and S. Rajagopalan, External memory algorithms. chapter Computing on data streams, pp.107-118, 1999.

H. Jowhari and M. Ghodsi, New Streaming Algorithms for Counting Triangles in Graphs, In In COCOON, issue.10, pp.710-716, 2005.
DOI : 10.1007/11533719_72

R. Jain and A. Nayak, The space complexity of recognizing well-parenthesized expressions, Electronic Colloquium on Computational Complexity, p.11, 2010.

M. Kapralov, Better bounds for matchings in the streaming model, Proceedings of 24th ACM-SIAM Symposium on Discrete Algorithms, 2013.
DOI : 10.1137/1.9781611973105.121

C. Konrad and F. Magniez, Validating xml documents in the streaming model with external memory, Proceedings of 15th International Conference on Database Theory, p.13, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00580814

C. Konrad, F. Magniez, and C. Mathieu, Maximum matching in semistreaming with few passes, Proceedings of 15th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, p.13, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00647407

M. Daniel, K. Kane, T. Mehlhorn, H. Sauerwald, and . Sun, Counting arbitrary subgraphs in data streams, Lecture Notes in Computer Science, vol.7392, issue.2 10, pp.598-609, 2012.

E. Kushilevitz and N. Nisan, Communication complexity, 1997.

M. Daniel, J. Kane, D. P. Nelson, and . Woodruff, An optimal algorithm for the distinct elements problem, Proceedings of the twenty-ninth ACM SIGMOD-SIGACT- SIGART symposium on Principles of database systems, PODS '10, pp.41-52, 2010.

C. Konrad and A. Rosén, Approximation Semi-Matchings in Streaming and in Two-Party Communication, Proceedings of the 40th international conference on Automata , languages and programming, ICALP'13, p.13, 2013.

C. Konrad, W. Yu, and Q. Zhang, Budget Error-Correcting under Earth-Mover Distance, p.13, 2013.

A. Mcgregor, Finding Graph Matchings in Data Streams, Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques, APPROX'05/RANDOM'05, pp.170-181, 2005.
DOI : 10.1007/11538462_15

F. Magniez, C. Mathieu, and A. Nayak, Recognizing well-parenthesized expressions in the streaming model, Proceedings of 42nd ACM Symposium on Theory of Computing, pp.261-270, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00639623

J. I. Munro and M. S. Paterson, Selection and sorting with limited storage, Proceedings of the 19th Annual Symposium on Foundations of Computer Science, SFCS '78, pp.253-258, 1978.

S. Muthukrishnan, Data streams: algorithms and applications. Found. Trends Theor, Comput . Sci, vol.1, issue.2, pp.117-236, 2005.