Rasmus Pagh
Professor
Algorithms and Complexity
Universitetsparken 1
2100 København Ø
- 2021
Advances and Open Problems in Federated Learning
Kairouz, P., McMahan, H. B., Avent, B., Bellet, A., Bennis, M., Bhagoji, A. N., Bonawitz, K., Charles, Z., Cormode, G., Cummings, R., D'Oliveira, R. G. L., Eichner, H., El Rouayheb, S., Evans, D., Gardner, J., Garrett, Z., Gascon, A., Ghazi, B., Gibbons, P. B., Gruteser, M. & 39 flere, , 2021, I: Foundations and Trends in Machine Learning. 14, 1-2, s. 1-210Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
- Udgivet
CountSketches, Feature Hashing and the Median of Three
Larsen, K. G., Pagh, Rasmus & Tetek, J., 2021, Proceedings of the 38 th International Conference on Machine Learning. Meila, M. & Zhang, T. (red.). PMLR, s. 6011-6020 (Proceedings of Machine Learning Research, Bind 139).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Differentially Private Aggregation in the Shuffle Model: Almost Central Accuracy in Almost a Single Message
Ghazi, B., Kumar, R., Manurangsi, P., Pagh, Rasmus & Sinha, A., 2021, Proceedings of the 38 th International Conference on Machine Learning. Meila, M. & Zhang, T. (red.). PMLR, s. 3692-3701 (Proceedings of Machine Learning Research, Bind 139).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Differentially Private Sparse Vectors with Low Error, Optimal Space, and Fast Access
Aumüller, M., Lebeda, C. J. & Pagh, Rasmus, 2021, CCS 2021 - Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. Association for Computing Machinery, s. 1223-1236 (Proceedings of the ACM Conference on Computer and Communications Security).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Efficient differentially private F0 linear sketching
Pagh, Rasmus & Stausholm, N. M., 2021, 24th International Conference on Database Theory, ICDT 2021. Yi, K. & Wei, Z. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, s. 1-19 18. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 186).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Fair near neighbor search via sampling
Aumuller, M., Har-Peled, S., Mahabadi, S., Pagh, Rasmus & Silvestri, F., 2021, I: SIGMOD Record. 50, 1, s. 42-49Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
- Udgivet
On the Power of Multiple Anonymous Messages: Frequency Estimation and Selection in the Shuffle Model of Differential Privacy
Ghazi, B., Golowich, N., Kumar, R., Pagh, Rasmus & Velingker, A., 2021, Advances in Cryptology – EUROCRYPT 2021 - 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Canteaut, A. & Standaert, F-X. (red.). Springer, s. 463-488 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 12698 LNCS).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
ID: 252282120
Flest downloads
-
24
downloads
Efficient differentially private F0 linear sketching
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Udgivet -
11
downloads
Fair near neighbor search via sampling
Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Udgivet -
11
downloads
DEANN: Speeding up Kernel-Density Estimation using Approximate Nearest Neighbor Search
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Udgivet