Journal Publications

[1] G. Cormode, A. Dasgupta, A. Goyal, and C. H. Lee. An evaluation of multi-probe locality sensitive hashing for computing similarities over web-scale query logs. PLOS ONE, 13(1):e0191175, 2018.
[2] J. Zhang, G. Cormode, M. Procopiuc, D. Srivastava, and X. Xiao. Privbayes: Private data release via bayesian networks. ACM Transactions on Database Systems, 2017.
[3] G. Cormode. Data sketching. Communications of the ACM (CACM), 60(9):48-55, 2017.
[4] G. Cormode and H. Jowhari. A second look at counting triangles in graph streams (revised). Theoretical Computer Science, 683:22-30, 2017.
[5] E. Cohen, G. Cormode, N. Duffield, and C. Lund. On the tradeoff between stability and fit. ACM Transactions on Algorithms, 13(1), 2016.
[6] A. Chakrabarti, G. Cormode, and A. McGregor. Robust lower bounds for communication and stream computation. Theory of Computing, 12(10):1-35, 2016.
[7] G. Luo, L. Wang, K. Yi, and G. Cormode. Quantiles over data streams: experimental comparisons, new analyses, and further improvements. The VLDB Journal, 25(4):449-472, 2016.
[8] K. Mirylenka, G. Cormode, T. Palpanas, and D. Srivastava. Conditional heavy hitters: detecting interesting correlations in data streams. The VLDB Journal, 24(3):395-414, 2015.
[9] S. Papadopoulos, G. Cormode, A. Deligiannakis, and M. N. Garofalakis. Lightweight query authentication on streams. ACM Transactions on Database Systems, 39(4):30:1-30:45, 2015.
[10] A. Chakrabarti, G. Cormode, A. McGregor, and J. Thaler. Annotations in data streams. ACM Transactions on Algorithms, 11(1), 2014.
[11] G. Cormode and D. Firmani. A unifying framework for l0-sampling algorithms. Distributed and Parallel Databases, 32(3):315-335, 2014. Special issue on Data Summarization on Big Data.
[12] G. Cormode. What does an associate editor actually do? SIGMOD Record, 42(2):52-58, June 2013.
[13] G. Cormode. The continuous distributed monitoring model. SIGMOD Record, 42(1), Mar. 2013.
[14] P. K. Agarwal, G. Cormode, Z. Huang, J. M. Phillips, Z. Wei, and K. Yi. Mergeable summaries. ACM Transactions on Database Systems, 38(4):26, 2013.
[15] A. Chakrabarti, G. Cormode, R. Kondapally, and A. McGregor. Information cost tradeoffs for augmented index and streaming language recognition. SIAM Journal on Computing (SICOMP), 42(1):61-83, 2013.
[16] G. Cormode, Q. Ma, S. Muthukrishnan, and B. Thompson. Socializing the h-index. Journal of Informetrics, 7(3):718 - 721, 2013.
[17] G. Cormode, M. Mitzenmacher, and J. Thaler. Streaming graph computations with a helpful advisor. Algorithmica, 65(2):409-442, 2013.
[18] G. Cormode, S. Muthukrishnan, and J. Yan. Studying the source code of scientific research. SIGKDD Explorations, 14(2):59-62, Dec. 2012.
[19] G. Cormode, S. Muthukrishnan, K. Yi, and Q. Zhang. Continuous sampling from distributed streams. Journal of the ACM (JACM), 59(2), Apr. 2012.
[20] G. Cormode and S. Muthukrishnan. Approximating data with the count-min data structure. IEEE Software, 2012.
[21] G. Cormode, S. Muthukrishnan, and K. Yi. Algorithms for distributed functional monitoring. ACM Transactions on Algorithms, 7(2):1-21, 2011.
[22] G. Cormode, J. Jestes, F. Li, and K. Yi. Semantics of ranking queries for probabilistic data. IEEE Transactions on Knowledge and Data Engineering, 23(12):1903-1917, 2011.
[23] G. Cormode, B. Krishnamurthy, and W. Willinger. A manifesto for modeling and measurement in social media. First Monday, 15(9), Sept. 2010.
[24] G. Cormode and M. Garofalakis. Histograms and wavelets on probabilistic data. IEEE Transactions on Knowledge and Data Engineering, 22(8):1142-1157, Aug. 2010.
[25] A. Chakrabarti, G. Cormode, and A. McGregor. A near-optimal algorithm for computing the entropy of a stream. ACM Transactions on Algorithms, 6(3), 2010.
[26] R. Berinde, G. Cormode, P. Indyk, and M. Strauss. Space-optimal heavy hitters with strong error bounds. ACM Transactions on Database Systems, 35(4), 2010.
[27] G. Cormode, D. Srivastava, T. Yu, and Q. Zhang. Anonymizing bipartite graph data using safe groupings. The VLDB Journal, 19(1):115-139, 2010.
[28] G. Cormode and M. Hadjieleftheriou. Methods for finding frequent items in data streams. The VLDB Journal, 19(1):3-20, 2010.
[29] G. Cormode, S. Tirthapura, and B. Xu. Time-decaying sketches for robust aggregation of sensor data. SIAM Journal on Computing (SICOMP), 39(4):1309-1339, 2009.
[30] G. Cormode, S. Tirthapura, and B. Xu. Time-decayed correlated aggregates over data streams. Statistical Analysis and Data Mining, 2(5-6):294-310, 2009.
[31] K. Yi, F. Li, G. Cormode, M. Hadjieleftheriou, G. Kollios, and D. Srivastava. Small synopses for group-by query verification on outsourced data streams. ACM Transactions on Database Systems, 34(3), 2009.
[32] G. Cormode and M. Hadjieleftheriou. Finding the frequent items in streams of data. Communications of the ACM (CACM), 52(10):97-105, 2009.
[33] G. Cormode. How not to review a paper: The tools and techniques of the adversarial reviewer. SIGMOD Record, 37(4):100-104, Dec. 2008.
[34] G. Cormode and B. Krishnamurthy. Key differences between web 1.0 and web 2.0. First Monday, 13(6), June 2008.
[35] G. Cormode and M. Garofalakis. Approximate continuous querying over distributed streams. ACM Transactions on Database Systems, 33(2), June 2008.
[36] G. Cormode, F. Korn, S. Muthukrishnan, and D. Srivastava. Finding hierarchical heavy hitters in streaming data. ACM Transactions on Knowledge Discovery from Data (TKDD), 1(4), Jan. 2008.
[37] G. Cormode and S. Muthukrishnan. The string edit distance matching problem with moves. ACM Transactions on Algorithms, 3(1), 2007.
[38] G. Cormode and S. Muthukrishnan. What's new: Finding significant differences in network data streams. Transactions on Networking, 13(6):1219-1232, December 2005.
[39] 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.
[40] 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.
[41] G. Cormode. Representations of the research student in popular culture. Annals of Improbable Research, 10(1):26-27, 2004.
[42] 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.
[43] 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 file was generated by bibtex2html 1.92.