activity
20242026
collaborators

7 papers

cs.DS2026

Tight Bounds on the Cost of Adaptivity for the Meyerson Sketch

Edith Cohen, Elena Gribelyuk, Pasin Manurangsi +1

In online facility location, points arrive one at a time, and the algorithm must either open a facility at the arriving point or route the point to an existing facility. The Meyers…

cs.DS2026

Adversarial Robustness for Small Frequency Moments and a Weak Equivalence Theorem for Turnstile Streams

Elena Gribelyuk, Honghao Lin, David P. Woodruff +2

We study adversarially robust algorithms for insertion-deletion (turnstile) streams, where future updates may depend on past algorithm outputs. While recent work achieved a robust…

cs.DS2026

Adversarial Robustness on Insertion-Deletion Streams

Elena Gribelyuk, Honghao Lin, David P. Woodruff +2

We study adversarially robust algorithms for insertion-deletion (turnstile) streams, where future updates may depend on past algorithm outputs. While robust algorithms exist for in…

cs.DS2026

Adaptively Robust Resettable Streaming

Edith Cohen, Elena Gribelyuk, Jelani Nelson +1

We study algorithms in the resettable streaming model, where the value of each key can either be increased or reset to zero. The model is suitable for applications such as active r…

cs.DS2025

Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness

Elena Gribelyuk, Honghao Lin, David P. Woodruff +2

We introduce a novel technique for ``lifting'' dimension lower bounds for linear sketches in the real-valued setting to dimension lower bounds for linear sketches with polynomially…

cs.DS2024

Near-Optimal Relative Error Streaming Quantile Estimation via Elastic Compactors

Elena Gribelyuk, Pachara Sawettamalya, Hongxun Wu +1

Computing the approximate quantiles or ranks of a stream is a fundamental task in data monitoring. Given a stream of elements and a query , a relative-err…

cs.DS2024

A Strong Separation for Adversarially Robust Estimation for Linear Sketches

Elena Gribelyuk, Honghao Lin, David P. Woodruff +2

The majority of streaming problems are defined and analyzed in a static setting, where the data stream is any worst-case sequence of insertions and deletions that is fixed in advan…