| [1] | G. Cormode, J. Thaler, and K. Yi. Verifying computations with streaming interactive proofs. In International Conference on Very Large Data Bases (VLDB), Sept. 2012. |
| [2] | P. Agarwal, G. Cormode, Z. Huang, J. Phillips, Z. Wei, and K. Yi. Mergeable summaries. In ACM Principles of Database Systems (PODS), 2012. |
| [3] | E. Cohen, G. Cormode, and N. Duffield. Don't let the negatives bring you down: Sampling from streams of signed updates. In ACM Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), 2012. |
| [4] | G. Cormode and K. Yi. Tracking distributed aggregates over time-based sliding windows. In Scientific and Statistical Database Management (SSDBM), 2012. |
| [5] | G. Cormode, S. Muthukrishnan, and J. Yan. Scienceography: the study of how science is written. In Proceedings of FUN 2012, 2012. |
| [6] | G. Cormode, M. Procopiuc, D. Srivastava, and T. Tran. Differentially private publication of sparse data. In International Conference on Database Theory, 2012. |
| [7] | G. Cormode, M. Procopiuc, E. Shen, D. Srivastava, and T. Yu. Differentially private spatial decompositions. In International Conference on Data Engineering (ICDE), 2012. |
| [8] | M. Lu, S. Bangalore, G. Cormode, M. Hadjieleftheriou, and D. Srivastava. A dataset search engine for the research document corpus. In International Conference on Data Engineering (ICDE), 2012. |
| [9] | G. Cormode, E. Shen, D. Srivastava, and T. Yu. Aggregate query answering on possibilistic data with cardinality constraints. In International Conference on Data Engineering (ICDE), 2012. |
| [10] | G. Cormode, M. Mitzenmacher, and J. Thaler. Practical verified computation with streaming interactive proofs. In Innovations in Theoretical Computer Science (ITCS), 2012. |
| [11] | G. Cormode. Personal privacy vs population privacy: Learning to attack anonymization. In ACM SIGKDD Conference, Aug. 2011. |
| [12] | P. Agarwal, G. Cormode, Z. Huang, J. Phillips, Z. Wei, and K. Yi. Mergeable coresets. In Third Workshop on Massive Data Algorithmics (MASSIVE), June 2011. |
| [13] | G. Cormode and K. Yi. Tracking distributed aggregates over time-based sliding windows (brief announcement). In ACM Principles of Distributed Computing (PODC), June 2011. |
| [14] | E. Cohen, G. Cormode, and N. Duffield. Structure-aware sampling on data streams. In ACM Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), June 2011. |
| [15] | E. Cohen, G. Cormode, and N. Duffield. Structure-aware sampling: Flexible and accurate summarization. In International Conference on Very Large Data Bases (VLDB), 2011. |
| [16] | G. Cormode, H. Karloff, and T. Wirth. Set cover algorithms for very large datasets. In ACM Conference on Information and Knowledge Management (CIKM), Oct. 2010. |
| [17] | A. Chakrabarti, G. Cormode, R. Kondapally, and A. McGregor. Information cost tradeoffs for augmented index and streaming language recognition. In IEEE Foundations of Computer Science (FOCS), Oct. 2010. |
| [18] | G. Cormode, M. Mitzenmacher, and J. Thaler. Streaming graph computations with a helpful advisor. In European Symposium on Algorithms, Sept. 2010. |
| [19] | G. Cormode, S. Muthukrishnan, K. Yi, and Q. Zhang. Optimal sampling from distributed streams. In ACM Principles of Database Systems (PODS), June 2010. |
| [20] | S. Bhagat, G. Cormode, B. Krishnamurthy, and D. Srivastava. Privacy in dynamic social networks. In World Wide Web Conference (WWW), June 2010. |
| [21] | G. Cormode, N. Li, T. Li, and D. Srivastava. Minimizing minimality and maximizing utility: Analyzing method-based attacks on anonymized data. In International Conference on Very Large Data Bases (VLDB), 2010. |
| [22] | S. Bhagat, G. Cormode, B. Krishnamurthy, and D. Srivastava. Prediction promotes privacy in dynamic social networks. In Workshop on Online Social Networks (WOSN), 2010. |
| [23] | S. Bhagat, G. Cormode, B. Krishnamurthy, and D. Srivastava. Class-based graph anonymization for social network data. In International Conference on Very Large Data Bases (VLDB), 2009. |
| [24] | G. Cormode, A. Deligiannakis, M. Garofalakis, and A. McGregor. Probabilistic histograms for probabilistic data. In International Conference on Very Large Data Bases (VLDB), 2009. |
| [25] | A. Chakrabarti, G. Cormode, and A. McGregor. Annotations in data streams. In International Colloquium on Automata, Languages and Programming (ICALP), 2009. |
| [26] | G. Cormode, L. Golab, F. Korn, A. McGregor, D. Srivastava, and X. Zhang. Estimating the confidence of conditional functional dependencies. In ACM SIGMOD International Conference on Management of Data (SIGMOD), 2009. |
| [27] | R. Berinde, G. Cormode, P. Indyk, and M. Strauss. Space-optimal heavy hitters with strong error bounds. In ACM Principles of Database Systems (PODS), 2009. |
| [28] | G. Cormode, S. Tirthapura, and B. Xu. Time-decayed correlated aggregates over data streams. In SIAM Conference on Data Mining, 2009. |
| [29] | G. Cormode and M. Garofalakis. Histograms and wavelets on probabilistic data. In International Conference on Data Engineering (ICDE), 2009. Best paper award. |
| [30] | G. Cormode, F. Li, and K. Yi. Semantics of ranking queries for probabilistic data and expected ranks. In International Conference on Data Engineering (ICDE), 2009. |
| [31] | G. Cormode, V. Shkapenyuk, D. Srivastava, and B. Xu. Forward decay: A practical time decay model for streaming systems. In International Conference on Data Engineering (ICDE), 2009. |
| [32] | G. Cormode and M. Hadjieleftheriou. Finding frequent items in data streams. In International Conference on Very Large Data Bases (VLDB), 2008. Best paper award. |
| [33] | G. Cormode, D. Srivastava, T. Yu, and Q. Zhang. Anonymizing bipartite graph data using safe groupings. In International Conference on Very Large Data Bases (VLDB), 2008. |
| [34] | G. Cormode, F. Korn, and S. Tirthapura. Time-decaying aggregates in out-of-order streams. In ACM Principles of Database Systems (PODS), 2008. |
| [35] | G. Cormode and A. McGregor. Approximation algorithms for clustering uncertain data. In ACM Principles of Database Systems (PODS), 2008. |
| [36] | G. Cormode, F. Korn, S. Muthukrishnan, and D. Srivastava. Summarizing two-dimensional data with skyline-based statistical descriptors. In Scientific and Statistical Database Management (SSDBM), 2008. |
| [37] | A. Chakrabarti, G. Cormode, and A. McGregor. Robust lower bounds for communication and stream computation. In ACM Symposium on Theory of Computing (STOC), 2008. |
| [38] | G. Cormode, F. Korn, S. Muthukrishnan, and Y. Wu. On signatures for communication graphs. In International Conference on Data Engineering (ICDE), 2008. |
| [39] | G. Cormode, F. Korn, and S. Tirthapura. Exponentially decayed aggregates on data streams. In International Conference on Data Engineering (ICDE), 2008. |
| [40] | G. Cormode, S. Muthukrishnan, and K. Yi. Algorithms for distributed, functional monitoring. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2008. |
| [41] | S. Bhagat, G. Cormode, and I. Rozenbaum. Applying link-based classification to label blogs. In Joint WEBKDD and SNA-KDD Workshop, 2007. |
| [42] | S. Ganguly and G. Cormode. On estimating frequency moments of data streams. In Proceedings of RANDOM, 2007. |
| [43] | G. Cormode, S. Tirthapura, and B. Xu. Time-decaying sketches for sensor data aggregation. In ACM Principles of Distributed Computing (PODC), 2007. |
| [44] | G. Cormode and M. Garofalakis. Sketching probabilistic data streams. In ACM SIGMOD International Conference on Management of Data (SIGMOD), 2007. |
| [45] | 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. |
| [46] | G. Cormode, S. Muthukrishnan, and W. Zhuang. Conquering the divide: Continuous clustering of distributed data streams. In International Conference on Data Engineering (ICDE), 2007. |
| [47] | 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. |
| [48] | G. Cormode and S. Muthukrishnan. Combinatorial algorithms for compressed sensing. In SIROCCO, 2006. This paper is © Springer-Verlag. |
| [49] | 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. |
| [50] | 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. |
| [51] | 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. |
| [52] | 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. |
| [53] | 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. |
| [54] | 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. |
| [55] | 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. |
| [56] | 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. |
| [57] | G. Cormode and S. Muthukrishnan. Summarizing and mining skewed data streams. In SIAM Conference on Data Mining, 2005. This paper is © SIAM. |
| [58] | 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. |
| [59] | G. Cormode and S. Muthukrishnan. Substring compression problems. In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 321-330, 2005. This paper is © SIAM. |
| [60] | 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. |
| [61] | 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. |
| [62] | 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. |
| [63] | 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. |
| [64] | 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. |
| [65] | 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. |
| [66] | 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. |
| [67] | 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. |
| [68] | 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. |
| [69] | G. Cormode and S. Muthukrishnan. Estimating dominance norms of multiple data streams. In European Symposium on Algorithms, volume 2838 of LNCS, 2003. This paper is © Springer-Verlag. |
| [70] | 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. |
| [71] | 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. |
| [72] | 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. |
| [73] | 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. |
| [74] | 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. |
| [75] | 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.