Srikanta Tirthapura

IEEE Trans. Knowl. Data Eng., 2022

2021

Mining Largest Maximal Quasi-Cliques.

[BibT_eX]

[DOI]

Hooman Hashemi

ACM Trans. Knowl. Discov. Data, 2021

Stratified random sampling from streaming and stored data.

[BibT_eX]

[DOI]

Distributed Parallel Databases, 2021

DriftSurf: Stable-State / Reactive-State Learning under Concept Drift.

[BibT_eX]

[DOI]

Ashraf Tahmasbi

Ellango Jothimurugesan

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

Shared-memory Parallel Maximal Clique Enumeration from Static and Dynamic Graphs.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2020

DriftSurf: A Risk-competitive Learning Algorithm under Concept Drift.

[BibT_eX]

[DOI]

Ashraf Tahmasbi

Ellango Jothimurugesan

CoRR, 2020

Random Sampling for Group-By Queries.

[BibT_eX]

[DOI]

Trong Duc Nguyen

Ming-Hung Shih

Sai Sree Parvathaneni

Divesh Srivastava

Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

2019

Incremental maintenance of maximal cliques in a dynamic graph.

[BibT_eX]

[DOI]

Michael Svendsen

VLDB J., 2019

Scalable Subgraph Counting: The Methods Behind The Madness.

[BibT_eX]

[DOI]

Seshadhri Comandur

Proceedings of the Companion of The 2019 World Wide Web Conference, 2019

Weighted Reservoir Sampling from Distributed Streams.

[BibT_eX]

[DOI]

Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

Shared-Memory Parallel Maximal Biclique Enumeration.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on High Performance Computing, 2019

Parallel Streaming Random Sampling.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2019: Parallel Processing, 2019

Stratified Random Sampling over Streaming and Stored Data.

[BibT_eX]

[DOI]

Proceedings of the Advances in Database Technology, 2019

FLEET: Butterfly Estimation from a Bipartite Graph Stream.

[BibT_eX]

[DOI]

Ahmet Erdem Sariyüce

Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

2018

Stream Sampling.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

Incremental Maintenance of Maximal Bicliques in a Dynamic Bipartite Graph.

[BibT_eX]

[DOI]

IEEE Trans. Multi Scale Comput. Syst., 2018

HYDRA: A Dynamic Big Data Regenerator.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2018

Counting Butterfies from a Large Bipartite Graph Stream.

[BibT_eX]

[DOI]

Ahmet Erdem Sariyüce

CoRR, 2018

Variance-Optimal Offline and Streaming Stratified Random Sampling.

[BibT_eX]

[DOI]

CoRR, 2018

Work-efficient parallel union-find.

[BibT_eX]

[DOI]

Concurr. Comput. Pract. Exp., 2018

Variance-Reduced Stochastic Gradient Descent on Streaming Data.

[BibT_eX]

[DOI]

Ellango Jothimurugesan

Ashraf Tahmasbi

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Butterfly Counting in Bipartite Networks.

[BibT_eX]

[DOI]

Ahmet Erdem Sariyüce

Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

V2V: Vector Embedding of a Graph and Applications.

[BibT_eX]

[DOI]

Trong Duc Nguyen

Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium Workshops, 2018

Learning Graphical Models from a Distributed Stream.

[BibT_eX]

[DOI]

Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

Onion Curve: A Space Filling Curve with Near-Optimal Clustering.

[BibT_eX]

[DOI]

Cuong Nguyen

Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

Shared-Memory Parallel Maximal Clique Enumeration.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Conference on High Performance Computing, 2018

Scalable and Dynamic Regeneration of Big Data Volumes.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Extending Database Technology, 2018

Enumerating Top-k Quasi-Cliques.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Big Data (IEEE BigData 2018), 2018

2017

Enumerating Maximal Bicliques from a Large Graph Using MapReduce.

[BibT_eX]

[DOI]

IEEE Trans. Serv. Comput., 2017

Enumeration of Maximal Cliques from an Uncertain Graph.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2017

Detecting Insider Threats Using RADISH: A System for Real-Time Anomaly Detection in Heterogeneous Data Streams.

[BibT_eX]

[DOI]

IEEE Syst. J., 2017

Streaming Algorithms for k-Means Clustering with Fast Queries.

[BibT_eX]

[DOI]

CoRR, 2017

A Change-Sensitive Algorithm for Maintaining Maximal Bicliques in a Dynamic Bipartite Graph.

[BibT_eX]

[DOI]

CoRR, 2017

Streaming k-Means Clustering with Fast Queries.

[BibT_eX]

[DOI]

Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

2016

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

[BibT_eX]

[DOI]

Yung-Yu Chung

IEEE Trans. Knowl. Data Eng., 2016

Estimating Quantiles from the Union of Historical and Streaming Data.

[BibT_eX]

[DOI]

Sneha Aman Singh

Divesh Srivastava

Proc. VLDB Endow., 2016

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

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2016

Work-Efficient Parallel and Incremental Graph Connectivity.

[BibT_eX]

[DOI]

CoRR, 2016

Change-Sensitive Algorithms for Maintaining Maximal Cliques in a Dynamic Graph.

[BibT_eX]

[DOI]

Michael Svendsen

CoRR, 2016

Space-Efficient Estimation of Statistics Over Sub-Sampled Streams.

[BibT_eX]

[DOI]

Algorithmica, 2016

Work-Efficient Parallel Union-Find with Applications to Incremental Graph Connectivity.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2016: Parallel Processing, 2016

