A General Method for Estimating Correlated Aggregates Over a Data Stream

article

A General Method for Estimating Correlated Aggregates over a Data Stream

article

A Lower Bound on Proximity Preservation by Space Filling Curves

scholarly article published May 2012

A Simple Message-Optimal Algorithm for Random Sampling from a Distributed Stream

A graph-based formulation for computational characterization of bulk heterojunction morphology

An Evaluation of Streaming Algorithms for Distinct Counting Over a Sliding Window

Analysis of Link Reversal Routing Algorithms

scholarly article by Costas Busch & Srikanta Tirthapura published January 2005 in SIAM Journal on Computing

Approximate covering detection among content-based subscriptions using space filling curves

Computational characterization of bulk heterojunction nanomorphology

Computing Frequent Elements Using Gossip

article

Concurrent counting is harder than queuing

Delay, cost and infrastructure tradeoff of epidemic routing in mobile sensor networks

article published in 2010

Dense subgraph maintenance under streaming edge weight updates for real-time story identification

Distributed Streams Algorithms for Sliding Windows

scholarly article by Phillip B. Gibbons & Srikanta Tirthapura published May 2004 in Theory of Computing Systems

Dynamic Analysis of the Arrow Distributed Protocol

Enumerating Maximal Bicliques from a Large Graph Using MapReduce

article

EvoMiner: frequent subtree mining in phylogenetic databases

article

Exponentially Decayed Aggregates on Data Streams

Finding correlated heavy-hitters over data streams

Identifying correlated heavy-hitters in a two-dimensional data stream

Identifying frequent items in a network using gossip

article

Improved sparse covers for graphs excluding a fixed minor

Incremental Maintenance of Maximal Bicliques in a Dynamic Bipartite Graph

Indexing based on edit-distance matching of shape graphs

Mining maximal cliques from a large graph using MapReduce: Tackling highly uneven subproblem sizes

Mining maximal cliques from an uncertain graph

Monitoring persistent items in the union of distributed streams

On the optimality of clustering properties of space filling curves

Optimal Random Sampling from Distributed Streams Revisited

article published in 2011

Optimality of Clustering Properties of Space-Filling Curves

Parallel streaming frequency-based aggregates

Parallel triangle counting in massive streaming graphs

Randomized smoothing networks

Range‐Efficient Counting of Distinct Elements in a Massive Data Stream

Rectangle-efficient aggregation in spatial data streams

Self-stabilizing smoothing and balancing networks

Sketching asynchronous data streams over sliding windows

Space-Efficient Estimation of Statistics Over Sub-Sampled Streams

Space-efficient estimation of statistics over sub-sampled streams

Space-efficient tracking of persistent items in a massive data stream

Space-efficient tracking of persistent items in a massive data stream

Sparse Covers for Planar Graphs and Graphs that Exclude a Fixed Minor

article published in 2013

Time-decayed correlated aggregates over data streams

Time-decaying Sketches for Robust Aggregation of Sensor Data

Time-decaying aggregates in out-of-order streams

Time-decaying sketches for sensor data aggregation

Variance-Reduced Stochastic Gradient Descent on Streaming Data ⬇️

Wireless sensor deployment for 3D coverage with constraints