F_p moment estimation and heavy-hitters in the sliding window model can be solved in Õ(ε^{-p} log^2 n + ε^{-2} log n) bits, matching the new lower bounds up to log log n and log(1/ε) factors.
Randomness-efficient oblivious sampling
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Tight Bounds for Heavy-Hitters and Moment Estimation in the Sliding Window Model
F_p moment estimation and heavy-hitters in the sliding window model can be solved in Õ(ε^{-p} log^2 n + ε^{-2} log n) bits, matching the new lower bounds up to log log n and log(1/ε) factors.