activity
20242026
most citedImproved Local Computation Algorithms for Greedy Set Cover via Retroactive Updates

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

collaborators
Showing 2024Show all

1 paper · 1 filter

cs.DS2024

One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches

Edith Cohen, Jelani Nelson, Tamás Sarlós +2

Cardinality sketches are compact data structures for representing sets or vectors. These sketches are space-efficient, typically requiring only logarithmic storage in the input siz…