Publications

Sand, A., Holt, M. K., Johansen, J., Brodal, G. S., Mailund, T. & Pedersen, C. N. S. (2014). tqDist: A Library for Computing the Quartet and Triplet Distances Between Binary and General Trees. Bioinformatics, 30(4), 2079-2080. https://doi.org/10.1093/bioinformatics/btu157

Sabatini, F. M., Lenoir, J., Hattab, T., Arnst, E. A., Chytrý, M., Dengler, J., De Ruffray, P., Hennekens, S. M., Jandt, U., Jansen, F., Jiménez-Alfaro, B., Kattge, J., Levesley, A., Pillar, V. D., Purschke, O., Sandel, B., Sultana, F., Aavik, T., Aćić, S. ... Bruelheide, H. (2021). sPlotOpen – An environmentally balanced, open-access, global dataset of vegetation plots. Global Ecology and Biogeography, 30(9), 1740-1764. https://doi.org/10.1111/geb.13346

Bruelheide, H., Dengler, J., Jiménez-Alfaro, B., Purschke, O., Hennekens, S. M., Chytrý, M., Pillar, V. D., Jansen, F., Kattge, J., Sandel, B., Aubin, I., Biurrun, I., Field, R., Haider, S., Jandt, U., Lenoir, J., Peet, R. K., Peyre, G., Sabatini, F. M. ... Zverev, A. (2019). sPlot – A new tool for global vegetation analyses. Journal of Vegetation Science, 30(2), 161-186. https://doi.org/10.1111/jvs.12710

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. Lecture Notes in Computer Science (LNCS) No. 10992 https://doi.org/10.1007/978-3-319-96881-0_18

Brodal, G. S. (1996). Worst-case efficient priority queues. In Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms (pp. 52-58). Society for Industrial and Applied Mathematics.

Brodal, G. S. & Katajainen, J. (1998). Worst-case efficient external-memory priority queues. In S. Arnborg & L. Ivansson (Eds.), Algorithm Theory — SWAT'98: 6th Scandinavian Workshop on Algorithm Theory Stockholm, Sweden, July 8–10, 1998 Proceedings (pp. 107-118). Springer. Lecture Notes in Computer Science Vol. 1432 https://doi.org/10.1007/BFb0054359

Brodal, G. S. (1997). Worst Case Efficient Data Structures. Department of Computer Science, Aarhus University. BRICS-DS No. 97-1 http://www.brics.dk/DS/97/1/BRICS-DS-97-1.pdf

Kejlberg-Rasmussen, C., Kopelowitz, T., Pettie, S. & Porat, E. (2014). Word-packing Algorithms for Dynamic Connectivity and Dynamic Sets. (1407.6755v1 ed.) arXiv.org. http://arxiv.org/abs/1407.6755v1

Moeslund, J. E. & Helsing, F., (2020). Vurdering og genvurdering af effekten af et indsamlingsforbud på bestemte dagsommerfuglearter, 6 p., Fagligt notat fra DCE – Nationalt Center for Miljø og Energi Vol. 2020 No. 47 https://dce.au.dk/fileadmin/dce.au.dk/Udgivelser/Notatet_2020/N2020_47.pdf

Moeslund, J. E. & Helsing, F., (2020). Vurdering af WWF’s anbefalinger om at udvide indsamlingsforbud af dagsommerfugle i Danmark, 5 p., Fagligt notat fra DCE – Nationalt Center for Miljø og Energi Vol. 2020 No. 54 https://dce.au.dk/fileadmin/dce.au.dk/Udgivelser/Notatet_2020/N2020_54.pdf

Nygaard, B., Elmeros, M., Holm, T. E., Kahlert, J. A., Moeslund, J. E., Therkildsen, O. R., Søgaard, B. & Ejrnæs, R. (2014). Vindmøller på § 3-beskyttede naturarealer: Potentielle konsekvenser for biodiversitet, fugle og flagermus. Aarhus Universitet, DCE - Nationalt Center for Miljø og Energi. Videnskabelig rapport fra DCE - Nationalt Center for Miljø og Energi No. 115 http://dce2.au.dk/pub/SR115.pdf

