| [1] | K. Prasad, S. Ghosh, G. Cormode, I. Mironov, A. Yousefpour, and P. Stock. Reconciling security and communication efficiency in federated learning. 46(1), 2023. |
| [2] | G. Cormode, Z. Karnin, E. Liberty, J. Thaler, and Veselý. Relative error streaming quantiles. Journal of the ACM (JACM), 70(5):1-48, 2023. |
| [3] | A. Bharadwaj and G. Cormode. Federated computation: a survey of concepts and challenges. Distributed and Parallel Databases, 2023. |
| [4] | G. Cormode, Z. Karnin, E. Liberty, J. Thaler, and Veselý. Relative error streaming quantiles. SIGMOD Record, 51(1):66-79, Mar. 2022. |
| [5] | G. Cormode. Current trends in data summaries. SIGMOD Record, 50(4):6–15, Jan. 2022. |
| [6] | G. Cormode, C. Maple, and M. Scott. Aggregation and transformation of vector-valued messages in the shuffle model of differential privacy. IEEE Trans. Inf. Forensics Secur., 17:612-627, 2022. |
| [7] | G. Cormode, T. Kulkarni, and D. Srivastava. Constrained private mechanisms for count data. IEEE Transactions on Knowledge and Data Engineering, 33(2):415-430, Feb. 2021. |
| [8] | P. Kairouz, H. B. McMahan, B. Avent, A. Bellet, M. Bennis, A. N. Bhagoji, K. A. Bonawitz, Z. Charles, G. Cormode, R. Cummings, R. G. L. D'Oliveira, H. Eichner, S. E. Rouayheb, D. Evans, J. Gardner, Z. Garrett, A. Gascón, B. Ghazi, P. B. Gibbons, M. Gruteser, Z. Harchaoui, C. He, L. He, Z. Huo, B. Hutchinson, J. Hsu, M. Jaggi, T. Javidi, G. Joshi, M. Khodak, J. Konečný, A. Korolova, F. Koushanfar, S. Koyejo, T. Lepoint, Y. Liu, P. Mittal, M. Mohri, R. Nock, A. Özgür, R. Pagh, H. Qi, D. Ramage, R. Raskar, M. Raykova, D. Song, W. Song, S. U. Stich, Z. Sun, A. T. Suresh, F. Tramèr, P. Vepakomma, J. Wang, L. Xiong, Z. Xu, Q. Yang, F. X. Yu, H. Yu, and S. Zhao. Advances and open problems in federated learning. Foundations and Trends in Machine Learning, 14(1-2):1-210, 2021. |
| [9] | K. J. Ahn, G. Cormode, S. Guha, A. McGregor, and A. Wirth. Correlation clustering in data streams. Algorithmica, 83(7):1980-2017, 2021. |
| [10] | G. Cormode and P. Veselý. Streaming algorithms for bin packing and vector scheduling. Theory of Computing Systems, 65(6):916-942, 2021. |
| [11] | A. Chakrabarti, G. Cormode, A. McGregor, J. Thaler, and S. Venktatasubramanian. Verifiable stream computation and Arthur-Merlin communication. SIAM Journal on Computing (SICOMP), 2019. |
| [12] | G. Cormode and H. Jowhari. lp samplers and their applications: A survey. ACM Computing Surveys, 2018. |
| [13] | 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. |
| [14] | J. Zhang, G. Cormode, M. Procopiuc, D. Srivastava, and X. Xiao. Privbayes: Private data release via bayesian networks. ACM Transactions on Database Systems, 2017. |
| [15] | G. Cormode. Data sketching. Communications of the ACM (CACM), 60(9):48-55, 2017. |
| [16] | G. Cormode and H. Jowhari. A second look at counting triangles in graph streams (revised). Theoretical Computer Science, 683:22-30, 2017. |
| [17] | E. Cohen, G. Cormode, N. Duffield, and C. Lund. On the tradeoff between stability and fit. ACM Transactions on Algorithms, 13(1), 2016. |
| [18] | A. Chakrabarti, G. Cormode, and A. McGregor. Robust lower bounds for communication and stream computation. Theory of Computing, 12(10):1-35, 2016. |
| [19] | 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. |
| [20] | 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. |
| [21] | 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. |
| [22] | A. Chakrabarti, G. Cormode, A. McGregor, and J. Thaler. Annotations in data streams. ACM Transactions on Algorithms, 11(1), 2014. |
| [23] | 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. |
| [24] | G. Cormode. What does an associate editor actually do? SIGMOD Record, 42(2):52-58, June 2013. |
| [25] | G. Cormode. The continuous distributed monitoring model. SIGMOD Record, 42(1), Mar. 2013. |
| [26] | 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. |
| [27] | 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. |
| [28] | G. Cormode, Q. Ma, S. Muthukrishnan, and B. Thompson. Socializing the h-index. Journal of Informetrics, 7(3):718 - 721, 2013. |
| [29] | G. Cormode, M. Mitzenmacher, and J. Thaler. Streaming graph computations with a helpful advisor. Algorithmica, 65(2):409-442, 2013. |
| [30] | G. Cormode, S. Muthukrishnan, and J. Yan. Studying the source code of scientific research. SIGKDD Explorations, 14(2):59-62, Dec. 2012. |
| [31] | G. Cormode, S. Muthukrishnan, K. Yi, and Q. Zhang. Continuous sampling from distributed streams. Journal of the ACM (JACM), 59(2), Apr. 2012. |
| [32] | G. Cormode and S. Muthukrishnan. Approximating data with the count-min data structure. IEEE Software, 2012. |
| [33] | G. Cormode, S. Muthukrishnan, and K. Yi. Algorithms for distributed functional monitoring. ACM Transactions on Algorithms, 7(2):1-21, 2011. |
| [34] | 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. |
| [35] | G. Cormode, B. Krishnamurthy, and W. Willinger. A manifesto for modeling and measurement in social media. First Monday, 15(9), Sept. 2010. |
| [36] | G. Cormode and M. Garofalakis. Histograms and wavelets on probabilistic data. IEEE Transactions on Knowledge and Data Engineering, 22(8):1142-1157, Aug. 2010. |
| [37] | 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. |
| [38] | 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. |
| [39] | G. Cormode, D. Srivastava, T. Yu, and Q. Zhang. Anonymizing bipartite graph data using safe groupings. The VLDB Journal, 19(1):115-139, 2010. |
| [40] | G. Cormode and M. Hadjieleftheriou. Methods for finding frequent items in data streams. The VLDB Journal, 19(1):3-20, 2010. |
| [41] | 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. |
| [42] | 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. |
| [43] | 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. |
| [44] | G. Cormode and M. Hadjieleftheriou. Finding the frequent items in streams of data. Communications of the ACM (CACM), 52(10):97-105, 2009. |
| [45] | G. Cormode. How not to review a paper: The tools and techniques of the adversarial reviewer. SIGMOD Record, 37(4):100-104, Dec. 2008. |
| [46] | G. Cormode and B. Krishnamurthy. Key differences between web 1.0 and web 2.0. First Monday, 13(6), June 2008. |
| [47] | G. Cormode and M. Garofalakis. Approximate continuous querying over distributed streams. ACM Transactions on Database Systems, 33(2), June 2008. |
| [48] | 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. |
| [49] | G. Cormode and S. Muthukrishnan. The string edit distance matching problem with moves. ACM Transactions on Algorithms, 3(1), 2007. |
| [50] | G. Cormode and S. Muthukrishnan. What's new: Finding significant differences in network data streams. Transactions on Networking, 13(6):1219-1232, December 2005. |
| [51] | 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. |
| [52] | 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. |
| [53] | G. Cormode. Representations of the research student in popular culture. Annals of Improbable Research, 10(1):26-27, 2004. |
| [54] | 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. |
| [55] | 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.