Publications

Larsen, K. G., Weinstein, O. & Yu, H. (2018). Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds. In M. Henzinger, D. Kempe & I. Diakonikolas (Eds.), STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (pp. 978-989). Association for Computing Machinery. https://doi.org/10.1145/3188745.3188790

Larsen, K. G. & Nielsen, J. B. (2018). Yes, There is an Oblivious RAM Lower Bound! In H. Shacham & A. Boldyreva (Eds.), Advances in Cryptology -- CRYPTO 2018 (pp. 523-542). Springer VS. https://doi.org/10.1007/978-3-319-96881-0_18

Larsen, K. G., Nelson, J., Huy L Nguyen & Thorup, M. (2019). Heavy Hitters via Cluster-Preserving Clustering. Communications of the ACM, 62(8), 95-100. https://doi.org/10.1145/3339185

Larsen, K. G. (2014). ON range searching in the group model and combinatorial discrepancy. S I A M Journal on Computing, 43(2), 673-686. https://doi.org/10.1137/120865240

Larsen, K. G., Malkin, T., Weinstein, O. & Yeo, K. (2020). Lower Bounds for Oblivious Near-Neighbor Search. In S. Chawla (Ed.), SODA '20: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1116-1134). Society for Industrial and Applied Mathematics. https://doi.org/10.5555/3381089.3381157

Larsen, K. G. (2019). Constructive Discrepancy Minimization with Hereditary L2 Guarantees. In R. Niedermeier & C. Paul (Eds.), 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019) Article 48 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.STACS.2019.48

Larsen, K. G., Mitzenmacher, M. & Tsourakakis, C. E. (2020). Optimal Learning of Joint Alignments with a Faulty Oracle. In 2020 IEEE International Symposium on Information Theory, ISIT 2020 (pp. 2492-2497). IEEE. https://doi.org/10.1109/ISIT44484.2020.9174310

Larsen, K. G. & Simkin, M. (2020). Secret sharing lower bound: Either reconstruction is hard or shares are long. In C. Galdi & V. Kolesnikov (Eds.), Security and Cryptography for Networks (pp. 566-578). Springer. https://doi.org/10.1007/978-3-030-57990-6_28

Larsen, K. G., Simkin, M. & Yeo, K. (2020). Lower Bounds for Multi-server Oblivious RAMs. In R. Pass & K. Pietrzak (Eds.), Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings (pp. 486-503). Springer. https://doi.org/10.1007/978-3-030-64375-1_17

Larsen, K. G., Starup, J. L. & Steensgaard, J. (2021). Further Unifying the Landscape of Cell Probe Lower Bounds. 224-231. Paper presented at Happening virtually , -. https://cs.au.dk/~larsen/papers/FurtherUnifying.pdf

Larsen, K. G., Pagh, R. & Tetek, J. (2021). CountSketches, Feature Hashing and the Median of Three. In M. Meila & T. Zhang (Eds.), Proceedings of the 38th International Conference on Machine Learning, ICML 2021 (pp. 6011-6020) http://proceedings.mlr.press/v139/larsen21a.html

Larsen, K. G. & Ritzert, M. (2022). Optimal Weak to Strong Learning. arxiv.org. https://doi.org/10.48550/arXiv.2206.01563

Larsen, K. G., Obremski, M. & Simkin, M. (2023). Distributed Shuffling in Adversarial Environments. In K.-M. Chung (Ed.), 4th Conference on Information-Theoretic Cryptography, ITC 2023 Article 10 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2023.10

Larsen, K. G. (2023). Bagging is an Optimal PAC Learner. In G. Neu & L. Rosasco (Eds.), Proceedings of COLT 2023 (Vol. 195, pp. 450-468). MLResearch Press.

Larsen, K. G. (2023). Fast Discrepancy Minimization with Hereditary Guarantees. In N. Bansal & V. Nagarajan (Eds.), Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 276-289). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977554.ch11

Larsen, K. G., Pagh, R., Persiano, G., Pitassi, T., Yeo, K. & Zamir, O. (2024). Optimal Non-Adaptive Cell Probe Dictionaries and Hashing. In K. Bringmann, M. Grohe, G. Puppis & O. Svensson (Eds.), 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024 Article 104 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2024.104

Larsen, K. G. (2024). From TCS to Learning Theory. In R. Kralovic & A. Kucera (Eds.), 49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024 Article 4 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.MFCS.2024.4

Larsen, K. G. & Yu, H. (2023). Super-Logarithmic Lower Bounds for Dynamic Graph Problems. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) (pp. 1589-1604). IEEE. https://doi.org/10.1109/FOCS57990.2023.00096

Larsen, K. G. (2024). Bagging is an Optimal PAC Learner (Extended Abstract). In K. Larson (Ed.), Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence (IJCAI-24) (pp. 8411-8415). IJCAI Organization. https://doi.org/10.24963/ijcai.2024/932

Larsen, K. G. (2013). Models and Techniques for Proving Data Structure Lower Bounds. Department of Computer Science, Aarhus University.

Larsen, K. G. & Simkin, M. (2025). Time/Space Tradeoffs for Generic Attacks on Delay Functions. In Theory of Cryptography: 23rd International Conference, TCC 2025, Aarhus, Denmark, December 1–5, 2025, Proceedings, Part IV (pp. 451-477). Springer. https://doi.org/10.1007/978-3-032-12290-2_15

Larsen, K. G. & Schalburg, N. (2025). Tight Generalization Bounds for Large-Margin Halfspaces. In The Thirty-ninth Annual Conference on Neural Information Processing Systems https://openreview.net/forum?id=wAq0ZLxrGq

