
- Self-stabilizing Routing in Publish-Subscribe Systems Zhenhui Shen and Srikanta Tirthapura
- Abstract of \Distributed Queuing and Applications" by Srikanta Tirthapura, Ph.D., Brown Univer-sity, May 2003.
- Sketching Asynchronous Streams Over a Sliding Window Srikanta Tirthapura
- Time-Decaying Aggregates in Out-of-order Streams Graham Cormode
- SIAM J. COMPUT. c 2005 Society for Industrial and Applied Mathematics Vol. 35, No. 2, pp. 305326
- Selfstabilizing Routing in PublishSubscribe Systems Zhenhui Shen and Srikanta Tirthapura
- Approximate Covering Detection among Content-Based Subscriptions Using Space Filling Curves
- DOI: 10.1007/s00224-004-1156-4 Theory Comput. Systems OF1OF22 (2004)
- A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition Srikanta Tirthapura, Sudip Seal and Srinivas Aluru
- Concurrent Counting is Harder than Queuing Srikanta Tirthapura 1 , Costas Busch 2
- Computing Frequent Elements Using Gossip Bibudh Lahiri
- Indexing for Subscription Covering in PublishSubscribe Systems
- Distrib. Comput. (2006) 18(5): 345357 DOI 10.1007/s00446-005-0130-y
- Adaptive Counting Networks Srikanta Tirthapura
- A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
- Rangeefficient computation of F 0 over massive data streams Dept. of Computer Science
- Faster Event Forwarding in a ContentBased PublishSubscribe System through Lookup Reuse
- Indexing for Subscription Covering in Publish-Subscribe Systems
- Concurrent Counting is Harder than Queuing Srikanta Tirthapura1
- Adaptive Counting Networks Srikanta Tirthapura
- Faster Event Forwarding in a Content-Based Publish-Subscribe System through Lookup Reuse
- Indexing Based on Edit-Distance Matching of Shape Graphs Srikanta Tirthapura2
- J. Parallel Distrib. Comput. 66 (2006) 626632 www.elsevier.com/locate/jpdc
- A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
- Range-efficient computation of F0 over massive data streams Dept. of Computer Science
- Improved Sparse Covers for Graphs Excluding a Fixed Costas Busch
- Approximate Covering Detection among ContentBased Subscriptions Using Space Filling Curves
- Sketching Asynchronous Streams Over a Sliding Window Srikanta Tirthapura
- A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition Srikanta Tirthapura, Sudip Seal and Srinivas Aluru
- Analysis of Link Reversal Routing Algorithms for Mobile Ad Hoc Networks
- Indexing Based on EditDistance Matching of Shape Graphs Srikanta Tirthapura 2 ,Daniel Sharvit 1 ,Philip Klein 2 ,Benjamin B. Kimia 1
- Estimating Simple Functions on the Union of Data Streams Phillip B. Gibbons
- Optimal Sampling from Distributed Streams Revisited
- Optimal Random Sampling from Distributed Streams Revisited
- A General Method for Estimating Correlated Aggregates Over a Data Stream
- A Lower Bound On Proximity Preservation by Space Filling Curves Industrial and Manufacturing Systems Engg.