2 citations · 6 across the 18 of their papers we have counts for
4 papers · 1 filter
Can LLMs be Used to Simplify Algorithms? Simpler Algorithms for Vertex Coloring and Edge Connectivity
Antoine El-Hayek, Monika Henzinger, Da Wei Zheng
Having simple algorithms is important for the practical adoption of new algorithms. However, simplifying existing algorithms is a field that does not usually receive a lot of atten…
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…
Near-Optimal Generalized Private Testing
Anamay Chaturvedi, Monika Henzinger, Jalaj Upadhyay
In differential privacy (DP), the generalized private testing problem was introduced by Liu and Talwar (STOC 2019). Given a dataset and a sequence of black-box…
Dynamic Hierarchical -Tree Decomposition and Its Applications
Gramoz Goranci, Monika Henzinger, Peter Kiss +2
We develop a new algorithmic framework for designing approximation algorithms for cut-based optimization problems on capacitated undirected graphs that undergo edge insertions and…