Ejrnæs, R., Moeslund, J. E., Brunbjerg, A. K., Groom, G. B. & Bladt, J. (2018). Videreudvikling af lokal bioscore for biodiversitetskortet for Danmark. Aarhus Universitet, DCE – Nationalt Center for Miljø og Energi ©. Teknisk rapport fra DCE - Nationalt Center for Miljø og Energi Vol. 122 http://dce2.au.dk/pub/TR122.pdf

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

Clifford, R., Grønlund, A., Larsen, K. G. & Starikovskaya, T. (2018). Upper and lower bounds for dynamic data structures on strings. In R. Niedermeier & B. Vallée (Eds.), 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018 (Vol. 96, pp. 22:1-22:14). [22] Schloss Dagstuhl--Leibniz-Zentrum für Informatik. Leibniz International Proceedings in Informatics No. 96 https://doi.org/10.4230/LIPIcs.STACS.2018.22

Johannsen, V. K., Rojas, S. K., Brunbjerg, A. K., Schumacher, J., Bladt, J., Bladt, J., Nyed, P., Moeslund, J. E., Nord-Larsen, T. & Ejrnæs, R. (2015). Udvikling af et High Nature Value - HNV-skovkort for Danmark: IGN Rapport November 2015, Institut for Geovidenskab og Naturforvaltning, Københavns Universitet, Frederiksberg.

Moeslund, J. E., Nygaard, B., Normand, S. & Madsen, B. (2021). Udredning af alternative datakilder i NOVANA-programmets naturtypeovervågning. Aarhus Universitet, DCE - Nationalt Center for Miljø og Energi. Videnskabelig rapport fra DCE - Nationalt Center for Miljø og Energi No. 458 https://dce2.au.dk/pub/SR458.pdf

Stølting Brodal, G., Davoodi, P., Lewenstein, M., Raman, R. & Satti, S. R. (2016). Two dimensional range minimum queries and Fibonacci lattices. Theoretical Computer Science, 638, 33-43. https://doi.org/10.1016/j.tcs.2016.02.016

Brodal, G. S., Davoodi, P., Lewenstein, M., Raman, R. & Rao, S. S. (2012). Two Dimensional Range Minimum Queries and Fibonacci Lattices. Lecture Notes in Computer Science, 7501, 217-228 . https://doi.org/10.1007/978-3-642-33090-2_20

Brodal, G. S. & Moruz, G. (2005). Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms. In F. Dehne, A. Lopez-Ortiz & J-R. Sack (Eds.), Algorithms and Data Structures: 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005. Proceedings (pp. 385-395). Springer. Lecture Notes in Computer Science Vol. 3608 https://doi.org/10.1007/11534273_34

Brodal, G. S., Gfeller, B., Jørgensen, A. G. & Sanders, P. (2011). Towards optimal range medians. Theoretical Computer Science, 412(24), 2588-2601. https://doi.org/10.1016/j.tcs.2010.05.003

Cohen-Addad, V., Larsen, K. G., Saulpic, D. & Schwiegelshohn, C. (2022). Towards optimal lower bounds for k-median and k-means coresets. In S. Leonardi & A. Gupta (Eds.), STOC 2022 - Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (pp. 1038-1051). Association for Computing Machinery. https://doi.org/10.1145/3519935.3519946

Grønlund, A. & Larsen, K. G. (2016). Towards Tight Lower Bounds for Range Reporting on the RAM. Leibniz International Proceedings in Informatics, 55, 92:1 - 92:12. https://doi.org/10.4230/LIPIcs.ICALP.2016.92

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), [91]. https://doi.org/10.1890/ES13-00134.1

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

Brodal, G. S. & Jacob, R. (2001). Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries. Electronic Colloquium on Computational Complexity, 92(ALCOMFT-TR-01-176).

