The following pages link to Srikanta Tirthapura (Q362592):
Displayed 25 items.
- Approximate covering detection among content-based subscriptions using space filling curves (Q362593) (← links)
- Concurrent counting is harder than queuing (Q604464) (← links)
- Identifying frequent items in a network using gossip (Q666263) (← links)
- Distributed streams algorithms for sliding windows (Q706324) (← links)
- A general method for estimating correlated aggregates over a data stream (Q747615) (← links)
- Dynamic analysis of the arrow distributed protocol (Q863197) (← links)
- Work-efficient parallel union-find with applications to incremental graph connectivity (Q1693229) (← links)
- Identifying correlated heavy-hitters in a two-dimensional data stream (Q1741250) (← links)
- Sketching asynchronous data streams over sliding windows (Q1954256) (← links)
- Sparse covers for planar graphs and graphs that exclude a fixed minor (Q2249746) (← links)
- Self-stabilizing smoothing and balancing networks (Q2375300) (← links)
- Randomized smoothing networks (Q2497733) (← links)
- Competitive concurrent distributed queuing (Q2787673) (← links)
- Optimality of Clustering Properties of Space-Filling Curves (Q2790122) (← links)
- Optimal Random Sampling from Distributed Streams Revisited (Q3095333) (← links)
- Parallel Streaming Random Sampling (Q3297571) (← links)
- Time-decaying Sketches for Robust Aggregation of Sensor Data (Q3586182) (← links)
- A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window (Q3590955) (← links)
- (Q4436053) (← links)
- (Q4952689) (← links)
- Space‐efficient tracking of persistent items in a massive data stream (Q4969927) (← links)
- Sketching asynchronous streams over a sliding window (Q5177269) (← links)
- Improved sparse covers for graphs excluding a fixed minor (Q5401394) (← links)
- Time-decaying sketches for sensor data aggregation (Q5401414) (← links)
- Analysis of Link Reversal Routing Algorithms (Q5470692) (← links)