Rasmus Pagh
Professor
Algorithms and Complexity
Universitetsparken 1
2100 København Ø
ORCID: 0000-0002-1516-9306
1 - 2 out of 2Page size: 10
- 2023
- Published
A Smooth Binary Mechanism for Efficient Private Continual Observation
Andersson, Joel Daniel & Pagh, Rasmus, 2023. 11 p.Research output: Contribution to conference › Paper › Research
- Published
Simple Set Sketching
Bæk Tejs Houen, J., Pagh, Rasmus & Walzer, S., 2023, Proceedings, 2023 Symposium on Simplicity in Algorithms (SOSA). Kavitha, T. & Mehlhorn, K. (eds.). Society for Industrial and Applied Mathematics, p. 228-241Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
ID: 252282120
Most downloads
-
17
downloads
Efficient differentially private F0 linear sketching
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published