Graham Cormode

Publications

• AMS Sketch
• Misra-Gries Summaries
• Continuous sampling from distributed streams
• A second look at counting triangles in graph streams (corrected)
• What does an associate editor actually do?
• Parameterized Streaming: Maximal Matching and Vertex Cover
• On the Tradeoff between Stability and Fit
• PrivBayes
• L p Samplers and Their Applications
• A second look at counting triangles in graph streams
• An evaluation of multi-probe locality sensitive hashing for computing similarities over web-scale query logs
• AMS Sketch
• The continuous distributed monitoring model
• Count-Min Sketch
• Misra-Gries Summaries
• Count-Min Sketch
• Data sketching
• Approximating Data with the Count-Min Sketch
• Differentially Private Spatial Decompositions
• Studying the source code of scientific research
• Streaming Methods in Data Analysis
• First author advantage
• Join Sizes, Frequency Moments, and Applications
• Stable Distributions in Streaming Computations
• A Dataset Search Engine for the Research Document Corpus
• UMicS
• Corrigendum to “A second look at counting triangles in graph streams” [Theoret. Comput. Sci. 552 (2014) 44–51]
• People like us
• Modeling collaboration in academia
• Quantiles over data streams
• Mergeable summaries
• Summary Data Structures for Massive Data
• DPT
• Sampling for big data
• Socializing the h-index
• Conservative or liberal? Personalized differential privacy
• Aggregate Query Answering on Possibilistic Data with Cardinality Constraints
• Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition
• Lightweight authentication of linear algebraic queries on data streams
• Annotations for Sparse Data Streams
• On Unifying the Space of ℓ0-Sampling Algorithms
• Don't let the negatives bring you down
• A unifying framework for ℓ 0-sampling algorithms
• Privacy at Scale
• Mergeable summaries
• Conditional heavy hitters: detecting interesting correlations in data streams
• Don't let the negatives bring you down
• Accurate and efficient private release of datacubes and contingency tables
• Empirical privacy and empirical utility of anonymized data
• Correlation Clustering in Data Streams
• Exponentially Decayed Aggregates on Data Streams
• Histograms and Wavelets on Probabilistic Data
• Finding frequent items in data streams
• Streaming in a connected world
• Algorithms for Next Generation Networks
• Key differences between Web 1.0 and Web 2.0
• Approximate continuous querying over distributed streams
• On Signatures for Communication Graphs
• Verifying computations with streaming interactive proofs
• Conquering the Divide: Continuous Clustering of Distributed Data Streams
• Anonymized Data: Generation, models, usage
• Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
• How NOT to review a paper
• Privacy in dynamic social networks
• The string edit distance matching problem with moves
• Structure-aware sampling on data streams
• Streaming Graph Computations with a Helpful Advisor
• Algorithms for distributed functional monitoring
• Finding the frequent items in streams of data
• Discrete Methods in Epidemiology
• Time-decayed correlated aggregates over data streams
• Selected data mining concepts
• Streaming in a connected world
• Synopses for Massive Data: Samples, Histograms, Wavelets, Sketches
• Semantics of Ranking Queries for Probabilistic Data
• Optimal sampling from distributed streams
• Methods for finding frequent items in data streams
• Space-optimal heavy hitters with strong error bounds
• Estimating the confidence of conditional functional dependencies
• Probabilistic histograms for probabilistic data
• Anonymized data
• Continuous distributed monitoring
• A manifesto for modeling and measurement in social media
• Practical verified computation with streaming interactive proofs
• Annotations in Data Streams
• Anonymizing bipartite graph data using safe groupings
• Time-Decayed Correlated Aggregates over Data Streams
• Approximation algorithms for clustering uncertain data
• Set cover algorithms for very large datasets
• Forward Decay: A Practical Time Decay Model for Streaming Systems
• Personal privacy vs population privacy
• Anonymizing bipartite graph data using safe groupings
• Finding hierarchical heavy hitters in streaming data
• Small synopses for group-by query verification on outsourced data streams
• Class-based graph anonymization for social network data
• Minimizing minimality and maximizing utility
• A near-optimal algorithm for estimating the entropy of a stream
• Streaming Graph Computations with a Helpful Advisor
• Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition
• Semantics of Ranking Queries for Probabilistic Data
• Edit Distance Under Block Operations, 2000; Cormode, Paterson, Sahinalp, Vishkin 2000; Muthukrishnan, Sahinalp
• Combinatorial Algorithms for Compressed Sensing
• The string edit distance matching problem with moves
• Combinatorial Algorithms for Compressed Sensing
• Time-decaying sketches for sensor data aggregation
• Finding Hierarchical Heavy Hitters in Data Streams
• Sketching probabilistic data streams
• Fast Approximate Wavelet Tracking on Streams
• What's hot and what's not
• Holistic aggregates in a networked world
• What's hot and what's not: tracking most frequent items dynamically
• Comparing Data Streams Using Hamming Norms (How to Zero In)
• Holistic UDAFs at streaming speeds
• Summarizing and Mining Skewed Data Streams
• An improved data stream summary: the count-min sketch and its applications
• What's new: Finding significant differences in network data streams
• Communication-efficient distributed monitoring of thresholded counts
• Space- and time-efficient deterministic algorithms for biased quantiles over data streams
• Estimating Dominance Norms of Multiple Data Streams
• An Improved Data Stream Summary: The Count-Min Sketch and Its Applications
• What's new: finding significant differences in network data streams
• Comparing data streams using hamming norms (how to zero in)
• Applications of Sketching and Pathways to Impact
• PrivLava: Synthesizing Relational Data with Foreign Keys under Differential Privacy
• Relative Error Streaming Quantiles
• Interactive Proofs For Differentially Private Counting
• Federated computation: a survey of concepts and challenges