#### Filter Results:

- Full text PDF available (22)

#### Publication Year

2000

2018

- This year (13)
- Last 5 years (32)
- Last 10 years (57)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Phillip B. Gibbons, Srikanta Tirthapura
- SPAA
- 2001

Massive data sets often arise as physically distributed, parallel data streams. We present algorithms for estimating simple functions on the union of such data streams, while using only logarithmicâ€¦ (More)

- Phillip B. Gibbons, Srikanta Tirthapura
- Theory of Computing Systems
- 2004

Massive data sets often arise as physically distributed, parallel data streams, and it is important to estimate various aggregates and statistics on the union of these streams. This paper presentsâ€¦ (More)

- A. Pavan, Kanat Tangwongsan, Srikanta Tirthapura, Kun-Lung Wu
- PVLDB
- 2013

This paper presents a new space-efficient algorithm for counting and sampling triangles--and more generally, constant-sized cliques--in a massive graph whose edges arrive as a stream. Compared toâ€¦ (More)

- Graham Cormode, Flip Korn, Srikanta Tirthapura
- PODS
- 2008

Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events such as stock feeds,â€¦ (More)

- Costas Busch, Srikanta Tirthapura
- SIAM J. Comput.
- 2005

Link reversal algorithms provide a simple mechanism for routing in communication networks whose topology is frequently changing, such as in mobile ad hoc networks. A link reversal algorithm routes byâ€¦ (More)

- Maurice Herlihy, Srikanta Tirthapura
- 18th International Parallel and Distributedâ€¦
- 2004

Summary form only given. A smoothing network is a distributed data structure that accepts tokens on input wires and routes them to output wires. It ensures that however imbalanced the traffic onâ€¦ (More)

- A. Pavan, Srikanta Tirthapura
- SIAM J. Comput.
- 2007

Efficient one-pass estimation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consider rangeefficientâ€¦ (More)

A b s t r a c t We discuss a graph-algorithmic approach to comparing shapes. We focus in this paper on comparing simple closed curves in the plane. Our approach is to (1) represent such a shape byâ€¦ (More)

- Srikanta Tirthapura, Bojian Xu, Costas Busch
- PODC
- 2006

We study the problem of maintaining sketches of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in which the observedâ€¦ (More)

- Costas Busch, Srikanta Tirthapura
- STACS
- 2007

We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data streams, where theâ€¦ (More)