Develops space-optimal ℓ_p samplers for data streams and uses them to resolve open problems in unbiased F_p estimation under the forget model while generalizing to suffix-prefix deletions and entropy estimation.
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Unbiased Insights: Optimal Streaming Algorithms for $\ell_p$ Sampling, the Forget Model, and Beyond
Develops space-optimal ℓ_p samplers for data streams and uses them to resolve open problems in unbiased F_p estimation under the forget model while generalizing to suffix-prefix deletions and entropy estimation.