Publications

Brodal, G. S. & Fagerberg, R. (1999). Dynamic Representations of Sparse Graphs. In F. Dehne, J-R. Sack, A. Gupta & R. Tamassia (Eds.), Algorithms and Data Structures: 6th International Workshop, WADS’99 Vancouver, Canada, August 11–14, 1999 Proceedings (pp. 773-782). Springer. Lecture Notes in Computer Science Vol. 1663 https://doi.org/10.1007/3-540-48447-7_34

Brodal, G. S. & Leonardi, S. (Eds.) (2005). ESA 2005: 13th Annual European Symposium: Springer LNCS 3669.

Assmann, J. J., Moeslund, J. E., Treier, U. A. & Normand, S. (2022). EcoDes-DK15: high-resolution ecological descriptors of vegetation and terrain derived from Denmark's national airborne laser scanning data set. Earth System Science Data, 14(2), 823-844. https://doi.org/10.5194/essd-14-823-2022

Brunbjerg, A. K., Bruun, H. H., Moeslund, J. E., Sadler, J. P., Svenning, J-C. & Ejrnæs, R. (2015). Ecospace - a unified framework for understanding variation in biodiversity. Poster session presented at Biodiversitetssymposiet 2015, Aarhus , Denmark.

Brunbjerg, A. K., Bruun, H. H., Moeslund, J. E., Sadler, J. P., Svenning, J-C. & Ejrnæs, R. (2017). Ecospace: a unified framework for understanding variation in terrestrial biodiversity. Basic and Applied Ecology, 18, 86-94. https://doi.org/10.1016/j.baae.2016.09.002

Brodal, G. S., Fagerberg, R., Mailund, T., Pedersen, C. N. S. & Sand, A. (2013). Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree. The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings, 24, 1814-1832. http://knowledgecenter.siam.org/0236-000098/0236-000098/1

Brodal, G. S., Fagerberg, R. & Vinther, K. (2004). Engineering a Cache-Oblivious Sorting Algorithm. In Proceedings of the Sixth Annual Workshop on Algorithm Engineering and Experiments, ALENEX '04 (pp. 4-17). Society for Industrial and Applied Mathematics.

Brodal, G. S., Fagerberg, R. & Vinther, K. (2007). Engineering a Cache-Oblivious Sorting Algorithm. Journal of Experimental Algorithmics, 12. https://doi.org/10.1145/1227161.1227164

Chytrý, M., Hennekens, S. M., Jiménez-Alfaro, B., Knollová, I., Dengler, J., Jansen, F., Landucci, F., Schaminée, J. H. J., Aćić, S., Agrillo, E., Ambarlı, D., Angelini, P., Apostolova, I., Attorre, F., Berg, C., Bergmeier, E., Biurrun, I., Botta-Dukát, Z., Brisse, H. ... Yamalov, S. (2015). European Vegetation Archive (EVA): an integrated database of European vegetation plots. Applied Vegetation Science, 19(1), 173-180. https://doi.org/10.1111/avsc.12191

Belazzougui, D., Brodal, G. S. & Nielsen, J. A. S. (2014). Expected linear time sorting for word size Ω(log² n log log n). In R. Ravi & I. L. Gørtz (Eds.), Algorithm Theory – SWAT 2014: 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings (pp. 26-37). Springer VS. Lecture Notes in Computer Science Vol. 8503 https://doi.org/10.1007/978-3-319-08404-6_3

Wilkinson, B. T. (2015). Exploring the Problem Space of Orthogonal Range Searching. Department of Computer Science, Aarhus University.

Arge, L., Brodal, G. S. & Satti, S. R. (2008). External Memory Planar Point Location with Logarithmic Updates. In M. Teilaud (Ed.), Proceedings of the twenty-fourth annual symposium on Computational geometry (pp. 139-147). Association for Computing Machinery. https://doi.org/10.1145/1377676.1377699

Arge, L. A., Brodal, G. S. & Satti, S. R. (2012). External Memory Planar Point Location with Logarithmic Updates. Algorithmica, 63(1-2), 457-475. https://doi.org/10.1007/s00453-011-9541-2

Brodal, G. S. (2016). External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates. In N. Ollinger & H. Vollmer (Eds.), 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016) (Vol. 47, pp. 23:1-23:14). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH. Leibniz International Proceedings in Informatics https://doi.org/10.4230/LIPIcs.STACS.2016.23

