Srikanta N. Tirthapura, Ph.D. - Publications

Affiliations: 
2003 Brown University, Providence, RI 

26 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Das A, Sanei-Mehri S, Tirthapura S. Shared-memory Parallel Maximal Clique Enumeration from Static and Dynamic Graphs Acm Transactions On Parallel Computing. 7: 1-28. DOI: 10.1145/3380936  0.3
2017 Mukherjee AP, Tirthapura S. Enumerating Maximal Bicliques from a Large Graph Using MapReduce Ieee Transactions On Services Computing. 10: 771-784. DOI: 10.1109/Tsc.2016.2523997  0.416
2017 Mukherjee AP, Xu P, Tirthapura S. Enumeration of Maximal Cliques from an Uncertain Graph Ieee Transactions On Knowledge and Data Engineering. 29: 543-555. DOI: 10.1109/Tkde.2016.2527643  0.376
2017 Bose B, Avasarala B, Tirthapura S, Chung Y, Steiner D. Detecting Insider Threats Using RADISH: A System for Real-Time Anomaly Detection in Heterogeneous Data Streams Ieee Systems Journal. 11: 471-482. DOI: 10.1109/Jsyst.2016.2558507  0.335
2016 Chung Y, Tirthapura S, Woodruff DP. A Simple Message-Optimal Algorithm for Random Sampling from a Distributed Stream Ieee Transactions On Knowledge and Data Engineering. 28: 1356-1368. DOI: 10.1109/Tkde.2016.2518679  0.428
2015 Singh SA, Tirthapura S. An Evaluation of Streaming Algorithms for Distinct Counting Over a Sliding Window Frontiers in Ict. 2: 23. DOI: 10.3389/Fict.2015.00023  0.392
2015 Svendsen M, Mukherjee AP, Tirthapura S. Mining maximal cliques from a large graph using MapReduce: Tackling highly uneven subproblem sizes Journal of Parallel and Distributed Computing. 79: 104-114. DOI: 10.1016/J.Jpdc.2014.08.011  0.426
2015 Lahiri B, Mukherjee AP, Tirthapura S. Identifying correlated heavy-hitters in a two-dimensional data stream Data Mining and Knowledge Discovery. DOI: 10.1007/S10618-015-0438-6  0.379
2015 Tirthapura S, Woodruff DP. A General Method for Estimating Correlated Aggregates Over a Data Stream Algorithmica. 73: 235-260. DOI: 10.1007/S00453-014-9917-1  0.336
2014 Singh SA, Tirthapura S. Monitoring persistent items in the union of distributed streams Journal of Parallel and Distributed Computing. 74: 3115-3127. DOI: 10.1016/J.Jpdc.2014.07.008  0.406
2014 Deepak A, Fernández-Baca D, Tirthapura S, Sanderson MJ, McMahon MM. EvoMiner: frequent subtree mining in phylogenetic databases Knowledge and Information Systems. 41: 559-590. DOI: 10.1007/S10115-013-0676-0  0.368
2014 Busch C, Lafortune R, Tirthapura S. Sparse covers for planar graphs and graphs that exclude a fixed minor Algorithmica. 69: 658-684. DOI: 10.1007/S00453-013-9757-4  0.559
2014 Lahiri B, Tirthapura S, Chandrashekar J. Space-efficient tracking of persistent items in a massive data stream Statistical Analysis and Data Mining. 7: 70-92. DOI: 10.1002/Sam.11214  0.326
2012 Wodo O, Tirthapura S, Chaudhary S, Ganapathysubramanian B. A graph-based formulation for computational characterization of bulk heterojunction morphology Organic Electronics. 13: 1105-1113. DOI: 10.1016/J.Orgel.2012.03.007  0.318
2010 Busch C, Tirthapura S. Concurrent counting is harder than queuing Theoretical Computer Science. 411: 3823-3833. DOI: 10.1016/J.Tcs.2010.07.002  0.572
2010 Lahiri B, Tirthapura S. Identifying frequent items in a network using gossip Journal of Parallel and Distributed Computing. 70: 1241-1253. DOI: 10.1016/J.Jpdc.2010.07.006  0.448
2009 Cormode G, Tirthapura S, Xu B. Time-decaying Sketches for Robust Aggregation of Sensor Data Siam Journal On Computing. 39: 1309-1339. DOI: 10.1137/08071795X  0.339
2008 Xu B, Tirthapura S, Busch C. Sketching asynchronous data streams over sliding windows Distributed Computing. 20: 359-374. DOI: 10.1007/S00446-007-0048-7  0.56
2007 Pavan A, Tirthapura S. Range-efficient counting of distinct elements in a massive data stream Siam Journal On Computing. 37: 359-379. DOI: 10.1137/050643672  0.427
2006 Tirthapura S, Herlihy M. Self-stabilizing distributed queuing Ieee Transactions On Parallel and Distributed Systems. 17: 646-655. DOI: 10.1109/Tpds.2006.94  0.589
2006 Herlihy M, Tirthapura S. Randomized smoothing networks Journal of Parallel and Distributed Computing. 66: 626-632. DOI: 10.1016/J.Jpdc.2005.06.009  0.579
2006 Herlihy M, Tirthapura S. Self-stabilizing smoothing and balancing networks Distributed Computing. 18: 345-357. DOI: 10.1007/S00446-005-0130-Y  0.576
2006 Herlihy M, Kuhn F, Tirthapura S, Wattenhofer R. Dynamic analysis of the arrow distributed protocol Theory of Computing Systems. 39: 875-901. DOI: 10.1007/S00224-006-1251-9  0.601
2005 Busch C, Tirthapura S. Analysis of Link Reversal Routing Algorithms Siam Journal On Computing. 35: 305-326. DOI: 10.1137/S0097539704443598  0.571
2004 Gibbons PB, Tirthapura S. Distributed Streams Algorithms for Sliding Windows Theory of Computing Systems \/ Mathematical Systems Theory. 37: 457-478. DOI: 10.1007/S00224-004-1156-4  0.403
2001 Herlihy M, Tirthapura S, Wattenhofer R. Ordered multicast and distributed swap Operating Systems Review (Acm). 35: 85-96. DOI: 10.1145/371455.997810  0.586
Show low-probability matches.