Brodal, G. S. & Jacob, R. (2003). Time-Dependent Networks as Models to Achieve Fast Exact Time-Table Queries. Electronic Notes in Theoretical Computer Science, 92, 3-15. https://doi.org/10.1016/j.entcs.2003.12.019

Alstrup, S., Brodal, G. S., Gørtz, I. L. & Rauhe, T. (2001). Time and Space Efficient Multi-Method Dispatching. Electronic Colloquium on Computational Complexity, (ITU-TR-2001-8).

Alstrup, S., Brodal, G. S., Gørtz, I. L. & Rauhe, T. (2002). Time and Space Efficient Multi-Method Dispatching. In M. Penttonen & E. M. Schmidt (Eds.), Algorithm Theory — SWAT 2002: 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3–5, 2002 Proceedings (pp. 20-29). Springer. Lecture Notes in Computer Science Vol. 2368 https://doi.org/10.1007/3-540-45471-3_3

Larsen, K. G., Nelson, J. & Nguyen, H. L. (2015). Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms. In R. Servedio & R. Rubinfeld (Eds.), Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC '15 (pp. 803-812). Association for Computing Machinery. https://doi.org/10.1145/2746539.2746542

Chakraborty, D., Kamma, L. & Larsen, K. G. (2018). Tight cell probe bounds for succinct boolean matrix-Vector multiplication. In STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (pp. 1297-1306). Association for Computing Machinery. A C M Symposium on the Theory of Computing. Annual Proceedings No. 2018 https://doi.org/10.1145/3188745.3188830

Moeslund, J. E. (2012). The role of topography in determining local plant diversity patterns across Denmark. Aarhus University, Faculty of Science and Technology.

Odgaard, M. V., Moeslund, J. E., Bøcher, P. K., Dalgaard, T. & Svenning, J-C. (2013). The relative importance of geophysical constraints, amenity values, and farm-related factors in the dynamics of grassland set-aside. Agriculture, Ecosystems & Environment, 164, 286-291. https://doi.org/10.1016/j.agee.2012.09.009

Brodal, G. S., Chaudhuri, S. & Radhakrishnan, J. (1996). The randomized complexity of maintaining the minimum. Nordic Journal of Computing, 3(4), 337-351.

Afshani, P., Agrawal, M., Doerr, B., Doerr, C., Larsen, K. G. & Mehlhorn, K. (2019). The query complexity of a permutation-based variant of Mastermind. Discrete Applied Mathematics, 260, 28-50. https://doi.org/10.1016/j.dam.2019.01.007

Andersen, A. H., Clausen, K. K., Normand, S., Vikstrøm, T. & Moeslund, J. E. (2023). The influence of landscape characteristics on breeding bird dark diversity. Oecologia, 201(4), 1039-1052. https://doi.org/10.1007/s00442-023-05351-8

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.

Brodal, G. S., Brodnik, A. & Davoodi, P. (2013). The encoding complexity of two dimensional range minimum data structures. In H. L. Bodlaender & G. F. Italiano (Eds.), Algorithms – ESA 2013: 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings (pp. 229-240). Springer VS. Lecture Notes in Computer Science Vol. 8125 https://doi.org/10.1007/978-3-642-40450-4_20

Afshani, P., Afrawal, M., Benjamin, D., Larsen, K. G., Mehlhorn, K. & Winzen, C. (2012). The Query Complexity of Finding a Hidden Permutation. Electronic Colloquium on Computational Complexity, (TR12-087). http://eccc.hpi-web.de/report/2012/087/

Afshani, P., Agrawal, M., Benjamin, D., Doerr, C., Larsen, K. G. & Mehlhorn, K. (2013). The Query Complexity of Finding a Hidden Permutation. In A. Brodnik, A. López-Ortiz, V. Raman & A. Viola (Eds.), Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday (pp. 1-11). Springer VS. Lecture Notes in Computer Science Vol. 8066 https://doi.org/10.1007/978-3-642-40273-9_1

