Srikanta Tirthapura

According to our database1, Srikanta Tirthapura authored at least 90 papers between 2000 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Shared-memory Parallel Maximal Clique Enumeration from Static and Dynamic Graphs.
ACM Trans. Parallel Comput., 2020

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

Random Sampling for Group-By Queries.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

2019
Incremental maintenance of maximal cliques in a dynamic graph.
VLDB J., 2019

Scalable Subgraph Counting: The Methods Behind The Madness.
Proceedings of the Companion of The 2019 World Wide Web Conference, 2019

Weighted Reservoir Sampling from Distributed Streams.
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

Shared-Memory Parallel Maximal Biclique Enumeration.
Proceedings of the 26th IEEE International Conference on High Performance Computing, 2019

Parallel Streaming Random Sampling.
Proceedings of the Euro-Par 2019: Parallel Processing, 2019

Stratified Random Sampling over Streaming and Stored Data.
Proceedings of the Advances in Database Technology, 2019

FLEET: Butterfly Estimation from a Bipartite Graph Stream.
Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

2018
Stream Sampling.
Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

Incremental Maintenance of Maximal Bicliques in a Dynamic Bipartite Graph.
IEEE Trans. Multi Scale Comput. Syst., 2018

HYDRA: A Dynamic Big Data Regenerator.
Proc. VLDB Endow., 2018

Counting Butterfies from a Large Bipartite Graph Stream.
CoRR, 2018

Variance-Optimal Offline and Streaming Stratified Random Sampling.
CoRR, 2018

Work-efficient parallel union-find.
Concurr. Comput. Pract. Exp., 2018

Variance-Reduced Stochastic Gradient Descent on Streaming Data.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Butterfly Counting in Bipartite Networks.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

V2V: Vector Embedding of a Graph and Applications.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium Workshops, 2018

Learning Graphical Models from a Distributed Stream.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

Onion Curve: A Space Filling Curve with Near-Optimal Clustering.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

Shared-Memory Parallel Maximal Clique Enumeration.
Proceedings of the 25th IEEE International Conference on High Performance Computing, 2018

Scalable and Dynamic Regeneration of Big Data Volumes.
Proceedings of the 21st International Conference on Extending Database Technology, 2018

Enumerating Top-k Quasi-Cliques.
Proceedings of the IEEE International Conference on Big Data, 2018

2017
Enumerating Maximal Bicliques from a Large Graph Using MapReduce.
IEEE Trans. Serv. Comput., 2017

Enumeration of Maximal Cliques from an Uncertain Graph.
IEEE Trans. Knowl. Data Eng., 2017

Detecting Insider Threats Using RADISH: A System for Real-Time Anomaly Detection in Heterogeneous Data Streams.
IEEE Syst. J., 2017

Streaming Algorithms for k-Means Clustering with Fast Queries.
CoRR, 2017

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

Streaming k-Means Clustering with Fast Queries.
Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

2016
A Simple Message-Optimal Algorithm for Random Sampling from a Distributed Stream.
IEEE Trans. Knowl. Data Eng., 2016

Estimating Quantiles from the Union of Historical and Streaming Data.
Proc. VLDB Endow., 2016

Identifying correlated heavy-hitters in a two-dimensional data stream.
Data Min. Knowl. Discov., 2016

Work-Efficient Parallel and Incremental Graph Connectivity.
CoRR, 2016

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

Space-Efficient Estimation of Statistics Over Sub-Sampled Streams.
Algorithmica, 2016

Work-Efficient Parallel Union-Find with Applications to Incremental Graph Connectivity.
Proceedings of the Euro-Par 2016: Parallel Processing, 2016

2015
Mining maximal cliques from a large graph using MapReduce: Tackling highly uneven subproblem sizes.
J. Parallel Distributed Comput., 2015

An Evaluation of Streaming Algorithms for Distinct Counting Over a Sliding Window.
Frontiers ICT, 2015

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

