| Threesomes, degenerates, and love triangles A Grønlund, S Pettie Journal of the ACM (JACM) 65 (4), 1-25, 2018 | 149* | 2018 |
| Fast Exact k-Means, k-Medians and Bregman Divergence Clustering in 1D A Grønlund, KG Larsen, A Mathiasen, ... arXiv preprint arXiv:1701.07204, 2017 | 68 | 2017 |
| 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 | 64 | 2017 |
| Geometric computations on indecisive points A Jørgensen, M Löffler, JM Phillips Workshop on Algorithms and Data Structures, 536-547, 2011 | 57* | 2011 |
| 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 | 56 | 2011 |
| Towards optimal range medians GS Brodal, B Gfeller, AG Jørgensen, P Sanders Theoretical Computer Science 412 (24), 2588-2601, 2011 | 52 | 2011 |
| Optimal resilient dynamic dictionaries GS Brodal, R Fagerberg, I Finocchi, F Grandoni, GF Italiano, ... European Symposium on Algorithms, 347-358, 2007 | 48 | 2007 |
| Priority queues resilient to memory faults AG Jørgensen, G Moruz, T Mølhave Algorithms and Data Structures: 10th International Workshop, WADS 2007 …, 2007 | 44 | 2007 |
| Cell probe lower bounds and approximations for range mode M Greve, AG Jørgensen, KD Larsen, J Truelsen International Colloquium on Automata, Languages, and Programming, 605-616, 2010 | 41 | 2010 |
| Data structures for range median queries GS Brodal, AG Jørgensen International Symposium on Algorithms and Computation, 822-831, 2009 | 36 | 2009 |
| New Unconditional Hardness Results for Dynamic and Online Problems RC Allan Gronlund, KG Larsen Foundations of Computer Science (FOCS), 2015 IEEE 56th Annual Symposium on …, 2015 | 34* | 2015 |
| A Linear Time Algorithm for the k Maximal Sums Problem GS Brodal, AG Jørgensen Mathematical Foundations of Computer Science 2007: 32nd International …, 2007 | 31 | 2007 |
| Approximate Range Emptiness in Constant Time and Optimal Space KG Larsen, G Allan, M Goswami, P Rasmus ACM-SIAM Symposium on Discrete Algorithms, 2015 | 27* | 2015 |
| Near-tight margin-based generalization bounds for support vector machines A Grønlund, L Kamma, KG Larsen International Conference on Machine Learning, 3779-3788, 2020 | 20 | 2020 |
| Upper and lower bounds for dynamic data structures on strings R Clifford, A Grønlund, KG Larsen, T Starikovskaya arXiv preprint arXiv:1802.06545, 2018 | 19 | 2018 |
| Margin-based generalization lower bounds for boosted classifiers A Grønlund, L Kamma, K Green Larsen, A Mathiasen, J Nelson Advances in Neural Information Processing Systems 32, 2019 | 16 | 2019 |
| Counting in the presence of memory faults G Brodal, A Jørgensen, G Moruz, T Mølhave Algorithms and Computation, 842-851, 2009 | 11 | 2009 |
| Fault tolerant external memory algorithms G Brodal, A Jørgensen, T Mølhave Algorithms and Data Structures, 411-422, 2009 | 11 | 2009 |
| Margins are insufficient for explaining gradient boosting A Grønlund, L Kamma, K Green Larsen Advances in Neural Information Processing Systems 33, 1902-1912, 2020 | 9 | 2020 |
| Optimal minimal margin maximization with boosting A Mathiasen, KG Larsen, A Grønlund International Conference on Machine Learning, 4392-4401, 2019 | 6 | 2019 |
Kasper Green LarsenProfessor, Computer Science, Aarhus University在 cs.au.dk 的电子邮件经过验证