Schmidt, M., Schwiegelshohn, C. & Sohler, C. (2020). Fair Coresets and Streaming Algorithms for Fair k-means. In E. Bampis & N. Megow (Eds.), Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Revised Selected Papers (pp. 232-251). Springer. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 11926 LNCS https://doi.org/10.1007/978-3-030-39479-0_16

Brodal, G. S., Demaine, E. D. & Munro, J. I. (2005). Fast Allocation and Deallocation with an Improved Buddy System. Acta Informatica, 41(4-5), 273-291. https://doi.org/10.1007/s00236-004-0159-6

de Berg, M., Tsirogiannis, C. & Wilkinson, B. (2015). Fast Computation of Categorical Richness on Raster Data Sets and Related Problems. In Proceedings. Workshop on Massive Data Algorithmics (MASSIVE) (pp. 86-107)

Afshani, P. (2014). Fast Computation of Output-Sensitive Maxima in a Word RAM. In C. Chekuri (Ed.), Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms: SODA 2014; Portland, OR; United States; 5 January 2014 through 7 January 2014 (pp. 1414-1423). Association for Computing Machinery. http://www.scopus.com/inward/record.url?scp=84902105500&partnerID=8YFLogxK

de Berg, M., Tsirogiannis, C. & Wilkinson, B. T. (2015). Fast computation of categorical richness on raster data sets and related problems. In GIS '15: Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems [18] https://doi.org/10.1145/2820783.2820825

Brodal, G. S. (1995). Fast meldable priority queues. In S. G. Akl, F. Dehne, J-R. Sack & N. Santoro (Eds.), Algorithms and Data Structures: 4th International Workshop, WADS '95 Kingston, Canada, August 16–18, 1995 Proceedings (pp. 282-290). Springer. Lecture Notes in Computer Science Vol. 955 https://doi.org/10.1007/3-540-60220-8_70

Brodal, G. S., Kaligosi, K., Katriel, I. & Kutz, M. (2005). Faster Algorithms for Computing Longest Common Increasing Subsequences. B R I C S Report Series, (RS-05-37).

Brodal, G. S., Kaligosi, K., Katriel, I. & Kutz, M. (2006). Faster Algorithms for Computing Longest Common Increasing Subsequences. In M. Lewenstein & G. Valiente (Eds.), Combinatorial Pattern Matching (pp. 330-341). Springer. Lecture Notes in Computer Science Vol. 4009 https://doi.org/10.1007/11780441_30

Kutz, M., Brodal, G. S., Kaligosi, K. & Katriel, I. (2011). Faster Algorithms for Computing Longest Common Increasing Subsequences. Journal of Discrete Algorithms, 9(4), 314-325. https://doi.org/10.1016/j.jda.2011.03.013

Larsen, K. G. & Williams, R. (2017). Faster Online Matrix-Vector Multiplication. In P. N. Klein (Ed.), Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. PRDA17, pp. 2182-2189). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974782

Jørgensen, A. G., Brodal, G. S. & Mølhave, T. (2009). Fault Tolerant External Memory Algorithms. Lecture Notes in Computer Science, 5664, 411-422. https://doi.org/10.1007/978-3-642-03367-4_36

Brodal, G. S., Lyngsø, R. B., Pedersen, C. N. S. & Stoye, J. (1999). Finding Maximal Pairs with Bounded Gap. In M. Crochemore & M. Paterson (Eds.), Combinatorial Pattern Matching: 10th Annual Symposium, CPM 99 Warwick University, UK, July 22–24, 1999 Proceedings (pp. 134-149). Springer. Lecture Notes in Computer Science Vol. 1645 https://doi.org/10.1007/3-540-48452-3_11

Brodal, G. S. & Pedersen, C. N. S. (2000). Finding Maximal Quasiperiodicities in Strings. In R. Giancarlo & D. Sankoff (Eds.), Combinatorial Pattern Matching: 11th Annual Symposium, CPM 2000 Montreal, Canada, June 21–23, 2000 Proceedings (pp. 397-411). Springer. Lecture Notes in Computer Science Vol. 1848 https://doi.org/10.1007/3-540-45123-4_33

Brodal, G. S. (2005). Finger Search Trees. In D. Mehta & S. Sahni (Eds.), Handbook of Data Structures and Applications CRC Press.

Brodal, G. S., Nielsen, J. A. S. & Truelsen, J. (2012). Finger Search in the Implicit Model. Lecture Notes in Computer Science, 7676, 527-536 . https://doi.org/10.1007/978-3-642-35261-4_55

Brodal, G. S. (1998). Finger search trees with constant insertion time. In Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms (pp. 540-549). Society for Industrial and Applied Mathematics.

