Conference Publications

[1] G. Cormode, H. Jowhari, M. Monemizadeh, and S. Muthukrishnan. Streaming algorithms for matching size estimation in sparse graphs. In European Symposium on Algorithms, 2017.
[2] Z. Jorgensen, T. Yu, and G. Cormode. Publishing attributed social graphs with formal privacy guarantees. In ACM SIGMOD International Conference on Management of Data (SIGMOD), pages 107-122, 2016.
[3] R. Chitnis, G. Cormode, H. Esfandiari, M. Hajiaghayi, A. McGregor, M. Monemizadeh, and S. Vorotnikova. Kernelization via sampling with applications to dynamic graph streams. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2016.
[4] K. J. Ahn, G. Cormode, S. Guha, A. McGregor, and A. Wirth. Correlation clustering in data streams. In International Conference on Machine Learning, ICML, pages 2237-2246, 2015.
[5] X. He, G. Cormode, A. Machanavajjhala, C. M. Procopiuc, and D. Srivastava. DPT: differentially private trajectory synthesis using hierarchical reference systems. In Proceedings of the VLDB Endowment, volume 8, pages 1154-1165, 2015.
[6] R. Chitnis, G. Cormode, H. Esfandiari, M. Hajiaghayi, and M. Monemizadeh. New streaming algorithms for parameterized maximal matching & beyond. In Symposium on Parallelism in Algorithms, pages 56-58, 2015.
[7] J. Zhang, G. Cormode, M. Procopiuc, D. Srivastava, and X. Xiao. Private release of graph statistics using ladder functions. In ACM SIGMOD International Conference on Management of Data (SIGMOD), 2015.
[8] A. Chakrabarti, G. Cormode, A. McGregor, J. Thaler, and S. Venkatasubramanian. Verifiable stream computation and arthur-merlin communication. In Computational Complexity Conference, 2015.
[9] Z. Jorgensen, T. Yu, and G. Cormode. Conservative or liberal? personalized differential privacy. In International Conference on Data Engineering (ICDE), 2015.
[10] R. Chitnis, G. Cormode, M. Hajiaghayi, and M. Monemizadeh. Parameterized streaming: Maximal matching and vertex cover. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2015.
[11] G. Cormode, M. Procopiuc, D. Srivastava, X. Xiao, and J. Zhang. Privbayes: Private data release via bayesian networks. In ACM SIGMOD International Conference on Management of Data (SIGMOD), 2014.
[12] Q. Ma, S. Muthukrishnan, B. Thompson, and G. Cormode. Modeling collaboration in academia: A game theoretic approach. In WWW Workshop on Big Scholarly Data, 2014.
[13] G. Cormode, S. Muthukrishnan, and J. Yan. People like us: Mining scholarly data for comparable researchers. In WWW Workshop on Big Scholarly Data, 2014.
[14] A. Chakrabarti, G. Cormode, N. Goyal, and J. Thaler. Annotations for sparse data streams. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2014.
[15] G. Cormode, S. Muthukrishnan, and J. Yan. First author advantage: Citation labeling in research. In Proceedings of the Computational Scientometrics: Theory and Applications Workshop at CIKM, 2013.
[16] G. Cormode, X. Gong, C. M. Procopiuc, E. Shen, D. Srivastava, and T. Yu. UMicS: From anonymized data to usable microdata. In ACM Conference on Information and Knowledge Management (CIKM), 2013.
[17] S. Papadopoulos, G. Cormode, A. Deligiannakis, and M. Garofalakis. Lightweight authentication of linear algebraic queries on data streams. In ACM SIGMOD International Conference on Management of Data (SIGMOD), 2013.
[18] L. Wang, G. Luo, K. Yi, and G. Cormode. Quantiles over data streams: An experimental study. In ACM SIGMOD International Conference on Management of Data (SIGMOD), 2013.
[19] G. Cormode, C. M. Procopiuc, E. Shen, D. Srivastava, and T. Yu. Empirical privacy and empirical utility of anonymized data. In Privacy-Preserving Data Publication and Analysis (PrivDB), 2013.
[20] G. Cormode, K. Mirylenka, T. Palpanas, and D. Srivastava. Finding interesting correlations with conditional heavy hitters. In International Conference on Data Engineering (ICDE), 2013.
[21] G. Cormode, C. M. Procopiuc, D. Srivastava, and G. Yaroslavtsev. Accurate and efficient private release of datacubes and contingency tables. In International Conference on Data Engineering (ICDE), 2013.
[22] G. Cormode and D. Firmani. On unifying the space of l0-sampling algorithms. In SIAM Meeting on Algorithm Engineering and Experiments, 2013.
[23] G. Cormode, J. Thaler, and K. Yi. Verifying computations with streaming interactive proofs. In International Conference on Very Large Data Bases (VLDB), Sept. 2012.
[24] A. Goyal, H. Daumé III, and G. Cormode. Sketch algorithms for estimating point queries in NLP. In EMNLP-CoNLL, pages 1093-1103, 2012.
[25] P. Agarwal, G. Cormode, Z. Huang, J. Phillips, Z. Wei, and K. Yi. Mergeable summaries. In ACM Principles of Database Systems (PODS), 2012.
[26] 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.
[27] G. Cormode and K. Yi. Tracking distributed aggregates over time-based sliding windows. In Scientific and Statistical Database Management (SSDBM), 2012.
[28] G. Cormode, S. Muthukrishnan, and J. Yan. Scienceography: the study of how science is written. In Proceedings of the International Conference on Fun with Algorithms (FUN), 2012.
[29] G. Cormode, M. Procopiuc, D. Srivastava, and T. Tran. Differentially private publication of sparse data. In International Conference on Database Theory (ICDT), 2012.
[30] G. Cormode, M. Procopiuc, E. Shen, D. Srivastava, and T. Yu. Differentially private spatial decompositions. In International Conference on Data Engineering (ICDE), 2012.
[31] 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.
[32] 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.
[33] G. Cormode, M. Mitzenmacher, and J. Thaler. Practical verified computation with streaming interactive proofs. In Innovations in Theoretical Computer Science (ITCS), 2012.
[34] P. Agarwal, G. Cormode, Z. Huang, J. Phillips, Z. Wei, and K. Yi. Mergeable coresets. In Third Workshop on Massive Data Algorithmics (MASSIVE), 2011.
[35] G. Cormode. Personal privacy vs population privacy: Learning to attack anonymization. In ACM SIGKDD Conference, 2011.
[36] E. Cohen, G. Cormode, and N. Duffield. Structure-aware sampling: Flexible and accurate summarization. In International Conference on Very Large Data Bases (VLDB), 2011.
[37] G. Cormode and K. Yi. Tracking distributed aggregates over time-based sliding windows (brief announcement). In ACM Principles of Distributed Computing (PODC), 2011.
[38] E. Cohen, G. Cormode, and N. Duffield. Structure-aware sampling on data streams. In ACM Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), 2011.
[39] G. Cormode, H. Karloff, and T. Wirth. Set cover algorithms for very large datasets. In ACM Conference on Information and Knowledge Management (CIKM), 2010.
[40] G. Cormode, S. Muthukrishnan, K. Yi, and Q. Zhang. Optimal sampling from distributed streams. In ACM Principles of Database Systems (PODS), 2010.
[41] S. Bhagat, G. Cormode, B. Krishnamurthy, and D. Srivastava. Privacy in dynamic social networks. In World Wide Web Conference (WWW), 2010.
[42] G. Cormode, M. Mitzenmacher, and J. Thaler. Streaming graph computations with a helpful advisor. In European Symposium on Algorithms, 2010.
[43] 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), 2010.
[44] 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.
[45] S. Bhagat, G. Cormode, B. Krishnamurthy, and D. Srivastava. Prediction promotes privacy in dynamic social networks. In Workshop on Online Social Networks (WOSN), 2010.
[46] 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.
[47] G. Cormode, A. Deligiannakis, M. Garofalakis, and A. McGregor. Probabilistic histograms for probabilistic data. In International Conference on Very Large Data Bases (VLDB), 2009.
[48] A. Chakrabarti, G. Cormode, and A. McGregor. Annotations in data streams. In International Colloquium on Automata, Languages and Programming (ICALP), 2009.
[49] 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.
[50] 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.
[51] G. Cormode, S. Tirthapura, and B. Xu. Time-decayed correlated aggregates over data streams. In SIAM Conference on Data Mining (SDM), 2009.
[52] G. Cormode and M. Garofalakis. Histograms and wavelets on probabilistic data. In International Conference on Data Engineering (ICDE), 2009. Best paper award.
[53] 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.
[54] 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.
[55] G. Cormode and M. Hadjieleftheriou. Finding frequent items in data streams. In International Conference on Very Large Data Bases (VLDB), 2008. Best paper award.
[56] 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.
[57] G. Cormode, F. Korn, and S. Tirthapura. Time-decaying aggregates in out-of-order streams. In ACM Principles of Database Systems (PODS), 2008.
[58] G. Cormode and A. McGregor. Approximation algorithms for clustering uncertain data. In ACM Principles of Database Systems (PODS), 2008.
[59] 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.
[60] A. Chakrabarti, G. Cormode, and A. McGregor. Robust lower bounds for communication and stream computation. In ACM Symposium on Theory of Computing (STOC), 2008.
[61] G. Cormode, F. Korn, S. Muthukrishnan, and Y. Wu. On signatures for communication graphs. In International Conference on Data Engineering (ICDE), 2008.
[62] G. Cormode, F. Korn, and S. Tirthapura. Exponentially decayed aggregates on data streams. In International Conference on Data Engineering (ICDE), 2008.
[63] G. Cormode, S. Muthukrishnan, and K. Yi. Algorithms for distributed, functional monitoring. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2008.
[64] S. Bhagat, G. Cormode, and I. Rozenbaum. Applying link-based classification to label blogs. In Joint WEBKDD and SNA-KDD Workshop, 2007.
[65] S. Ganguly and G. Cormode. On estimating frequency moments of data streams. In Proceedings of RANDOM, 2007.
[66] G. Cormode, S. Tirthapura, and B. Xu. Time-decaying sketches for sensor data aggregation. In ACM Principles of Distributed Computing (PODC), 2007.
[67] G. Cormode and M. Garofalakis. Sketching probabilistic data streams. In ACM SIGMOD International Conference on Management of Data (SIGMOD), 2007.
[68] 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.
[69] G. Cormode, S. Muthukrishnan, and W. Zhuang. Conquering the divide: Continuous clustering of distributed data streams. In International Conference on Data Engineering (ICDE), 2007.
[70] 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.
[71] G. Cormode and S. Muthukrishnan. Combinatorial algorithms for compressed sensing. In SIROCCO, 2006.
[72] 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.
[73] 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.
[74] G. Cormode, M. Garofalakis, and D. Sacharidis. Fast approximate wavelet tracking on streams. In Extending Database Technology, pages 4-22, 2006.
[75] 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.
[76] 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.
[77] 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.
[78] G. Cormode and S. Muthukrishnan. Space efficient mining of multigraph streams. In ACM Principles of Database Systems (PODS), pages 271-282, 2005.
[79] 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.
[80] G. Cormode and S. Muthukrishnan. Summarizing and mining skewed data streams. In SIAM Conference on Data Mining (SDM), 2005.
[81] 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.
[82] G. Cormode and S. Muthukrishnan. Substring compression problems. In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 321-330, 2005.
[83] 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.
[84] G. Cormode, F. Korn, S. Muthukrishnan, T. Johnson, O. Spatscheck, and D. Srivastava. Holistic UDAFs at streaming speeds. In ACM SIGMOD International Conference on Management of Data (SIGMOD), pages 35-46, 2004.
[85] 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.
[86] 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.
[87] G. Cormode and S. Muthukrishnan. What's new: Finding significant differences in network data streams. In Proceedings of IEEE Infocom, pages 1534-1545, 2004.
[88] 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.
[89] 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.
[90] 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.
[91] 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.
[92] G. Cormode and S. Muthukrishnan. Estimating dominance norms of multiple data streams. In European Symposium on Algorithms, volume 2838 of LNCS, 2003.
[93] 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.
[94] 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.
[95] 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.
[96] 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.
[97] G. Cormode, M. Paterson, S. C. Sahinalp, and U. Vishkin. Communication complexity of document exchange. In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 197-206, 2000.
[98] 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 file was generated by bibtex2html 1.92.