| Publication | Date of Publication | Type |
|---|
Time-decayed correlated aggregates over data streams
Statistical Analysis and Data Mining | 2024-11-21 | Paper |
Space‐efficient tracking of persistent items in a massive data stream
Statistical Analysis and Data Mining: The ASA Data Science Journal | 2020-10-14 | Paper |
Parallel streaming random sampling
Lecture Notes in Computer Science | 2020-07-20 | Paper |
Identifying correlated heavy-hitters in a two-dimensional data stream
Data Mining and Knowledge Discovery | 2019-05-03 | Paper |
| Work-efficient parallel union-find with applications to incremental graph connectivity | 2018-01-11 | Paper |
Space-efficient estimation of statistics over sub-sampled streams
Algorithmica | 2016-03-29 | Paper |
Competitive concurrent distributed queuing
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing | 2016-03-04 | Paper |
Optimality of clustering properties of space-filling curves
ACM Transactions on Database Systems | 2016-03-02 | Paper |
A general method for estimating correlated aggregates over a data stream
Algorithmica | 2015-10-19 | Paper |
Sketching asynchronous streams over a sliding window
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Sparse covers for planar graphs and graphs that exclude a fixed minor
Algorithmica | 2014-07-03 | Paper |
Time-decaying sketches for sensor data aggregation
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Improved sparse covers for graphs excluding a fixed minor
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Approximate covering detection among content-based subscriptions using space filling curves
Journal of Parallel and Distributed Computing | 2013-08-22 | Paper |
Approximate covering detection among content-based subscriptions using space filling curves
Journal of Parallel and Distributed Computing | 2013-08-22 | Paper |
Sketching asynchronous data streams over sliding windows
Distributed Computing | 2013-06-20 | Paper |
Self-stabilizing smoothing and balancing networks
Distributed Computing | 2013-06-13 | Paper |
Identifying frequent items in a network using gossip
Journal of Parallel and Distributed Computing | 2012-03-07 | Paper |
Optimal Random Sampling from Distributed Streams Revisited
Lecture Notes in Computer Science | 2011-10-28 | Paper |
Concurrent counting is harder than queuing
Theoretical Computer Science | 2010-11-11 | Paper |
Time-decaying sketches for robust aggregation of sensor data
SIAM Journal on Computing | 2010-09-06 | Paper |
A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
STACS 2007 | 2007-09-03 | Paper |
Dynamic analysis of the arrow distributed protocol
Theory of Computing Systems | 2007-01-25 | Paper |
Randomized smoothing networks
Journal of Parallel and Distributed Computing | 2006-08-04 | Paper |
Analysis of Link Reversal Routing Algorithms
SIAM Journal on Computing | 2006-06-01 | Paper |
Distributed streams algorithms for sliding windows
Theory of Computing Systems | 2005-02-08 | Paper |
| scientific article; zbMATH DE number 2006654 (Why is no real title available?) | 2003-11-23 | Paper |
| scientific article; zbMATH DE number 1445367 (Why is no real title available?) | 2000-05-10 | Paper |
