I agree that this site is using cookies. You can find further informations here.
X
Larsen, Kasper Green
625  results:
Search for persons X
?
1

How to Compress Encrypted Data:

, In: Advances in Cryptology – EUROCRYPT 2023; Lecture Notes in Computer Science,
Fleischhacker, Nils ; Larsen, Kasper Green ; Simkin, Mark - p. 551-577 , 2023
Link: https://doi.org/10.1007/..
 
?
2

Super-Logarithmic Lower Bounds for Dynamic Graph Problems:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),
Larsen, Kasper Green ; Yu, Huacheng - p. 1589-1604 , 2023
Link: https://doi.org/10.1109/..
 
?
3

Towards optimal lower bounds for k-median and k-means cores..:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Cohen-Addad, Vincent ; Larsen, Kasper Green ; Saulpic, David. - p. 1038-1051 , 2022
Link: https://dl.acm.org/doi/1..
 
?
4

Property-Preserving Hash Functions for Hamming Distance fro..:

, In: Advances in Cryptology – EUROCRYPT 2022; Lecture Notes in Computer Science,
Fleischhacker, Nils ; Larsen, Kasper Green ; Simkin, Mark - p. 764-781 , 2022
Link: https://doi.org/10.1007/..
 
?
5

Optimal oblivious priority queues:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Jafargholi, Zahra ; Larsen, Kasper Green ; Simkin, Mark - p. 2366-2383 , 2021
Link: https://dl.acm.org/doi/1..
 
?
6

Optimal Oblivious Priority Queues:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Jafargholi, Zahra ; Larsen, Kasper Green ; Simkin, Mark - p. 2366-2383 , 2021
Link: https://doi.org/10.1137/..
 
?
7

Lower Bounds for External Memory Integer Sorting via Networ..:

Farhadi, Alireza ; Hajiaghayi, MohammadTaghi ; Larsen, Kasper Green.
SIAM Journal on Computing.  52 (2021)  2 - p. STOC19-87-STOC19-111 , 2021
Link: https://doi.org/10.1137/..
 
?
8

Crossing the Logarithmic Barrier for Dynamic Boolean Data S..:

Larsen, Kasper Green ; Weinstein, Omri ; Yu, Huacheng
SIAM Journal on Computing.  49 (2020)  5 - p. STOC18-323-STOC18-367 , 2020
Link: https://doi.org/10.1137/..
 
?
9

Lower bounds for oblivious near-neighbor search:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
Larsen, Kasper Green ; Malkin, Tal ; Weinstein, Omri. - p. 1116-1134 , 2020
Link: https://dl.acm.org/doi/1..
 
?
10

Optimal Learning of Joint Alignments with a Faulty Oracle:

, In: 2020 Information Theory and Applications Workshop (ITA),
Larsen, Kasper Green ; Mitzenmacher, Michael ; Tsourakakis, Charalampos E. - p. 1-10 , 2020
Link: https://doi.org/10.1109/..
 
?
11

Lower bounds for external memory integer sorting via networ..:

Farhadi, Alireza ; Hajiaghayi, Mohammad Taghi ; Larsen, Kasper Green.
Communications of the ACM.  63 (2020)  10 - p. 97-105 , 2020
Link: https://doi.org/10.1145/..
 
?
12

Secret Sharing Lower Bound: Either Reconstruction is Hard o..:

, In: Lecture Notes in Computer Science; Security and Cryptography for Networks,
Larsen, Kasper Green ; Simkin, Mark - p. 566-578 , 2020
Link: https://doi.org/10.1007/..
 
?
13

Lower Bounds for Multi-server Oblivious RAMs:

, In: Theory of Cryptography; Lecture Notes in Computer Science,
Larsen, Kasper Green ; Simkin, Mark ; Yeo, Kevin - p. 486-503 , 2020
Link: https://doi.org/10.1007/..
 
?
14

Optimal Learning of Joint Alignments with a Faulty Oracle:

, In: 2020 IEEE International Symposium on Information Theory (ISIT),
Larsen, Kasper Green ; Mitzenmacher, Michael ; Tsourakakis, Charalampos E. - p. 2492-2497 , 2020
Link: https://doi.org/10.1109/..
 
?
15

Lower bounds for external memory integer sorting via networ..:

Farhadi, Alireza ; Hajiaghayi, Mohammad Taghi ; Larsen, Kasper Green.
Communications of the ACM.  63 (2020)  10 - p. 97-105 , 2020
Link: https://dl.acm.org/doi/1..
 
1-15