Publications

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., 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., 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. BRICS 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. https://doi.org/10.1007/978-3-540-27810-8_41

Brodal, G. S., Fagerberg, R. & Moruz, G. (2004). On the Adaptiveness of Quicksort. BRICS 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. 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. 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

Brodal, G. S. & Jacob, R. (2001). Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries. Electronic Colloquium on Computational Complexity, 92(ALCOMFT-TR-01-176).

Brodal, G. S., Lagogiannis, G., Makris, C., Tsakalidis, A. & Tsichlas, K. (2003). Optimal Finger Search Trees in the Pointer Machine. Journal of Computer and System Sciences, 67(2), 381-418. https://doi.org/10.1016/S0022-0000(03)00013-8

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., Makris, C., Sioutas, S., Tsakalidis, A. K. & Tsichlas, K. (2002). Optimal Solutions for the Temporal Precedence Problem. Algorithmica, 33(4), 494-510. https://doi.org/10.1007/s00453-002-0935-z

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

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

Brodal, G. S., Kaligosi, K., Katriel, I. & Kutz, M. (2005). Faster Algorithms for Computing Longest Common Increasing Subsequences. BRICS 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. https://doi.org/10.1007/11780441_30

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. https://doi.org/10.1007/978-3-540-74456-6_37

Brodal, G. S., Georgiadis, L. & Katriel, I. (2008). An O(n log n) Version of the Averbakh-Berman Algorithm for the Robust Median of a Tree. Operations Research Letters, 36(1), 14 -18. https://doi.org/10.1016/j.orl.2007.02.012

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

Brodal, G. S., Arge, L. & Georgiadis, L. (2006). Improved Dynamic Planar Point Location. In Proceedings of the 47th Annual Symposium on Foundations of Computer Science (pp. 305-314). IEEE. https://doi.org/10.1109/FOCS.2006.40

Brodal, G. S., Makris, C. & Tsichlas, K. (2006). Purely Functional Worst Case Constant Time Catenable Sorted Lists. In Y. Azar & T. Erlebach (Eds.), Algorithms – ESA 2006: 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006. Proceedings (pp. 172-183). Springer. https://doi.org/10.1007/11841036_18

Brodal, G. S. & Moruz, G. (2006). Skewed Binary Search Trees. In Y. Azar & T. Erlebach (Eds.), Algorithms – ESA 2006: 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006. Proceedings (pp. 708-719). Springer. https://doi.org/10.1007/11841036_63

Brodal, G. S. & Jørgensen, A. G. (2007). A Linear Time Algorithm for the k Maximal Sums Problem. In L. Kucera & A. Kucera (Eds.), Mathematical Foundations of Computer Science 2007: 32nd International Symposium, MFCS 2007 Ceský Krumlov, Czech Republic, August 26-31, 2007 Proceedings (pp. 442-453). Springer. https://doi.org/10.1007/978-3-540-74456-6_40

Brodal, G. S., Frigioni, D. & Marchetti-Spaccamela, A. (Eds.) (2001). Algorithm Engineering: Proceedings of 5th International Workshop on Algorithm Engineering (WAE 2001). (2141 i Lecture Notes in Computer Science ed.) Springer.

Brodal, G. S., Fagerberg, R. & Moruz, G. (2008). On the Adaptiveness of Quicksort. Journal of Experimental Algorithmics, 12. https://doi.org/10.1145/1227161.1402294

Brodal, G. S. & Jørgensen, A. G. (2008). Selecting Sums in Arrays. Lecture Notes in Computer Science, 5369, 100-111. https://doi.org/10.1007/978-3-540-92182-0_12

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

Brodal, G. S., Fagerberg, R., Greve, M. & López-Ortis, A. (2009). Online Sorted Range Reporting. Lecture Notes in Computer Science, 5878, 173-182. https://doi.org/10.1007/978-3-642-10631-6_19

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

Brodal, G. S., Gfeller, B., Jørgensen, A. G. & Sanders, P. (2011). Towards optimal range medians. Theoretical Computer Science, 412(24), 2588-2601. https://doi.org/10.1016/j.tcs.2010.05.003

Brodal, G. S. & Srinivasan, V. (2000). Improved Bounds for Dictionary Look-up with One Error. Information Processing Letters, 75(1-2), 57-59. https://doi.org/10.1016/S0020-0190(00)00079-X

Brodal, G. S., Kejlberg-Rasmussen, C. & Truelsen, J. (2010). A Cache-Oblivious Implicit Dictionary with the Working Set Property. Lecture Notes in Computer Science, 6507, 37-48. https://doi.org/10.1007/978-3-642-17514-5_4

Brodal, G. S. (1999). Priority queues on parallel machines. Parallel Computing, 25(8), 987-1011. https://doi.org/10.1016/S0167-8191(99)00032-0

Brodal, G. S., Träff, J. L. & Zaroliagis, C. D. (1998). A Parallel Priority Queue with Constant Time Operations. Journal of Parallel and Distributed Computing, 49(1), 4-21. https://doi.org/10.1006/jpdc.1998.1425

Brodal, G. S., Chaudhuri, S. & Radhakrishnan, J. (1996). The randomized complexity of maintaining the minimum. Nordic Journal of Computing, 3(4), 337-351.

Brodal, G. S. (1996). Partially persistent data structures of bounded degree with constant update time. Nordic Journal of Computing, 3(3), 238-255.

Brodal, G. S. & Okasaki, C. (1996). Optimal purely functional priority queues. Journal of Functional Programming, 6(6), 839-858. https://doi.org/10.1017/S095679680000201X

Brodal, G. S. & Jacob, R. (2003). Time-Dependent Networks as Models to Achieve Fast Exact Time-Table Queries. Electronic Notes in Theoretical Computer Science, 92, 3-15. https://doi.org/10.1016/j.entcs.2003.12.019

Brodal, G. S. & Jakob, R. (2000). Dynamic Planar Convex Hull with Optimal Query Time and O(log n · log log n ) Update Time. In Algorithm Theory - SWAT 2000: 7th Scandinavian Workshop on Algorithm Theory Bergen, Norway, July 5–7, 2000 Proceedings (pp. 181-186). Springer. https://doi.org/10.1007/3-540-44985-X_7

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. https://doi.org/10.1007/3-540-45123-4_33

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. https://doi.org/10.1007/3-540-48447-7_34

Displaying results 251 to 300 out of 454

Revised 01.09.2025

Publications

Head of research