|
[1]
|
Smriti Bhagat, Graham Cormode, Balachander Krishnamurthy, and Divesh
Srivastava.
Class-based graph anonymization for social network data.
In International Conference on Very Large Data Bases (VLDB),
2009.
|
|
[2]
|
Graham Cormode, Antonios Deligiannakis, Minos Garofalakis, and Andrew McGregor.
Probabilistic histograms for probabilistic data.
In International Conference on Very Large Data Bases (VLDB),
2009.
|
|
[3]
|
Amit Chakrabarti, Graham Cormode, and Andrew McGregor.
Annotations in data streams.
In International Colloquium on Automata, Languages and
Programming (ICALP), 2009.
|
|
[4]
|
Graham Cormode, Lukasz Golab, Flip Korn, Andrew McGregor, Divesh Srivastava,
and Xi Zhang.
Estimating the confidence of conditional functional dependencies.
In ACM SIGMOD International Conference on Management of Data
(SIGMOD), 2009.
|
|
[5]
|
Radu Berinde, Graham Cormode, Piotr Indyk, and Martin Strauss.
Space-optimal heavy hitters with strong error bounds.
In ACM Principles of Database Systems (PODS), 2009.
|
|
[6]
|
Graham Cormode, Srikanta Tirthapura, and Bojian Xu.
Time-decayed correlated aggregates over data streams.
In SIAM Conference on Data Mining, 2009.
|
|
[7]
|
Graham Cormode and Minos Garofalakis.
Histograms and wavelets on probabilistic data.
In International Conference on Data Engineering (ICDE), 2009.
Best paper award.
|
|
[8]
|
Graham Cormode, Feifei Li, and Ke Yi.
Semantics of ranking queries for probabilistic data and expected
ranks.
In International Conference on Data Engineering (ICDE), 2009.
|
|
[9]
|
Graham Cormode, Vladislav Shkapenyuk, Divesh Srivastava, and Bojian Xu.
Forward decay: A practical time decay model for streaming systems.
In International Conference on Data Engineering (ICDE), 2009.
|
|
[10]
|
Graham Cormode and Marios Hadjieleftheriou.
Finding frequent items in data streams.
In International Conference on Very Large Data Bases (VLDB),
2008.
Best paper award.
|
|
[11]
|
Graham Cormode, Divesh Srivastava, Ting Yu, and Qing Zhang.
Anonymizing bipartite graph data using safe groupings.
In International Conference on Very Large Data Bases (VLDB),
2008.
|
|
[12]
|
Graham Cormode, Flip Korn, and Srikanta Tirthapura.
Time-decaying aggregates in out-of-order streams.
In ACM Principles of Database Systems (PODS), 2008.
|
|
[13]
|
Graham Cormode and Andrew McGregor.
Approximation algorithms for clustering uncertain data.
In ACM Principles of Database Systems (PODS), 2008.
|
|
[14]
|
Graham Cormode, Flip Korn, S. Muthukrishnan, and Divesh Srivastava.
Summarizing two-dimensional data with skyline-based statistical
descriptors.
In Scientific and Statistical Database Management (SSDBM),
2008.
|
|
[15]
|
Amit Chakrabarti, Graham Cormode, and Andrew McGregor.
Robust lower bounds for communication and stream computation.
In ACM Symposium on Theory of Computing (STOC), 2008.
|
|
[16]
|
Graham Cormode, Flip Korn, S. Muthukrishnan, and Yihua Wu.
On signatures for communication graphs.
In International Conference on Data Engineering (ICDE), 2008.
|
|
[17]
|
Graham Cormode, Flip Korn, and Srikanta Tirthapura.
Exponentially decayed aggregates on data streams.
In International Conference on Data Engineering (ICDE), 2008.
|
|
[18]
|
G. Cormode, S. Muthukrishnan, and K. Yi.
Algorithms for distributed, functional monitoring.
In ACM-SIAM Symposium on Discrete Algorithms (SODA),
2008.
|
|
[19]
|
S. Bhagat, G. Cormode, and I. Rozenbaum.
Applying link-based classification to label blogs.
In Joint WEBKDD and SNA-KDD Workshop, 2007.
|
|
[20]
|
S. Ganguly and G. Cormode.
On estimating frequency moments of data streams.
In Proceedings of RANDOM, 2007.
|
|
[21]
|
G. Cormode, S. Tirthapura, and B. Xu.
Time-decaying sketches for sensor data aggregation.
In ACM Principles of Distributed Computing (PODC), 2007.
|
|
[22]
|
G. Cormode and M. Garofalakis.
Sketching probabilistic data streams.
In ACM SIGMOD International Conference on Management of Data
(SIGMOD), 2007.
|
|
[23]
|
S. Bhagat, G. Cormode, S. Muthukrishnan, I. Rozenbaum, and H. Xue.
No blog is an island analyzing connections across information
networks.
In International Conference on Weblogs and Social Media, 2007.
|
|
[24]
|
G. Cormode, S. Muthukrishnan, and W. Zhuang.
Conquering the divide: Continuous clustering of distributed data
streams.
In International Conference on Data Engineering (ICDE), 2007.
|
|
[25]
|
A. Chakrabarti, G. Cormode, and A. McGregor.
A near-optimal algorithm for computing the entropy of a stream.
In ACM-SIAM Symposium on Discrete Algorithms (SODA),
2007.
|
|
[26]
|
G. Cormode and S. Muthukrishnan.
Combinatorial algorithms for compressed sensing.
In SIROCCO, 2006.
This paper is © Springer-Verlag.
|
|
[27]
|
G. Cormode, F. Korn, S. Muthukrishnan, and D. Srivastava.
Space- and time-efficient deterministic algorithms for biased
quantiles over data streams.
In ACM Principles of Database Systems (PODS), 2006.
This paper is © ACM.
|
|
[28]
|
G. Cormode, R. Keralapura, and J. Ramimirtham.
Communication-efficient distributed monitoring of thresholded counts.
In ACM SIGMOD International Conference on Management of Data
(SIGMOD), 2006.
This paper is © ACM.
|
|
[29]
|
G. Cormode, M. Garofalakis, and D. Sacharidis.
Fast approximate wavelet tracking on streams.
In Extending Database Technology, pages 4-22, 2006.
This paper is © Springer-Verlag.
|
|
[30]
|
G. Cormode, S. Muthukrishnan, and W. Zhuang.
What's different: Distributed, continuous monitoring of
duplicate-resilient aggregates on data streams.
In International Conference on Data Engineering (ICDE), pages
20-31, 2006.
This paper is © IEEE.
|
|
[31]
|
G. Cormode, S. Muthukrishnan, and I. Rozenbaum.
Summarizing and mining inverse distributions on data streams via
dynamic inverse sampling.
In International Conference on Very Large Data Bases (VLDB),
pages 25-36, 2005.
This paper is © VLDB.
|
|
[32]
|
G. Cormode and M. Garofalakis.
Sketching streams through the net: Distributed approximate query
tracking.
In International Conference on Very Large Data Bases (VLDB),
pages 13-24, 2005.
|
|
[33]
|
G. Cormode and S. Muthukrishnan.
Space efficient mining of multigraph streams.
In ACM Principles of Database Systems (PODS), pages
271-282, 2005.
This paper is © ACM.
|
|
[34]
|
G. Cormode, M. Garofalakis, S. Muthukrishnan, and R. Rastogi.
Holistic aggregates in a networked world: Distributed tracking of
approximate quantiles.
In ACM SIGMOD International Conference on Management of Data
(SIGMOD), pages 25-36, 2005.
This paper is © ACM.
|
|
[35]
|
G. Cormode and S. Muthukrishnan.
Summarizing and mining skewed data streams.
In SIAM Conference on Data Mining, 2005.
This paper is © SIAM.
|
|
[36]
|
G. Cormode, F. Korn, S. Muthukrishnan, and D. Srivastava.
Effective computation of biased quantiles over data streams.
In International Conference on Data Engineering (ICDE), pages
20-31, 2005.
This paper is © IEEE.
|
|
[37]
|
G. Cormode and S. Muthukrishnan.
Substring compression problems.
In ACM-SIAM Symposium on Discrete Algorithms (SODA),
pages 321-330, 2005.
This paper is © SIAM.
|
|
[38]
|
G. Cormode, F. Korn, S. Muthukrishnan, and D. Srivastava.
Diamond in the rough: Finding hierarchical heavy hitters in
multi-dimensional data.
In ACM SIGMOD International Conference on Management of Data
(SIGMOD), pages 155-166, 2004.
This paper is © ACM.
|
|
[39]
|
G. Cormode, F. Korn, S. Muthukrishnan, T. Johnson, O. Spatscheck, and
D. Srivastava.
Holistic udafs at streaming speeds.
In Proceedings of SIGMOD, pages 35-46, 2004.
This paper is © ACM.
|
|
[40]
|
G. Cormode.
The hardness of the lemmings game, or Oh no, more NP-completeness
proofs.
In Proceedings of Third International Conference on Fun with
Algorithms, pages 65-76, 2004.
|
|
[41]
|
G. Cormode, A. Czumaj, and S. Muthukrishnan.
How to increase the acceptance ratios of top conferences.
In Proceedings of Third International Conference on Fun with
Algorithms, pages 262-273, 2004.
|
|
[42]
|
G. Cormode and S. Muthukrishnan.
What's new: Finding significant differences in network data streams.
In Proceedings of IEEE Infocom, pages 1534-1545, 2004.
This paper is © IEEE.
|
|
[43]
|
G. Cormode and S. Muthukrishnan.
An improved data stream summary: The count-min sketch and its
applications.
In Proceedings of Latin American Theoretical Informatics
(LATIN), pages 29-38, 2004.
This paper is © Springer-Verlag.
|
|
[44]
|
G. Cormode.
Stable distributions for stream computations: it's as easy as 0,1,2.
In Workshop on Management and Processing of Massive Data Streams
at FCRC, 2003.
|
|
[45]
|
G. Cormode and S. Muthukrishnan.
What's hot and what's not: Tracking most frequent items dynamically.
In ACM Principles of Database Systems (PODS), pages
296-306, 2003.
This paper is © ACM.
|
|
[46]
|
G. Cormode, F. Korn, S. Muthukrishnan, and D. Srivastava.
Finding hierarchical heavy hitters in data streams.
In International Conference on Very Large Data Bases (VLDB),
pages 464-475, 2003.
This paper is © VLDB.
|
|
[47]
|
G. Cormode and S. Muthukrishnan.
Estimating dominance norms of multiple data streams.
In Proceedings of the 11th European Symposium on Algorithms
(ESA), volume 2838 of LNCS, 2003.
This paper is © Springer-Verlag.
|
|
[48]
|
G. Cormode, M. Datar, P. Indyk, and S. Muthukrishnan.
Comparing data streams using Hamming norms.
In International Conference on Very Large Data Bases (VLDB),
pages 335-345, 2002.
This paper is © VLDB.
|
|
[49]
|
G. Cormode, P. Indyk, N. Koudas, and S. Muthukrishnan.
Fast mining of tabular data via approximate distance computations.
In International Conference on Data Engineering (ICDE), pages
605-616, 2002.
This paper is © IEEE.
|
|
[50]
|
G. Cormode and S. Muthukrishnan.
The string edit distance matching problem with moves.
In ACM-SIAM Symposium on Discrete Algorithms (SODA),
pages 667-676, 2002.
This paper is © SIAM.
|
|
[51]
|
G. Cormode, S Muthukrishnan, and S. C. Sahinalp.
Permutation editing and matching via embeddings.
In International Colloquium on Automata, Languages and
Programming (ICALP), volume 2076, pages 481-492, 2001.
This paper is © Springer-Verlag.
|
|
[52]
|
G. Cormode, M. Paterson, S. C. Sahinalp, and U. Vishkin.
Communication complexity of document exchange.
In Proceedings of the 11th Symposium on Discrete Algorithms,
pages 197-206, 2000.
This paper is © SIAM.
|
|
[53]
|
G. Ozsoyoglu, N. H. Balkir, G. Cormode, and Z. M. Ozsoyoglu.
Electronic books in digital libraries.
In Proceedings of IEEE Advances in Digital Libraries (ADL),
pages 5-14, 2000.
This paper is © IEEE.
|
|
[1]
|
Ke Yi, Feifei Li, Graham Cormode, Marios Hadjieleftheriou, George Kollios, and
Divesh Srivastava.
Small synopses for group-by query verification on outsourced data
streams.
ACM Transactions on Database Systems, 34(3), 2009.
|
|
[2]
|
Graham Cormode and Marios Hadjieleftheriou.
Finding the frequent items in streams of data.
Communications of the ACM, 52(10):97-105, 2009.
|
|
[3]
|
Graham Cormode.
How not to review a paper: The tools and techniques of the
adversarial reviewer.
SIGMOD Record, 37(4):100-104, December 2008.
|
|
[4]
|
Graham Cormode and Balachander Krishnamurthy.
Key differences between web 1.0 and web 2.0.
First Monday, 13(6), June 2008.
|
|
[5]
|
Graham Cormode and Minos Garofalakis.
Approximate continuous querying over distributed streams.
ACM Transactions on Database Systems, 33(2), June 2008.
|
|
[6]
|
Graham Cormode, Flip Korn, S. Muthukrishnan, and Divesh Srivastava.
Finding hierarchical heavy hitters in streaming data.
ACM Transactions on Knowledge Discovery from Data (TKDD),
1(4), January 2008.
|
|
[7]
|
G. Cormode and S. Muthukrishnan.
The string edit distance matching problem with moves.
ACM Transactions on Algorithms, 3(1), 2007.
|
|
[8]
|
G. Cormode and S. Muthukrishnan.
What's new: Finding significant differences in network data streams.
Transactions on Networking, 13(6):1219-1232, December 2005.
This paper is © IEEE.
|
|
[9]
|
G. Cormode and S. Muthukrishnan.
An improved data stream summary: The count-min sketch and its
applications.
Journal of Algorithms, 55(1):58-75, April 2005.
This paper is © Elsevier.
|
|
[10]
|
G. Cormode and S. Muthukrishnan.
What's hot and what's not: Tracking most frequent items dynamically.
ACM Transactions on Database Systems, 30(1):249-278, March
2005.
This paper is © ACM.
|
|
[11]
|
G. Cormode.
Representations of the research student in popular culture.
Annals of Improbable Research, 10(1):26-27, 2004.
|
|
[12]
|
G. Ozsoyoglu, N. H. Balkir, G. Cormode, and Z. M. Ozsoyoglu.
Electronic books in digital libraries.
IEEE Transactions on Knowledge and Data Engineering,
16(3):317-331, 2004.
This paper is © IEEE.
|
|
[13]
|
G. Cormode, M. Datar, P. Indyk, and S. Muthukrishnan.
Comparing data streams using Hamming norms.
IEEE Transactions on Knowledge and Data Engineering,
15(3):529-541, 2003.
This paper is © IEEE.
|
|
[1]
|
Graham Cormode and Minos Garofalakis.
Histograms and wavelets on probabilistic data.
Technical Report arXiv:0806.1071, arXiv, 2008.
|
|
[2]
|
G. Cormode, F. Korn, and S. Tirthapura.
Time decaying aggregates in out-of-order streams.
Technical Report 2007-10, Center for Discrete Mathematics and
Computer Science (DIMACS), 2007.
|
|
[3]
|
G. Cormode.
Computational fundamentals of analyzing and mining data streams.
In Workshop on Data Stream Analysis. 2007.
|
|
[4]
|
G. Cormode and S. Muthukrishnan.
Combinatorial algorithms for compressed sensing.
In Proceedings of Conference on Information Sciences and Systems
(CISS). 2006.
Invited submission.
|
|
[5]
|
G. Cormode.
Some key concepts in data mining - clustering.
In Discrete Methods in Epidemiology, volume 70 of DIMACS,
pages 2-9. AMS, 2006.
|
|
[6]
|
G. Cormode and M. Garofalakis.
Join sizes, frequency moments, and applications.
In M. Garofalakis, J. Gehrke, and R. Rastogi, editors, Data
Stream Management: Processing High-Speed Data Streams. 2006.
|
|
[7]
|
G. Cormode and P. Indyk.
Stable distributions in streaming computations.
In M. Garofalakis, J. Gehrke, and R. Rastogi, editors, Data
Stream Management: Processing High-Speed Data Streams. 2006.
|
|
[8]
|
G. Cormode and M. Garofalakis.
Efficient strategies for continuous distributed tracking tasks.
In IEEE Data Engineering Bulletin, pages 33-39. IEEE, March
2005.
This paper is © IEEE.
|
|
[9]
|
G. Cormode and S. Muthukrishnan.
Combinatorial algorithms for compressed sensing.
Technical Report 2005-40, Center for Discrete Mathematics and
Computer Science (DIMACS), 2005.
|
|
[10]
|
G. Cormode and S. Muthukrishnan.
Towards an algorithmic theory of compressed sensing.
Technical Report 2005-25, Center for Discrete Mathematics and
Computer Science (DIMACS), 2005.
|
|
[11]
|
G. Cormode, S. Muthukrishnan, and I. Rozenbaum.
Summarizing and mining inverse distributions on data streams via
dynamic inverse sampling.
Technical Report 2005-11, Center for Discrete Mathematics and
Computer Science (DIMACS), 2005.
|
|
[12]
|
G. Cormode.
The hardness of the lemmings game, or, “Oh no, more
NP-Completeness proofs”.
Technical Report 2004-11, Center for Discrete Mathematics and
Computer Science (DIMACS), 2004.
|
|
[13]
|
J. Abello and G. Cormode.
Report on DIMACS working group meeting: Data mining and
epidemiology, March 18-19, 2004.
Technical Report 2004-37, Center for Discrete Mathematics and
Computer Science (DIMACS), 2004.
|
|
[14]
|
G. Cormode, A. Czumaj, and S. Muthukrishnan.
How to increase the acceptance ratios of top conferences.
Technical Report 2004-12, Center for Discrete Mathematics and
Computer Science (DIMACS), 2004.
|
|
[15]
|
G. Cormode and S. Muthukrishnan.
Radial histograms for spatial streams.
Technical Report 2003-11, Center for Discrete Mathematics and
Computer Science (DIMACS), 2003.
|
|
[16]
|
G. Cormode and S. Muthukrishnan.
Estimating dominance norms of multiple data streams.
Technical Report 2002-35, Center for Discrete Mathematics and
Computer Science (DIMACS), 2002.
|
|
[17]
|
G. Cormode and S. Muthukrishnan.
The string edit distance matching problem with moves.
Technical Report 2001-26, Center for Discrete Mathematics and
Computer Science (DIMACS), 2001.
|
|
[18]
|
G. Cormode.
Topic dependencies for electronic books.
(unpublished manuscript), 1999.
|
|
[19]
|
G. Cormode.
Springs and sound layouts.
(unpublished manuscript), 1998.
|
|
[1]
|
Anonymization and uncertainty in social network data, October 2009.
Talk at DBIR Day 2009 at NYU Poly.
|
|
[2]
|
Graham Cormode and Divesh Srivastava.
Anonymized data: Generation, models, usage, July 2009.
Tutorial at SIGMOD 2009.
|
|
[3]
|
Processing graph streams: Upper and lower bounds, June 2009.
Talk at Workshop on Algorithms and Models for Complex Networks,
Bristol UK.
|
|
[4]
|
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.
|
|
[5]
|
On 'selection and sorting with limited storage', September 2008.
Talk at Mike66 Workshop celebrating Mike Paterson.
|
|
[6]
|
Algorithms for distributed functional monitoring, August 2008.
Talk at Dagstuhl Seminar on Sublinear Algorithms.
|
|
[7]
|
Data stream algorithms, July 2008.
Tutorial at Bristol Summer School on Probabilistic Techniques in
Computer Science. Streaming video available.
|
|
[8]
|
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.
|
|
[9]
|
Analyzing web 2.0, blogs and social networks, December 2007.
Talk at AT&T Labs.
|
|
[10]
|
Computational fundamentals of analyzing and mining data streams, March 2007.
Tutorial at Workshop on Data Stream Analysis, Caserta, Italy.
|
|
[11]
|
Computing the entropy of a stream, December 2006.
AT&T Theory Seminar, Bell Labs Theory Seminar, DyDAn Seminar.
|
|
[12]
|
A compact survey of compressed sensing, December 2006.
Workshop on Algorithms for Data Streams, IIT Kanpur, India.
|
|
[13]
|
Biased quantiles, June 2006.
Bertinoro.
|
|
[14]
|
Cluster and data stream analysis, March 2006.
Tutorial at DIMACS Workshop on Data Mining and Epidemiology.
|
|
[15]
|
Tracking inverse distributions of massive data streams, July 2005.
Network Sampling Workshop in Paris, Bell Labs Research Seminar.
|
|
[16]
|
Towards an algorithmic theory of compressed sensing, July 2005.
Schloss Dagstuhl.
|
|
[17]
|
Summarizing and mining skewed data streams, May 2005.
NJIT.
|
|
[18]
|
Algorithms for processing massive data at network line speed, March 2004.
|
|
[19]
|
How hard are computer games?, February 2004.
DIMACS, February 2004.
|
|
[20]
|
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.
|
|
[21]
|
Zeroing in on the l0 metric, August 2003.
DIMACS Workshop on Discrete Metric Spaces and their Algorithmic
Applications at Princeton.
|
|
[22]
|
Tracking frequent items dynamically, 2003.
Institute of Advanced Studies, DIMACS, Stonybrook and U. Penn.
|
|
[23]
|
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.
|
|
[24]
|
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.
|
|
[25]
|
Short string signatures, September 2000.
DIMACS Workshop on Sublinear Algorithms in Princeton, NJ.
|