Publications

Arge, L., Brodal, G. S. & Fagerberg, R. (2005). Cache-Oblivious Data Structures. In D. Mehta & S. Sahni (Eds.), Handbook of Data Structures and Applications CRC Press.

Arge, L., Brodal, G. S. & Toma, L. (2004). On External-Memory MST, SSP and Multi-Way Planar Graph Separation. Journal of Algorithms, 53(2), 186-206.

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. & Toma, L. (2000). On External-Memory MST, SSSP, and Multi-way Planar Graph Separation. In Algorithm Theory - SWAT 2000: 7th Scandinavian Workshop on Algorithm Theory Bergen, Norway, July 5-7, 2000 Proceedings (pp. 709-715). Springer. Lecture Notes in Computer Science Vol. 1851 https://doi.org/10.1007/3-540-44985-X_37

Arge, L. A., Goodrich, M. T. & Sitchinava, N. (2010). Parallel External Memory Graph Algorithms. I P D P S Proceedings, 1-11. https://doi.org/10.1109/IPDPS.2010.5470440

Arge, L. A., Larsen, K. G., Mølhave, T. & Walderveen, F. V. (2010). Cleaning Massive Sonar Point Clouds. In Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems. GIS '10 (pp. 152-161). Association for Computing Machinery. https://doi.org/10.1145/1869790.1869815

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

Arge, L. & Larsen, K. G. (2012). I/O-Efficient Spatial Data Structures for Range Queries. SIGSPATIAL Special, 4(2), 2-7. http://www.sigspatial.org/sigspatial-special-issues/SIGSPATIALSpecialVol4No2.pdf

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

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. Lecture Notes in Computer Science Vol. 8125 https://doi.org/10.1007/978-3-642-40450-4_6

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

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), [e12994]. https://doi.org/10.1111/jvs.12994

Barnabo, G., Leonardi, S., Fazzone, A. & Schwiegelshohn, C. (2019). Algorithms for fair team formation in online labour marketplaces. The Web Conference 2019 - Companion of the World Wide Web Conference, WWW 2019, 484-490. https://doi.org/10.1145/3308560.3317587

Bartal, Y., Fandina, O. N. & Neiman, O. (2022). Covering metric spaces by few trees. Journal of Computer and System Sciences, 130, 26-42. https://doi.org/10.1016/j.jcss.2022.06.001

Bartal, Y., Fandina, O. N. & Larsen, K. G. (2022). Optimality of the Johnson-Lindenstrauss Dimensionality Reduction for Practical Measures. In X. Goaoc & M. Kerber (Eds.), 38th International Symposium on Computational Geometry, SoCG 2022 [13] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Vol. 224 https://doi.org/10.4230/LIPIcs.SoCG.2022.13

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

Becchetti, L., Bury, M., Cohen-Addad, V., Grandoni, F. & Schwiegelshohn, C. (2019). Oblivious dimension reduction for k-means: Beyond subspaces and the Johnson-lindenstrauss lemma. Proceedings of the Annual ACM Symposium on Theory of Computing, 1039-1050. https://doi.org/10.1145/3313276.3316318

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

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. (2007). Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model. In SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures (pp. 61-70) https://doi.org/10.1145/1248377.1248391

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

Berglin, E. & Brodal, G. S. (2017). A simple greedy algorithm for dynamic graph orientation. In Y. Okamoto & T. Tokuyama (Eds.), 28th International Symposium on Algorithms and Computation (ISAAC 2017) (pp. 12:1-12:12). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics No. 92 https://doi.org/10.4230/LIPIcs.ISAAC.2017.12

Berglin, E. & Brodal, G. S. (2020). A Simple Greedy Algorithm for Dynamic Graph Orientation. Algorithmica, 82(2), 245-259. https://doi.org/10.1007/s00453-018-0528-0

Bladt, J., Brunbjerg, A. K., Moeslund, J. E., Petersen, A. H. & Ejrnæs, R. (2016). Opdatering af lokal bioscore for biodiversitetskortet for Danmark 2015. In DCE rapport Technical Report from DCE - Danish Centre for Environment and Energy No. 74 http://dce2.au.dk/pub/TR74.pdf

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

