Kuldeep S. Meel

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

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

collaborators

2 papers

cs.DB2023

Approximating Queries on Probabilistic Graphs

Antoine Amarilli, Timothy van Bremen, Octave Gaspard +1

Query evaluation over probabilistic databases is notoriously intractable -- not only in combined complexity, but often in data complexity as well. This motivates the study of appro…

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…