![]() | ![]() |
| 2012 | ||
|---|---|---|
| 112 | Graham Cormode, Michael Mitzenmacher, Justin Thaler: Practical verified computation with streaming interactive proofs. ITCS 2012: 90-112 | |
| 111 | Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang, Jeff M. Phillips, Zhewei Wei, Ke Yi: Mergeable summaries. PODS 2012: 23-34 | |
| 110 | Graham Cormode, S. Muthukrishnan, Jinyun Yun: Scienceography: the study of how science is written CoRR abs/1202.2638: (2012) | |
| 109 | Amit Chakrabarti, Graham Cormode, Andrew McGregor, Justin Thaler: Annotations in Data Streams. Electronic Colloquium on Computational Complexity (ECCC) 19: 22 (2012) | |
| 108 | Graham Cormode, Minos N. Garofalakis, Peter J. Haas, Chris Jermaine: Synopses for Massive Data: Samples, Histograms, Wavelets, Sketches. Foundations and Trends in Databases 4(1-3): 1-294 (2012) | |
| 107 | Graham Cormode, Muthu Muthukrishnan: Approximating Data with the Count-Min Sketch. IEEE Software 29(1): 64-69 (2012) | |
| 106 | Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang: Continuous sampling from distributed streams. J. ACM 59(2): 10 (2012) | |
| 2011 | ||
| 105 | Graham Cormode: Algorithms for Continuous Distributing Monitoring: A survey. AlMoDEP 2011: 1-10 | |
| 104 | Graham Cormode: Personal privacy vs population privacy: learning to attack anonymization. KDD 2011: 1253-1261 | |
| 103 | Graham Cormode, Ke Yi: Tracking distributed aggregates over time-based sliding windows. PODC 2011: 213-214 | |
| 102 | Edith Cohen, Graham Cormode, Nick G. Duffield: Structure-aware sampling on data streams. SIGMETRICS 2011: 197-208 | |
| 101 | Smriti Bhagat, Graham Cormode, S. Muthukrishnan: Node Classification in Social Networks. Social Network Data Analytics 2011: 115-148 | |
| 100 | Graham Cormode, S. Muthukrishnan, Ke Yi: Algorithms for distributed functional monitoring. ACM Transactions on Algorithms 7(2): 21 (2011) | |
| 99 | Smriti Bhagat, Graham Cormode, S. Muthukrishnan: Node Classification in Social Networks CoRR abs/1101.3291: (2011) | |
| 98 | Edith Cohen, Graham Cormode, Nick G. Duffield: Structure-Aware Sampling: Flexible and Accurate Summarization CoRR abs/1102.5146: (2011) | |
| 97 | Graham Cormode, Cecilia Magdalena Procopiuc, Divesh Srivastava, Thanh T. L. Tran: Differentially Private Publication of Sparse Data CoRR abs/1103.0825: (2011) | |
| 96 | Graham Cormode, Magda Procopiuc, Entong Shen, Divesh Srivastava, Ting Yu: Differentially Private Spatial Decompositions CoRR abs/1103.5170: (2011) | |
| 95 | Graham Cormode, Michael Mitzenmacher, Justin Thaler: Practical Verified Computation with Streaming Interactive Proofs CoRR abs/1105.2003: (2011) | |
| 94 | Graham Cormode, Justin Thaler, Ke Yi: Verifying Computations with Streaming Interactive Proofs CoRR abs/1109.6882: (2011) | |
| 93 | Graham Cormode, Michael Mitzenmacher, Justin Thaler: Streaming Graph Computations with a Helpful Advisor. Electronic Colloquium on Computational Complexity (ECCC) 18: 105 (2011) | |
| 92 | Amit Chakrabarti, Graham Cormode, Andrew McGregor: Robust Lower Bounds for Communication and Stream Computation. Electronic Colloquium on Computational Complexity (ECCC) 18: 62 (2011) | |
| 91 | Jeffrey Jestes, Graham Cormode, Feifei Li, Ke Yi: Semantics of Ranking Queries for Probabilistic Data. IEEE Trans. Knowl. Data Eng. 23(12): 1903-1917 (2011) | |
| 90 | Edith Cohen, Graham Cormode, Nick G. Duffield: Structure-Aware Sampling: Flexible and Accurate Summarization. PVLDB 4(11): 819-830 (2011) | |
| 89 | Graham Cormode, Justin Thaler, Ke Yi: Verifying Computations with Streaming Interactive Proofs. PVLDB 5(1): 25-36 (2011) | |
| 2010 | ||
| 88 | Graham Cormode, Howard J. Karloff, Anthony Wirth: Set cover algorithms for very large datasets. CIKM 2010: 479-488 | |
| 87 | Graham Cormode, Michael Mitzenmacher, Justin Thaler: Streaming Graph Computations with a Helpful Advisor. ESA (1) 2010: 231-242 | |
| 86 | Amit Chakrabarti, Graham Cormode, Ranganath Kondapally, Andrew McGregor: Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition. FOCS 2010: 387-396 | |
| 85 | Graham Cormode, Divesh Srivastava: Anonymized Data: Generation, models, usage. ICDE 2010: 1211-1212 | |
| 84 | Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang: Optimal sampling from distributed streams. PODS 2010: 77-86 | |
| 83 | Smriti Bhagat, Graham Cormode, Balachander Krishnamurthy, Divesh Srivastava: Privacy in dynamic social networks. WWW 2010: 1059-1060 | |
| 82 | Radu Berinde, Piotr Indyk, Graham Cormode, Martin J. Strauss: Space-optimal heavy hitters with strong error bounds. ACM Trans. Database Syst. 35(4): 26 (2010) | |
| 81 | Amit Chakrabarti, Graham Cormode, Andrew McGregor: A near-optimal algorithm for estimating the entropy of a stream. ACM Transactions on Algorithms 6(3): (2010) | |
| 80 | Graham Cormode, Michael Mitzenmacher, Justin Thaler: Streaming Graph Computations with a Helpful Advisor CoRR abs/1004.2899: (2010) | |
| 79 | Amit Chakrabarti, Graham Cormode, Ranganath Kondapally, Andrew McGregor: Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition CoRR abs/1004.3304: (2010) | |
| 78 | Graham Cormode: Individual Privacy vs Population Privacy: Learning to Attack Anonymization CoRR abs/1011.2511: (2010) | |
| 77 | Graham Cormode, Justin Thaler, Ke Yi: Verifying Computations with Streaming Interactive Proofs. Electronic Colloquium on Computational Complexity (ECCC) 17: 159 (2010) | |
| 76 | Amit Chakrabarti, Graham Cormode, Ranganath Kondapally, Andrew McGregor: Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition. Electronic Colloquium on Computational Complexity (ECCC) 17: 76 (2010) | |
| 75 | Graham Cormode, Balachander Krishnamurthy, Walter Willinger: A manifesto for modeling and measurement in social media. First Monday 15(9): (2010) | |
| 74 | Graham Cormode, Minos N. Garofalakis: Histograms and Wavelets on Probabilistic Data. IEEE Trans. Knowl. Data Eng. 22(8): 1142-1157 (2010) | |
| 73 | Graham Cormode, Ninghui Li, Tiancheng Li, Divesh Srivastava: Minimizing Minimality and Maximizing Utility: Analyzing Method-based attacks on Anonymized Data. PVLDB 3(1): 1045-1056 (2010) | |
| 72 | Graham Cormode, Divesh Srivastava, Ting Yu, Qing Zhang: Anonymizing bipartite graph data using safe groupings. VLDB J. 19(1): 115-139 (2010) | |
| 71 | Graham Cormode, Marios Hadjieleftheriou: Methods for finding frequent items in data streams. VLDB J. 19(1): 3-20 (2010) | |
| 2009 | ||
| 70 | Amit Chakrabarti, Graham Cormode, Andrew McGregor: Annotations in Data Streams. ICALP (1) 2009: 222-234 | |
| 69 | Graham Cormode, Vladislav Shkapenyuk, Divesh Srivastava, Bojian Xu: Forward Decay: A Practical Time Decay Model for Streaming Systems. ICDE 2009: 138-149 | |
| 68 | Graham Cormode, Minos N. Garofalakis: Histograms and Wavelets on Probabilistic Data. ICDE 2009: 293-304 | |
| 67 | Graham Cormode, Feifei Li, Ke Yi: Semantics of Ranking Queries for Probabilistic Data and Expected Ranks. ICDE 2009: 305-316 | |
| 66 | Radu Berinde, Graham Cormode, Piotr Indyk, Martin J. Strauss: Space-optimal heavy hitters with strong error bounds. PODS 2009: 157-166 | |
| 65 | Graham Cormode, Srikanta Tirthapura, Bojian Xu: Time-Decayed Correlated Aggregates over Data Streams. SDM 2009: 269-280 | |
| 64 | Graham Cormode, Divesh Srivastava: Anonymized data: generation, models, usage. SIGMOD Conference 2009: 1015-1018 | |
| 63 | Graham Cormode, Lukasz Golab, Flip Korn, Andrew McGregor, Divesh Srivastava, Xi Zhang: Estimating the confidence of conditional functional dependencies. SIGMOD Conference 2009: 469-482 | |
| 62 | Graham Cormode: Count-Min Sketch. Encyclopedia of Database Systems 2009: 511-516 | |
| 61 | Ke Yi, Feifei Li, Graham Cormode, Marios Hadjieleftheriou, George Kollios, Divesh Srivastava: Small synopses for group-by query verification on outsourced data streams. ACM Trans. Database Syst. 34(3): (2009) | |
| 60 | Graham Cormode, Marios Hadjieleftheriou: Finding the frequent items in streams of data. Commun. ACM 52(10): 97-105 (2009) | |
| 59 | Graham Cormode, Antonios Deligiannakis, Minos N. Garofalakis, Andrew McGregor: Probabilistic Histograms for Probabilistic Data. PVLDB 2(1): 526-537 (2009) | |
| 58 | Graham Cormode, Divesh Srivastava, Smriti Bhagat, Balachander Krishnamurthy: Class-based graph anonymization for social network data. PVLDB 2(1): 766-777 (2009) | |
| 57 | Graham Cormode, Srikanta Tirthapura, Bojian Xu: Time-decaying Sketches for Robust Aggregation of Sensor Data. SIAM J. Comput. 39(4): 1309-1339 (2009) | |
| 56 | Graham Cormode, Srikanta Tirthapura, Bojian Xu: Time-decayed correlated aggregates over data streams. Statistical Analysis and Data Mining 2(5-6): 294-310 (2009) | |
| 2008 | ||
| 55 | Graham Cormode, Minos N. Garofalakis: Streaming in a connected world: querying and tracking distributed data streams. EDBT 2008: 745 | |
| 54 | Graham Cormode, Flip Korn, Srikanta Tirthapura: Exponentially Decayed Aggregates on Data Streams. ICDE 2008: 1379-1381 | |
| 53 | Graham Cormode, Flip Korn, S. Muthukrishnan, Yihua Wu: On Signatures for Communication Graphs. ICDE 2008: 189-198 | |
| 52 | Graham Cormode, Andrew McGregor: Approximation algorithms for clustering uncertain data. PODS 2008: 191-200 | |
| 51 | Graham Cormode, Flip Korn, Srikanta Tirthapura: Time-decaying aggregates in out-of-order streams. PODS 2008: 89-98 | |
| 50 | Graham Cormode, S. Muthukrishnan, Ke Yi: Algorithms for distributed functional monitoring. SODA 2008: 1076-1085 | |
| 49 | Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava: Summarizing Two-Dimensional Data with Skyline-Based Statistical Descriptors. SSDBM 2008: 42-60 | |
| 48 | Amit Chakrabarti, Graham Cormode, Andrew McGregor: Robust lower bounds for communication and stream computation. STOC 2008: 641-650 | |
| 47 | Graham Cormode, Minos N. Garofalakis: Approximate continuous querying over distributed streams. ACM Trans. Database Syst. 33(2): (2008) | |
| 46 | Graham Cormode, Minos N. Garofalakis: Histograms and Wavelets on Probabilistic Data CoRR abs/0806.1071: (2008) | |
| 45 | Graham Cormode, Balachander Krishnamurthy: Key differences between Web 1.0 and Web 2.0. First Monday 13(6): (2008) | |
| 44 | Graham Cormode, Divesh Srivastava, Ting Yu, Qing Zhang: Anonymizing bipartite graph data using safe groupings. PVLDB 1(1): 833-844 (2008) | |
| 43 | Graham Cormode, Marios Hadjieleftheriou: Finding frequent items in data streams. PVLDB 1(2): 1530-1541 (2008) | |
| 42 | Graham Cormode: How NOT to review a paper: the tools and techniques of the adversarial reviewer. SIGMOD Record 37(4): 100-104 (2008) | |
| 41 | Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava: Finding hierarchical heavy hitters in streaming data. TKDD 1(4): (2008) | |
| 2007 | ||
| 40 | Sumit Ganguly, Graham Cormode: On Estimating Frequency Moments of Data Streams. APPROX-RANDOM 2007: 479-493 | |
| 39 | Graham Cormode, S. Muthukrishnan, Wei Zhuang: Conquering the Divide: Continuous Clustering of Distributed Data Streams. ICDE 2007: 1036-1045 | |
| 38 | Graham Cormode, Srikanta Tirthapura, Bojian Xu: Time-decaying sketches for sensor data aggregation. PODC 2007: 215-224 | |
| 37 | Graham Cormode, Minos N. Garofalakis: Streaming in a connected world: querying and tracking distributed data streams. SIGMOD Conference 2007: 1178-1181 | |
| 36 | Graham Cormode, Minos N. Garofalakis: Sketching probabilistic data streams. SIGMOD Conference 2007: 281-292 | |
| 35 | Amit Chakrabarti, Graham Cormode, Andrew McGregor: A near-optimal algorithm for computing the entropy of a stream. SODA 2007: 328-335 | |
| 34 | Smriti Bhagat, Graham Cormode, Irina Rozenbaum: Applying Link-Based Classification to Label Blogs. WebKDD/SNA-KDD 2007: 97-117 | |
| 33 | Graham Cormode, S. Muthukrishnan: The string edit distance matching problem with moves. ACM Transactions on Algorithms 3(1): (2007) | |
| 2006 | ||
| 32 | Graham Cormode, Minos N. Garofalakis, Dimitris Sacharidis: Fast Approximate Wavelet Tracking on Streams. EDBT 2006: 4-22 | |
| 31 | Graham Cormode, S. Muthukrishnan, Wei Zhuang: What's Different: Distributed, Continuous Monitoring of Duplicate-Resilient Aggregates on Data Streams. ICDE 2006: 57 | |
| 30 | Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava: Space- and time-efficient deterministic algorithms for biased quantiles over data streams. PODS 2006: 263-272 | |
| 29 | Ram Keralapura, Graham Cormode, Jeyashankher Ramamirtham: Communication-efficient distributed monitoring of thresholded counts. SIGMOD Conference 2006: 289-300 | |
| 28 | Graham Cormode, S. Muthukrishnan: Combinatorial Algorithms for Compressed Sensing. SIROCCO 2006: 280-294 | |
| 27 | Graham Cormode, Minos N. Garofalakis: Streaming in a Connected World. VLDB 2006: 1266 | |
| 2005 | ||
| 26 | Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava: Effective Computation of Biased Quantiles over Data Streams. ICDE 2005: 20-31 | |
| 25 | Graham Cormode, S. Muthukrishnan: Space efficient mining of multigraph streams. PODS 2005: 271-282 | |
| 24 | Graham Cormode, S. Muthukrishnan: Summarizing and Mining Skewed Data Streams. SDM 2005 | |
| 23 | Graham Cormode, Minos N. Garofalakis, S. Muthukrishnan, Rajeev Rastogi: Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles. SIGMOD Conference 2005: 25-36 | |
| 22 | Graham Cormode, S. Muthukrishnan: Substring compression problems. SODA 2005: 321-330 | |
| 21 | Graham Cormode, Minos N. Garofalakis: Sketching Streams Through the Net: Distributed Approximate Query Tracking. VLDB 2005: 13-24 | |
| 20 | Graham Cormode, S. Muthukrishnan, Irina Rozenbaum: Summarizing and Mining Inverse Distributions on Data Streams via Dynamic Inverse Sampling. VLDB 2005: 25-36 | |
| 19 | Graham Cormode, S. Muthukrishnan: What's hot and what's not: tracking most frequent items dynamically. ACM Trans. Database Syst. 30(1): 249-278 (2005) | |
| 18 | Graham Cormode, Minos N. Garofalakis: Efficient Strategies for Continuous Distributed Tracking Tasks. IEEE Data Eng. Bull. 28(1): 33-39 (2005) | |
| 17 | Graham Cormode, S. Muthukrishnan: What's new: finding significant differences in network data streams. IEEE/ACM Trans. Netw. 13(6): 1219-1232 (2005) | |
| 16 | Graham Cormode, S. Muthukrishnan: An improved data stream summary: the count-min sketch and its applications. J. Algorithms 55(1): 58-75 (2005) | |
| 2004 | ||
| 15 | Graham Cormode, S. Muthukrishnan: What's New: Finding Significant Differences in Network Data Streams. INFOCOM 2004 | |
| 14 | Graham Cormode, S. Muthukrishnan: An Improved Data Stream Summary: The Count-Min Sketch and Its Applications. LATIN 2004: 29-38 | |
| 13 | Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava: Diamond in the Rough: Finding Hierarchical Heavy Hitters in Multi-Dimensional Data. SIGMOD Conference 2004: 155-166 | |
| 12 | Graham Cormode, Theodore Johnson, Flip Korn, S. Muthukrishnan, Oliver Spatscheck, Divesh Srivastava: Holistic UDAFs at streaming speeds. SIGMOD Conference 2004: 35-46 | |
| 11 | Gultekin Özsoyoglu, Nevzat Hurkan Balkir, Z. Meral Özsoyoglu, Graham Cormode: On Automated Lesson Construction from Electronic Textbooks. IEEE Trans. Knowl. Data Eng. 16(3): 317-331 (2004) | |
| 2003 | ||
| 10 | Graham Cormode, S. Muthukrishnan: Estimating Dominance Norms of Multiple Data Streams. ESA 2003: 148-160 | |
| 9 | Graham Cormode, S. Muthukrishnan: What's hot and what's not: tracking most frequent items dynamically. PODS 2003: 296-306 | |
| 8 | Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava: Finding Hierarchical Heavy Hitters in Data Streams. VLDB 2003: 464-475 | |
| 7 | Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthukrishnan: Comparing Data Streams Using Hamming Norms (How to Zero In). IEEE Trans. Knowl. Data Eng. 15(3): 529-540 (2003) | |
| 2002 | ||
| 6 | Graham Cormode, Piotr Indyk, Nick Koudas, S. Muthukrishnan: Fast Mining of Massive Tabular Data via Approximate Distance Computations. ICDE 2002: 605-614 | |
| 5 | Graham Cormode, S. Muthukrishnan: The string edit distance matching problem with moves. SODA 2002: 667-676 | |
| 4 | Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthukrishnan: Comparing Data Streams Using Hamming Norms (How to Zero In). VLDB 2002: 335-345 | |
| 2001 | ||
| 3 | Graham Cormode, S. Muthukrishnan, Süleyman Cenk Sahinalp: Permutation Editing and Matching via Embeddings. ICALP 2001: 481-492 | |
| 2000 | ||
| 2 | Gultekin Özsoyoglu, Nevzat Hurkan Balkir, Graham Cormode, Z. Meral Özsoyoglu: Electronic Books in Digital Libraries. ADL 2000: 5-14 | |
| 1 | Graham Cormode, Mike Paterson, Süleyman Cenk Sahinalp, Uzi Vishkin: Communication complexity of document exchange. SODA 2000: 197-206 | |
Colors in the list of coauthors
Last update Tue May 29 01:28:40 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page