Peterka, T., Hájek, M., Jiroušek, M., Jiménez-Alfaro, B., Aunina, L., Bergamini, A., Dítě, D., Felbaba-Klushyna, L., Graf, U., Hájková, P., Hettenbergerová, E., Ivchenko, T. G., Jansen, F., Koroleva, N. E., Lapshina, E. D., Lazarević, P. M., Moen, A., Napreenko, M. G., Pawlikowski, P. ... Chytrý, M. (2017). Formalized classification of European fen vegetation at the alliance level. Applied Vegetation Science, 20(1), 124-142. https://doi.org/10.1111/avsc.12271

Afshani, P., Fagerberg, R., Hammer, D., Jacob, R., Kostitsyna, I., Meyer, U., Penschuck, M. & Sitchinava, N. (2019). Fragile complexity of comparison-based algorithms. In M. A. Bender, O. Svensson & G. Herman (Eds.), 27th Annual European Symposium on Algorithms, ESA 2019 [2] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Vol. 144 https://doi.org/10.4230/LIPIcs.ESA.2019.2

Brodal, G. S., Sioutas, S., Tsakalidis, K. & Tsichlas, K. (2012). Fully Persistent B-trees. The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings, 23, 602-614. http://delivery.acm.org.ez.statsbiblioteket.dk:2048/10.1145/2100000/2095167/p602-brodal.pdf?ip=130.225.27.190&acc=ACTIVE%20SERVICE&CFID=163115493&CFTOKEN=91446070&__acm__=1356816735_08b5a98a0788aa0b0163ee8e9fc7dce3

Freksen, C. B., Kamma, L. & Larsen, K. G. (2018). Fully Understanding the Hashing Trick. arXiv.org. http://arxiv.org/abs/1805.08539

Freksen, C. B., Kamma, L. & Larsen, K. G. (2018). Fully Understanding the Hashing Trick. 1. Poster session presented at Neural Information Processing Systems Conference, Montreal, Canada.

Cohen-Addad, V., Hjuler, N., Parotsidis, N., Saulpic, D. & Schwiegelshohn, C. (2019). Fully dynamic consistent facility location. Advances in Neural Information Processing Systems, 32.

Brodal, G. S., Sioutas, S., Tsakalidis, K. & Tsichlas, K. (2020). Fully persistent B-trees. Theoretical Computer Science, 841, 10-26. https://doi.org/10.1016/j.tcs.2020.06.027

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. Lecture Notes in Computer Science Vol. 2518 https://doi.org/10.1007/3-540-36136-7_20

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

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

Ajwani, D., Sitchinava, N. & Zeh, N. (2010). Geometric Algorithms for Private-Cache Chip Multiprocessors. Lecture Notes in Computer Science, 6347, 75-86. https://doi.org/10.1007/978-3-642-15781-3_7

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., Nelson, J., Nguyen, H. L. & Thorup, M. (2016). Heavy hitters via cluster-preserving clustering. In 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) (pp. 61-70). IEEE. https://doi.org/10.1109/FOCS.2016.16

Larsen, K. G. (2012). Higher Cell Probe Lower Bounds for Evaluating Polynomials. In FOCS'12: IEEE 53rd Annual Symposium on Foundations of Computer Science (pp. 293 - 301 ). IEEE Computer Society Press. https://doi.org/10.1109/FOCS.2012.21

Arge, L., Afshani, P. & Larsen, K. G. (2012). Higher-dimensional Orthogonal Range Reporting and Rectangle Stabbing in the Pointer Machine Model. In Proceedings of the 2012 Symposuim on Computational Geometry (pp. 323-338). Association for Computing Machinery. https://doi.org/10.1145/2261250.2261299

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

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.), Annual Cryptology Conference : CRYPTO 2016: Advances in Cryptology – CRYPTO 2016 (Vol. 9816, pp. 478-498). Springer VS. Lecture Notes in Computer Science Vol. 9816 https://doi.org/10.1007/978-3-662-53015-3_17

Odgaard, M. V., Moeslund, J. E., Dalgaard, T., Bøcher, P. K. & Svenning, J-C. (2014). Human-driven topographic effects on the distribution of forest in a flat, lowland agricultural region. Journal of Geographical Sciences, 24(1), 76-92. https://doi.org/10.1007/s11442-014-1074-6

Larsen, K. G. & Pagh, R. (2012). I/O-Efficient Data Structures for Colored Range and Prefix Reporting. The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings, 23, 583-592. http://siam.omnibooksonline.com/2012SODA/index.html

Displaying results 101 to 150 out of 331