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.

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., Demaine, E. D., Fineman, J. T., Iacono, J., Langerman, S. & Munro, J. I. (2010). Cache-Oblivious Dynamic Dictionaries with Optimal Update/Query Tradeoff. Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings, 1448-1456. http://www.siam.org/proceedings/soda/2010/SODA10_117_brodalg.pdf

Kejlberg-Rasmussen, C. & Brodal, G. S. (2012). Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property. Leibniz International Proceedings in Informatics, 14, 112--123. https://doi.org/10.4230/LIPIcs.STACS.2012.112

Arge, L., Brodal, G. S., Fagerberg, R. & Laustsen, M. (2005). Cache-Oblivious Planar Orthogonal Range Searching and Counting. In Proceedings of the twenty-first annual symposium on Computational geometry (pp. 160-169). Association for Computing Machinery. https://doi.org/10.1145/1064092.1064119

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. (2008). Cache-Oblivious Sorting. In M-Y. Kao (Ed.), Encyclopedia of Algorithms (Vol. 3, pp. 126-129). Springer. https://doi.org/10.1007/978-0-387-30162-4_63

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

Jørgensen, A. G., Greve, M., Larsen, K. D. & Truelsen, J. (2010). Cell Probe Lower Bounds and Approximations for Range Mode. Lecture Notes in Computer Science, 6198, 605-616. https://doi.org/10.1007/978-3-642-14165-2_51

Haxen, M., Raeburn, M., Afshani, P. & Karras, P. (2021). Centerpoint Query Authentication. In Proceedings of the 30th ACM International Conference on Information & Knowledge Management (CIKM '21) (pp. 3083-3087). Association for Computing Machinery. https://doi.org/10.1145/3459637.3482072

Damgaard, C., Moeslund, J. E. & Wind, P. (2020). Changes in the abundance of Danish orchids over the past 30 years. Diversity, 12(6), [244]. https://doi.org/10.3390/d12060244

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

Pouteau, R., Thuiller, W., Hobohm, C., Brunel, C., Conn, B. J., Dawson, W., de Sá Dechoum, M., Ebel, A. L., Essl, F., Fragman-Sapir, O., Fristoe, T., Jogan, N., Kreft, H., Lenzner, B., Meyer, C., Pergl, J., Pyšek, P., Verkhozina, A., Weigelt, P. ... van Kleunen, M. (2021). Climate and socio-economic factors explain differences between observed and expected naturalization patterns of European plants around the world. Global Ecology and Biogeography, 30(7), 1514-1531. https://doi.org/10.1111/geb.13316

Green Larsen, K., Mitzenmacher, M. & Tsourakakis, C. (2020). Clustering with a faulty oracle. In Y. Huang, I. King, T-Y. Liu & M. van Steen (Eds.), WWW '20: Proceedings of The Web Conference 2020 (pp. 2831-2834). Association for Computing Machinery. https://doi.org/10.1145/3366423.3380045

Jamalabadi, S., Schwiegelshohn, C. & Schwiegelshohn, U. (2020). Commitment and Slack for Online Load Maximization. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (pp. 339–348). Association for Computing Machinery. https://doi.org/10.1145/3350755.3400271

Damgård, I., Larsen, K. G. & Nielsen, J. B. (2019). Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing. In A. Boldyreva & D. Micciancio (Eds.), Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings (Vol. II, pp. 61-84). Springer. Lecture Notes in Computer Science Vol. 11693 https://doi.org/10.1007/978-3-030-26951-7_3

Brodal, G. S. & Pinotti, M. C. (2001). Comparator Networks for Binary Heap Construction. Theoretical Computer Science, 250(1-2), 235-245. https://doi.org/10.1016/S0304-3975(99)00137-1

Brodal, G. S. & Pinotti, M. C. (1998). Comparator networks for binary heap construction. In S. Arnborg & L. Ivansson (Eds.), Algorithm Theory — SWAT'98: 6th Scandinavian Workshop on Algorithm Theory Stockholm, Sweden, July 8–10, 1998 Proceedings (pp. 158-168). Springer. Lecture Notes in Computer Science Vol. 1432 https://doi.org/10.1007/BFb0054364

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

Stissing, M., Mailund, T., Pedersen, C. N. S., Brodal, G. S. & Fagerberg, R. (2007). Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees. In Proceedings of the 5th Asia-Pacific Bioinformatics Conference (APBC) (pp. 91-100)

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., 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.

Stissing, M., Pedersen, C. N. S., Mailund, T. & Brodal, G. S. (2007). Computing the Quartet Distance between Evolutionary Trees of Bounded Degree. In Proceedings of the 5th Asia-Pacific Bioinformatics Conference (APBC) (pp. 101-110)

Stissing, M., Mailund, T., Pedersen, C. S., Brodal, G. S. & Fagerberg, R. (2008). Computing the all-pairs quartet distance on a set of evolutionary trees. Journal of Bioinformatics and Computational Biology, 6(1), 37-50.

Afshani, P., Sheng, C., Tao, Y. & Wilkinson, B. T. (2014). Concurrent range reporting in two-dimensional space. 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. 983-994). Association for Computing Machinery. http://www.scopus.com/inward/record.url?scp=84902105500&partnerID=8YFLogxK

