| [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. |
This file was generated by bibtex2html 1.92.