Picture for Monika Henzinger

Monika Henzinger

Expander Hierarchies for Normalized Cuts on Graphs

Add code
Jun 20, 2024
Viaarxiv icon

Making Old Things New: A Unified Algorithm for Differentially Private Clustering

Add code
Jun 17, 2024
Viaarxiv icon

Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond

Add code
Feb 27, 2024
Viaarxiv icon

Simple, Scalable and Effective Clustering via One-Dimensional Projections

Add code
Oct 25, 2023
Viaarxiv icon

Differential Privacy for Clustering Under Continual Observation

Add code
Jul 27, 2023
Figure 1 for Differential Privacy for Clustering Under Continual Observation
Viaarxiv icon

A Unifying Framework for Differentially Private Sums under Continual Observation

Add code
Jul 18, 2023
Viaarxiv icon

Almost Tight Error Bounds on Differentially Private Continual Counting

Add code
Nov 09, 2022
Viaarxiv icon

Constant matters: Fine-grained Complexity of Differentially Private Continual Observation

Add code
Apr 04, 2022
Figure 1 for Constant matters: Fine-grained Complexity of Differentially Private Continual Observation
Figure 2 for Constant matters: Fine-grained Complexity of Differentially Private Continual Observation
Viaarxiv icon

Capacity Releasing Diffusion for Speed and Locality

Add code
Jun 10, 2018
Figure 1 for Capacity Releasing Diffusion for Speed and Locality
Figure 2 for Capacity Releasing Diffusion for Speed and Locality
Figure 3 for Capacity Releasing Diffusion for Speed and Locality
Figure 4 for Capacity Releasing Diffusion for Speed and Locality
Viaarxiv icon

Algorithms and Conditional Lower Bounds for Planning Problems

Add code
Apr 19, 2018
Figure 1 for Algorithms and Conditional Lower Bounds for Planning Problems
Figure 2 for Algorithms and Conditional Lower Bounds for Planning Problems
Figure 3 for Algorithms and Conditional Lower Bounds for Planning Problems
Figure 4 for Algorithms and Conditional Lower Bounds for Planning Problems
Viaarxiv icon