Larsen, K. G. (2019). Constructive Discrepancy Minimization with Hereditary L2 Guarantees. In R. Niedermeier & C. Paul (Eds.), 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019) [48] Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH. Leibniz International Proceedings in Informatics Vol. 126 https://doi.org/10.4230/LIPIcs.STACS.2019.48

Munteanu, A. & Schwiegelshohn, C. (2018). Coresets-Methods and History: A Theoreticians Design Pattern for Approximation and Streaming Algorithms. KI - Kunstliche Intelligenz, 32(1), 37-53. https://doi.org/10.1007/s13218-017-0519-3

Larsen, K. G., Pagh, R. & Tetek, J. (2021). CountSketches, Feature Hashing and the Median of Three. In M. Meila & T. Zhang (Eds.), Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event (pp. 6011-6020). Proceedings of Machine Learning Research Vol. 139 http://proceedings.mlr.press/v139/larsen21a.html

Jørgensen, A. G., Brodal, G. S., Mølhave, T. & Moruz, G. (2009). Counting in the Presence of Memory Faults. Lecture Notes in Computer Science, 5878, 842-851. https://doi.org/10.1007/978-3-642-10631-6_85

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

Afshani, P., Bender, M. A., Farach-Colton, M., Fineman, J. T., Goswami, M. & Tsai, M. T. (2017). Cross-Referenced dictionaries and the limits of write optimization. In P. N. Klein (Ed.), 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 (pp. 1523-1532). Association for Computing Machinery.

Larsen, K. G., Weinstein, O. & Yu, H. (2018). Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds. In M. Henzinger, D. Kempe & I. Diakonikolas (Eds.), STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (pp. 978-989). Association for Computing Machinery. A C M. S I G A C T - S I G M O D - S I G A R T Symposium on Principles of Database Systems. Proceedings No. 2018 https://doi.org/10.1145/3188745.3188790

Brodal, G. S., Sioutas, S., Pantazos, K. & Zaroliagis, C. D. (2015). D2-tree: A new overlay with deterministic bounds. Algorithmica, 72(3), 860-883. https://doi.org/10.1007/s00453-014-9878-4

Brodal, G. S., Sioutas, S., Tsichlas, K. & Zaroliagis, C. (2010). D²-tree: A new overlay with deterministic bounds. In O. Cheong , K-Y. Chwa & K. Park (Eds.), Algorithms and Computation: 21st International Symposium, ISAAC 2010, Jeju, Korea, December 15-17, 2010, Proceedings, Part II (pp. 1-12). Springer VS. Lecture Notes in Computer Science Vol. 6507 https://doi.org/10.1007/978-3-642-17514-5_1

Ejrnæs, R., Nygaard, B., Kjær, C., Baattrup-Pedersen, A., Brunbjerg, A. K., Clausen, K. K., Fløjgaard, C., Hansen, J. L. S., D.D. Hansen, M., Holm, T. E., Johnsen, T. J., Johansson, L. S., Moeslund, J. E., Sterup, J., Hansen, R. R., Strandberg, B., Søndergaard, M. & Wiberg-Larsen, P. (2021). Danmarks biodiversitet 2020. DCE - Nationalt Center for Miljø og Energi. Videnskabelig rapport fra DCE - Nationalt Center for Miljø og Energi No. 465 https://dce2.au.dk/pub/SR465.pdf

Moeslund, J. E., Brunbjerg, A. K., Clausen, K. K., Dalby, L., Fløjgaard, C., Juel, A. & Lenoir, J. (2015). Dark diversity illuminates the dim side of restoration. Poster session presented at International Congress for Conservation Biology, Montpellier, France.

Fløjgaard, C., Valdez, J. W., Dalby, L., Moeslund, J. E., Clausen, K. K., Ejrnæs, R., Pärtel, M. & Brunbjerg, A. K. (2020). Dark diversity reveals importance of biotic resources and competition for plant diversity across habitats. Ecology and Evolution, 10(12), 6078-6088. https://doi.org/10.1101/685040, https://doi.org/10.1002/ece3.6351

