I agree that this site is using cookies. You can find further informations here.
X
Pagh, Rasmus
249  results:
Search for persons X
?
1

PLAN: Variance-Aware Private Mean Estimation:

Aumüller, Martin ; Lebeda, Christian Janos ; Nelson, Boel.
Proceedings on Privacy Enhancing Technologies.  2024 (2024)  3 - p. 606-625 , 2024
Link: https://doi.org/10.56553..
 
?
2

Differentially Private Selection from Secure Distributed Co..:

, In: Proceedings of the ACM on Web Conference 2024,
Damgård, Ivan ; Keller, Hannah ; Nelson, Boel.. - p. 1103-1114 , 2024
Link: https://dl.acm.org/doi/1..
 
?
3

Pseudorandom Hashing for Space-bounded Computation with App..:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),
Kacham, Praneeth ; Pagh, Rasmus ; Thorup, Mikkel. - p. 1515-1550 , 2023
Link: https://doi.org/10.1109/..
 
?
4

HyperLogLogLog : Cardinality Estimation With One Log Mor:

, In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining,
Karppa, Matti ; Pagh, Rasmus - p. 753-761 , 2022
Link: https://dl.acm.org/doi/1..
 
?
5

Technical Perspective: Relative Error Streaming Quantiles:

Pagh, Rasmus
ACM SIGMOD Record.  51 (2022)  1 - p. 68-68 , 2022
Link: https://doi.org/10.1145/..
 
?
6

Representing Sparse Vectors with Differential Privacy, Low ..:

Aumüller, Martin ; Lebeda, Christian Janos ; Pagh, Rasmus
Journal of Privacy and Confidentiality.  12 (2022)  2 - p. , 2022
Link: https://doi.org/10.29012..
 
?
7

Sampling a Near Neighbor in High Dimensions — Who is the Fa..:

Aumüller, Martin ; Har-Peled, Sariel ; Mahabadi, Sepideh..
ACM Transactions on Database Systems.  47 (2022)  1 - p. 1-40 , 2022
Link: https://doi.org/10.1145/..
 
?
8

Sampling near neighbors in search for fairness:

Aumüller, Martin ; Har-Peled, Sariel ; Mahabadi, Sepideh..
Communications of the ACM.  65 (2022)  8 - p. 83-90 , 2022
Link: https://doi.org/10.1145/..
 
?
9

Fair near neighbor search via sampling:

Aumuller, Martin ; Har-Peled, Sariel ; Mahabadi, Sepideh..
ACM SIGMOD Record.  50 (2021)  1 - p. 42-49 , 2021
Link: https://doi.org/10.1145/..
 
?
10

On the Power of Multiple Anonymous Messages: Frequency Esti..:

, In: Lecture Notes in Computer Science; Advances in Cryptology – EUROCRYPT 2021,
Ghazi, Badih ; Golowich, Noah ; Kumar, Ravi.. - p. 463-488 , 2021
Link: https://doi.org/10.1007/..
 
?
11

2021 ACM PODS Alberto O. Mendelzon Test-of-Time Award:

, In: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems,
Bonifati, Angela ; Pagh, Rasmus ; Schwentick, Thomas - p. 82 ff. , 2021
Link: https://dl.acm.org/doi/1..
 
?
12

Fair near neighbor search via sampling:

Aumuller, Martin ; Har-Peled, Sariel ; Mahabadi, Sepideh..
ACM SIGMOD Record.  50 (2021)  1 - p. 42-49 , 2021
Link: https://dl.acm.org/doi/1..
 
?
13

Differentially Private Sparse Vectors with Low Error, Optim..:

, In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security,
Aumüller, Martin ; Lebeda, Christian Janos ; Pagh, Rasmus - p. 1223-1236 , 2021
Link: https://dl.acm.org/doi/1..
 
?
14

On the I/O Complexity of the k-Nearest Neighbors Problem:

, In: Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems,
Goswami, Mayank ; Jacob, Riko ; Pagh, Rasmus - p. 205-212 , 2020
Link: https://dl.acm.org/doi/1..
 
?
15

Private Aggregation from Fewer Anonymous Messages:

, In: Advances in Cryptology – EUROCRYPT 2020; Lecture Notes in Computer Science,
Ghazi, Badih ; Manurangsi, Pasin ; Pagh, Rasmus. - p. 798-827 , 2020
Link: https://doi.org/10.1007/..
 
1-15