Articles with public access mandates - Kasper Green LarsenLearn more
Available somewhere: 43
Optimality of the Johnson-Lindenstrauss lemma
KG Larsen, J Nelson
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
Mandates: US National Science Foundation, US Department of Defense, Danish National …
Yes, there is an oblivious RAM lower bound!
KG Larsen, JB Nielsen
Annual International Cryptology Conference, 523-542, 2018
Mandates: European Commission
Heavy hitters via cluster-preserving clustering
KG Larsen, J Nelson, HL Nguyễn, M Thorup
Communications of the ACM 62 (8), 95-100, 2019
Mandates: US National Science Foundation, US Department of Defense, Danish Council for …
Faster online matrix-vector multiplication
KG Larsen, R Williams
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
Mandates: US National Science Foundation, Danish National Research Foundation
A dichotomy for regular expression membership testing
K Bringmann, A Grønlund, KG Larsen
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
Mandates: Danish National Research Foundation
Towards optimal lower bounds for k-median and k-means coresets
V Cohen-Addad, KG Larsen, D Saulpic, C Schwiegelshohn
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
Mandates: Danish Council for Independent Research, Agence Nationale de la Recherche
The query complexity of a permutation-based variant of Mastermind
P Afshani, M Agrawal, B Doerr, C Doerr, KG Larsen, K Mehlhorn
Discrete Applied Mathematics 260, 28-50, 2019
Mandates: Agence Nationale de la Recherche
On range searching in the group model and combinatorial discrepancy
KG Larsen
SIAM Journal on Computing 43 (2), 673-686, 2014
Mandates: Danish National Research Foundation
Crossing the logarithmic barrier for dynamic boolean data structure lower bounds
KG Larsen, O Weinstein, H Yu
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
Mandates: US National Science Foundation
How to prove knowledge of small secrets
C Baum, I Damgård, KG Larsen, M Nielsen
Annual International Cryptology Conference, 478-498, 2016
Mandates: Danish Council for Independent Research, Danish National Research Foundation …
Lower bounds for oblivious data structures
R Jacob, KG Larsen, JB Nielsen
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
Mandates: Danish Council for Independent Research, European Commission
New unconditional hardness results for dynamic and online problems
RCA Gronlund, A Grønlund, KG Larsen
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1089-1107, 2015
Mandates: Danish National Research Foundation, UK Engineering and Physical Sciences …
Tight cell probe bounds for succinct boolean matrix-vector multiplication
D Chakraborty, L Kamma, KG Larsen
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
Mandates: Villum Foundation, European Commission
Cleaning massive sonar point clouds
L Arge, KG Larsen, T Mølhave, F van Walderveen
Proceedings of the 18th SIGSPATIAL International Conference on Advances in …, 2010
Mandates: US National Institutes of Health
Improved Coresets for Euclidean -Means
V Cohen-Addad, K Green Larsen, D Saulpic, C Schwiegelshohn, ...
Advances in Neural Information Processing Systems 35, 2679-2694, 2022
Mandates: Danish Council for Independent Research, European Commission, Innovation …
On hardness of several string indexing problems
KG Larsen, JI Munro, JS Nielsen, SV Thankachan
Theoretical Computer Science 582, 74-82, 2015
Mandates: Natural Sciences and Engineering Research Council of Canada, Danish National …
Approximate range emptiness in constant time and optimal space
M Goswami, A Grønlund, KG Larsen, R Pagh
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
Mandates: Danish National Research Foundation
Lower bounds for external memory integer sorting via network coding
A Farhadi, MT Hajiaghayi, KG Larsen, E Shi
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
Mandates: US National Science Foundation
Lower bounds for multi-server oblivious RAMs
KG Larsen, M Simkin, K Yeo
Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC …, 2020
Mandates: European Commission
Communication lower bounds for statistically secure MPC, with or without preprocessing
I Damgård, KG Larsen, JB Nielsen
Annual International Cryptology Conference, 61-84, 2019
Mandates: Danish Council for Independent Research, European Commission
Publication and funding information is determined automatically by a computer program