3 papers
cs.DS2026
Edit-Neighboring Data Streams and Privacy under Continual Observation
Joel Daniel Andersson, Anamay Chaturvedi, Monika Henzinger +1
Differential privacy under Continual Observation (CO) quantifies the loss in privacy that occurs when outputs generated using a stream of sensitive input data are published in the…
cs.DS2026
Concurrent Composition for Differentially Private Continual Mechanisms
Monika Henzinger, Roodabeh Safavi, Salil Vadhan
Many intended uses of differential privacy involve a that is set up to run continuously over a long period of time, making more statistical releases…
math.CO2025
Counting Perfect Matchings In Dirac Hypergraphs
Matthew Kwan, Roodabeh Safavi, Yiting Wang
One of the foundational theorems of extremal graph theory is Dirac's theorem, which says that if an n-vertex graph G has minimum degree at least n/2, then G has a Hamilton cycle, a…