Afshani, P. & Nielsen, J. A. S. (2016). Data Structure Lower Bounds for Document Indexing Problems. In I. Chatzigiannakis, M. Mitzenmacher, Y. Rabani & D. Sangiorgi (Eds.), 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) (Vol. 55, pp. 93:1-93:15). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH. Leibniz International Proceedings in Informatics Vol. 55 https://doi.org/10.4230/LIPIcs.ICALP.2016.93

Jørgensen, A. G. & Brodal, G. S. (2009). Data Structures for Range Median Queries. Lecture Notes in Computer Science, 842-851. https://doi.org/10.1007/978-3-642-10631-6_83

Nygaard, B., Moeslund, J. E., Ejrnæs, R., Mielec, C. L., Carl, H., Clausen, K. K., Dylmer, E., Elmeros, M., Flensted, K. N., Fog, K., Goldberg, I., Hansen, M. D. D., Helsing, F., Jørum, P., Lissner, J., Læssøe, T., Bang Madsen, H., Misser, J., Olsen, K. ... Wind, P. (2021). De vigtigste levesteder for rødlistede arter i Danmark. DCE - Nationalt Center for Miljø og Energi. Videnskabelig rapport fra DCE - Nationalt Center for Miljø og Energi No. 470 https://dce2.au.dk/pub/SR470.pdf

Eenberg, K., Larsen, K. G. & Yu, H. (2017). DecreaseKeys are expensive for external memory priority queues. In STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Vol. Part F128415, pp. 1081-1093). Association for Computing Machinery. https://doi.org/10.1145/3055399.3055437

Afshani, P., Chan, T. M. & Tsakalidis, K. (2014). Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM. In J. Esparza , P. Fraigniaud, T. Husfeldt & E. Koutsoupias (Eds.), Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I (pp. 77-88 ). Springer VS. Lecture Notes in Computer Science Vol. 8572 https://doi.org/10.1007/978-3-662-43948-7_7

Groom, G. B., Bladt, J., Moeslund, J. E. & Ejrnæs, R. (2018). Developing biodiversity proxies: Technical description. Aarhus Universitet, DCE – Nationalt Center for Miljø og Energi ©. Technical Report from DCE – Danish Centre for Environment and Energy No. 123

Brunbjerg, A. K., Bladt, J., Brink, M., Fredshavn, J. R., Mikkelsen, P., Moeslund, J. E., Nygaard, B., Skov, F. & Ejrnæs, R. (2016). Development and implementation of a High Nature Value (HNV) farming indicator for Denmark. Ecological Indicators, 61(2), 274-281. https://doi.org/10.1016/j.ecolind.2015.09.027

Sporbert, M., Welk, E., Seidler, G., Jandt, U., Acic, S., Biurrun, I., Campos, J. A., Čarni, A., Cerabolini, B. E. L., Chytrý, M., Ćušterevska, R., Dengler, J., De Sanctis, M., Dziuba, T., Fagúndez, J., Field, R., Golub, V., He, T., Jansen, F. ... Bruelheide, H. (2021). Different sets of traits explain abundance and distribution patterns of European plants at different spatial scales. Journal of Vegetation Science, 32(2), [e13016]. https://doi.org/10.1111/jvs.13016

Brodal, G. S., Kaporis, A. C., Sioutas, S., Tsakalidis, K. & Tsichlas, K. (2009). Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time. Lecture Notes in Computer Science, 5878, 193-202. https://doi.org/10.1007/978-3-642-10631-6_21

Stølting Brodal, G., Kaporis, A. C., Papadopoulos, A. N., Sioutas, S., Tsakalidis, K. & Tsichlas, K. (2014). Dynamic 3-sided planar range queries with expected doubly-logarithmic time. Theoretical Computer Science, 526(March), 58-74. https://doi.org/10.1016/j.tcs.2014.01.014

Kejlberg-Rasmussen, C. (2013). Dynamic Data Structures: The Interplay of Invariants and Algorithm Design. Department of Computer Science, Aarhus University.

Brodal, G. S., Georgiadis, L., Hansen, K. A. & Katriel, I. (2007). Dynamic Matchings in Convex Bipartite Graphs. In L. Kucera & A. Kucera (Eds.), Proc. 32nd International Symposium on Mathematical Foundations of Computer Science (pp. 406-417). Springer. Lecture Notes in Computer Science Vol. 4708 https://doi.org/10.1007/978-3-540-74456-6_37

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 340