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
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. (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.
https://doi.org/10.1007/3-540-45465-9_37
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
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., Sioutas, S., Tsichlas, K. & Zaroliagis, C. (2010).
D2-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.
https://doi.org/10.1007/978-3-642-17514-5_1
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.
https://doi.org/10.1007/3-540-48452-3_11
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.
https://doi.org/10.1007/3-540-36136-7_20
Brodal, G. S., Lyngsø, R. B., Östlin, A.
& Pedersen, C. N. S. (2002).
Solving the String Statistics Problem in Time O(n log n). 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. 728-739). Springer.
https://doi.org/10.1007/3-540-45465-9_62
Brodal, G. S., Rysgaard, C. M., Schou, J. K. R. & Svenning, R. (2023).
Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location. In P. Morin & S. Suri (Eds.),
Algorithms and Data Structures: 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings (pp. 644-659). Springer.
https://doi.org/10.1007/978-3-031-38906-1_43
Brodal, G. S., Fagerberg, R.
, Pedersen, C. N. S., Östlin, A., Orejas, F. (Ed.), Spirakis, P. G. (Ed.) & Leeuwen, J. V. (Ed.) (2001).
The Complexity of Constructing Evolutionary Trees Using Experiments. In
Lecture Notes In Computer Science; Vol. 2076: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (2076 of Lecture Notes in Computer Science ed., Vol. 2076/2001, pp. 140-151). Springer.