Braverman, V., Cohen-Addad, V., Jiang, S. H-C., Krauthgamer, R., Schwiegelshohn, C., Toftrup, M. B. & Wu, X. (2022). The Power of Uniform Sampling for Coresets. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (pp. 462-473). IEEE. https://doi.org/10.1109/FOCS54457.2022.00051

Larsen, K. G. & Nelson, J. (2016). The Johnson-Lindenstrauss Lemma Is Optimal for Linear Dimensionality Reduction. Leibniz International Proceedings in Informatics, 55, 82:1 - 82:11. https://doi.org/10.4230/LIPIcs.ICALP.2016.82

Bender, M. A., Brodal, G. S., Fagerberg, R., Ge, D., He, S., Hu, H., Iacono, J. & López-Ortiz, A. (2003). The Cost of Cache-Oblivious Searching. In Proc. 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS): IEEE Computer Society Press, Washington D.C. (Vol. Session 6, pp. 271-282). IEEE Computer Society Press.

Bender, M. A., Brodal, G. S., Fagerberg, R., Ge, D., He, S., Hu, H., Iacono, J. & López-Ortiz, A. (2011). The Cost of Cache-Oblivious Searching. Algorithmica, 61(2), 463-505. https://doi.org/10.1007/s00453-010-9394-0

Brodal, G. S., Fagerberg, R., Pedersen, C. N. S. & Östlin, A. (2001). The Complexity of Constructing Evolutionary Trees Using Experiments. In F. Orejas, P. G. Spirakis & J. van Leeuwen (Eds.), Automata, Languages and Programming: 28th International Colloquium, ICALP 2001 Crete, Greece, July 8–12, 2001 Proceedings (pp. 140-151). Springer. Lecture Notes in Computer Science Vol. 2076 https://doi.org/10.1007/3-540-48224-5_12

Brodal, G. S. & Skyum, S. (1996). The Complexity of Computing the -ary Composition of a Binary Associative Operator. Department of Computer Science, Aarhus University. BRICS-RS No. 96-42 http://www.brics.dk/RS/96/42/BRICS-RS-96-42.pdf

Westergaard, M., Kristensen, L. M., Brodal, G. S. & Arge, L. (2007). The ComBack Method - Extending Hash Compaction with Backtracking. In Petri Nets and Other Models of Concurrency – ICATPN 2007: 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, Siedlce, Poland, June 25-29, 2007. Proceedings (pp. 455-464). Springer. Lecture Notes in Computer Science Vol. 4546 https://doi.org/10.1007/978-3-540-73094-1_26

Larsen, K. G. (2012). The Cell Probe Complexity of Dynamic Range Counting. In STOC’12 : Proceedings of the 44th symposium on Theory of Computing (pp. 85-94). Association for Computing Machinery. https://doi.org/10.1145/2213977.2213987

Sporbert, M., Keil, P., Seidler, G., Bruelheide, H., Jandt, U., Aćić, S., Biurrun, I., Campos, J. A., Čarni, A., Chytrý, M., Ćušterevska, R., Dengler, J., Golub, V., Jansen, F., Kuzemko, A., Lenoir, J., Marceno, C., Moeslund, J. E., Pérez-Haase, A. ... Welk, E. (2020). Testing macroecological abundance patterns: the relationship between local abundance and range size, range position and climatic suitability among European vascular plants. Journal of Biogeography, 47(10), 2210-2222. https://doi.org/10.1111/jbi.13926

Bringmann, K. & Larsen, K. G. (2013). Succinct Sampling from Discrete Distributions. In Proceedings of the 45th annual ACM Symposium on Theory of Computing, STOC '13 (pp. 775-782 ). Association for Computing Machinery. A C M Symposium on the Theory of Computing. Annual Proceedings https://doi.org/10.1145/2488608.2488707

Displaying results 1 to 50 out of 340

Revised 17.04.2023

Department of Computer Science

Publications

Kasper Green Larsen

Peyman Afshani

Gerth Stølting Brodal

Chris Schwiegelshohn

Publications

Head of research

Kasper Green Larsen

Faculty

Peyman Afshani

Gerth Stølting Brodal

Chris Schwiegelshohn