Invited Talks

[1] Engineering streaming algorithms, June 2017. Invited talk at Symposium on Experimental Algorithms.
[2] Engineering privacy for small groups, Nov. 2016. Talk at Isaac Newton Institute.
[3] Matching and covering in streaming graphs, Sept. 2016. Invited keynote talk at DISC 2016.
[4] The confounding problem of private data release, Sept. 2016. Invited talk at Heilbronn Conference; WMG; Liverpool University.
[5] Sub-quadratic recovery of correlated pairs, June 2016. Talk at Google Research, Facebook, Simons Institute, Manchester U., LSE.
[6] Compact summaries over large datasets, May 2015. Invited tutorial in PODS 2015 and BICOD 2015.
[7] Trusting the cloud with practical interactive proofs, Apr. 2015. Talk at Google NYC, Bristol, Oxford Algorithms Day, Durham.
[8] The confounding problem of private data release, Mar. 2015. Invited talk at EDBT/ICDT 2015.
[9] Sampling for big data, Aug. 2014. Tutorial at SIGKDD 2014 conference.
[10] Sketches, streaming and big data, July 2014. Summer school on Hashing at University of Copenhagen.
[11] Differentially private mechanisms for data release, March 2014. Talk at Hamilton Institute; Edinburgh University; Yahoo! Research, New York.
[12] Sketch data structures and concentration bounds / mergeable summaries, Sept. 2013. Invited tutorial at Yandex conference.
[13] Streaming, sketching and sufficient statistics, Sept. 2013. Invited tutorial at Big Data Boot Camp, Simons Institute for Theoretical Computer Science, Berkeley.
[14] Summary data structures for massive data, July 2013. Invited talk in Session on Data Streams and Compression, Computability in Europe 2013.
[15] Computing + statistics = data science, June 2013. An introduction to data science for teenagers, IGGY DUX awards, Experience Warwick.
[16] Streaming verification of outsourced computation, May 2013. Talk at Big Data Analytics Workshop, Microsoft Research Cambridge, and University of Warwick.
[17] Building blocks of privacy: Differentially private mechanisms, Apr. 2013. Invited tutorial talk at Privacy Preserving Data Publication and Analysis (PrivDB) workshop.
[18] Privacy and big data: Challenges and promise, Mar. 2013. Invited panel at NYU Abu Dhabi conference on Big Data Systems, Applications, and Privacy.
[19] Current industry trends in computer science research, Mar. 2013. Invited Talk/Panel at NSF Research Experience for Undergraduates PI Meeting.
[20] Data-driven concerns in private data release, Sept. 2012. Talk at Stevens Institute of Technology; AT&T Labs; UMass Amherst; Rutgers University-Newark; Bell Labs; NYU-Abu Dhabi.
[21] Sketches: Past, present and future, 2012. Invited Panel on Sketching and Streaming at SAMSI Workshop, 2012.
[22] Small summaries for Big Data, 2012. Talk at Duke ARO workshop on Big Data at Large; MSR Cambridge; Princeton.
[23] Continuous distributed monitoring: A short survey, Sept. 2011. Invited keynote at Algorithms and Models for Distributed Event Processing (AlMoDEP).
[24] Some sketchy results, May 2011. Talk at DIMACS Workshop on Algorithms in the Field (8F).
[25] Mergeable summaries, Apr. 2011. Talk at Harvard University; DIMACS; Johns Hopkins; University of Pennsylvania; AT&T Labs; Warwick University.
[26] Data anonymization, Mar. 2011. Guest lecture in 'Dealing with Massive Data' at Columbia University.
[27] Distributed summaries, 2011. Talk at DIMACS workshop on Parallelism: a 2020 vision.
[28] G. Cormode and D. Srivastava. Anonymized data: Generation, models, usage, Mar. 2010. Tutorial at ICDE 2010.
[29] Sipping from the firehose: Streaming interactive proofs for verifying computations, February 2010. Invited talk at Bristol Algorithms Days 2010; University of Maryland.
[30] Progress in data anonymization: from k-anonymity to the minimality attack, February 2010. Talk in Bristol.
[31] Anonymization and uncertainty in social network data, Oct. 2009. Invited talk at DBIR Day 2009 at NYU Poly.
[32] G. Cormode and D. Srivastava. Anonymized data: Generation, models, usage, July 2009. Tutorial at SIGMOD 2009.
[33] Processing graph streams: Upper and lower bounds, June 2009. Talk at Workshop on Algorithms and Models for Complex Networks, Bristol UK.
[34] 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.
[35] On 'selection and sorting with limited storage', Sept. 2008. Talk at Mike66 Workshop celebrating Mike Paterson.
[36] Algorithms for distributed functional monitoring, Aug. 2008. Talk at Dagstuhl Seminar on Sublinear Algorithms.
[37] Data stream algorithms, July 2008. Tutorial at Bristol Summer School on Probabilistic Techniques in Computer Science.
[38] 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.
[39] Analyzing web 2.0, blogs and social networks, Dec. 2007. Talk at AT&T Labs.
[40] Computational fundamentals of analyzing and mining data streams, March 2007. Tutorial at Workshop on Data Stream Analysis, Caserta, Italy.
[41] Computing the entropy of a stream, December 2006. AT&T Labs; Bell Labs; DyDAn Center.
[42] A compact survey of compressed sensing, December 2006. Workshop on Algorithms for Data Streams, IIT Kanpur, India.
[43] Biased quantiles, June 2006. Bertinoro.
[44] Cluster and data stream analysis, March 2006. Tutorial at DIMACS Workshop on Data Mining and Epidemiology.
[45] Tracking inverse distributions of massive data streams, July 2005. Network Sampling Workshop in Paris, Bell Labs Research Seminar.
[46] Towards an algorithmic theory of compressed sensing, July 2005. Schloss Dagstuhl.
[47] Summarizing and mining skewed data streams, May 2005. NJIT.
[48] Algorithms for processing massive data at network line speed, March 2004. Talk at U. Iowa; U. Minnesota; Dartmouth; Google; AT&T; CWRU; Poly.
[49] How hard are computer games?, February 2004. Talk at DIMACS.
[50] What's hot, what's not, what's new and what's next, October 2003. Bell Labs; DIMACS Mixer at AT&T Labs.
[51] Zeroing in on the l0 metric, August 2003. DIMACS Workshop on Discrete Metric Spaces and their Algorithmic Applications at Princeton.
[52] Tracking frequent items dynamically, 2003. Institute of Advanced Studies; DIMACS; Stonybrook; U. Pennsylvania.
[53] 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.
[54] Embeddings of metrics on strings and permuations, March 2002. Workshop on Discrete Metric Spaces and their Algorithmic Applications in Haifa, Israel; BCTCS.
[55] Short string signatures, September 2000. DIMACS Workshop on Sublinear Algorithms in Princeton, NJ.

This file was generated by bibtex2html 1.92.