Leblanc, C., Bonnet, P., Servajean, M., Chytrý, M., Aćić, S., Argagnon, O., Bergamini, A., Biurrun, I., Bonari, G., Campos, J. A., Čarni, A., Ćušterevska, R., De Sanctis, M., Dengler, J., Garbolino, E., Golub, V., Jandt, U., Jansen, F., Lebedeva, M. ... Joly, A. (2024). A deep-learning framework for enhancing habitat identification based on species composition. Applied Vegetation Science, 27(3), Article e12802. https://doi.org/10.1111/avsc.12802

Leblanc, C., Bonnet, P., Servajean, M., Thuiller, W., Chytrý, M., Aćić, S., Argagnon, O., Biurrun, I., Bonari, G., Bruelheide, H., Campos, J. A., Čarni, A., Ćušterevska, R., De Sanctis, M., Dengler, J., Dziuba, T., Garbolino, E., Jandt, U., Jansen, F. ... Joly, A. (2025). Learning the syntax of plant assemblages. Nature Plants, 11(10), 2026-2040. https://doi.org/10.1038/s41477-025-02105-7

Madalgo, P. A., Barbay, J. & Chan, T. M. (2017). Instance-optimal geometric algorithms. Journal of the ACM, 64(1), Article 3. https://doi.org/10.1145/3046673

Mai, T., Munteanu, A., Musco, C., Rao, A. B., Schwiegelshohn, C. & Woodruff, D. P. (2023). Optimal Sketching Bounds for Sparse Linear Regression. In Proceedings of The 26th International Conference on Artificial Intelligence and Statistics (pp. 11288-11316). PMLR. https://proceedings.mlr.press/v206/mai23a.html

Mailund , Brodal, G. S., Fagerberg, R., Pedersen, C. N. S. & Phillips, D. (2006). Recrafting the Neighbor-Joining Method. BMC Bioinformatics, 7(29).

Midolo, G., Clark, A. T., Chytrý, M., Essl, F., Dullinger, S., Jandt, U., Bruelheide, H., Argagnon, O., Biurrun, I., Chiarucci, A., Ćušterevska, R., De Frenne, P., De Sanctis, M., Dengler, J., Divíšek, J., Dziuba, T., Ejrnæs, R., Garbolino, E., Illa, E. ... Keil, P. (2025). Six Decades of Losses and Gains in Alpha Diversity of European Plant Communities. Ecology Letters, 28(11), Article e70248. https://doi.org/10.1111/ele.70248

Moeslund, J. E., Bøcher, P. K., Svenning, J.-C., Møllehave, T. & Arge, L. (2009). Impacts of 21^stcentury sea-level rise on a Danish major city - an assessment based on fine-resolution digital topography and a new flooding algorithm. IOP Conference Series: Earth and Environment Science, 8(1), 012022. https://doi.org/10.1088/1755-1315/8/1/012022

Moeslund, J. E., Arge, L., Bøcher, P. K., Nygaard, B. & Svenning, J.-C. (2009). Konsekvenser af "coastal squeezing" for plantesamfund på strandenge i Danmark.

Moeslund, J. E., Arge, L. A., Bøcher, P. K., Nygaard, B. & Svenning, J.-C. (2009). The impacts of coastal squeezing on salt-meadow plant communities in Denmark. Poster session presented at Beyond Kyoto: Addressing the challenges of climate change, Aarhus, Denmark.

Moeslund, J. E., Arge, L. A., Bøcher, P. K., Nygaard, B. & Svenning, J.-C. (2011). Geographically Comprehensive Assessment of Salt-Meadow Vegetation-Elevation Relations Using LiDAR. Wetlands, 31(3), 471-482. https://doi.org/10.1007/s13157-011-0179-2

Moeslund, J. E., Arge, L., Bøcher, P. K., Dalgaard, T., Ejrnæs, R., Odgaard, M. V. & Svenning, J.-C. (2013). Topographically controlled soil moisture drives plant diversity patterns within grasslands. Biodiversity and Conservation, 22(10), 2151-2166. https://doi.org/10.1007/s10531-013-0442-3

Moeslund, J. E., Arge, L., Bøcher, P. K., Dalgaard, T. & Svenning, J.-C. (2013). Topography as a driver of local terrestrial vascular plant diversity patterns. Nordic Journal of Botany, 31(2), 129-144. https://doi.org/10.1111/j.1756-1051.2013.00082.x

Moeslund, J. E., Arge, L., Bøcher, P. K., Dalgaard, T., Odgaard, M. V., Nygaard, B. & Svenning, J.-C. (2013). Topographically controlled soil moisture is the primary driver of local vegetation patterns across a lowland region. Ecosphere (Washington, D.C.), 4(7), Article 91. https://doi.org/10.1890/ES13-00134.1

Moeslund, J. E., Brunbjerg, A. K., Clausen, K. K., Dalby, L., Fløjgaard, C., Juel, A. & Lenoir, J. (2015). Dark diversity illuminates the dim side of restoration. Poster session presented at International Congress for Conservation Biology, Montpellier, France.

Moeslund, J. E. (2016, Jul 15). Small steps for man, giant leaps for plants. http://blogs.springer.com/lst/small-steps-man-giant-leaps-plants/

Moeslund, J. E., Brunbjerg, A. K., Clausen, K., Dalby, L., Fløjgaard, C., Juel, A. & Lenoir, J. (2017). Using dark diversity and plant characteristics to guide conservation and restoration. Journal of Applied Ecology, 54(6), 1730-1741. https://doi.org/10.1111/1365-2664.12867

Moeslund, J. E., Ejrnæs, R. & Wind, P. (2015). Manual til rødlistevurdering af danske arter 2013-2019. Aarhus University, DCE - Danish Centre for Environment and Energy. Teknisk rapport fra DCE - Nationalt Center for Miljø og Energi No. 54