Follow
Kasper Green Larsen
Title
Cited by
Cited by
Year
Orthogonal range searching on the RAM, revisited
TM Chan, KG Larsen, M Pătraşcu
Proceedings of the twenty-seventh annual symposium on Computational geometry …, 2011
2222011
Optimality of the Johnson-Lindenstrauss lemma
KG Larsen, J Nelson
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
1142017
Yes, there is an oblivious RAM lower bound!
KG Larsen, JB Nielsen
Annual International Cryptology Conference, 523-542, 2018
872018
The cell probe complexity of dynamic range counting
KG Larsen
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
792012
Heavy hitters via cluster-preserving clustering
KG Larsen, J Nelson, HL Nguyễn, M Thorup
Communications of the ACM 62 (8), 95-100, 2019
732019
Mental models and programming aptitude
ME Caspersen, KD Larsen, J Bennedsen
Proceedings of the 12th annual SIGCSE conference on Innovation and …, 2007
682007
The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction
KG Larsen, J Nelson
arXiv preprint arXiv:1411.2404, 2014
672014
Linear-Space Data Structures for Range Mode Query in Arrays
TM Chan, S Durocher, KG Larsen, J Morrison, BT Wilkinson
56*
Higher Cell Probe Lower Bounds for Evaluating Polynomials
KG Larsen
52*
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
512017
Range selection and median: Tight cell probe lower bounds and adaptive data structures
AG Jørgensen, KG Larsen
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2011
512011
Orthogonal range reporting in three and higher dimensions
P Afshani, L Arge, KD Larsen
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 149-158, 2009
502009
Fast exact k-means, k-medians and Bregman divergence clustering in 1D
A Grønlund, KG Larsen, A Mathiasen, JS Nielsen, S Schneider, M Song
arXiv preprint arXiv:1701.07204, 2017
492017
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
P Afshani, L Arge, KD Larsen
Proceedings of the 2010 annual symposium on Computational geometry, 240-246, 2010
482010
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
47*2019
Faster online matrix-vector multiplication
KG Larsen, R Williams
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
472017
On range searching in the group model and combinatorial discrepancy
KG Larsen
SIAM Journal on Computing 43 (2), 673-686, 2014
462014
Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model
P Afshani, L Arge, KG Larsen
Proc. 28th ACM Symposium on Computational Geometry, 2012
442012
Cell probe lower bounds and approximations for range mode
M Greve, A Jørgensen, K Larsen, J Truelsen
Automata, Languages and Programming, 605-616, 2010
412010
How to prove knowledge of small secrets
C Baum, I Damgård, KG Larsen, M Nielsen
Annual International Cryptology Conference, 478-498, 2016
392016
The system can't perform the operation now. Try again later.
Articles 1–20