Publications

Brodal, G. S. & Gasieniec, L. (1996). Approximate dictionary queries. In D. Hirschberg & G. Myers (Eds.), Combinatorial Pattern Matching: 7th Annual Symposium, CPM 96 Laguna Beach, California, June 10–12, 1996 Proceedings (pp. 65-74). Springer. https://doi.org/10.1007/3-540-61258-0_6

Brodal, G. S. (1997). Predecessor queries in dynamic integer sets. In R. Reischuk & M. Morwan (Eds.), STACS 97: 14th Annual Symposium on Theoretical Aspects of Computer Science Lübeck, Germany February 27–March 1, 1997 Proceedings (pp. 21-32). Springer. https://doi.org/10.1007/BFb0023445

Brodal, G. S. (1998). Finger search trees with constant insertion time. In Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms (pp. 540-549). Society for Industrial and Applied Mathematics.

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. https://doi.org/10.1007/BFb0054364

Brodal, G. S. & Katajainen, J. (1998). Worst-case efficient external-memory priority queues. In S. Arnborg & L. Ivansson (Eds.), Algorithm Theory — SWAT'98: 6th Scandinavian Workshop on Algorithm Theory Stockholm, Sweden, July 8–10, 1998 Proceedings (pp. 107-118). Springer. https://doi.org/10.1007/BFb0054359

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

Alstrup, S., Brodal, G. S. & Rauhe, T. (2000). Pattern matching in dynamic texts. In D. Shmoys (Ed.), Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms (pp. 819-828). Society for Industrial and Applied Mathematics.

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

Alstrup, S., Brodal, G. S. & Rauhe, T. (2000). New data structures for orthogonal range searching. In 41st Annual Symposium on Foundations of Computer Science, 2000. Proceedings. (pp. 198-207). IEEE Computer Society Press. https://doi.org/10.1109/SFCS.2000.892088

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. & 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. (1996). Partially persistent data structures of bounded degree with constant update time. Nordic Journal of Computing, 3(3), 238-255.

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., 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. (1999). Priority queues on parallel machines. Parallel Computing, 25(8), 987-1011. https://doi.org/10.1016/S0167-8191(99)00032-0

Afshani, P., Hamilton, C. & Zeh, N. (2010). A general approach for cache-oblivious range reporting and approximate range counting. Computational Geometry, 43(8), 700-712. https://doi.org/10.1016/j.comgeo.2010.04.003

Afshani, P., Arge, L. A. & Larsen, K. D. (2010). I/O-efficient Orthogonal Range Reporting in Three and Higher Dimensions. Abstract from Workshop on Massive Data Algorithms, Snowbird, United States.

Afshani, P., Arge, L. A. & Larsen, K. D. (2010). Orthogonal Range Reporting: Query Lower Bounds, Optimal Structures in 3-d, and Higher Dimensional Improvements. Annual A C M Symposium on Computational Geometry. Proceedings, 240-246. https://doi.org/10.1145/1810959.1811001

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

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

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

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

Afshani, P., Brodal, G. S. & Zeh, N. (2011). Ordered and Unordered Top-K Range Reporting in Large Data Sets. In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algoritms. SODA 2011 (pp. 390-400). Society for Industrial and Applied Mathematics. http://www.siam.org/proceedings/soda/2011/SODA11_031_afshanip.pdf

Kutz, M., Brodal, G. S., Kaligosi, K. & Katriel, I. (2011). Faster Algorithms for Computing Longest Common Increasing Subsequences. Journal of Discrete Algorithms, 9(4), 314-325. https://doi.org/10.1016/j.jda.2011.03.013

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

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

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

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

Agarwal, P. K., Arge, L. A., Brodal, G. S. & Vitter, J. S. (1999). I/O-efficient dynamic point location in monotone planar subdivisions. In Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms (pp. 11-20). Association for Computing Machinery.

Afshani, P., Hamilton, C. & Zeh, N. (2009). A general approach for cache-oblivious range reporting and approximate range counting. In Proceedings of the 25th annual symposium on Computational geometry Association for Computing Machinery. https://doi.org/10.1145/1542362.1542413

Afshani, P., Hamilton, C. & Zeh, N. (2009). Cache-oblivious range reporting with optimal queries requires superlinear space. In Proceedings of the 25th annual symposium on Computational geometry (pp. 277-286). Association for Computing Machinery. https://doi.org/10.1145/1542362.1542412

Afshani, P., Barbay, J. & Chan, T. M. (2009). Instance-optimal geometric algorithms. In 50th Annual Symposium on Foundations of Computer Science. Proceedings (pp. 129-138). IEEE Computer Society Press. https://doi.org/10.1109/FOCS.2009.34

Davoodi, P., Brodal, G. S. & Rao, S. S. (2010). On Space Efficient Two Dimensional Range Minimum Data Structures. Lecture Notes in Computer Science, 6347, Part 2 , 171-182. https://doi.org/10.1007/978-3-642-15781-3_15

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

Moeslund, J. E., Arge, L., Bøcher, P. K., Nygaard, B. & Svenning, J.-C. (2009). Konsekvenser af "coastal squeezing" for plantesamfund på strandenge i Danmark.

Moeslund, J. E., Bøcher, P. K., Svenning, J.-C., Møllehave, T. & Arge, L. (2009). Impacts of 21^stcentury 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

Afshani, P., Arge, L. A. & Larsen, K. D. (2009). Orthogonal Range Reporting in Three and Higher Dimensions. Symposium on Foundations of Computer Science. Annual Proceedings, 149-158. https://doi.org/10.1109/FOCS.2009.58

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

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

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

Jørgensen, A. G., Brodal, G. S. & Mølhave, T. (2009). Fault Tolerant External Memory Algorithms. Lecture Notes in Computer Science, 5664, 411-422. https://doi.org/10.1007/978-3-642-03367-4_36

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

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.

Caspersen, M. E., Bennedsen, J. & Larsen, K. D. (2007). Mental Models and Programming Aptitude. SIGCSE Bulletin Inroads, 39(3), 206-210. https://doi.org/10.1145/1269900.1268845

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

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

Displaying results 351 to 400 out of 453

Revised 01.09.2025

Publications

Head of research