Graham Cormode
According to our database^{1},
Graham Cormode
authored at least 167 papers
between 2000 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org

at dl.acm.org
On csauthors.net:
Bibliography
2019
L_{p} Samplers and Their Applications: A Survey.
ACM Comput. Surv., 2019
Technical perspective: The true cost of popularity.
Commun. ACM, 2019
Independent Sets in VertexArrival Streams.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
2018
CountMin Sketch.
Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018
Marginal Release Under Local Differential Privacy.
Proceedings of the 2018 International Conference on Management of Data, 2018
Privacy at Scale: Local Differential Privacy in Practice.
Proceedings of the 2018 International Conference on Management of Data, 2018
Data Summarization and Distributed Computation.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018
Approximating the CaroWei Bound for Independent Sets in Graph Streams.
Proceedings of the Combinatorial Optimization  5th International Symposium, 2018
Leveraging WellConditioned Bases: Streaming and Distributed Summaries in Minkowski pNorms.
Proceedings of the 35th International Conference on Machine Learning, 2018
Fast Sketchbased Recovery of Correlation Outliers.
Proceedings of the 21st International Conference on Database Theory, 2018
Learning Graphical Models from a Distributed Stream.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018
Constrained Private Mechanisms for Count Data.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018
You Can Check Others' Work More Quickly Than Doing It Yourself.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018
Cheap Checking for Cloud Computing: Statistical Analysis via Annotated Data Streams.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018
2017
Corrigendum to "A second look at counting triangles in graph streams" [Theoret. Comput. Sci. 552 (2014) 4451].
Theor. Comput. Sci., 2017
A second look at counting triangles in graph streams (corrected).
Theor. Comput. Sci., 2017
Data Sketching.
ACM Queue, 2017
Data sketching.
Commun. ACM, 2017
Engineering Streaming Algorithms.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017
The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017
2016
MisraGries Summaries.
Encyclopedia of Algorithms, 2016
CountMin Sketch.
Encyclopedia of Algorithms, 2016
AMS Sketch.
Encyclopedia of Algorithms, 2016
Quantiles over data streams: experimental comparisons, new analyses, and further improvements.
VLDB J., 2016
On the Tradeoff between Stability and Fit.
ACM Trans. Algorithms, 2016
Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams.
Proceedings of the TwentySeventh Annual ACMSIAM Symposium on Discrete Algorithms, 2016
Publishing Attributed Social Graphs with Formal Privacy Guarantees.
Proceedings of the 2016 International Conference on Management of Data, 2016
Stable Distributions in Streaming Computations.
Proceedings of the Data Stream Management  Processing HighSpeed Data Streams, 2016
Join Sizes, Frequency Moments, and Applications.
Proceedings of the Data Stream Management  Processing HighSpeed Data Streams, 2016
2015
Conditional heavy hitters: detecting interesting correlations in data streams.
VLDB J., 2015
DPT: Differentially Private Trajectory Synthesis Using Hierarchical Reference Systems.
PVLDB, 2015
Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015
Parameterized Streaming: Maximal Matching and Vertex Cover.
Proceedings of the TwentySixth Annual ACMSIAM Symposium on Discrete Algorithms, 2015
Private Release of Graph Statistics using Ladder Functions.
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015
Compact Summaries over Large Datasets.
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015
Correlation Clustering in Data Streams.
Proceedings of the 32nd International Conference on Machine Learning, 2015
The Confounding Problem of Private Data Release (Invited Talk).
Proceedings of the 18th International Conference on Database Theory, 2015
Conservative or liberal? Personalized differential privacy.
Proceedings of the 31st IEEE International Conference on Data Engineering, 2015
Verifiable Stream Computation and ArthurMerlin Communication.
Proceedings of the 30th Conference on Computational Complexity, 2015
Streaming Methods in Data Analysis.
Proceedings of the Data Science  30th British International Conference on Databases, 2015
2014
Lightweight Query Authentication on Streams.
ACM Trans. Database Syst., 2014
A second look at counting triangles in graph streams.
Theor. Comput. Sci., 2014
Annotations in Data Streams.
ACM Trans. Algorithms, 2014
Front Matter.
PVLDB, 2014
A unifying framework for ℓ 0sampling algorithms.
Distributed and Parallel Databases, 2014
Modeling collaboration in academia: a game theoretic approach.
Proceedings of the 23rd International World Wide Web Conference, 2014
People like us: mining scholarly data for comparable researchers.
Proceedings of the 23rd International World Wide Web Conference, 2014
Annotations for Sparse Data Streams.
Proceedings of the TwentyFifth Annual ACMSIAM Symposium on Discrete Algorithms, 2014
PrivBayes: private data release via bayesian networks.
Proceedings of the International Conference on Management of Data, 2014
Sampling for big data: a tutorial.
Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014
2013
What does an associate editor actually do?
SIGMOD Record, 2013
The continuous distributed monitoring model.
SIGMOD Record, 2013
Socializing the hindex.
J. Informetrics, 2013
On Interactivity in ArthurMerlin Communication and Stream Computation.
Electronic Colloquium on Computational Complexity (ECCC), 2013
Quantiles over data streams: an experimental study.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2013
Lightweight authentication of linear algebraic queries on data streams.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2013
Accurate and efficient private release of datacubes and contingency tables.
Proceedings of the 29th IEEE International Conference on Data Engineering, 2013
Finding interesting correlations with conditional heavy hitters.
Proceedings of the 29th IEEE International Conference on Data Engineering, 2013
Empirical privacy and empirical utility of anonymized data.
Proceedings of the Workshops Proceedings of the 29th IEEE International Conference on Data Engineering, 2013
UMicS: from anonymized data to usable microdata.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013
First author advantage: citation labeling in research.
Proceedings of the 2013 workshop on Computational scientometrics: theory & applications, 2013
Summary Data Structures for Massive Data.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013
On Unifying the Space of ℓ_{0}Sampling Algorithms.
Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, 2013
2012
Approximating Data with the CountMin Sketch.
IEEE Software, 2012
Studying the source code of scientific research.
SIGKDD Explorations, 2012
LargeScale Distributed Computation (NII Shonan Meeting 20121).
NII Shonan Meet. Rep., 2012
Continuous sampling from distributed streams.
J. ACM, 2012
Synopses for Massive Data: Samples, Histograms, Wavelets, Sketches.
Foundations and Trends in Databases, 2012
Annotations in Data Streams.
Electronic Colloquium on Computational Complexity (ECCC), 2012
Tracking Distributed Aggregates over TimeBased Sliding Windows.
Proceedings of the Scientific and Statistical Database Management, 2012
Don't let the negatives bring you down: sampling from streams of signed updates.
Proceedings of the ACM SIGMETRICS/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, 2012
Mergeable summaries.
Proceedings of the 31st ACM SIGMODSIGACTSIGART Symposium on Principles of Database Systems, 2012
Practical verified computation with streaming interactive proofs.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012
Differentially private summaries for sparse data.
Proceedings of the 15th International Conference on Database Theory, 2012
A Dataset Search Engine for the Research Document Corpus.
Proceedings of the IEEE 28th International Conference on Data Engineering (ICDE 2012), 2012
Aggregate Query Answering on Possibilistic Data with Cardinality Constraints.
Proceedings of the IEEE 28th International Conference on Data Engineering (ICDE 2012), 2012
Differentially Private Spatial Decompositions.
Proceedings of the IEEE 28th International Conference on Data Engineering (ICDE 2012), 2012
Scienceography: The Study of How Science Is Written.
Proceedings of the Fun with Algorithms  6th International Conference, 2012
Sketch Algorithms for Estimating Point Queries in NLP.
Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, 2012
2011
Semantics of Ranking Queries for Probabilistic Data.
IEEE Trans. Knowl. Data Eng., 2011
Verifying Computations with Streaming Interactive Proofs.
PVLDB, 2011
StructureAware Sampling: Flexible and Accurate Summarization.
PVLDB, 2011
Structureaware sampling on data streams.
Proceedings of the SIGMETRICS 2011, 2011
Tracking distributed aggregates over timebased sliding windows.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011
Personal privacy vs population privacy: learning to attack anonymization.
Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011
Algorithms for Continuous Distributing Monitoring: A survey.
Proceedings of the First International Workshop on Algorithms and Models for Distributed Event Processing 2011, 2011
Node Classification in Social Networks.
Proceedings of the Social Network Data Analytics, 2011
2010
Anonymizing bipartite graph data using safe groupings.
VLDB J., 2010
Methods for finding frequent items in data streams.
VLDB J., 2010
Spaceoptimal heavy hitters with strong error bounds.
ACM Trans. Database Syst., 2010
A nearoptimal algorithm for estimating the entropy of a stream.
ACM Trans. Algorithms, 2010
Minimizing Minimality and Maximizing Utility: Analyzing Methodbased attacks on Anonymized Data.
PVLDB, 2010
A manifesto for modeling and measurement in social media.
First Monday, 2010
Verifying Computations with Streaming Interactive Proofs.
Electronic Colloquium on Computational Complexity (ECCC), 2010
Privacy in dynamic social networks.
Proceedings of the 19th International Conference on World Wide Web, 2010
Prediction Promotes Privacy in Dynamic Social Networks.
Proceedings of the 3rd Workshop on Online Social Networks, 2010
Optimal sampling from distributed streams.
Proceedings of the TwentyNinth ACM SIGMODSIGACTSIGART Symposium on Principles of Database Systems, 2010
Anonymized Data: Generation, models, usage.
Proceedings of the 26th International Conference on Data Engineering, 2010
Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010
Streaming Graph Computations with a Helpful Advisor.
Proceedings of the Algorithms, 2010
Set cover algorithms for very large datasets.
Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010
2009
CountMin Sketch.
Proceedings of the Encyclopedia of Database Systems, 2009
Small synopses for groupby query verification on outsourced data streams.
ACM Trans. Database Syst., 2009
Timedecaying Sketches for Robust Aggregation of Sensor Data.
SIAM J. Comput., 2009
Classbased graph anonymization for social network data.
PVLDB, 2009
Probabilistic Histograms for Probabilistic Data.
PVLDB, 2009
Finding the frequent items in streams of data.
Commun. ACM, 2009
Anonymized data: generation, models, usage.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2009
Estimating the confidence of conditional functional dependencies.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2009
TimeDecayed Correlated Aggregates over Data Streams.
Proceedings of the SIAM International Conference on Data Mining, 2009
Spaceoptimal heavy hitters with strong error bounds.
Proceedings of the TwentyEigth ACM SIGMODSIGACTSIGART Symposium on Principles of Database Systems, 2009
Forward Decay: A Practical Time Decay Model for Streaming Systems.
Proceedings of the 25th International Conference on Data Engineering, 2009
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks.
Proceedings of the 25th International Conference on Data Engineering, 2009
Histograms and Wavelets on Probabilistic Data.
Proceedings of the 25th International Conference on Data Engineering, 2009
Annotations in Data Streams.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009
2008
Approximate continuous querying over distributed streams.
ACM Trans. Database Syst., 2008
Finding hierarchical heavy hitters in streaming data.
TKDD, 2008
How NOT to review a paper: the tools and techniques of the adversarial reviewer.
SIGMOD Record, 2008
Anonymizing bipartite graph data using safe groupings.
PVLDB, 2008
Finding frequent items in data streams.
PVLDB, 2008
Key differences between Web 1.0 and Web 2.0.
First Monday, 2008
Robust lower bounds for communication and stream computation.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008
Summarizing TwoDimensional Data with SkylineBased Statistical Descriptors.
Proceedings of the Scientific and Statistical Database Management, 2008
Algorithms for distributed functional monitoring.
Proceedings of the Nineteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2008
Approximation algorithms for clustering uncertain data.
Proceedings of the TwentySeventh ACM SIGMODSIGACTSIGART Symposium on Principles of Database Systems, 2008
Timedecaying aggregates in outoforder streams.
Proceedings of the TwentySeventh ACM SIGMODSIGACTSIGART Symposium on Principles of Database Systems, 2008
Exponentially Decayed Aggregates on Data Streams.
Proceedings of the 24th International Conference on Data Engineering, 2008
On Signatures for Communication Graphs.
Proceedings of the 24th International Conference on Data Engineering, 2008
Streaming in a connected world: querying and tracking distributed data streams.
Proceedings of the EDBT 2008, 2008
2007
A nearoptimal algorithm for computing the entropy of a stream.
Proceedings of the Eighteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2007
Streaming in a connected world: querying and tracking distributed data streams.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2007
Sketching probabilistic data streams.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2007
Timedecaying sketches for sensor data aggregation.
Proceedings of the TwentySixth Annual ACM Symposium on Principles of Distributed Computing, 2007
Applying LinkBased Classification to Label Blogs.
Proceedings of the Advances in Web Mining and Web Usage Analysis, 2007
No Blog is an Island  Analyzing Connections Across Information Networks.
Proceedings of the First International Conference on Weblogs and Social Media, 2007
Conquering the Divide: Continuous Clustering of Distributed Data Streams.
Proceedings of the 23rd International Conference on Data Engineering, 2007
On Estimating Frequency Moments of Data Streams.
Proceedings of the Approximation, 2007
2006
Streaming in a Connected World.
Proceedings of the 32nd International Conference on Very Large Data Bases, 2006
Combinatorial Algorithms for Compressed Sensing.
Proceedings of the Structural Information and Communication Complexity, 2006
Communicationefficient distributed monitoring of thresholded counts.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2006
Space and timeefficient deterministic algorithms for biased quantiles over data streams.
Proceedings of the TwentyFifth ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems, 2006
What's Different: Distributed, Continuous Monitoring of DuplicateResilient Aggregates on Data Streams.
Proceedings of the 22nd International Conference on Data Engineering, 2006
Fast Approximate Wavelet Tracking on Streams.
Proceedings of the Advances in Database Technology, 2006
2005
Efficient Strategies for Continuous Distributed Tracking Tasks.
IEEE Data Eng. Bull., 2005
Summarizing and Mining Inverse Distributions on Data Streams via Dynamic Inverse Sampling.
Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30, 2005
Sketching Streams Through the Net: Distributed Approximate Query Tracking.
Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30, 2005
Substring compression problems.
Proceedings of the Sixteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2005
Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2005
Summarizing and Mining Skewed Data Streams.
Proceedings of the 2005 SIAM International Conference on Data Mining, 2005
Space efficient mining of multigraph streams.
Proceedings of the Twentyfourth ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems, 2005
Effective Computation of Biased Quantiles over Data Streams.
Proceedings of the 21st International Conference on Data Engineering, 2005
2004
On Automated Lesson Construction from Electronic Textbooks.
IEEE Trans. Knowl. Data Eng., 2004
Holistic UDAFs at streaming speeds.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2004
Diamond in the Rough: Finding Hierarchical Heavy Hitters in MultiDimensional Data.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2004
An Improved Data Stream Summary: The CountMin Sketch and Its Applications.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004
What's New: Finding Significant Differences in Network Data Streams.
Proceedings of the Proceedings IEEE INFOCOM 2004, 2004
Selected Data Mining Concepts.
Proceedings of the Discrete Methods in Epidemiology, 2004
2003
Sequence distance embeddings.
PhD thesis, 2003
Finding Hierarchical Heavy Hitters in Data Streams.
Proceedings of 29th International Conference on Very Large Data Bases, 2003
What's hot and what's not: tracking most frequent items dynamically.
Proceedings of the TwentySecond ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems, 2003
Estimating Dominance Norms of Multiple Data Streams.
Proceedings of the Algorithms, 2003
2002
Comparing Data Streams Using Hamming Norms (How to Zero In).
Proceedings of 28th International Conference on Very Large Data Bases, 2002
The string edit distance matching problem with moves.
Proceedings of the Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2002
Fast Mining of Massive Tabular Data via Approximate Distance Computations.
Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA, February 26, 2002
2001
Permutation Editing and Matching via Embeddings.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001
2000
Communication complexity of document exchange.
Proceedings of the Eleventh Annual ACMSIAM Symposium on Discrete Algorithms, 2000
Electronic Books in Digital Libraries.
Proceedings of IEEE Advances in Digital Libraries 2000 (ADL 2000), 2000