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
Arge, L., Brodal, G. S., Truelsen, J. & Tsirogiannis, C. (2013).
An optimal and practical cache-oblivious algorithm for computing multiresolution rasters. In
Algorithms – ESA 2013: 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings (pp. 61-72). Springer VS.
https://doi.org/10.1007/978-3-642-40450-4_6
Axmanova, I., Kalusová, V., Danihelka, J., Dengler, J., Pergl, J., Pysek, P., Večeřa, M., Attorre, F., Biurrun, I., Boch, S., Conradi, T., Gavilán, R. G., Jimenez-Alfaro, B., Knollová, I., Kuzemko, A., Lenoir, J., Medvecká, J.
, Moeslund, J. E., Obratov-Petković, D. ... Chytrý, M. (2021).
Neophyte invasions in European grasslands.
Journal of Vegetation Science,
32(2), Article e12994.
https://doi.org/10.1111/jvs.12994
Baum, C., Damgård, I. B., Larsen, K. G. & Nielsen, M. (2016).
How to prove knowledge of small secrets. In J. Katz & M. Robshaw (Eds.),
Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings: CRYPTO 2016: Advances in Cryptology – CRYPTO 2016 (Vol. 9816, pp. 478-498). Springer VS.
https://doi.org/10.1007/978-3-662-53015-3_17
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., Jacob, R. & Vicari, E. (2010).
Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model.
Theory of Computing Systems,
47(4), 934-962.
https://doi.org/10.1007/s00224-010-9285-4
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
Bladt, J., Brunbjerg, A. K., Moeslund, J. E., Petersen, A. H.
& Ejrnæs, R., (2016).
Appendix 6: Opdatering af biodiversitetskortet for Danmark 2015, 10 p., Notat fra DCE - Nationalt Center for Miljø og Energi
Böhm, M., Fazzone, A., Leonardi, S., Menghini, C.
& Schwiegelshohn, C. (2021).
Algorithms for fair k-clustering with multiple protected attributes.
Operations Research Letters,
49(5), 787-789.
https://doi.org/10.1016/j.orl.2021.08.011
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
Proceedings - 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science, FOCS 2022 (pp. 462-473). IEEE.
https://doi.org/10.1109/FOCS54457.2022.00051
Brodal, G. S., Fagerberg, R.
& Moruz, G. (2005).
Cache-Aware and Cache-Oblivious Adaptive Sorting. In L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi & M. Yung (Eds.),
Automata, Languages and Programming: 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005. Proceedings (pp. 576-588). Springer.
https://doi.org/10.1007/11523468_47
Brodal, G. S. & Fagerberg, R. (2002).
Cache Oblivious Distribution Sweeping. In P. Widmayer, S. Eidenbenz, F. Triguero, R. Morales, R. Conejo & M. Hennessy (Eds.),
Automata, Languages and Programming: 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8–13, 2002 Proceedings (pp. 426-438). Springer.
https://doi.org/10.1007/3-540-45465-9_37
Brodal, G. S., Fagerberg, R., Bose, P. (Ed.) & Morin, P. (Ed.) (2002).
Funnel Heap - A Cache Oblivious Priority Queue. In P. Bose & P. Morin (Eds.),
Algorithms and Computation: 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21–23, 2002 Proceedings (pp. 219-228). Springer.
https://doi.org/10.1007/3-540-36136-7_20
Brodal, G. S., Fagerberg, R., Meyer, U. & Zeh, N. (2004).
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. In T. Hagerup & J. Katajainen (Eds.),
Algorithm Theory - SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004. Proceedings (pp. 480-492). Springer.
https://doi.org/10.1007/978-3-540-27810-8_41