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-4Moeslund, J. E., Arge, L. A., Bøcher, P. K., Nygaard, B. & Svenning, J-C. (2009).
The impacts of coastal squeezing on salt-meadow plant communities in Denmark. Poster session presented at Beyond Kyoto: Addressing the challenges of climate change, Aarhus, Denmark.
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
Moeslund, J. E., Bøcher, P. K., Svenning, J-C., Møllehave, T. & Arge, L. (2009).
Impacts of 21st century sea-level rise on a Danish major city - an assessment based on fine-resolution digital topography and a new flooding algorithm.
IOP Conference Series: Earth and Environment Science,
8(1), 012022.
https://doi.org/10.1088/1755-1315/8/1/012022
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.
Westergaard, M., Kristensen, L. M., Brodal, G. S. & Arge, L. (2007).
The ComBack Method - Extending Hash Compaction with Backtracking. In
Petri Nets and Other Models of Concurrency – ICATPN 2007: 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, Siedlce, Poland, June 25-29, 2007. Proceedings (pp. 455-464). Springer.
https://doi.org/10.1007/978-3-540-73094-1_26
Jørgensen, A. G., Brodal, G. S., Moruz, G., Mølhave, T., Fagerberg, R., Finocchi, I., Grandoni, F. & Italiano, G. F. (2007).
Optimal Resilient Dynamic Dictionaries. In L. Arge, M. Hoffmann & E. Welzl (Eds.),
Algorithms – ESA 2007: 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007. Proceedings (pp. 347-358). Springer.
https://doi.org/10.1007/978-3-540-75520-3_32
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., 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
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.
https://doi.org/10.1007/978-3-540-39763-2_20
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.
