Invited Talks

[1] Some sketchy results, May 2011. Talk at DIMACS Workshop on Algorithms in the Field (8F).
[2] Mergeable summaries, Apr. 2011. Talk at Harvard University, DIMACS, Johns Hopkins, University of Pennsylvania, AT&T Labs.
[3] Data anonymization, Mar. 2011. Guest lecture in 'Dealing with Massive Data' at Columbia University.
[4] Distributed summaries, 2011. Talk at DIMACS workshop on Parallelism: a 2020 vision.
[5] G. Cormode and D. Srivastava. Anonymized data: Generation, models, usage, Mar. 2010. Tutorial at ICDE 2010.
[6] Sipping from the firehose: Streaming interactive proofs for verifying computations, February 2010. Talk at Bristol Algorithms Days 2010; Fort Meade.
[7] Progress in data anonymization: from k-anonymity to the minimality attack, February 2010. Talk in Cheltenham.
[8] Anonymization and uncertainty in social network data, Oct. 2009. Talk at DBIR Day 2009 at NYU Poly.
[9] G. Cormode and D. Srivastava. Anonymized data: Generation, models, usage, July 2009. Tutorial at SIGMOD 2009.
[10] Processing graph streams: Upper and lower bounds, June 2009. Talk at Workshop on Algorithms and Models for Complex Networks, Bristol UK.
[11] Finding frequent items in data streams, March 2009. Talk at DIMACS Working group on Streaming, Coding and Compressive Sensing; AT&T Labs; UMass Amherst; Dartmouth College.
[12] On 'selection and sorting with limited storage', Sept. 2008. Talk at Mike66 Workshop celebrating Mike Paterson.
[13] Algorithms for distributed functional monitoring, Aug. 2008. Talk at Dagstuhl Seminar on Sublinear Algorithms.
[14] Data stream algorithms, July 2008. Tutorial at Bristol Summer School on Probabilistic Techniques in Computer Science. Streaming video available.
[15] G. Cormode and M. Garofalakis. Streaming in a connected world: Querying and tracking distributed data streams, March 2008. Tutorial at VLDB 2006, SIGMOD 2007, EDBT 2008. Partial video available.
[16] Analyzing web 2.0, blogs and social networks, Dec. 2007. Talk at AT&T Labs.
[17] Computational fundamentals of analyzing and mining data streams, March 2007. Tutorial at Workshop on Data Stream Analysis, Caserta, Italy.
[18] Computing the entropy of a stream, December 2006. AT&T Theory Seminar, Bell Labs Theory Seminar, DyDAn Seminar.
[19] A compact survey of compressed sensing, December 2006. Workshop on Algorithms for Data Streams, IIT Kanpur, India.
[20] Biased quantiles, June 2006. Bertinoro.
[21] Cluster and data stream analysis, March 2006. Tutorial at DIMACS Workshop on Data Mining and Epidemiology.
[22] Tracking inverse distributions of massive data streams, July 2005. Network Sampling Workshop in Paris, Bell Labs Research Seminar.
[23] Towards an algorithmic theory of compressed sensing, July 2005. Schloss Dagstuhl.
[24] Summarizing and mining skewed data streams, May 2005. NJIT.
[25] Algorithms for processing massive data at network line speed, March 2004.
[26] How hard are computer games?, February 2004. DIMACS, February 2004.
[27] What's hot, what's not, what's new and what's next, October 2003. Bell Labs, October 2003. A shorter version was given at the DIMACS Mixer at AT&T Labs.
[28] Zeroing in on the l0 metric, August 2003. DIMACS Workshop on Discrete Metric Spaces and their Algorithmic Applications at Princeton.
[29] Tracking frequent items dynamically, 2003. Institute of Advanced Studies, DIMACS, Stonybrook and U. Penn.
[30] Algorithmic embeddings for comparing large text streams, June 2002. CCR/DIMACS Workshop/Tutorial on Mining Massive Data Sets and Streams: Mathematical Methods and Algorithms for Homeland Defense.
[31] Embeddings of metrics on strings and permuations, March 2002. Workshop on Discrete Metric Spaces and their Algorithmic Applications in Haifa, Israel, March 2002. A short version of this talk was also given at BCTCS.
[32] Short string signatures, September 2000. DIMACS Workshop on Sublinear Algorithms in Princeton, NJ.

This file was generated by bibtex2html 1.92.