Brodal, G. S., Fagerberg, R., Hammer, D., Meyer, U., Penschuck, M. & Tran, H. (2021).
An experimental study of external memory algorithms for connected components. In D. Coudert & E. Natale (Eds.),
19th International Symposium on Experimental Algorithms, SEA 2021 (pp. 23). Article 23 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.SEA.2021.23
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
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
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
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
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
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
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
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
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.
https://doi.org/10.1007/3-540-45471-3_3
Alstrup, S.
, Brodal, G. S. & Rauhe, T. (2000).
Pattern matching in dynamic texts. In D. Shmoys (Ed.),
Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms (pp. 819-828). Society for Industrial and Applied Mathematics.
Alexander, C., Moeslund, J. E., Bøcher, P. K., Arge, L. & Svenning, J-C. (2013).
Airborne laser scanner (LiDAR) proxies for understory light conditions.
Remote Sensing of Environment,
134, 152-161.
https://doi.org/10.1016/j.rse.2013.02.028
Alamdari, S., Angelini, P., Chan, T. M., Di Battista, G., Frati, F., Lubiw, A., Patrignani, M., Roselli, V., Singla, S.
& Wilkinson, B. T. (2013).
Morphing Planar Graph Drawings with a Polynomial Number of Steps.
The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings,
24, 1656-1667.
http://knowledgecenter.siam.org/0236-000137/0236-000137/1
Alamdari, S., Angelini, P., Barrera-Cruz, F., Chan, T. M., Da Lozzo, G., Di Battista, G., Frati, F., Haxell, P., Lubiw, A., Patrignani, M., Roselli, V., Singla, S.
& Wilkinson, B. T. (2017).
How to Morph Planar Graph Drawings.
S I A M Journal on Computing,
46(2), 824-852.
https://doi.org/10.1137/16M1069171