Bringmann, K., Grønlund, A. & Larsen, K. G. (2017). A Dichotomy for Regular Expression Membership Testing. In 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) (pp. 307-318). IEEE Computer Society Press. https://doi.org/10.1109/FOCS.2017.36

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

Brodal, G. S., Fagerberg, R. & Moruz, G. (2005). On the Adaptiveness of Quicksort. In ALENEX05 (pp. 130-140). Society for Industrial and Applied Mathematics.

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. Lecture Notes in Computer Science Vol. 3580 https://doi.org/10.1007/11523468_47

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. & Fagerberg, R. (2006). Cache-oblivious String Dictionaries. In SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm (pp. 581-590). Association for Computing Machinery. https://doi.org/10.1145/1109557.1109621

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

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

Brodal, G. S. (2004). Cache-Oblivious Algorithms and Data Structures. In T. Hagerup & J. Katajainen (Eds.), Algorithm Theory - SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004. Proceedings (pp. 3-13). Springer. Lecture Notes in Computer Science Vol. 3111 https://doi.org/10.1007/978-3-540-27810-8_2

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

Brodal, G. S., Fagerberg, R. & Farach-Colton, M. (Ed.) (2003). Lower Bounds for External Memory Dictionaries. In Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms (pp. 546-554). Society for Industrial and Applied Mathematics.

Brodal, G. S., Fagerberg, R. & Goemans, M. X. (Ed.) (2003). On the Limits of Cache-Obliviousness. In Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (pp. 307-315). Association for Computing Machinery. https://doi.org/10.1145/780542.780589

Brodal, G. S., Fagerberg, R. & Jacob, R. (2001). Cache Oblivious Search Trees via Binary Trees of Small Height. B R I C S Report Series, (RS-01-36), 1-20.

Brodal, G. S., Fagerberg, R. & Jacob, R. (2002). Cache-Oblivious Search Trees via Binary Trees of Small Height. In Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms (pp. 39-48). Association for Computing Machinery.

Brodal, G. S., Fagerberg, R., Mailund, T., Pedersen, C. N. S. & Phillips, D. (2003). Speeding Up Neighbour-Joining Tree Construction. (Work package 5 ed.) ALCOM-FT.

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. Lecture Notes in Computer Science Vol. 3111 https://doi.org/10.1007/978-3-540-27810-8_41

Brodal, G. S., Fagerberg, R. & Moruz, G. (2004). On the Adaptiveness of Quicksort. B R I C S Report Series, (RS-04-27).

Brodal, G. S., Fagerberg, R., Pedersen, C. N. S., Eades, P. (Ed.) & Takaoka, T. (Ed.) (2001). Computing the Quartet Distance Between Evolutionary Trees in Time O(n log² n). In Proceedings of Algorithms and Computation : 12th International Symposium, ISAAC 2001 (2223 of Lecture Notes in Computer Science ed., Vol. 2223/2001, pp. 731-742). Springer.

Brodal, G. S., Fagerberg, R. & Pedersen, C. N. S. (2003). Computing the Quartet Distance Between Evolutionary Trees in Time O(n log n). Algorithmica, 38(2), 377-395. https://doi.org/10.1007/s00453-003-1065-y

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., 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., Östlin, A., Pedersen, C. N. S. & Rao, S. S. (2003). Computing Refined Buneman Trees in Cubic Time. In G. Benson & R. Page (Eds.), Algorithms in Bioinformatics: Third International Workshop, WABI 2003, Budapest, Hungary, September 15-20, 2003. Proceedings (pp. 259-270). Springer. Lecture Notes in Computer Science Vol. 2812 https://doi.org/10.1007/978-3-540-39763-2_20

Brodal, G. S. & Jacob, R. (2002). Dynamic Planar Convex Hull. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science: (pp. 617-626). IEEE Press. https://doi.org/10.1109/SFCS.2002.1181875

Displaying results 51 to 100 out of 331