Distinct Random Sampling from a Distributed Stream.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

Mining maximal cliques from an uncertain graph.
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.
VLDB J., 2014

Optimality of Clustering Properties of Space-Filling Curves.
ACM Trans. Database Syst., 2014

Space-efficient tracking of persistent items in a massive data stream.
Stat. Anal. Data Min., 2014

EvoMiner: frequent subtree mining in phylogenetic databases.
Knowl. Inf. Syst., 2014

Monitoring persistent items in the union of distributed streams.
J. Parallel Distributed Comput., 2014

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

Parallel streaming frequency-based aggregates.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

2013
Counting and Sampling Triangles from a Graph Stream.
Proc. VLDB Endow., 2013

Parallel triangle counting in massive streaming graphs.
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.
J. Parallel Distributed Comput., 2012

Rectangle-efficient aggregation in spatial data streams.
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.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012

2011
Optimal Random Sampling from Distributed Streams Revisited.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

2010
Concurrent counting is harder than queuing.
Theor. Comput. Sci., 2010

Identifying frequent items in a network using gossip.
J. Parallel Distributed Comput., 2010

Delay, cost and infrastructure tradeoff of epidemic routing in mobile sensor networks.
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference, 2010

2009
Stream Sampling.
Proceedings of the Encyclopedia of Database Systems, 2009

Time-decaying Sketches for Robust Aggregation of Sensor Data.
SIAM J. Comput., 2009

Time-decayed correlated aggregates over data streams.
Stat. Anal. Data Min., 2009

Finding correlated heavy-hitters over data streams.
Proceedings of the 28th International Performance Computing and Communications Conference, 2009

2008
Sketching asynchronous data streams over sliding windows.
Distributed Comput., 2008

Computing Frequent Elements Using Gossip.
Proceedings of the Structural Information and Communication Complexity, 2008

Time-decaying aggregates in out-of-order streams.
Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

Exponentially Decayed Aggregates on Data Streams.
Proceedings of the 24th International Conference on Data Engineering, 2008

2007
Range-Efficient Counting of Distinct Elements in a Massive Data Stream.
SIAM J. Comput., 2007

A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window.
Proceedings of the STACS 2007, 2007

Time-decaying sketches for sensor data aggregation.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Improved sparse covers for graphs excluding a fixed minor.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2006
Self-Stabilizing Distributed Queuing.
IEEE Trans. Parallel Distributed Syst., 2006

Dynamic Analysis of the Arrow Distributed Protocol.
Theory Comput. Syst., 2006

Randomized smoothing networks.
J. Parallel Distributed Comput., 2006

Self-stabilizing smoothing and balancing networks.
Distributed Comput., 2006

Sketching asynchronous streams over a sliding window.
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.
Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications, 2006

A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition.
Proceedings of the 2006 International Conference on Parallel Processing (ICPP 2006), 2006

2005
Analysis of Link Reversal Routing Algorithms.
SIAM J. Comput., 2005

Range Efficient Computation of F<sub>0</sub> over Massive Data Streams.
Proceedings of the 21st International Conference on Data Engineering, 2005

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

Indexing for Subscription Covering in Publish-Subscribe Systems.
Proceedings of the ISCA 18th International Conference on Parallel and Distributed Computing Systems, 2005

2004
Distributed Streams Algorithms for Sliding Windows.
Theory Comput. Syst., 2004

Brief announcement: adaptive balancing networks.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2003
Analysis of link reversal routing algorithms for mobile ad hoc networks.
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.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Self-Stabilizing Smoothing and Counting Maurice Herlihy, Srikanta Tirthapura.
Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 2003

2001
Ordered Multicast and Distributed Swap.
ACM SIGOPS Oper. Syst. Rev., 2001

Estimating simple functions on the union of data streams.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Competitive concurrent distributed queuing.
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

2000
A tree-edit-distance algorithm for comparing simple, closed shapes.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000


  Loading...