32 citations · 74 across the 12 of their papers we have counts for
9 papers · 1 filter
Parallel Streaming Random Sampling
Kanat Tangwongsan, Srikanta Tirthapura
This paper investigates parallel random sampling from a potentially-unending data stream whose elements are revealed in a series of element sequences (minibatches). While sampling…
Weighted Reservoir Sampling from Distributed Streams
Rajesh Jayaram, Gokarna Sharma, Srikanta Tirthapura +1
We consider message-efficient continuous random sampling from a distributed stream, where the probability of inclusion of an item in the sample is proportional to a weight associat…
FLEET: Butterfly Estimation from a Bipartite Graph Stream
Seyed-Vahid Sanei-Mehri, Yu Zhang, Ahmet Erdem Sariyuce +1
We consider space-efficient single-pass estimation of the number of butterflies, a fundamental bipartite graph motif, from a massive bipartite graph stream where each edge represen…
Enumerating Top-k Quasi-Cliques
Seyed-Vahid Sanei-Mehri, Apurba Das, Srikanta Tirthapura
Quasi-cliques are dense incomplete subgraphs of a graph that generalize the notion of cliques. Enumerating quasi-cliques from a graph is a robust way to detect densely connected st…
Shared-Memory Parallel Maximal Clique Enumeration
Apurba Das, Seyed-Vahid Sanei-Mehri, Srikanta Tirthapura
We present shared-memory parallel methods for Maximal Clique Enumeration (MCE) from a graph. MCE is a fundamental and well-studied graph analytics task, and is a widely used primit…
A Change-Sensitive Algorithm for Maintaining Maximal Bicliques in a Dynamic Bipartite Graph
Apurba Das, Srikanta Tirthapura
We consider the maintenance of maximal bicliques from a dynamic bipartite graph that changes over time due to the addition or deletion of edges. When the set of edges in a graph ch…
Streaming k-Means Clustering with Fast Queries
Yu Zhang, Kanat Tangwongsan, Srikanta Tirthapura
We present methods for k-means clustering on a stream with a focus on providing fast responses to clustering queries. Compared to the current state-of-the-art, our methods provide…
Work-Efficient Parallel and Incremental Graph Connectivity
Natcha Simsiri, Kanat Tangwongsan, Srikanta Tirthapura +1
On an evolving graph that is continuously updated by a high-velocity stream of edges, how can one efficiently maintain if two vertices are connected? This is the connectivity probl…
Incremental Maintenance of Maximal Cliques in a Dynamic Graph
Apurba Das, Michael Svendsen, Srikanta Tirthapura
We consider the maintenance of the set of all maximal cliques in a dynamic graph that is changing through the addition or deletion of edges. We present nearly tight bounds on the m…