Srikanta Tirthapura

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
43Space-efficient tracking of persistent items in a massive data stream. Bibudh Lahiri, Jaideep Chandrashekar, Srikanta Tirthapura. DEBS 2011, 255-266. Web SearchBibTeXDownload
42Optimal Random Sampling from Distributed Streams Revisited. Srikanta Tirthapura, David P. Woodruff. DISC 2011, 283-297. Web SearchBibTeXDownload
2010
41A Streaming Approximation Algorithm for Klee's Measure Problem. Gokarna Sharma, Costas Busch, Srikanta Tirthapura. CoRR (abs/1004.1569) (2010). Web SearchBibTeXDownload
40Delay, cost and infrastructure tradeoff of epidemic routing in mobile sensor networks. Shan Zhou, Lei Ying, Srikanta Tirthapura. IWCMC 2010, 1242-1246. Web SearchBibTeXDownload
39Identifying frequent items in a network using gossip. Bibudh Lahiri, Srikanta Tirthapura. J. Parallel Distrib. Comput. (70): 1241-1253 (2010). Web SearchBibTeXDownload
38Concurrent counting is harder than queuing. Costas Busch, Srikanta Tirthapura. Theor. Comput. Sci. (411): 3823-3833 (2010). Web SearchBibTeXDownload
2009
37Stream Sampling. Bibudh Lahiri, Srikanta Tirthapura. Encyclopedia of Database Systems 2009, 2838-2842. Web SearchBibTeXDownload
36Finding correlated heavy-hitters over data streams. Bibudh Lahiri, Srikanta Tirthapura. IPCCC 2009, 307-314. Web SearchBibTeXDownload
35Time-Decayed Correlated Aggregates over Data Streams. Graham Cormode, Srikanta Tirthapura, Bojian Xu. SDM 2009, 269-280. Cited by 1Web SearchBibTeXDownload
34Time-decaying Sketches for Robust Aggregation of Sensor Data. Graham Cormode, Srikanta Tirthapura, Bojian Xu. SIAM J. Comput. (39): 1309-1339 (2009). Web SearchBibTeXDownload
33Time-decayed correlated aggregates over data streams. Graham Cormode, Srikanta Tirthapura, Bojian Xu. Statistical Analysis and Data Mining (2): 294-310 (2009). Web SearchBibTeXDownload
2008
32Sketching asynchronous data streams over sliding windows. Bojian Xu, Srikanta Tirthapura, Costas Busch. Distributed Computing (20): 359-374 (2008). Web SearchBibTeXDownload
31Exponentially Decayed Aggregates on Data Streams. Graham Cormode, Flip Korn, Srikanta Tirthapura. ICDE 2008, 1379-1381. Cited by 5Web SearchBibTeXDownload
30Time-decaying aggregates in out-of-order streams. Graham Cormode, Flip Korn, Srikanta Tirthapura. PODS 2008, 89-98. Cited by 6Web SearchBibTeXDownload
29Computing Frequent Elements Using Gossip. Bibudh Lahiri, Srikanta Tirthapura. SIROCCO 2008, 119-130. Web SearchBibTeXDownload
2007
28Approximate Covering Detection among Content-Based Subscriptions Using Space Filling Curves. Zhenhui Shen, Srikanta Tirthapura. ICDCS 2007, 2. Web SearchBibTeXDownload
27Time-decaying sketches for sensor data aggregation. Graham Cormode, Srikanta Tirthapura, Bojian Xu. PODC 2007, 215-224. Cited by 15Web SearchBibTeXDownload
26Improved sparse covers for graphs excluding a fixed minor. Costas Busch, Ryan LaFortune, Srikanta Tirthapura. PODC 2007, 61-70. Web SearchBibTeXDownload
25Range-Efficient Counting of Distinct Elements in a Massive Data Stream. A. Pavan, Srikanta Tirthapura. SIAM J. Comput. (37): 359-379 (2007). Web SearchBibTeXDownload
24A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window. Costas Busch, Srikanta Tirthapura. STACS 2007, 465-476. Web SearchBibTeXDownload
2006
23Self-stabilizing smoothing and balancing networks. Maurice Herlihy, Srikanta Tirthapura. Distributed Computing (18): 345-357 (2006). Web SearchBibTeXDownload
22A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition. Srikanta Tirthapura, Sudip Seal, Srinivas Aluru. ICPP 2006, 505-512. Web SearchBibTeXDownload
21Self-Stabilizing Distributed Queuing. Srikanta Tirthapura, Maurice Herlihy. IEEE Trans. Parallel Distrib. Syst. (17): 646-655 (2006). Web SearchBibTeXDownload
20Concurrent counting is harder than queuing. Costas Busch, Srikanta Tirthapura. IPDPS 2006. Web SearchBibTeXDownload
19Randomized smoothing networks. Maurice Herlihy, Srikanta Tirthapura. J. Parallel Distrib. Comput. (66): 626-632 (2006). Web SearchBibTeXDownload
18Faster Event Forwarding in a Content-Based Publish-Subscribe System through Lookup ReuseEvent. Zhenhui Shen, Srikanta Tirthapura. NCA 2006, 77-84. Web SearchBibTeXDownload
17Sketching asynchronous streams over a sliding window. Srikanta Tirthapura, Bojian Xu, Costas Busch. PODC 2006, 82-91. Web SearchBibTeXDownload
16Dynamic Analysis of the Arrow Distributed Protocol. Maurice Herlihy, Fabian Kuhn, Srikanta Tirthapura, Roger Wattenhofer. Theory Comput. Syst. (39): 875-901 (2006). Web SearchBibTeXDownload
2005
15Adaptive Counting Networks. Srikanta Tirthapura. ICDCS 2005, 241-250. Web SearchBibTeXDownload
14Range Efficient Computation of F0 over Massive Data Streams. Pavan Aduri, Srikanta Tirthapura. ICDE 2005, 32-43. Web SearchBibTeXDownload
13Indexing for Subscription Covering in Publish-Subscribe Systems. Zhenhui Shen, Srinivas Aluru, Srikanta Tirthapura. ISCA PDCS 2005, 328-333. Web SearchBibTeX
12Analysis of Link Reversal Routing Algorithms. Costas Busch, Srikanta Tirthapura. SIAM J. Comput. (35): 305-326 (2005). Web SearchBibTeXDownload
2004
11Randomized Smoothing Networks. Maurice Herlihy, Srikanta Tirthapura. IPDPS 2004. Web SearchBibTeXDownload
10Brief announcement: adaptive balancing networks. Srikanta Tirthapura. PODC 2004, 387. Web SearchBibTeXDownload
2003
9Self-Stabilizing Smoothing and Counting Maurice Herlihy, Srikanta Tirthapura. Maurice Herlihy, Srikanta Tirthapura. ICDCS 2003, 4-11. Web SearchBibTeXDownload
8Brief announcement: concurrent counting is harder than queuing. Srikanta Tirthapura. PODC 2003, 112. Web SearchBibTeXDownload
7Analysis of link reversal routing algorithms for mobile ad hoc networks. Costas Busch, Srikanth Surapaneni, Srikanta Tirthapura. SPAA 2003, 210-219. Web SearchBibTeXDownload
2002
6Distributed streams algorithms for sliding windows. Phillip B. Gibbons, Srikanta Tirthapura. SPAA 2002, 63-72. Web SearchBibTeXDownload
2001
5Self Stabilizing Distributed Queuing. Maurice Herlihy, Srikanta Tirthapura. DISC 2001, 209-223. Web SearchBibTeXDownload
4Ordered Multicast and Distributed Swap. Maurice Herlihy, Srikanta Tirthapura, Roger Wattenhofer. Operating Systems Review (35): 85-96 (2001). Web SearchBibTeXDownload
3Competitive concurrent distributed queuing. Maurice Herlihy, Srikanta Tirthapura, Roger Wattenhofer. PODC 2001, 127-133. Web SearchBibTeXDownload
2Estimating simple functions on the union of data streams. Phillip B. Gibbons, Srikanta Tirthapura. SPAA 2001, 281-291. Web SearchBibTeXDownload
2000
1A tree-edit-distance algorithm for comparing simple, closed shapes. Philip N. Klein, Srikanta Tirthapura, Daniel Sharvit, Benjamin B. Kimia. SODA 2000, 696-704. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research