N. V. Vinodchandran

most citedDistinct Elements in Streams: An Algorithm for the (Text) Book

2 citations · 2 across the 1 of their papers we have counts for

collaborators

Showing cs.DSShow all

1 paper · 1 filter

cs.DS2023★ 2 cited

Distinct Elements in Streams: An Algorithm for the (Text) Book

Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel

Given a data stream $A = ⟨ a_{1}, a_{2}, \dots, a_{m} ⟩$ of $m$ elements where each $a_{i} \in [n]$ , the Distinct Elements problem is to estimate the number of disti…