Publications

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., 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. & Moruz, G. (2004). On the Adaptiveness of Quicksort. B R I C S Report Series, (RS-04-27).

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.

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. & 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. Lecture Notes in Computer Science Vol. 3580 https://doi.org/10.1007/11523468_47

Brodal, G. S. & Leonardi, S. (Eds.) (2005). ESA 2005: 13th Annual European Symposium: Springer LNCS 3669.

Brodal, G. S., Demaine, E. D. & Munro, J. I. (2005). Fast Allocation and Deallocation with an Improved Buddy System. Acta Informatica, 41(4-5), 273-291. https://doi.org/10.1007/s00236-004-0159-6

Brodal, G. S., Kaligosi, K., Katriel, I. & Kutz, M. (2005). Faster Algorithms for Computing Longest Common Increasing Subsequences. B R I C S Report Series, (RS-05-37).

Brodal, G. S. (2005). Finger Search Trees. In D. Mehta & S. Sahni (Eds.), Handbook of Data Structures and Applications CRC Press.

Brodal, G. S., Fagerberg, R. & Moruz, G. (2005). On the Adaptiveness of Quicksort. In ALENEX05 (pp. 130-140). Society for Industrial and Applied Mathematics.

Brodal, G. S. & Moruz, G. (2005). Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms. In F. Dehne, A. Lopez-Ortiz & J-R. Sack (Eds.), Algorithms and Data Structures: 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005. Proceedings (pp. 385-395). Springer. Lecture Notes in Computer Science Vol. 3608 https://doi.org/10.1007/11534273_34

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

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. Lecture Notes in Computer Science Vol. 4009 https://doi.org/10.1007/11780441_30

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. Lecture Notes in Computer Science Vol. 4168 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. Lecture Notes in Computer Science Vol. 4168 https://doi.org/10.1007/11841036_63

Mailund , Brodal, G. S., Fagerberg, R., Pedersen, C. N. S. & Phillips, D. (2006). Recrafting the Neighbor-Joining Method. B M C Bioinformatics, 7(29).

Bender, M. A., Brodal, G. S., Fagerberg, R., Jacob, R. & Vicari, E. (2007). Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model. In SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures (pp. 61-70) https://doi.org/10.1145/1248377.1248391

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. Lecture Notes in Computer Science Vol. 4708 https://doi.org/10.1007/978-3-540-74456-6_40

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., Fagerberg, R. & Vinther, K. (2007). Engineering a Cache-Oblivious Sorting Algorithm. Journal of Experimental Algorithmics, 12. https://doi.org/10.1145/1227161.1227164

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

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. Lecture Notes in Computer Science Vol. 4698 https://doi.org/10.1007/978-3-540-75520-3_32

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)

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)

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. Lecture Notes in Computer Science Vol. 4546 https://doi.org/10.1007/978-3-540-73094-1_26

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

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

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

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

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

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

Ajwani, D., Sitchinava, N. & Zeh, N. (2010). Geometric Algorithms for Private-Cache Chip Multiprocessors. Lecture Notes in Computer Science, 6347, 75-86. https://doi.org/10.1007/978-3-642-15781-3_7

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

Arge, L. A., Goodrich, M. T. & Sitchinava, N. (2010). Parallel External Memory Graph Algorithms. I P D P S Proceedings, 1-11. https://doi.org/10.1109/IPDPS.2010.5470440

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

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

Displaying results 51 to 100 out of 340

Revised 17.04.2023

Department of Computer Science

Publications

Kasper Green Larsen

Peyman Afshani

Gerth Stølting Brodal

Chris Schwiegelshohn

Publications

Head of research

Kasper Green Larsen

Faculty

Peyman Afshani

Gerth Stølting Brodal

Chris Schwiegelshohn