2015

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

[BibT_eX]

[DOI]

Michael Svendsen

J. Parallel Distributed Comput., 2015

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

[BibT_eX]

[DOI]

Sneha Aman Singh

Frontiers ICT, 2015

A General Method for Estimating Correlated Aggregates Over a Data Stream.

[BibT_eX]

[DOI]

Algorithmica, 2015

Distinct Random Sampling from a Distributed Stream.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

Mining maximal cliques from an uncertain graph.

[BibT_eX]

[DOI]

Proceedings of the 31st IEEE International Conference on Data Engineering, 2015

2014

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

[BibT_eX]

[DOI]

VLDB J., 2014

Optimality of Clustering Properties of Space-Filling Curves.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2014

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

[BibT_eX]

[DOI]

Jaideep Chandrashekar

Stat. Anal. Data Min., 2014

EvoMiner: frequent subtree mining in phylogenetic databases.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2014

Monitoring persistent items in the union of distributed streams.

[BibT_eX]

[DOI]

Sneha Aman Singh

J. Parallel Distributed Comput., 2014

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

[BibT_eX]

[DOI]

Ryan LaFortune

Algorithmica, 2014

Parallel streaming frequency-based aggregates.

[BibT_eX]

[DOI]

Kun-Lung Wu

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

2013

Counting and Sampling Triangles from a Graph Stream.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2013

Parallel triangle counting in massive streaming graphs.

[BibT_eX]

[DOI]

A. Pavan

Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

2012

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

[BibT_eX]

[DOI]

Zhenhui Shen

J. Parallel Distributed Comput., 2012

Rectangle-efficient aggregation in spatial data streams.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2012

A Lower Bound on Proximity Preservation by Space Filling Curves.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012

2011

Optimal Random Sampling from Distributed Streams Revisited.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 25th International Symposium, 2011

2010

Concurrent counting is harder than queuing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Identifying frequent items in a network using gossip.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2010

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

[BibT_eX]

[DOI]

Shan Zhou

Lei Ying

Proceedings of the 6th International Wireless Communications and Mobile Computing Conference, 2010

2009

Stream Sampling.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Database Systems, 2009

Time-decaying Sketches for Robust Aggregation of Sensor Data.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

Time-decayed correlated aggregates over data streams.

[BibT_eX]

[DOI]

Stat. Anal. Data Min., 2009

Finding correlated heavy-hitters over data streams.

[BibT_eX]

[DOI]

Proceedings of the 28th International Performance Computing and Communications Conference, 2009

2008

Sketching asynchronous data streams over sliding windows.

[BibT_eX]

[DOI]

Distributed Comput., 2008

Computing Frequent Elements Using Gossip.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2008

Time-decaying aggregates in out-of-order streams.

[BibT_eX]

[DOI]

Flip Korn

Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

Exponentially Decayed Aggregates on Data Streams.

[BibT_eX]

[DOI]

Flip Korn

Proceedings of the 24th International Conference on Data Engineering, 2008

2007

Range-Efficient Counting of Distinct Elements in a Massive Data Stream.

[BibT_eX]

[DOI]

A. Pavan

SIAM J. Comput., 2007

A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window.

[BibT_eX]

[DOI]

Proceedings of the STACS 2007, 2007

Time-decaying sketches for sensor data aggregation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Improved sparse covers for graphs excluding a fixed minor.

[BibT_eX]

[DOI]

Ryan LaFortune

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2006

Self-Stabilizing Distributed Queuing.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2006

Dynamic Analysis of the Arrow Distributed Protocol.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2006

Randomized smoothing networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2006

Self-stabilizing smoothing and balancing networks.

[BibT_eX]

[DOI]

Distributed Comput., 2006

Sketching asynchronous streams over a sliding window.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Faster Event Forwarding in a Content-Based Publish-Subscribe System through Lookup ReuseEvent.

[BibT_eX]

[DOI]

Zhenhui Shen

Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications, 2006

A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition.

[BibT_eX]

[DOI]

Sudip Seal

Srinivas Aluru

Proceedings of the 2006 International Conference on Parallel Processing (ICPP 2006), 2006

2005

Analysis of Link Reversal Routing Algorithms.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Range Efficient Computation of F<sub>0</sub> over Massive Data Streams.

[BibT_eX]

[DOI]

Aduri Pavan

Proceedings of the 21st International Conference on Data Engineering, 2005

Adaptive Counting Networks.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS 2005), 2005

Indexing for Subscription Covering in Publish-Subscribe Systems.

[BibT_eX]

Zhenhui Shen

Srinivas Aluru

Proceedings of the ISCA 18th International Conference on Parallel and Distributed Computing Systems, 2005

2004

Distributed Streams Algorithms for Sliding Windows.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2004

Brief announcement: adaptive balancing networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2003

Distributed Queuing and Applications.

[BibT_eX]

[DOI]

PhD thesis, 2003

Analysis of link reversal routing algorithms for mobile ad hoc networks.

[BibT_eX]

[DOI]

Srikanth Surapaneni

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Brief announcement: concurrent counting is harder than queuing.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Self-Stabilizing Smoothing and Counting Maurice Herlihy, Srikanta Tirthapura.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 2003

2001

Ordered Multicast and Distributed Swap.

[BibT_eX]

[DOI]

Roger Wattenhofer

ACM SIGOPS Oper. Syst. Rev., 2001

Estimating simple functions on the union of data streams.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Competitive concurrent distributed queuing.

[BibT_eX]

[DOI]