Curriculum Vitæ

Brief Biography
Gerth Stølting Brodal is a Professor at the Department of Computer Science, Aarhus University, Denmark (since January 2016). He received his PhD in computer science in 1997 from Aarhus University for the thesis ``Worst Case Efficient Data Structures''. From 1997 to 1998 he was a PostDoc in the group of Kurt Mehlhorn at the MaxPlanckInstitute for Computer Science in Saarbrücken, Germany. 19982005 he was affiliated with BRICS (Center for Basic Research in Computer Science) located at the Department of Computer Science, Aarhus University. 20042015 he was an Associate Professor (tenured) at the Department of Computer Science, Aarhus University. Since March 2007 he is affiliated with MADALGO (Center for Massive Data Algorithmics), Aarhus University, founded by the Danish National Research Foundataion.
His main research interests are the design and analysis of algorithms and data structures. He has done work on fundamental data structures, including dictionaries and priority queues, persistent data structures, computational geometry, graph algorithms, string algorithms, I/Oefficient and cacheoblivious algorithms and data structures, algorithm engineering, and computational biology.
Education
 February 1993April 1997
 PhD in Computer Science, Aarhus University, Denmark.
Dissertation: Worst Case Efficient Data Structures.
Advisor: Erik Meineche Schmidt.
Committee: Mogens Nielsen (Aarhus), Arne Andersson (Lund), and J. Ian Munro (Waterloo).  August 1989November 1994
 MSc (cand.scient.) in Computer Science and Mathematics, Aarhus University, Denmark.
 August 1988May 1989
 Military service, Jyske Telegrafregiment, Fredericia, Denmark.
 August 1985June 1988
 ``Studentereksamen'', Aabenraa Gymnasium og HF, Aabenraa, Denmark.
Positions
 January 2016present
 Professor, Department of Computer Science, Aarhus University.
 April 2009December 2015
 Associate Professor (tenured, Lektor MSK), Department of Computer Science, Aarhus University.
 April 2004March 2009
 Associate Professor (tenured), Department of Computer Science, Aarhus University.
 August 2001January 2005
 Associate Professor, BRICS, Department of Computer Science, Aarhus University.
 August 1999July 2001
 Research Associate Professor, BRICS, Department of Computer Science, Aarhus University.
 August 1998July 1999
 Research Assistant Professor, BRICS Ph.D. School, Department of Computer Science, Aarhus University.
 February 1997July 1998
 PostDoc at the MaxPlanckInstitut for Computer Science, Saarbrücken, Germany.
Funding
 September 2013June 2014
 Aarhus University Research Foundation, Guest Researcher Grant, Seth Pettie (University of Michigan Ann Arbor), 250.000 DKK.
 January 2011December 2012
 Slovenian Research Agency, Project: Algorithms on Massive Geographical LiDAR Datasets  AMAGELDA (Principal investigator: Andrej Brodnik, Ljubljana Slovenia), 3.000 Euro (22.500 DKK).
 July 2005June 2006
 The Danish Natural Science Research Council, Graph Algorithms and Contraint Programming, PostDoc Irit Katriel., 480.000 DKK.
 January 2005December 2007
 The Danish Natural Science Research Council, Grant #21040389, Algoritmer til rekonstruktion og sammenligning af træer og netværk. Coordinator Christian N.S. Pedersen, Aarhus University, 360.000 DKK.
 January 2005December 2007
 Nordic Network on Algorithms from the Nordic Academy for Advanced Study (NORFA). Coordinator Fedor V. Fomin, University of Bergen, 900.000 NOK (825.000 DKK).
 January 2008December 2009
 Nordic Network on Algorithms from the Nordic Academy for Advanced Study (NORFA). Coordinator Fedor V. Fomin, University of Bergen, 600.000 NOK (510.000 DKK).
 February 2002January 2005
 Associate Professor grant from the Carlsberg Foundation, 1.350.000 DKK.
 MayJuly 1998
 Scholarship (PostDoc) from the MaxPlanckInstitut für Informatik, Saarbrücken, Germany, 10.200 DM (39.200 DKK).
 May 1997April 1998
 Scholarship (PostDoc) from the Carlsberg Foundation, 300.000 DKK.
 FebruaryApril 1997
 Scholarship (PostDoc) from the MaxPlanckInstitut für Informatik, Saarbrücken, Germany, 10.200 DM (39.200 DKK).
 February 1995January 1997
 Scholarship (PhDstipendium) from the Danish Natural Science Research Council, 717.591 DKK.
 February 1993January 1995
 Scholarship (Scholarstipendium) from the Danish Research Academy, 156.000 DKK.
Awards
 2017
 Lecturer of the Year, Department of Computer Science, Aarhus University.
 2012
 Lecturer of the Year, Department of Computer Science, Aarhus University.
 2001
 Best paper award 12th Annual International Symposium on Algorithms and Computation, for the paper ``Computing the Quartet Distance Between Evolutionary Trees in Time '', coauthored with Rolf Fagerberg and Christian N. S. Pedersen.
Publications
Conference publications appearing in journals and technical reports appearing elsewhere are numbered in parenthesis with the newer appearance.
Editor
 1
 Algorithms  ESA 2005: 13th Annual European Symposium, Gerth Stølting Brodal and Stefano Leonardi (Edt.), volume 3669 of Lecture Notes in Computer Science. Springer Verlag, Berlin, 2005.
 2
 Algorithm Engineering  5th International Workshop (WAE 2001), Gerth Stølting Brodal, Daniele Frigioni, and Alberto MarchettiSpaccamela (Edt.), volume 2141 of Lecture Notes in Computer Science. Springer Verlag, Berlin, 2001.
Book Chapters
 3
 CacheOblivious Sorting, Gerth Stølting Brodal. In Encyclopedia of Algorithms, MingYang Kao (Edt.), pages 126129. Springer, 2008.
 4
 CacheOblivious Data Structures, Lars Arge, Gerth Stølting Brodal, and Rolf Fagerberg. In Handbook of Data Structures and Applications, Dinesh Mehta and Sartaj Sahni (Edt.), 27 pages. CRC Press, 2005.
 5
 Finger Search Trees, Gerth Stølting Brodal. In Handbook of Data Structures and Applications, Dinesh Mehta and Sartaj Sahni (Edt.), 11 pages. CRC Press, 2005.
Journal Articles
 6
 Two Dimensional Range Minimum Queries and Fibonacci Lattices, Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, and S. Srinivasa Rao. In Theoretical Computer Science, volume 638, pages 3343, 2016.
 7
 Tree: A New Overlay with Deterministic Bounds, Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, and Christos D. Zaroliagis. In Algorithmica, volume 72(3), pages 860883, 2015.
 8
 OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm, Gerth Stølting Brodal, Gabriel Moruz, and Andrei Negoescu. In Theory of Computing Systems, Special issue of the 9th Workshop on Approximation and Online Algorithms, volume 56(1), pages 2240, 2015.
 9
 tqDist: A Library for Computing the Quartet and Triplet Distances Between Binary or General Trees, Andreas Sand, Morten Kragelund Holt, Jens Johansen, Gerth Stølting Brodal, Thomas Mailund, and Christian Nørgaard Storm Pedersen. In Bioinformatics, 2014.
 10
 Dynamic 3sided Planar Range Queries with Expected Doubly Logarithmic Time, Gerth Stølting Brodal, Alexis Kaporis, Apostolos Papadopoulos, Spyros Sioutas, Konstantinos Tsakalidis, and Kostas Tsichlas. In Theoretical Computer Science, volume 526, pages 5874, 2014.
 11
 Integer Representations towards Efficient Counting in the Bit Probe Model, Gerth Stølting Brodal, Mark Greve, Vineet Pandey, and S. Srinivasa Rao. In Journal of Discrete Algorithms, volume 26, pages 3444, 2014.
 12
 Algorithms for Computing the Triplet and Quartet Distances for Binary and General Trees, Andreas Sand, Morten Kragelund Holt, Jens Johansen, Rolf Fagerberg, Gerth Stølting Brodal, Christian Nørgaard Storm Pedersen, and Thomas Mailund. In Biology  Special Issue on Developments in Bioinformatic Algorithms, volume 2(4), pages 11891209, 2013.
 13
 A practical time algorithm for computing the triplet distance on binary trees, Andreas Sand, Gerth Stølting Brodal, Rolf Fagerberg, Christian Nørgaard Storm Pedersen, and Thomas Mailund. In BMC Bioinformatics, volume 14(Suppl 2), S18 pages, 2013.
 14
 External Memory Planar Point Location with Logarithmic Updates, Lars Arge, Gerth Stølting Brodal, and S. Srinivasa Rao. In Algorithmica, volume 63(1), pages 457475, 2012.
 15
 On Space Efficient Two Dimensional Range Minimum Data Structures, Gerth Stølting Brodal, Pooya Davoodi, and S. Srinivasa Rao. In Algorithmica, Special issue on ESA 2010, volume 63(4), pages 815830, 2012.
 16
 Optimal Sparse Matrix Dense Vector Multiplication in the I/OModel, Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, and Elias Vicari. In Theory of Computing Systems, Special issue of SPAA'07, volume 47(4), pages 934962, 2010.
 17
 Towards Optimal Range Median, Gerth Stølting Brodal, Beat Gfeller, Allan Grønlund Jørgensen, and Peter Sanders. In Theoretical Computer Science, Special issue of ICALP'09, volume 412(24), pages 25882601, 2011.
 18
 Faster Algorithms for Computing Longest Common Increasing Subsequences, Martin Kutz, Gerth Stølting Brodal, Kanela Kaligosi, and Irit Katriel. In Journal of Discrete Algorithms, Special Issue of CPM 2006, volume 9(4), pages 314325, 2011.
 19
 The Cost of CacheOblivious Searching, Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, and Alejandro LópezOrtiz. In Algorithmica, volume 61(2), pages 463505, 2011.
 20
 Computing the AllPairs Quartet Distance on a set of Evolutionary Trees, Martin Stissing, Thomas Mailund, Christian Nørgaard Storm Pedersen, Gerth Stølting Brodal, and Rolf Fagerberg. In Journal of Bioinformatics and Computational Biology, volume 6(1), pages 3750, 2008.
 21
 On the Adaptiveness of Quicksort, Gerth Stølting Brodal, Rolf Fagerberg, and Gabriel Moruz. In ACM Journal of Experimental Algorithmics, Special Issue of ALENEX 2005, volume 12(Article No. 3.2), 19 pages, 2008.
 22
 An Version of the AverbakhBerman Algorithm for the Robust Median of a Tree, Gerth Stølting Brodal, Loukas Georgiadis, and Irit Katriel. In Operations Research Letters, volume 36(1), pages 1418, 2008.
 23
 Engineering a CacheOblivious Sorting Algorithm, Gerth Stølting Brodal, Rolf Fagerberg, and Kristoffer Vinther. In ACM Journal of Experimental Algorithmics, Special Issue of ALENEX 2004, volume 12(Article No. 2.2), 23 pages, 2007.
 24
 Recrafting the NeighborJoining Method, Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg, Christian Nørgaard Storm Pedersen, and Derek Phillips. In BMC Bioinformatics, volume 7(29), 2006.
 25
 Fast Allocation and Deallocation with an Improved Buddy System, Gerth Stølting Brodal, Erik D. Demaine, and J. Ian Munro. In Acta Informatica, volume 41(45), pages 273291, 2005.
 26
 On ExternalMemory MST, SSSP and Multiway Planar Graph Separation, Lars Arge, Gerth Stølting Brodal, and Laura Toma. In Journal of Algorithms, volume 53(2), pages 186206, 2004.
 27
 Computing the Quartet Distance Between Evolutionary Trees in Time , Gerth Stølting Brodal, Rolf Fagerberg, and Christian Nørgaard Storm Pedersen. In Algorithmica, Special issue on ISAAC 2001, volume 38(2), pages 377395, 2004.
 28
 Optimal Finger Search Trees in the Pointer Machine, Gerth Stølting Brodal, George Lagogiannis, Christos Makris, Athanasios Tsakalidis, and Kostas Tsichlas. In Journal of Computer and System Sciences, Special issue on STOC 2002, volume 67(2), pages 381418, 2003.
 29
 Optimal Solutions for the Temporal Precedence Problem, Gerth Stølting Brodal, Christos Makris, Spyros Sioutas, Athanasios Tsakalidis, and Kostas Tsichlas. In Algorithmica, volume 33(4), pages 494510, 2002.
 30
 Comparator Networks for Binary Heap Construction, Gerth Stølting Brodal and M. Cristina Pinotti. In Theoretical Computer Science, volume 250(12), pages 235245, 2001.
 31
 Improved Bounds for Dictionary Lookup with One Error, Gerth Stølting Brodal and Venkatesh Srinivasan. In Information Processing Letters, volume 75(12), pages 5759, 2000.
 32
 Finding Maximal Pairs with Bounded Gap, Gerth Stølting Brodal, Rune Bang Lyngsø, Christian Nørgaard Storm Pedersen, and Jens Stoye. In Journal of Discrete Algorithms, Special Issue of Matching Patterns, volume 1(1), pages 77104, 2000.
 33
 Priority Queues on Parallel Machines, Gerth Stølting Brodal. In Parallel Computing, volume 25(8), pages 9871011, 1999.
 34
 A Parallel Priority Queue with Constant Time Operations, Gerth Stølting Brodal, Jesper Larsson Träff, and Christos D. Zaroliagis. In Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures, volume 49(1), pages 421, 1998.
 35
 The Randomized Complexity of Maintaining the Minimum, Gerth Stølting Brodal, Shiva Chaudhuri, and Jaikumar Radhakrishnan. In Nordic Journal of Computing, Selected Papers of the 5th Scandinavian Workshop on Algorithm Theory (SWAT'96), volume 3(4), pages 337351, 1996.
 36
 Partially Persistent Data Structures of Bounded Degree with Constant Update Time, Gerth Stølting Brodal. In Nordic Journal of Computing, volume 3(3), pages 238255, 1996.
 37
 Optimal Purely Functional Priority Queues, Gerth Stølting Brodal and Chris Okasaki. In Journal of Functional Programming, volume 6(6), pages 839858, 1996.
Conference Articles
 38
 A Simple Greedy Algorithm for Dynamic Graph Orientation, Edvin Berglin and Gerth Stølting Brodal. In Proc. 25th Annual European Symposium on Algorithms, Leibniz International Proceedings in Informatics, 12:112:12 pages. Schloss Dagstuhl  LeibnizZentrum für Informatik, Dagstuhl Publishing, Germany, 2017.
 39
 Cache Oblivious Algorithms for Computing the Triplet Distance between Trees, Gerth Stølting Brodal and Konstantinos Mampentzidis. In Proc. 25th Annual European Symposium on Algorithms, Leibniz International Proceedings in Informatics. Schloss Dagstuhl  LeibnizZentrum für Informatik, Dagstuhl Publishing, Germany, 2017.
 40
 External Memory ThreeSided Range Reporting and Top Queries with Sublogarithmic Updates, Gerth Stølting Brodal. In Proc. 33rd Annual Symposium on Theoretical Aspects of Computer Science, volume 47 of Leibniz International Proceedings in Informatics, 23:123:14 pages. Schloss Dagstuhl  LeibnizZentrum für Informatik, Dagstuhl Publishing, Germany, 2016.
 41
 Strictly Implicit Priority Queues: On the Number of Moves and WorstCase Time, Gerth Stølting Brodal, Jesper Sindahl Nielsen, and Jakob Truelsen. In Proc. 14th International Workshop on Algorithms and Data Structures, volume 9214 of Lecture Notes in Computer Science, pages 112. Springer Verlag, Berlin, 2015.
 42
 Expected Linear Time Sorting for Word Size , Djamal Belazzougui, Gerth Stølting Brodal, and Jesper Sindahl Nielsen. In Proc. 14th Scandinavian Workshop on Algorithm Theory, volume 8503 of Lecture Notes in Computer Science, pages 2637. Springer Verlag, Berlin, 2014.
 43
 Optimal Planar Orthogonal Skyline Counting Queries, Gerth Stølting Brodal and Kasper Green Larsen. In Proc. 14th Scandinavian Workshop on Algorithm Theory, volume 8503 of Lecture Notes in Computer Science, pages 98109. Springer Verlag, Berlin, 2014.
 44
 On the Scalability of Computing Triplet and Quartet Distances, Morten Kragelund Holt, Jens Johansen, and Gerth Stølting Brodal. In Proc. 16th Workshop on Algorithm Engineering and Experiments, pages 919, 2014.
 45
 An Optimal and Practical CacheOblivious Algorithm for Computing Multiresolution Rasters, Lars Arge, Gerth Stølting Brodal, Jakob Truelsen, and Constantinos Tsirogiannis. In Proc. 21st Annual European Symposium on Algorithms, volume 8125 of Lecture Notes in Computer Science, pages 6172. Springer Verlag, Berlin, 2013.
 46
 The Encoding Complexity of Two Dimensional Range Minimum Data Structures, Gerth Stølting Brodal, Andrej Brodnik, and Pooya Davoodi. In Proc. 21st Annual European Symposium on Algorithms, volume 8125 of Lecture Notes in Computer Science, pages 229240. Springer Verlag, Berlin, 2013.
 47
 A Survey on Priority Queues, Gerth Stølting Brodal. In Proc. Conference on Space Efficient Data Structures, Streams and Algorithms  Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday, volume 8066 of Lecture Notes in Computer Science, pages 150163. Springer Verlag, Berlin, 2013.
 (13)
 A practical time algorithm for computing the triplet distance on binary trees, Andreas Sand, Gerth Stølting Brodal, Rolf Fagerberg, Christian Nørgaard Storm Pedersen, and Thomas Mailund. In Proc. 11th Asia Pacific Bioinformatics Conference. Tsinghua University Press, 2013.
 48
 Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree, Gerth Stølting Brodal, Rolf Fagerberg, Christian Nørgaard Storm Pedersen, Thomas Mailund, and Andreas Sand. In Proc. 24th Annual ACMSIAM Symposium on Discrete Algorithms, pages 18141832, 2013.
 49
 Finger Search in the Implicit Model, Gerth Stølting Brodal, Jesper Sindahl Nielsen, and Jakob Truelsen. In Proc. 23th Annual International Symposium on Algorithms and Computation, volume 7676 of Lecture Notes in Computer Science, pages 527536. Springer Verlag, Berlin, 2012.
 50
 Two Dimensional Range Minimum Queries and Fibonacci Lattices, Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, and S. Srinivasa Rao. In Proc. 20th Annual European Symposium on Algorithms, volume 7501 of Lecture Notes in Computer Science, pages 217228. Springer Verlag, Berlin, 2012.
 51
 Strict Fibonacci Heaps, Gerth Stølting Brodal, George Lagogiannis, and Robert E. Tarjan. In Proc. 44th Annual ACM Symposium on Theory of Computing, pages 11771184, 2012.
 52
 CacheOblivious Implicit Predecessor Dictionaries with the Working Set Property, Gerth Stølting Brodal and Casper KejlbergRasmussen. In Proc. 29th Annual Symposium on Theoretical Aspects of Computer Science, volume 14 of Leibniz International Proceedings in Informatics, pages 112123. Schloss Dagstuhl  LeibnizZentrum für Informatik, Dagstuhl Publishing, Germany, 2012.
 53
 Fully Persistent Btrees, Gerth Stølting Brodal, Spyros Sioutas, Konstantinos Tsakalidis, and Kostas Tsichlas. In Proc. 23rd Annual ACMSIAM Symposium on Discrete Algorithms, pages 602614, 2012.
 (8)
 OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm, Gerth Stølting Brodal, Gabriel Moruz, and Andrei Negoescu. In Proc. 9th Workshop on Approximation and Online Algorithms, volume 7164 of Lecture Notes in Computer Science, pages 164175. Springer Verlag, Berlin, 2011.
 54
 Path Minima Queries in Dynamic Weighted Trees, Gerth Stølting Brodal, Pooya Davoodi, and S. Srinivasa Rao. In Proc. 12th International Workshop on Algorithms and Data Structures, volume 6844 of Lecture Notes in Computer Science, pages 290301. Springer Verlag, Berlin, 2011.
 55
 Dynamic Planar Range Maxima Queries, Gerth Stølting Brodal and Konstantinos Tsakalidis. In Proc. 38th International Colloquium on Automata, Languages, and Programming, volume 6755 of Lecture Notes in Computer Science, pages 256267. Springer Verlag, Berlin, 2011.
 (11)
 Integer Representations towards Efficient Counting in the Bit Probe Model, Gerth Stølting Brodal, Mark Greve, Vineet Pandey, and S. Srinivasa Rao. In Proc. 8th Annual Conference on Theory and Applications of Models of Computation, volume 6648 of Lecture Notes in Computer Science, pages 206217. Springer Verlag, Berlin, 2011.
 56
 Ordered and Unordered TopK Range Reporting in Large Data Sets, Peyman Afshani, Gerth Stølting Brodal, and Norbert Zeh. In Proc. 22nd Annual ACMSIAM Symposium on Discrete Algorithms, pages 390400, 2011.
 (7)
 Tree: A New Overlay with Deterministic Bounds, Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, and Christos D. Zaroliagis. In Proc. 21th Annual International Symposium on Algorithms and Computation, Part II, volume 6507 of Lecture Notes in Computer Science, pages 112. Springer Verlag, Berlin, 2010.
 57
 A CacheOblivious Implicit Dictionary with the Working Set Property, Gerth Stølting Brodal, Casper KejlbergRasmussen, and Jakob Truelsen. In Proc. 21th Annual International Symposium on Algorithms and Computation, Part II, volume 6507 of Lecture Notes in Computer Science, pages 3748. Springer Verlag, Berlin, 2010.
 (15)
 On Space Efficient Two Dimensional Range Minimum Data Structures, Gerth Stølting Brodal, Pooya Davoodi, and S. Srinivasa Rao. In Proc. 18th Annual European Symposium on Algorithms, volume 6347 of Lecture Notes in Computer Science, pages 171182. Springer Verlag, Berlin, 2010.
 58
 CacheOblivious Dynamic Dictionaries with Optimal Update/Query Tradeoff, Gerth Stølting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, and J. Ian Munro. In Proc. 21st Annual ACMSIAM Symposium on Discrete Algorithms, pages 14481456, 2010.
 (17)
 Data Structures for Range Median Queries, Gerth Stølting Brodal and Allan Grønlund Jørgensen. In Proc. 20th Annual International Symposium on Algorithms and Computation, volume 5878 of Lecture Notes in Computer Science, pages 822831. Springer Verlag, Berlin, 2009.
 59
 Online Sorted Range Reporting, Gerth Stølting Brodal, Rolf Fagerberg, Mark Greve, and Alejandro LópezOrtiz. In Proc. 20th Annual International Symposium on Algorithms and Computation, volume 5878 of Lecture Notes in Computer Science, pages 173182. Springer Verlag, Berlin, 2009.
 (10)
 Dynamic 3sided Planar Range Queries with Expected Doubly Logarithmic Time, Gerth Stølting Brodal, Alexis C. Kaporis, Spyros Sioutas, Konstantinos Tsakalidis, and Kostas Tsichlas. In Proc. 20th Annual International Symposium on Algorithms and Computation, volume 5878 of Lecture Notes in Computer Science, pages 193202. Springer Verlag, Berlin, 2009.
 60
 Counting in the Presence of Memory Faults, Gerth Stølting Brodal, Allan Grønlund Jørgensen, Gabriel Moruz, and Thomas Mølhave. In Proc. 20th Annual International Symposium on Algorithms and Computation, volume 5878 of Lecture Notes in Computer Science, pages 842851. Springer Verlag, Berlin, 2009.
 61
 Fault Tolerant External Memory Algorithms, Gerth Stølting Brodal, Allan Grønlund Jørgensen, and Thomas Mølhave. In Proc. 11th International Workshop on Algorithms and Data Structures, volume 5664 of Lecture Notes in Computer Science, pages 411422. Springer Verlag, Berlin, 2009.
 62
 Selecting Sums in Arrays, Gerth Stølting Brodal and Allan Grønlund Jørgensen. In Proc. 19th Annual International Symposium on Algorithms and Computation, volume 5369 of Lecture Notes in Computer Science, pages 100111. Springer Verlag, Berlin, 2008.
 (14)
 External memory planar point location with logarithmic updates, Lars Arge, Gerth Stølting Brodal, and S. Srinivasa Rao. In Proc. 24st Annual ACM Symposium on Computational Geometry, pages 139147, 2008.
 63
 Optimal Resilient Dynamic Dictionaries, Gerth Stølting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe Italiano, Allan Grønlund Jørgensen, Gabriel Moruz, and Thomas Mølhave. In Proc. 15th Annual European Symposium on Algorithms, volume 4708 of Lecture Notes in Computer Science, pages 347358. Springer Verlag, Berlin, 2007.
 64
 Dynamic Matchings in Convex Bipartite Graphs, Gerth Stølting Brodal, Loukas Georgiadis, Kristoffer A. Hansen, and Irit Katriel. In Proc. 32nd International Symposium on Mathematical Foundations of Computer Science, volume 4708 of Lecture Notes in Computer Science, pages 406417. Springer Verlag, Berlin, 2007.
 65
 A Linear Time Algorithm for the Maximal Sums Problem, Gerth Stølting Brodal and Allan Grønlund Jørgensen. In Proc. 32nd International Symposium on Mathematical Foundations of Computer Science, volume 4708 of Lecture Notes in Computer Science, pages 442453. Springer Verlag, Berlin, 2007.
 66
 The ComBack Method  Extending Hash Compaction with Backtracking, Michael Westergaard, Lars Michael Kristensen, Gerth Stølting Brodal, and Lars Arge. In Proc. 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, volume 4546 of Lecture Notes in Computer Science, pages 445464. Springer Verlag, Berlin, 2007.
 (16)
 Optimal Sparse Matrix Dense Vector Multiplication in the I/OModel, Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, and Elias Vicari. In Proc. 19th ACM Symposium on Parallelism in Algorithms and Architectures, pages 6170, 2007.
 67
 Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree, Martin Stissing, Christian Nørgaard Storm Pedersen, Thomas Mailund, Gerth Stølting Brodal, and Rolf Fagerberg. In Proc. 5th Asia Pacific Bioinformatics Conference, volume 5 of Advances in Bioinformatics & Computational Biology, pages 101110. Imperial College Press, 2007.
 (20)
 Computing the AllPairs Quartet Distance on a set of Evolutionary Trees, Martin Stissing, Thomas Mailund, Christian Nørgaard Storm Pedersen, Gerth Stølting Brodal, and Rolf Fagerberg. In Proc. 5th Asia Pacific Bioinformatics Conference, Advances in Bioinformatics & Computational Biology, pages 91100. Imperial College Press, 2007.
 68
 Improved Dynamic Planar Point Location, Lars Arge, Gerth Stølting Brodal, and Loukas Georgiadis. In Proc. 47th Annual Symposium on Foundations of Computer Science, pages 305314, 2006.
 69
 Purely Functional Worst Case Constant Time Catenable Sorted Lists, Gerth Stølting Brodal, Christos Makris, and Kostas Tsichlas. In Proc. 14th Annual European Symposium on Algorithms, volume 4168 of Lecture Notes in Computer Science, pages 172183. Springer Verlag, Berlin, 2006.
 70
 Skewed Binary Search Trees, Gerth Stølting Brodal and Gabriel Moruz. In Proc. 14th Annual European Symposium on Algorithms, volume 4168 of Lecture Notes in Computer Science, pages 708719. Springer Verlag, Berlin, 2006.
 (18)
 Faster Algorithms for Computing Longest Common Increasing Subsequences, Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, and Martin Kutz. In Proc. 17th Annual Symposium on Combinatorial Pattern Matching, volume 4009 of Lecture Notes in Computer Science, pages 330341. Springer Verlag, Berlin, 2006.
 71
 Cacheoblivious String Dictionaries, Gerth Stølting Brodal and Rolf Fagerberg. In Proc. 17th Annual ACMSIAM Symposium on Discrete Algorithms, pages 581590, 2006.
 72
 Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms, Gerth Stølting Brodal and Gabriel Moruz. In Proc. 9th International Workshop on Algorithms and Data Structures, volume 3608 of Lecture Notes in Computer Science, pages 385395. Springer Verlag, Berlin, 2005.
 73
 CacheAware and CacheOblivious Adaptive Sorting, Gerth Stølting Brodal, Rolf Fagerberg, and Gabriel Moruz. In Proc. 32nd International Colloquium on Automata, Languages, and Programming, volume 3580 of Lecture Notes in Computer Science, pages 576588. Springer Verlag, Berlin, 2005.
 74
 CacheOblivious Planar Orthogonal Range Searching and Counting, Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg, and Morten Laustsen. In Proc. 21st Annual ACM Symposium on Computational Geometry, pages 160169, 2005.
 (21)
 On the Adaptiveness of Quicksort, Gerth Stølting Brodal, Rolf Fagerberg, and Gabriel Moruz. In Proc. 7th Workshop on Algorithm Engineering and Experiments, pages 130140, 2005.
 75
 CacheOblivious Algorithms and Data Structures, Gerth Stølting Brodal. In Proc. 9th Scandinavian Workshop on Algorithm Theory, volume 3111 of Lecture Notes in Computer Science, pages 313. Springer Verlag, Berlin, 2004.
 76
 CacheOblivious Data Structures and Algorithms for Undirected BreadthFirst Search and Shortest Paths, Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, and Norbert Zeh. In Proc. 9th Scandinavian Workshop on Algorithm Theory, volume 3111 of Lecture Notes in Computer Science, pages 480492. Springer Verlag, Berlin, 2004.
 (23)
 Engineering a CacheOblivious Sorting Algorithm, Gerth Stølting Brodal, Rolf Fagerberg, and Kristoffer Vinther. In Proc. 6th Workshop on Algorithm Engineering and Experiments, pages 417, 2004.
 77
 TimeDependent Networks as Models to Achieve Fast Exact TimeTable Queries, Gerth Stølting Brodal and Riko Jacob. In Proc. Algorithmic Methods and Models for Optimization of Railways (ATMOS 2003), volume 92(1) of Electronic Notes in Theoretical Computer Science, 12 pages. Elsevier Science, 2003.
 (19)
 The Cost of CacheOblivious Searching, Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, and Alejandro LópezOrtiz. In Proc. 44th Annual Symposium on Foundations of Computer Science, pages 271282, 2003.
 78
 Computing Refined Buneman Trees in Cubic Time, Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian Nørgaard Storm Pedersen, and S. Srinivasa Rao. In Proc. 3rd Workshop on Algorithms in BioInformatics, volume 2812 of Lecture Notes in Computer Science, pages 259270. Springer Verlag, Berlin, 2003.
 79
 On the Limits of CacheObliviousness, Gerth Stølting Brodal and Rolf Fagerberg. In Proc. 35th Annual ACM Symposium on Theory of Computing, pages 307315, 2003.
 80
 Lower Bounds for External Memory Dictionaries, Gerth Stølting Brodal and Rolf Fagerberg. In Proc. 14th Annual ACMSIAM Symposium on Discrete Algorithms, pages 546554, 2003.
 81
 Funnel Heap  A Cache Oblivious Priority Queue, Gerth Stølting Brodal and Rolf Fagerberg. In Proc. 13th Annual International Symposium on Algorithms and Computation, volume 2518 of Lecture Notes in Computer Science, pages 219228. Springer Verlag, Berlin, 2002.
 82
 Dynamic Planar Convex Hull, Gerth Stølting Brodal and Riko Jacob. In Proc. 43rd Annual Symposium on Foundations of Computer Science, pages 617626, 2002.
 83
 Time and Space Efficient MultiMethod Dispatching, Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, and Theis Rauhe. In Proc. 8th Scandinavian Workshop on Algorithm Theory, volume 2368 of Lecture Notes in Computer Science, pages 2029. Springer Verlag, Berlin, 2002.
 84
 Cache Oblivious Distribution Sweeping, Gerth Stølting Brodal and Rolf Fagerberg. In Proc. 29th International Colloquium on Automata, Languages, and Programming, volume 2380 of Lecture Notes in Computer Science, pages 426438. Springer Verlag, Berlin, 2002.
 85
 Solving the String Statistics Problem in Time , Gerth Stølting Brodal, Rune Bang Lyngsø, Anna Östlin, and Christian Nørgaard Storm Pedersen. In Proc. 29th International Colloquium on Automata, Languages, and Programming, volume 2380 of Lecture Notes in Computer Science, pages 728739. Springer Verlag, Berlin, 2002.
 (28)
 Optimal Finger Search Trees in the Pointer Machine, Gerth Stølting Brodal, George Lagogiannis, Christos Makris, Athanasios Tsakalidis, and Kostas Tsichlas. In Proc. 34th Annual ACM Symposium on Theory of Computing, pages 583591, 2002.
 86
 CacheOblivious Search Trees via Binary Trees of Small Height, Gerth Stølting Brodal, Rolf Fagerberg, and Riko Jacob. In Proc. 13th Annual ACMSIAM Symposium on Discrete Algorithms, pages 3948, 2002.
 (27)
 Computing the Quartet Distance Between Evolutionary Trees in Time , Gerth Stølting Brodal, Rolf Fagerberg, and Christian Nørgaard Storm Pedersen. In Proc. 12th Annual International Symposium on Algorithms and Computation, volume 2223 of Lecture Notes in Computer Science, pages 731742. Springer Verlag, Berlin, 2001.
 87
 The Complexity of Constructing Evolutionary Trees Using Experiments, Gerth Stølting Brodal, Rolf Fagerberg, Christian Nørgaard Storm Pedersen, and Anna Östlin. In Proc. 28th International Colloquium on Automata, Languages, and Programming, volume 2076 of Lecture Notes in Computer Science, pages 140151. Springer Verlag, Berlin, 2001.
 88
 Optimal Static Range Reporting in One Dimension, Stephen Alstrup, Gerth Stølting Brodal, and Theis Rauhe. In Proc. 33rd Annual ACM Symposium on Theory of Computing, pages 476482, 2001.
 89
 New Data Structures for Orthogonal Range Searching, Stephen Alstrup, Gerth Stølting Brodal, and Theis Rauhe. In Proc. 41st Annual Symposium on Foundations of Computer Science, pages 198207, 2000.
 90
 Dynamic Planar Convex Hull with Optimal Query Time and Update Time, Gerth Stølting Brodal and Riko Jacob. In Proc. 7th Scandinavian Workshop on Algorithm Theory, volume 1851 of Lecture Notes in Computer Science, pages 5770. Springer Verlag, Berlin, 2000.
 (26)
 On External Memory MST, SSSP and Multiway Planar Graph Separation, Lars Arge, Gerth Stølting Brodal, and Laura Toma. In Proc. 7th Scandinavian Workshop on Algorithm Theory, volume 1851 of Lecture Notes in Computer Science, pages 433447. Springer Verlag, Berlin, 2000.
 91
 Finding Maximal Quasiperiodicities in Strings, Gerth Stølting Brodal and Christian Nørgaard Storm Pedersen. In Proc. 11th Annual Symposium on Combinatorial Pattern Matching, volume 1848 of Lecture Notes in Computer Science, pages 397411. Springer Verlag, Berlin, 2000.
 92
 Pattern Matching in Dynamic Texts, Stephen Alstrup, Gerth Stølting Brodal, and Theis Rauhe. In Proc. 11th Annual ACMSIAM Symposium on Discrete Algorithms, pages 819828, 2000.
 93
 Dynamic Representations of Sparse Graphs, Gerth Stølting Brodal and Rolf Fagerberg. In Proc. 6th International Workshop on Algorithms and Data Structures, volume 1663 of Lecture Notes in Computer Science, pages 342351. Springer Verlag, Berlin, 1999.
 (32)
 Finding Maximal Pairs with Bounded Gap, Gerth Stølting Brodal, Rune Bang Lyngsø, Christian Nørgaard Storm Pedersen, and Jens Stoye. In Proc. 10th Annual Symposium on Combinatorial Pattern Matching, volume 1645 of Lecture Notes in Computer Science, pages 134149. Springer Verlag, Berlin, 1999.
 94
 I/OEfficient Dynamic Point Location in Monotone Subdivisions, Pankaj K. Agarwal, Lars Arge, Gerth Stølting Brodal, and Jeff Vitter. In Proc. 10th Annual ACMSIAM Symposium on Discrete Algorithms, pages 1120, 1999.
 95
 WorstCase Efficient ExternalMemory Priority Queues, Gerth Stølting Brodal and Jyrki Katajainen. In Proc. 6th Scandinavian Workshop on Algorithm Theory, volume 1432 of Lecture Notes in Computer Science, pages 107118. Springer Verlag, Berlin, 1998.
 (30)
 Comparator Networks for Binary Heap Construction, Gerth Stølting Brodal and M. Cristina Pinotti. In Proc. 6th Scandinavian Workshop on Algorithm Theory, volume 1432 of Lecture Notes in Computer Science, pages 158168. Springer Verlag, Berlin, 1998.
 96
 Finger Search Trees with Constant Insertion Time, Gerth Stølting Brodal. In Proc. 9th Annual ACMSIAM Symposium on Discrete Algorithms, pages 540549, 1998.
 (34)
 A Parallel Priority Data Structure with Applications, Gerth Stølting Brodal, Jesper Larsson Träff, and Christos D. Zaroliagis. In Proc. 11th International Parallel Processing Symposium, Dror G. Feitelson and Larry Rudolph (Edt.), pages 689693, IEEE Comput. Soc. Press, 1997.
 97
 Predecessor Queries in Dynamic Integer Sets, Gerth Stølting Brodal. In Proc. 14th Annual Symposium on Theoretical Aspects of Computer Science, volume 1200 of Lecture Notes in Computer Science, pages 2132. Springer Verlag, Berlin, 1997.
 (35)
 The Randomized Complexity of Maintaining the Minimum, Gerth Stølting Brodal, Shiva Chaudhuri, and Jaikumar Radhakrishnan. In Proc. 5th Scandinavian Workshop on Algorithm Theory, volume 1097 of Lecture Notes in Computer Science, pages 415. Springer Verlag, Berlin, 1996.
 (33)
 Priority Queues on Parallel Machines, Gerth Stølting Brodal. In Proc. 5th Scandinavian Workshop on Algorithm Theory, volume 1097 of Lecture Notes in Computer Science, pages 416427. Springer Verlag, Berlin, 1996.
 98
 Approximate Dictionary Queries, Gerth Stølting Brodal and Leszek Gasieniec. In Proc. 7th Annual Symposium on Combinatorial Pattern Matching, volume 1075 of Lecture Notes in Computer Science, pages 6574. Springer Verlag, Berlin, 1996.
 99
 WorstCase Efficient Priority Queues, Gerth Stølting Brodal. In Proc. 7th Annual ACMSIAM Symposium on Discrete Algorithms, pages 5258, 1996.
 100
 Fast Meldable Priority Queues, Gerth Stølting Brodal. In Proc. 4th International Workshop on Algorithms and Data Structures, volume 955 of Lecture Notes in Computer Science, pages 282290. Springer Verlag, Berlin, 1995.
Technical Reports
 (39)
 Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees, Gerth Stølting Brodal and Konstantinos Mampentzidis. Technical Report, 1706.10284, arXiv.org, 16 pages, June 2017.
 (40)
 External Memory ThreeSided Range Reporting and Top Queries with Sublogarithmic Updates, Gerth Stølting Brodal. Technical Report, 1509.08240, arXiv.org, 16 pages, September 2015.
 (41)
 Strictly Implicit Priority Queues: On the Number of Moves and WorstCase Time, Gerth Stølting Brodal, Jesper Sindahl Nielsen, and Jakob Truelsen. Technical Report, 1505.00147., arXiv.org, 15 pages, May 2015.
 (43)
 Optimal Planar Orthogonal Skyline Counting Queries, Gerth Stølting Brodal and Kasper Green Larsen. Technical Report, 1304.7959, arXiv.org, 17 pages, April 2013.
 (10)
 Dynamic 3sided Planar Range Queries with Expected Doubly Logarithmic Time, Gerth Stølting Brodal, Alexis C. Kaporis, Apostolos Papadopoulos, Spyros Sioutas, Konstantinos Tsakalidis, and Kostas Tsichlas. Technical Report, 1201.2702, arXiv.org, 29 pages, January 2012.
 (52)
 CacheOblivious Implicit Predecessor Dictionaries with the Working Set Property, Gerth Stølting Brodal and Casper KejlbergRasmussen. Technical Report, 1112.5472, arXiv.org, 16 pages, December 2011.
 (7)
 DTree: A New Overlay with Deterministic Bounds, Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, and Christos D. Zaroliagis. Technical Report, 1009.3134, arXiv.org, 21 pages, September 2010.
 (63)
 Optimal Resilient Dynamic Dictionaries, Gerth Stølting Brodal, Rolf Fagerberg, Allan Grønlund Jørgensen, Gabriel Moruz, and Thomas Mølhave. Technical Report, DAIMI PB585, Department of Computer Science, Aarhus University, 14 pages, November 2007.
 (18)
 Faster Algorithms for Computing Longest Common Increasing Subsequences, Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, and Martin Kutz. Technical Report, BRICSRS0537, BRICS, Department of Computer Science, Aarhus University, 16 pages, December 2005.
 (21)
 On the Adaptiveness of Quicksort, Gerth Stølting Brodal, Rolf Fagerberg, and Gabriel Moruz. Technical Report, BRICSRS0427, BRICS, Department of Computer Science, Aarhus University, 23 pages, December 2004.
 (76)
 CacheOblivious Data Structures and Algorithms for Undirected BreadthFirst Search and Shortest Paths, Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, and Norbert Zeh. Technical Report, BRICSRS042, BRICS, Department of Computer Science, Aarhus University, 19 pages, January 2004.
 (24)
 Speeding Up NeighbourJoining Tree Construction, Gerth Stølting Brodal, Rolf Fagerberg, Thomas Mailund, Christian Nørgaard Storm Pedersen, and Derek Phillips. Technical Report, ALCOMFTTR03102, ALCOMFT, 9 pages, November 2003.
 (23)
 Engineering a CacheOblivious Sorting Algorithm, Gerth Stølting Brodal, Rolf Fagerberg, and Kristoffer Vinther. Technical Report, ALCOMFTTR03101, ALCOMFT, 16 pages, November 2003.
 (78)
 Computing Refined Buneman Trees in Cubic Time, Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian Nørgaard Storm Pedersen, and S. Srinivasa Rao. Technical Report, ALCOMFTTR0373, ALCOMFT, 11 pages, November 2003.
 (79)
 On the Limits of CacheObliviousness, Gerth Stølting Brodal and Rolf Fagerberg. Technical Report, ALCOMFTTR0374, ALCOMFT, 17 pages, November 2003.
 (80)
 Lower Bounds for External Memory Dictionaries, Gerth Stølting Brodal and Rolf Fagerberg. Technical Report, ALCOMFTTR0375, ALCOMFT, 13 pages, November 2003.
 (19)
 The Cost of CacheOblivious Searching, Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, and Alejandro LópezOrtiz. Technical Report, ALCOMFTTR0376, ALCOMFT, 18 pages, November 2003.
 (25)
 Fast Allocation and Deallocation with an Improved Buddy System, Gerth Stølting Brodal, Erik D. Demaine, and J. Ian Munro. Technical Report, ALCOMFTTR033, ALCOMFT, 15 pages, May 2003.
 (78)
 Computing Refined Buneman Trees in Cubic Time, Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian Nørgaard Storm Pedersen, and S. Srinivasa Rao. Technical Report, BRICSRS0251, BRICS, Department of Computer Science, Aarhus University, 14 pages, December 2002.
 (81)
 Funnel Heap  A Cache Oblivious Priority Queue, Gerth Stølting Brodal and Rolf Fagerberg. Technical Report, ALCOMFTTR02136, ALCOMFT, 11 pages, June 2002.
 (28)
 Optimal Finger Search Trees in the Pointer Machine, Gerth Stølting Brodal, George Lagogiannis, Christos Makris, Athanasios Tsakalidis, and Kostas Tsichlas. Technical Report, ALCOMFTTR0277, ALCOMFT, 17 pages, May 2002.
 (83)
 Time and Space Efficient MultiMethod Dispatching, Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, and Theis Rauhe. Technical Report, ALCOMFTTR0276, ALCOMFT, 9 pages, May 2002.
 (85)
 Solving the String Statistics Problem in Time , Gerth Stølting Brodal, Rune Bang Lyngsø, Anna Östlin, and Christian Nørgaard Storm Pedersen. Technical Report, BRICSRS0213, BRICS, Department of Computer Science, Aarhus University, 28 pages, October 2002.
 (85)
 Solving the String Statistics Problem in Time , Gerth Stølting Brodal, Rune Bang Lyngsø, Anna Östlin, and Christian Nørgaard Storm Pedersen. Technical Report, ALCOMFTTR0255, ALCOMFT, 12 pages, May 2002.
 (27)
 Computing the Quartet Distance Between Evolutionary Trees in Time , Gerth Stølting Brodal, Rolf Fagerberg, and Christian Nørgaard Storm Pedersen. Technical Report, ALCOMFTTR0254, ALCOMFT, 15 pages, May 2002.
 (86)
 CacheOblivious Search Trees via Trees of Small Height, Gerth Stølting Brodal, Rolf Fagerberg, and Riko Jacob. Technical Report, ALCOMFTTR0253, ALCOMFT, 20 pages, May 2002.
 (84)
 Cache Oblivious Distribution Sweeping, Gerth Stølting Brodal and Rolf Fagerberg. Technical Report, BRICSRS0218, BRICS, Department of Computer Science, Aarhus University, 21 pages, 2009.
 (84)
 Cache Oblivious Distribution Sweeping, Gerth Stølting Brodal and Rolf Fagerberg. Technical Report, ALCOMFTTR0252, ALCOMFT, 22 pages, May 2002.
 (86)
 Cache Oblivious Search Trees via Binary Trees of Small Height, Gerth Stølting Brodal, Rolf Fagerberg, and Riko Jacob. Technical Report, BRICSRS0136, BRICS, Department of Computer Science, Aarhus University, 20 pages, October 2001.
 (87)
 The Complexity of Constructing Evolutionary Trees Using Experiments, Gerth Stølting Brodal, Rolf Fagerberg, Christian Nørgaard Storm Pedersen, and Anna Östlin. Technical Report, BRICSRS011, BRICS, Department of Computer Science, Aarhus University, 27 pages, July 2001.
 (77)
 Timedependent networks as models to achieve fast exact timetable queries, Gerth Stølting Brodal and Riko Jacob. Technical Report, ALCOMFTTR01176, ALCOMFT, 12 pages, September 2001.
 (27)
 Computing the Quartet Distance Between Evolutionary Trees in Time , Gerth Stølting Brodal, Rolf Fagerberg, and Christian Nørgaard Storm Pedersen. Technical Report, ALCOMFTTR01131, ALCOMFT, 12 pages, May 2001.
 (87)
 The Complexity of Constructing Evolutionary Trees Using Experiments, Gerth Stølting Brodal, Rolf Fagerberg, Christian Nørgaard Storm Pedersen, and Anna Östlin. Technical Report, ALCOMFTTR01130, ALCOMFT, 25 pages, May 2001.
 (88)
 Optimal Static Range Reporting in One Dimension, Stephen Alstrup, Gerth Stølting Brodal, and Theis Rauhe. Technical Report, ALCOMFTTR0153, ALCOMFT, 13 pages, May 2001.
 (26)
 On External Memory MST, SSSP and Multiway Planar Graph Separation, Lars Arge, Gerth Stølting Brodal, and Laura Toma. Technical Report, ALCOMFTTR0138, ALCOMFT, 14 pages, May 2001.
 (89)
 New Data Structures for Orthogonal Range Searching, Stephen Alstrup, Gerth Stølting Brodal, and Theis Rauhe. Technical Report, ALCOMFTTR0135, ALCOMFT, 17 pages, May 2001.
 (90)
 Dynamic Planar Convex Hull with Optimal Query Time and Update Time, Gerth Stølting Brodal and Riko Jacob. Technical Report, ALCOMFTTR0134, ALCOMFT, 14 pages, May 2001.
 (83)
 Time and Space Efficient MultiMethod Dispatching, Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, and Theis Rauhe. Technical Report, ITUTR20018, The IT University of Copenhagen, 13 pages, October 2001.
 (88)
 Optimal Static Range Reporting in One Dimension, Stephen Alstrup, Gerth Stølting Brodal, and Theis Rauhe. Technical Report, ITUTR20003, The IT University of Copenhagen, 12 pages, November 2000.
 (31)
 Improved Bounds for Dictionary Lookup with One Error, Gerth Stølting Brodal and Venkatesh Srinivasan. Technical Report, BRICSRS9950, BRICS, Department of Computer Science, Aarhus University, 5 pages, December 1999.
 (91)
 Finding Maximal Quasiperiodicities in Strings, Gerth Stølting Brodal and Christian Nørgaard Storm Pedersen. Technical Report, BRICSRS9925, BRICS, Department of Computer Science, Aarhus University, 20 pages, September 1999.
 (32)
 Finding Maximal Pairs with Bounded Gap, Gerth Stølting Brodal, Rune Bang Lyngsø, Christian Nørgaard Storm Pedersen, and Jens Stoye. Technical Report, BRICSRS9912, BRICS, Department of Computer Science, Aarhus University, 31 pages, April 1999.
 (92)
 Dynamic Pattern Matching, Stephen Alstrup, Gerth Stølting Brodal, and Theis Rauhe. Technical Report, DIKU Report 98/27, Department of Computer Science, University of Copenhagen, 16 pages, 1998.
 (30)
 Comparator Networks for Binary Heap Construction, Gerth Stølting Brodal and M. Cristina Pinotti. Technical Report, MPII981002, MaxPlanckInstitut für Informatik, 11 pages, January 1998.
 (95)
 WorstCase Efficient ExternalMemory Priority Queues, Gerth Stølting Brodal and Jyrki Katajainen. Technical Report, DIKU Report 97/25, Department of Computer Science, University of Copenhagen, 16 pages, October 1997.
 (96)
 Finger Search Trees with Constant Insertion Time, Gerth Stølting Brodal. Technical Report, MPII971020, MaxPlanckInstitut für Informatik, 17 pages, September 1997.
 (34)
 A Parallel Priority Queue with Constant Time Operations, Gerth Stølting Brodal, Jesper Larsson Träff, and Christos D. Zaroliagis. Technical Report, MPII971011, MaxPlanckInstitut für Informatik, 19 pages, May 1997.
 101
 The Complexity of Computing the ary Composition of a Binary Associative Operator, Gerth Stølting Brodal and Sven Skyum. Technical Report, BRICSRS9642, BRICS, Department of Computer Science, Aarhus University, 15 pages, November 1996.
 (35)
 The Randomized Complexity of Maintaining the Minimum, Gerth Stølting Brodal, Shiva Chaudhuri, and Jaikumar Radhakrishnan. Technical Report, BRICSRS9640, BRICS, Department of Computer Science, Aarhus University, 20 pages, November 1996.
 (35)
 The Randomized Complexity of Maintaining the Minimum, Gerth Stølting Brodal, Shiva Chaudhuri, and Jaikumar Radhakrishnan. Technical Report, MPII961014, MaxPlanckInstitut für Informatik, May 1996.
 102
 A Communication Complexity Proof that Symmetric Functions have Logarithmic Depth, Gerth Stølting Brodal and Thore Husfeldt. Technical Report, BRICSRS961, BRICS, Department of Computer Science, Aarhus University, 3 pages, January 1996.
 (37)
 Optimal Purely Functional Priority Queues, Gerth Stølting Brodal and Chris Okasaki. Technical Report, BRICSRS9637, BRICS, Department of Computer Science, Aarhus University, 27 pages, October 1996.
 (100)
 Fast Meldable Priority Queues, Gerth Stølting Brodal. Technical Report, BRICSRS9512, BRICS, Department of Computer Science, Aarhus University, 12 pages, February 1995.
 (36)
 Partially Persistent Data Structures of Bounded Degree with Constant Update Time, Gerth Stølting Brodal. Technical Report, BRICSRS9435, BRICS, Department of Computer Science, Aarhus University, 24 pages, November 1994.
Theses
 103
 Worst Case Efficient Data Structures, Gerth Stølting Brodal. PhD Thesis, Department of Computer Science, Aarhus University, Denmark, x+121 pages, January 1997. BRICSDS971.
 104
 Complexity of Data Structures, Gerth Stølting Brodal. Progress report, Department of Computer Science, Aarhus University, Denmark, 29 pages, November 1994.
Submissions
 105
 Fully Persistent Btrees, Gerth Stølting Brodal, Spyros Sioutas, Konstantinos Tsakalidis, and Kostas Tsichlas. Submitted to SIAM Journal of Computing.
Coauthors
Peyman Afshani, Pankaj K. Agarwal, Stephen Alstrup, Lars Arge, Djamal Belazzougui, Michael A. Bender, Edvin Berglin, Andrej Brodnik, Shiva Chaudhuri, Pooya Davoodi, Erik D. Demaine, Rolf Fagerberg, Jeremy T. Fineman, Irene Finocchi, Dongdong Ge, Loukas Georgiadis, Beat Gfeller, Fabrizio Grandoni, Mark Greve, Leszek Gasieniec, Inge Li Gørtz, Kristoffer A. Hansen, Simai He, Morten Kragelund Holt, Haodong Hu, Thore Husfeldt, John Iacono, Giuseppe Italiano, Riko Jacob, Jens Johansen, Allan Grønlund Jørgensen, Kanela Kaligosi, Alexis Kaporis, Alexis C. Kaporis, Jyrki Katajainen, Irit Katriel, Casper KejlbergRasmussen, Lars Michael Kristensen, Martin Kutz, Alejandro LópezOrtiz, George Lagogiannis, Stefan Langerman, Kasper Green Larsen, Morten Laustsen, Moshe Lewenstein, Rune Bang Lyngsø, Thomas Mailund, Christos Makris, Konstantinos Mampentzidis, Ulrich Meyer, Gabriel Moruz, J. Ian Munro, Thomas Mølhave, Andrei Negoescu, Jesper Sindahl Nielsen, Chris Okasaki, Vineet Pandey, Apostolos Papadopoulos, Christian Nørgaard Storm Pedersen, Derek Phillips, M. Cristina Pinotti, Jaikumar Radhakrishnan, Rajeev Raman, S. Srinivasa Rao, Theis Rauhe, Andreas Sand, Peter Sanders, Spyros Sioutas, Sven Skyum, Venkatesh Srinivasan, Martin Stissing, Jens Stoye, Robert E. Tarjan, Laura Toma, Jakob Truelsen, Jesper Larsson Träff, Athanasios Tsakalidis, Konstantinos Tsakalidis, Kostas Tsichlas, Constantinos Tsirogiannis, Elias Vicari, Kristoffer Vinther, Jeff Vitter, Michael Westergaard, Christos D. Zaroliagis, Norbert Zeh, Anna Östlin.
Program Committees
 2017
 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Limerick, Ireland.
 28th Annual ACMSIAM Symposium on Discrete Algorithms, Barcelona, Spain.
 2016
 18th Workshop on Algorithm Engineering and Experiments, Arlington, Virginia, USA.
 2015
 31st European Workshop on Computational Geometry, Ljubljana, Slovenia.
 26th International Workshop on Combinatorial Algorithms, Verona, Italy.
 2014
 25th Annual ACMSIAM Symposium on Discrete Algorithms, Portland, Oregon, USA.
 6th Workshop on Massive Data Algorithmics, Wroclaw, Poland.
 39th International Symposium on Mathematical Foundations of Computer Science, Budapest, Hungary.
 25th Annual International Symposium on Algorithms and Computation, Jeonju, Korea.
 25th International Workshop on Combinatorial Algorithms, Duluth, Minnesota, USA.
 41st International Colloquium on Automata, Languages, and Programming, IT University of Copenhagen, Copenhagen, Denmark.
 2013
 5th Workshop on Massive Data Algorithmics, Sophia Antipolis, France.
 19th International Symposium on Fundamentals of Computation Theory, Liverpool, United Kingdom.
 24rd International Workshop on Combinatorial Algorithms, Rouen, Normandy, France.
 7th International Conference on Language and Automata Theory and Applications, Bilbao, Spain.
 2012
 14th Workshop on Algorithm Engineering and Experiments, Kyoto, Japan.
 4th Workshop on Massive Data Algorithmics, Ljulbjana, Slovenia.
 23rd International Workshop on Combinatorial Algorithms, Kalasalingam University, Tamil Nadu, India.
 2011
 3rd Workshop on Massive Data Algorithmics, Paris, France.
 22nd International Workshop on Combinatorial Algorithms, University of Victoria, Victoria, British Columbia, Canada.
 2010
 2nd Workshop on Massive Data Algorithmics, Snowbird, Utah.
 21st International Workshop on Combinatorial Algorithms, King's College London, UK.
 9th Latin American Symposium on Theoretical Informatics, Oaxaca, Mexico.
 12th Scandinavian Workshop on Algorithm Theory, Bergen, Norway.
 18th Annual European Symposium on Algorithms, Liverpool, UK.
 2009
 11th International Workshop on Algorithms and Data Structures, Banff, Alberta, Canada.
 8th International Symposium on Experimental Algorithms, Dortmund, Germany.
 1st Workshop on Massive Data Algorithmics, Aarhus, Denmark (cochair).
 21st ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Canada.
 36th International Colloquium on Automata, Languages and Programming, Rhodes, Greece.
 2008
 7th International Workshop on Experimental Algorithms, Provincetown, Cape Cod, Massachusetts, USA.
 2007
 10th International Workshop on Algorithms and Data Structures, Halifax, Canada.
 18th Annual ACMSIAM Symposium on Discrete Algorithms, New Orleans, Louisiana, USA.
 9th Workshop on Algorithm Engineering and Experiments, New Orleans, Louisiana, USA (cochair).
 IEEE 2007 International Symposium on Parallel and Distributed Processing with Applications, Niagara Falls, Ontario, Canada.
 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany.
 International Workshop on Algorithmic Topics in Constraint Programming (cancelled), Wroclaw, Poland.
 2006
 9th Scandinavian Workshop on Algorithm Theory, Riga, Latvia.
 13th Symposium on String Processing and Information Retrieval (SPIRE), Glasgow, Scotland.
 2005
 13th Annual European Symposium on Algorithms  Engineering and Application Track, Mallorca, Spain (chair).
 37th Annual ACM Symposium on Theory of Computing, Baltimore, Maryland, USA.
 4th International Workshop on Efficient and Experimental Algorithms, Santorini Island, Greece.
 2004
 15th Annual ACMSIAM Symposium on Discrete Algorithms, New Orleans, Louisiana, USA.
 31st International Colloquium on Automata, Languages and Programming, Turku, Finland.
 24th Conference on Foundations of Software Technology and Theoretical Computer Science, Chennai, India.
 3rd International Conference on Fun With Algorithms, Isola d'Elba, Tuscany, Italy.
 6th Latin American Symposium on Theoretical Informatics, Buenos Aires, Argentina.
 15th Annual Symposium on Combinatorial Pattern Matching, Istanbul, Turkey.
 2003
 8th International Workshop on Algorithms and Data Structures, Ottawa, Canada.
 5th Workshop on Algorithm Engineering and Experiments, Baltimore, MD, USA.
 Workshop on Algorithms for Massive Data Sets (cancelled), Eindhoven, The Netherlands (cochair).
 11th Euromicro Conference on Parallel Distributed and Networking based Processing, Special session on Memory Hierachies, Genoa, Italy.
 2001
 9th Annual European Symposium on Algorithms, Aarhus, Denmark.
 1999
 Workshop on Algorithmic Aspects of Advanced Programming Languages, Paris, France.
Invited Speaker
 August 2008
 Lectures on lower bounds and string algorithms, MADALGO Summer School on Cache Oblivious Algorithms, MADALGO, Aarhus University, Denmark.
 June 2008
 Word RAM algorithms, International PhD School in Algorithms for Advanced Processor Architectures, IT University of Copenhagen, Denmark. [pdf, pptx]
 July 2004
 CacheOblivious Algorithms and Data Structures, 9th Scandinavian Workshop on Algorithm Theory, Louisiana Museum of Modern Art, Humlebæk, Denmark. [pdf]
 December 1999
 Regularities in Sequences, Workshop on Advances in Data Structures, preworkshop of the 19th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Chennai, India. [pdf]
Conference Participation
 November 2017
 Workshop on The Art of Data Structures in honor of Prof. Athanasios Tsakalidis (picture of participants). University of Patras, Patras, Greece (presentation [pdf, pptx] ).
 January 2017
 28th Annual ACMSIAM Symposium on Discrete Algorithms. Barcelona, Spain.
 August 2016
 8th Workshop on Massive Data Algorithmics. Aarhus, Denmark (presentation [pdf, pptx] ).
 February 2016
 33rd Annual Symposium on Theoretical Aspects of Computer Science. Orléans, France (presentation [pdf, pptx] ).
 January 2016
 27th Annual ACMSIAM Symposium on Discrete Algorithms. Washington, DC, USA.
 SeptemberOctober 2014
 Algorithms for Big Data. Goethe University, Frankfurt am Main, Germany.
 September 2014
 22nd Annual European Symposium on Algorithms. Wroclaw, Poland.
 September 2014
 6th Workshop on Massive Data Algorithmics. Wroclaw, Poland.
 July 2014
 14th Scandinavian Workshop on Algorithm Theory. Copenhagen, Denmark (presentation [pdf, pptx] ).
 January 2014
 25th Annual ACMSIAM Symposium on Discrete Algorithms. Portland, Oregon, USA.
 September 2013
 Dagstuhl Seminar on ``Algorithm Engineering''. Dagstuhl, Germany.
 September 2013
 5th Workshop on Massive Data Algorithmics. Inria, Sophia Antipolis, France.
 September 2013
 21st Annual European Symposium on Algorithms. Inria, Sophia Antipolis, France (presentation [pdf, pptx] ).
 August 2013
 Conference on Space Efficient Data Structures, Streams and Algorithms  In Honor of J. Ian Munro on the Occasion of His 66th Birthday. University of Waterloo, Waterloo, Ontario, Canada (presentation [pdf, pptx] ).
 August 2013
 13th International Workshop on Algorithms and Data Structures. University of Western Ontario, London, Ontario, Canada.
 January 2013
 24th Annual ACMSIAM Symposium on Discrete Algorithms. New Orleans, Louisiana, USA (presentation [pdf, pptx] ).
 September 2012
 4th Workshop on Massive Data Algorithmics. Ljubljana, Slovenia (presentation [pdf, pptx] ).
 September 2012
 20th Annual European Symposium on Algorithms. Ljubljana, Slovenia.
 May 2012
 44th Annual ACM Symposium on Theory of Computing. New York, New York, USA (presentation [pdf, pptx] ).
 January 2012
 23rd Annual ACMSIAM Symposium on Discrete Algorithms. Kyoto, Japan (presentation [pdf, pptx] ).
 January 2012
 14th Workshop on Algorithm Engineering and Experiments. Kyoto, Japan.
 August 2011
 12th International Workshop on Algorithms and Data Structures. Polytechnic Institute of New York University, Brooklyn, NY, USA.
 June 2011
 3rd Workshop on Massive Data Algorithmics. Paris, France.
 January 2011
 22nd Annual ACMSIAM Symposium on Discrete Algorithms. San Francisco, CA, USA.
 January 2011
 13th Workshop on Algorithm Engineering and Experiments. San Francisco, CA, USA.
 September 2010
 18th Annual European Symposium on Algorithms. Liverpool, United Kingdom (presentation [pdf, pptx] ).
 June 2010
 2nd Workshop on Massive Data Algorithmics. Snowbird, Utah, USA (presentation [pdf, pptx] ).
 January 2010
 21st Annual ACMSIAM Symposium on Discrete Algorithms. Austin, TX, USA.
 January 2010
 11th Workshop on Algorithm Engineering and Experiments. Austin, TX, USA.
 September 2009
 17th Annual European Symposium on Algorithms. Copenhagen, Denmark.
 June 2009
 25th Annual ACM Symposium on Computational Geometry. Aarhus, Denmark.
 June 2009
 Workshop on Massive Data Algorithmics. Aarhus, Denmark.
 March 2009
 Current Trends in Algorithms, Complexity Teory, and Cryptography. Tsinghua University, Beijing, China (presentation [pdf, pptx] ).
 August 2008
 MADALGO Summer School on Cache Oblivious Algorithms. MADALGO, Aarhus University, Denmark (invited speaker).
 June 2008
 International PhD School in Algorithms for Advanced Processor Architectures. IT University of Copenhagen, Denmark (invited speaker, presentation [pdf, pptx] ).
 January 2008
 19th Annual ACMSIAM Symposium on Discrete Algorithms. San Francisko, CA, USA.
 January 2008
 10th Workshop on Algorithm Engineering and Experiments. San Francisko, CA, USA.
 SeptemberOctober 2007
 3rd Bertinoro Workshop on Algorithms and Data Structures. Bertinoro, Forlì, Italy (presentation [pdf, ppt] ).
 August 2007
 32nd International Symposium on Mathematical Foundations of Computer Science. Cesky Krumlov, Czech Republic (presentation [pdf, ppt] ).
 January 2007
 18th Annual ACMSIAM Symposium on Discrete Algorithms. New Orleans, LA, USA.
 January 2007
 9th Workshop on Algorithm Engineering and Experiments. New Orleans, LA, USA.
 September 2006
 14th Annual European Symposium on Algorithms. Zürich, Switzerland (presentation [pdf, ppt] ).
 June 2006
 Workshop on SpaceConscious Algorithms. Bertinoro, Forlì, Italy (presentation [pdf] ).
 July 2006
 10th Scandinavian Workshop on Algorithm Theory. Riga, Latvia.
 January 2006
 17th Annual ACMSIAM Symposium on Discrete Algorithms. Miami, Florida, USA (presentation [pdf] ).
 January 2006
 8th Workshop on Algorithm Engineering and Experiments. Miami, Florida, USA.
 October 2005
 13th Annual European Symposium on Algorithms (ALGO 2005). Palma de Mallorca, Mallorca, Spain.
 MayJune 2005
 Algorithms and Data Structures. Bertinoro, Forlì, Italy (presentation [pdf] ).
 January 2005
 16th Annual ACMSIAM Symposium on Discrete Algorithms. Vancouer, British Columbia, Canada.
 September 2004
 12th Annual European Symposium on Algorithms (ALGO 2004). Bergen, Norway.
 July 2004
 Dagstuhl Seminar on ``CacheOblivious and CacheAware Algorithms''. Dagstuhl, Germany.
 July 2004
 9th Scandinavian Workshop on Algorithm Theory. Louisiana Museum of Modern Art, Humlebæk, Denmark (invited speaker, presentation [pdf] ).
 January 2004
 6th Workshop on Algorithm Engineering and Experiments. New Orleans, Louisiana, USA (presentation [pdf] ).
 January 2004
 15th Annual ACMSIAM Symposium on Discrete Algorithms. New Orleans, Louisana, USA.
 June 2003
 Algorithms and Data Structures. Bertinoro, Forlì, Italy (presentation [pdf] ).
 January 2003
 5th Workshop on Algorithm Engineering and Experiments. Baltimore, Maryland, USA.
 January 2003
 14th Annual ACMSIAM Symposium on Discrete Algorithms. Baltimore, Maryland, USA (presentation [pdf] ).
 November 2002
 13th Annual International Symposium on Algorithms and Computation. Vancouver, British Columbia, Canada (presentation [pdf] ).
 November 2002
 43rd Annual Symposium on Foundations of Computer Science. Vancouver, British Columbia, Canada.
 November 2002
 Workshop on Algorithms and Models for the WebGraph. Vancouver, British Columbia, Canada.
 May 2002
 34th Annual ACM Symposium on Theory of Computing. Montréal, Québec, Canada.
 August 2001
 ALGO 2001 (9th Annual European Symposium on Algorithms, 5th Workshop on Algorithm Engineering, and 1st Workshop on Algorithms in BioInformatics). Aarhus, Denmark.
 July 2001
 33rd Annual ACM Symposium on Theory of Computing. Hersonissos, Crete, Greece (presentation [pdf] ).
 July 2001
 28th International Colloquium on Automata, Languages, and Programming. Hersonissos, Crete, Greece.
 September 2000
 AlcomFT Meeting. Saarbrücken, Germany.
 July 2000
 7th Scandinavian Workshop on Algorithm Theory. Bergen, Norway.
 September 2000
 Dagstuhl Seminar on ``Experimental Algorithmics''. Dagstuhl, Germany.
 December 1999
 19th Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Chennai, India.
 December 1999
 Workshop on Advances in Data Structures, preworkshop of the 19th Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Chennai, India (invited speaker, presentation [pdf] ).
 January 1999
 10th Annual ACMSIAM Symposium on Discrete Algorithms. Baltimore, Maryland, USA.
 January 1999
 1st Workshop on Algorithm Engineering and Experimentation. Baltimore, Maryland, USA.
 July 1998
 6th Scandinavian Workshop on Algorithm Theory. Stockholm, Sweden (presentation [pdf; pdf] ).
 May 1998
 DIMACS Workshop on External Memory Algorithms and Visualization. Piscataway, New Jersey, USA.
 January 1998
 9th Annual ACMSIAM Symposium on Discrete Algorithms. San Francisko, California, USA (presentation [pdf] ).
 January 1998
 ALCOMIT Review Meeting. Saarbrücken, Germany.
 September 1997
 11th International Workshop on Distributed Algorithms. Saarbrücken, Germany.
 September 1997
 International School On Distributed Computing and Systems  ALCOMIT SODICS. Saarbrücken, Germany.
 May 1997
 Algorithms for Future Technologies  ALTEC'97. Saarbrücken, Germany.
 FebruaryMarch 1997
 14th Annual Symposium on Theoretical Aspects of Computer Science. Lübeck, Germany (presentation [pdf] ).
 July 1996
 5th Scandinavian Workshop on Algorithm Theory. Reykjavik, Iceland (presentation [pdf; pdf] ).
 January 1996
 7th Annual ACMSIAM Symposium on Discrete Algorithms. Atlanta, Georgia, USA (presentation [pdf] ).
 August 1995
 4th International Workshop on Algorithms and Data Structures. Kingston, Ontario, Canada (presentation [pdf] ).
 March 1995
 12th Annual Symposium on Theoretical Aspects of Computer Science. München, Germany.
 September 1994
 2nd Annual European Symposium on Algorithms. Utrecht, The Netherlands.
 August 1994
 Complexity Theory: Present and Future. Aarhus, Denmark.
 July 1994
 4th Scandinavian Workshop on Algorithm Theory. Aarhus, Denmark.
 SeptemberOctober 1993
 1st Annual European Symposium on Algorithms. Bad Honnef, Germany.
Talks
 August 2017
 An Optimal and Practical CacheOblivious Algorithm for Computer Multiresolution Rasters. Lecture for new computer science students. Aarhus, Denmark. [pdf, pptx]
 February 2017
 Pong  The Multiplayer Game. Verdens Kedeligste Foredrag (The World's Most Boring Lecture). Tågekammeret, Aarhus Universitet. Aarhus.
 March 2016
 External Memory ThreeSided Range Reporting and Top Queries with Sublogarithmic Updates. Dagstuhl Seminar on ``Data Structures and Advanced Models of Computation on Big Data''. Dagstuhl, Germany. [pdf, pptx]
 February 2016
 Professor inauguration talk: Data Structures and Models of Computation. Department of Computer Science, Aarhus University. Aarhus, Denmark. [pdf, pptx]
 November 2015
 External Memory ThreeSided Range Reporting and Topk Queries with Sublogarithmic Updates. Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Odense, Denmark. [pdf, pptx]
 November 2015
 External Memory ThreeSided Range Reporting and Topk Queries with Sublogarithmic Updates. MADALGO, Department of Computer Science, Aarhus University. Aarhus, Denmark. [pdf, pptx]
 August 2015
 Blackboard Introduction to TAs @ CS. Department of Computer Science, Aarhus University. Aarhus, Denmark. [pdf, pptx]
 August 2015
 Håndtering af øvelseshold og gruppeafleveringer. Blackboard Brugermøe @ ST. Aarhus Universitet. Aarhus, Denmark. [pdf, pptx]
 March 2015
 Prime Time. Verdens Kedeligste Foredrag (The World's Most Boring Lecture). Tågekammeret, Aarhus Universitet. Aarhus. [pdf]
 November 2014
 The Algorithms and Data Strutures Group at Aarhus University. Department of Computer Science, Aarhus University. Aarhus, Denmark. [pdf, pptx]
 September 2014
 Computing Triplet and Quartet Distances Between Trees. Computer Science Institute, Charles University. Prague, Czech Republic. [pdf, pptx]
 September 2014
 Simplicity in Computational Geometry  Sven Skyum's Algorithm for Computing the Smallest Enclosing Circle. Sven Skyum  farewell celebration. Department of Computer Science, Aarhus, Denmark. [pdf, pptx]
 August 2014
 Voronoi Diagrammer. Lecture for new computer science students. Aarhus, Denmark. [pdf, pptx]
 April 2014
 Sorting Integers in the RAM Model. Annual MADALGO Review Meeting. Aarhus, Denmark. [pdf, pptx]
 April 2014
 Algoritmer. Master Class in Mathematics, Aarhus University. Aarhus, Denmark. [pdf, pptx]
 April 2014
 Writing and Defending your Thesis. PhD retreat, Department of Computer Science, Aarhus University. Aarhus, Denmark. [pdf, pptx]
 February 2014
 Range Minimum Queries (Part II). Dagstuhl Seminar on ``Data Structures and Advanced Models of Computation on Big Data''. Dagstuhl, Germany. [pdf, pptx]
 January 2014
 Computing Triplet and Quartet Distances Between Trees. Department of Computer Science, University of Copenhagen. Copenhagen, Denmark. [pdf, pptx]
 October 2013
 The Encoding Complexity of Two Dimensional Range Minimum Data Structures. MADALGO, Department of Computer Science, Aarhus University. Aarhus, Denmark. [pdf, pptx]
 August 2013
 Voronoi Diagrammer. Lecture for new computer science students. Aarhus, Denmark. [pdf, pptx]
 May 2013
 Algorithms and Data Structures. Computer Science Day. Department of Computer Science, Aarhus University. Aarhus. [pdf, pptx]
 April 2013
 Algoritmer. Master Class in Mathematics, Aarhus University. Aarhus, Denmark. [pdf, pptx]
 FebruaryMarch 2013
 Algoritmer. udays, Aarhus University. Aarhus, Denmark. [pdf, pptx]
 December 2012
 Julehjerter. Open Space Aarhus. Aarhus, Denmark. [pdf, pptx]
 November 2012
 Triplet and Quartet Distances Between Trees of Arbitrary Degree. ETH Zürich. Zürich, Switzerland. [pdf, pptx]
 May 2012
 Algorithms and Data Structures  Strict Fibonacci Heaps. Computer Science Day. Department of Computer Science, Aarhus University. Aarhus. [pdf, pptx]
 February 2012
 Clossing a Classical Data Structure Problem: Strict Fibonacci Heaps. Annual MADALGO Review Meeting. Aarhus, Denmark. [pdf, pptx]
 November 2011
 Dynamic Planar Range Maxima Queries. LIAFA, Université Paris Diderot, Paris. Paris, France. [pdf, pptx]
 October 2011
 Integer Representations towards Efficient Counting in the Bit Probe Model. University of Ljubljana. Ljubljana, Slovenia. [pdf, pptx]
 October 2011
 Dynamic Planar Range Maxima Queries. University of Primorska. Koper, Slovenia. [pdf, pptx]
 August 2011
 Sådan virker Google. Ungdommens Naturvidenskabelige Forening i Aarhus (UNF). Aarhus Universitet. Aarhus, Denmark. [pdf, pptx]
 June 2011
 Integer Representations towards Efficient Counting in the Bit Probe Model. MADALGO, Department of Computer Science, Aarhus University. Aarhus, Denmark. [pdf, pptx]
 April 2011
 Sådan virker Google. Ungdommens Naturvidenskabelige Forening i København (UNF). IT Universitet. København, Denmark. [pdf, pptx]
 March 2011
 Binære Tællere. Verdens Kedeligste Foredrag (The World's Most Boring Lecture). Tågekammeret, Aarhus Universitet. Aarhus. [pdf, pptx]
 November 2010
 Udfordringer ved håndtering af massive datamængder: Forskingen ved Grundforskningscenteret for Massive Data Algortihmics Data Algorithmics. Møde i UniversitetsSamvirket Århus. Aarhus Universitet. Statsbiblioteket, Århus. [pdf, pptx]
 November 2010
 Massive Data Algorithmics. Forskningsdag for Datamatikerlærere. Erhvervsakademiet Lillebælt. Vejle. [pdf, pptx]
 October 2010
 External Memory Indexing Structures. Dansk Selskab for Datalogi. Copenhagen Business School. Frederiksbjerg. [pdf, pptx]
 FebruaryMarch 2010
 TimeSpace TradeOffs for 2D Range Minimum Queries. Dagstuhl Seminar on ``Data Structures''. Dagstuhl, Germany. [pdf, pptx]
 October 2009
 Algorithms: Matrices and Graphs. MasterClass in Mathematics. ScienceTalenter. Mærsk McKinney Møller Videncenter, Sorø, Denmark. [pdf, pptx]
 September 2009
 Internetsøgemaskiner. Ungdommens Naturvidenskabelige Forening i Aalborg (UNF). Aalborg Universitet. Ålborg, Denmark. [pdf]
 September 2009
 MADALGO. MasterClass Teacher Meeting. ScienceCenter. Mærsk McKinney Møller Videncenter, Sorø, Denmark. [pdf, pptx]
 June 2008
 Algorithms and Data Structures for Faulty Memory. Computer Science Day. Department of Computer Science, Aarhus University. Aarhus. [pdf, pptx]
 January 2008
 Massive Data Algorithmics. Danske Bank, Faglig Dag. Danske Bank. Aarhus. [pdf, ppt]
 May 2007
 CacheOblivious and External Memory Algorithms: Theory and Experiments. Oberwolfach Seminar on ``Algorithm Engineering''. Oberwolfach, Germany. [pdf, ppt]
 February 2007
 Internetsøgemaskiner. Ungdommens Naturvidenskabelige Forening i Ålborg (UNF). Aalborg Universitet. Ålborg, Denmark. [pdf]
 October 2006
 Skewed Binary Search Trees. Department of Computer Science, University of Copenhagen. Copenhagen, Denmark. [pdf]
 FebruaryMarch 2006
 Skewed Binary Search Trees. Dagstuhl Seminar on ``Data Structures''. Dagstuhl, Germany. [pdf]
 December 2004
 Internetsøgemaskiner. Ungdommens Naturvidenskabelige Forening i Aarhus (UNF). Aarhus Universitet. Aarhus, Denmark. [pdf]
 November 2004
 Søgemaskiner. Udviklerkonference. Danske Bank. Brabrand, Denmark. [pdf]
 May 2004
 Algorithms and Data Structures for Hierarchical Memory. Opfølgningsmøde med Danmarks Grundforskningsfond. BRICS, Department of Computer Science, Aarhus University. [pdf]
 April 2003
 Cache Oblivious Searching and Sorting. IT University of Copbenhagen. Copenhagen, Denmark. [pdf]
 January 2003
 Søgemaskiner på Internettet (with Rolf Fagerberg). Datalogforeningen. Department of Computer Science, Aarhus University. [pdf]
 October 2002
 BRICS Research Activities  Algorithms. BRICS Retreat. Sandbjerg, Denmark. [pdf]
 FebruaryMarch 2002
 Optimal Finger Search Trees in the Pointer Machine. Dagstuhl Seminar on ``Data Structures''. Dagstuhl, Germany. [pdf]
 October 2001
 Cache Oblivious Search Trees via Trees of Small Height. Computer Technology Institute. Patras, Greece. [pdf]
 September 2001
 Cache Oblivious Search Trees via Trees of Small Height. ALCOMFT Annual Review Meeting. Rome, Italy. [pdf]
 January 2001
 Udvikling og Implementering af Ombrydningsalgoritmer  Et projekt med CCI Europe. Opfølgningsmøde med Danmarks Grundforskningsfond. BRICS, Department of Computer Science, Aarhus University. [pdf]
 November 2000
 Optimal Static RangeReporting in One Dimension. BRICS, Department of Computer Science, Aarhus University. Aarhus, Denmark. [pdf]
 October 2000
 BRICS Research Activities  Algorithms. BRICS Retreat. Sandbjerg, Denmark. [pdf]
 FebruaryMarch 2000
 Dynamic Convex Hull. Dagstuhl Seminar on ``Data Structures''. Dagstuhl, Germany. [pdf]
 January 1999
 LevelBalanced BTrees. Department of Computer Science, Duke University. Durham, North Carolina. [pdf]
 August 1998
 LevelRebuilt BTrees. Theory and Practice of Algorithms for Problems Involving Massive Data Sets. BRICS, Department of Computer Science, Aarhus University. [pdf]
 March 1998
 WorstCase Efficient ExternalMemory Priority Queues. Dagstuhl Seminar on ``Data Structures''. Dagstuhl, Germany. [pdf]
 November 1997
 Finger Search Trees with Constant Insertion Time. Instituto di Elaborazione della Informazione, CNR, Pisa. Pisa, Italy. [pdf]
 August 1997
 Finger Search Trees with Constant Insertion Time. Oberwolfach Seminar on ``Effiziente Algoritmen''. Oberwolfach, Germany. [pdf]
 February 1997
 Predecessor Queries in Dynamic Integer Sets. MaxPlanckInstitut für Informatik. Saarbrücken, Germany.
 September 1996
 Approximate dictionary queries. BRICS, Department of Computer Science, Aarhus University. Aarhus, Denmark.
 September 1996
 Predecessor Queries in Dynamic Integer Sets. BRICS, Department of Computer Science, Aarhus University. Aarhus, Denmark.
 March 1996
 Priority Queues on Parallel Machines. BRICS, Department of Computer Science, Aarhus University. Aarhus, Denmark. [pdf]
 FebruaryMarch 1996
 Priority Queues on Parallel Machines. Dagstuhl Seminar on ``Data Structures''. Dagstuhl, Germany. [pdf]
 September 1995
 Fast Meldable Priority Queues. MaxPlanckInstitut für Informatik. Saarbrücken, Germany. [pdf]
 August 1995
 Priority Queues with Good Worst Case Performance. Toronto University. Toronto, Ontario, Canada. [pdf]
 May 1994
 Finger Search Trees. BRICS Strategy Workshop. BRICS, Department of Computer Science, Aarhus University. Hjarnø, Denmark. [pdf]
Scientific Visits
 June 2013
 Riko Jacob, ETH Zürich. Zürich, Switzerland.
 November 2012
 Riko Jacob, ETH Zürich. Zürich, Switzerland.
 November 2011
 Andy Brodknik, University of Primorska & University of Ljubljana. Koper & Ljubljana, Slovenia.
 November 2009
 Riko Jacob, Technische Universität München. Munich, Germany.
 May 2002
 Michiel Smid, School of Computer Science, Carleton University. Ottawa, Ontario, Canada.
 October 2001
 Athanasios K. Tsakalidis, Computer Technology Institute. Patras, Greece.
 January 1999
 Lars Arge, Department of Computer Science, Duke University. Durham, North Carolina, USA.
 January 1999
 Jyrki Katajainen, Department of Computer Science, University of Copenhagen. Copenhagen, Denmark.
 May 1998
 Ian Munro, Department of Computer Science, University of Waterloo. Waterloo, Ontario, Canada.
 May 1998
 Lars Arge, Department of Computer Science, Duke University. Durham, North Carolina, USA.
 November 1997
 M. Cristina Pinotti, Instituto di Elaborazione della Informazione, CNR, Pisa. Pisa, Italy.
 January 1996
 Haim Kaplan, Princeton University/DIMACS. Princeton, NJ, USA.
 September 1995May 1996
 Kurt Mehlhorn, MaxPlanckInstitut für Informatik. Saarbrücken, Germany.
 August 1995
 Peter Bro Miltersen, Toronto University. Toronto, Ontario, Canada.
Teaching
 October 2017
 Lecturer, Lecture and exercise class on algorithms at the IT Camp 2017 (woman in CS initiative). Department of Computer Science, Aarhus University.
 October 2017
 Lecturer, Lecture on algorithms for highschool students (Studiepraktik). Department of Computer Science, Aarhus University.
 Fall 2016
 Lecturer, Computer Science in Perspective (topic Classic Algoritms, and Internet Algorithms, 2 weeks). Department of Computer Science, Aarhus University.
 Spring 2016 (Quarter 4)
 Lecturer, Algorithms and Data Structures 2. Department of Computer Science, Aarhus University.
 Spring 2016 (Quarter 3)
 Lecturer, Algorithm Engineering. Department of Computer Science, Aarhus University.
 Spring 2016 (Quarter 3)
 Lecturer, Algorithms and Data Structures 1. Department of Computer Science, Aarhus University.
 Fall 2015
 Lecturer, Computer Science in Perspective (topic Classic Algoritms, and Internet Algorithms, 2 weeks). Department of Computer Science, Aarhus University.
 Fall 2015 (Quarters 1+2)
 Lecturer, Advanced Algorithms: Data Structures. Department of Computer Science, Aarhus University.
 Spring 2015 (Quarter 4)
 Lecturer, Algorithms and Data Structures 2. Department of Computer Science, Aarhus University.
 Spring 2015 (Quarter 3)
 Lecturer, Algorithm Engineering. Department of Computer Science, Aarhus University.
 Spring 2015 (Quarter 3)
 Lecturer, Algorithms and Data Structures 1. Department of Computer Science, Aarhus University.
 October 2014
 Lecturer, Exercise class on algorithms for highschool students (Gymnasiepraktik). Department of Computer Science, Aarhus University.
 Fall 2014
 Lecturer, Computer Science in Perspective (topic Classic Algoritms, and Internet Algorithms, 2 weeks). Department of Computer Science, Aarhus University.
 Spring 2014 (Quarter 4)
 Lecturer, Algorithms and Data Structures 2. Department of Computer Science, Aarhus University.
 Spring 2014 (Quarter 3)
 Lecturer, Algorithm Engineering. Department of Computer Science, Aarhus University.
 Spring 2014 (Quarter 3)
 Lecturer, Algorithms and Data Structures 1. Department of Computer Science, Aarhus University.
 Fall 2013 (Quarters 1+2)
 Lecturer, Advanced Algorithms: Data Structures. Department of Computer Science, Aarhus University.
 October 2013
 Lecturer, Exercise class on algorithms for highschool students (Gymnasiepraktik). Department of Computer Science, Aarhus University.
 October 2013
 Lecturer, Exercise class on algorithms at the IT Camp 2013 (woman in CS initiative). Department of Computer Science, Aarhus University.
 Fall 2013
 Lecturer, Computer Science in Perspective (topic Algoritms and Complexity, and Internet Algorithms, 2 weeks). Department of Computer Science, Aarhus University.
 Spring 2013 (Quarter 4)
 Lecturer, Algorithms and Data Structures 2. Department of Computer Science, Aarhus University.
 Spring 2013 (Quarter 3)
 Lecturer, Algorithm Engineering. Department of Computer Science, Aarhus University.
 Spring 2013 (Quarter 3)
 Lecturer, Algorithms and Data Structures 1. Department of Computer Science, Aarhus University.
 October 2012
 Lecturer, Exercise class on algorithms for highschool students (Gymnasiepraktik). Department of Computer Science, Aarhus University.
 October 2012
 Lecturer, Exercise class on algorithms at the IT Camp 2012 (woman in CS initiative). Department of Computer Science, Aarhus University.
 Fall 2012
 Lecturer, Computer Science in Perspective (topic Algoritms and Complexity, and Internet Algorithms, 2 weeks). Department of Computer Science, Aarhus University.
 May 2012
 Lecturer, Lecture on Google and exercises on algorithms for highschool students (from Silkeborg Gymnasium and Rødkilde Gymnasium, Vejle). Department of Computer Science, Aarhus University.
 Spring 2012 (Quarter 4)
 Lecturer, Algorithms and Data Structures 2. Department of Computer Science, Aarhus University.
 Spring 2012 (Quarter 3)
 Lecturer, Algorithms and Data Structures 1. Department of Computer Science, Aarhus University.
 October 2011
 Lecturer, Exercise class on algorithms for highschool students (Gymnasiepraktik). Department of Computer Science, Aarhus University.
 Fall 2011
 Lecturer, Computer Science in Perspective (topic Algoritms and Complexity, 1 week). Department of Computer Science, Aarhus University.
 Fall 2011 (Quarters 1+2)
 Lecturer, Advanced Algorithms: Data Structures. Department of Computer Science, Aarhus University.
 Spring 2011 (Quarter 4)
 Lecturer, Algorithms and Data Structures 2. Department of Computer Science, Aarhus University.
 Spring 2011 (Quarter 3)
 Lecturer, Algorithms and Data Structures 1. Department of Computer Science, Aarhus University.
 October 2010
 Lecturer, Exercise class on algorithms for highschool students (Gymnasiepraktik). Department of Computer Science, Aarhus University.
 Fall 2010 (Quarters 1+2)
 Lecturer, Computational Geometry. Department of Computer Science, Aarhus University.
 Fall 2010
 Lecturer, Computer Science in Perspective (topic Algoritms and Complexity, 1 week). Department of Computer Science, Aarhus University.
 Spring 2010 (Quarter 4)
 Lecturer, Algorithms and Data Structures 2. Department of Computer Science, Aarhus University.
 Spring 2010 (Quarter 3)
 Lecturer, Algorithms and Data Structures 1. Department of Computer Science, Aarhus University.
 October 2009
 Lecturer, Exercise class on algorithms for highschool students (Gymnasiepraktik). Department of Computer Science, Aarhus University.
 Fall 2009 (Quarters 1+2)
 Lecturer, Advanced Algorithms: Data Structures. Department of Computer Science, Aarhus University.
 Fall 2009
 Lecturer, Computer Science in Perspective (topic Algoritms and Complexity, 1 week). Department of Computer Science, Aarhus University.
 Spring 2009 (Quarter 4)
 Lecturer, Algorithms and Data Structures 2. Department of Computer Science, Aarhus University.
 Spring 2009 (Quarter 3)
 Lecturer, Algorithms and Data Structures 1. Department of Computer Science, Aarhus University.
 October 2008
 Lecturer, Exercise class on algorithms for highschool students (Gymnasiepraktik). Department of Computer Science, Aarhus University.
 Fall 2008 (Quarters 1+2)
 Lecturer, Computational Geometry. Department of Computer Science, Aarhus University.
 Fall 2008
 Lecturer, Computer Science in Perspective (topic Algoritms and Complexity, 1 week). Department of Computer Science, Aarhus University.
 Spring 2008 (Quarter 4)
 Lecturer, Algorithms and Data Structures 2. Department of Computer Science, Aarhus University.
 Spring 2008 (Quarter 3)
 Lecturer, Algorithms and Data Structures 1. Department of Computer Science, Aarhus University.
 November 2007
 Lecturer, Exercise class on algorithms for highschool students (Gymnasiepraktik). Department of Computer Science, Aarhus University.
 Fall 2007
 Lecturer, Computer Science in Perspective (topic Algoritms and Complexity, 1 week). Department of Computer Science, Aarhus University.
 Fall 2007 (Quarters 1+2)
 Lecturer, Advanced Algorithms: Data Structures. Department of Computer Science, Aarhus University.
 Spring 2007 (Quarter 4)
 Lecturer, Algorithms and Data Structures 2. Department of Computer Science, Aarhus University.
 Spring 2007 (Quarter 3)
 Lecturer, Algorithms and Data Structures 1. Department of Computer Science, Aarhus University.
 November 2006
 Lecturer, Exercise class on algorithms for highschool students (Gymnasiepraktik). Department of Computer Science, Aarhus University.
 Fall 2006 (Quarters 1+2)
 Lecturer, Computational Geometry (with Lars Arge). Department of Computer Science, Aarhus University.
 Fall 2006
 Lecturer, Computer Science in Perspective (topic Algoritms and Complexity, 1 week). Department of Computer Science, Aarhus University.
 Spring 2006 (Quarter 4)
 Lecturer, Algorithms and Data Structures 2. Department of Computer Science, Aarhus University.
 Spring 2006 (Quarter 3)
 Lecturer, Algorithms and Data Structures 1. Department of Computer Science, Aarhus University.
 November 2005
 Lecturer, Exercise class on algorithms for highschool students (Gymnasiepraktik). Department of Computer Science, Aarhus University.
 Fall 2005 (Quarter 1+2)
 Lecturer, Advanced Algorithms: Data Structures (with Lars Arge). Department of Computer Science, Aarhus University.
 Fall 2005
 Lecturer, Computer Science in Perspective (topic Algoritms and Complexity, 1 week). Department of Computer Science, Aarhus University.
 Spring 2005 (Quarter 4)
 Lecturer, Algorithms and Data Structures 2. Department of Computer Science, Aarhus University.
 Spring 2005 (Quarter 3)
 Lecturer, Algorithms and Data Structures 1. Department of Computer Science, Aarhus University.
 February 2005
 Lecturer, Exercise class on algorithms for highschool students (Gymnasiepraktik). Department of Computer Science, Aarhus University.
 Fall 2004
 Lecturer, Computer Science in Perspective (topic Algoritms and Complexity, 1 week). Department of Computer Science, Aarhus University.
 Fall 2004 (Quarter 1+2)
 Lecturer, Computational Geometry (with Lars Arge). Department of Computer Science, Aarhus University.
 Spring 2004 (Quarter 4)
 Lecturer, Algorithms and Data Structures 2. Department of Computer Science, Aarhus University.
 Spring 2004 (Quarter 3)
 Lecturer, Algorithms and Data Structures 1. Department of Computer Science, Aarhus University.
 Autumn 2003
 Lecturer, External Memory Algorithms and Data Structures (with Rolf Fagerberg). Department of Computer Science, Aarhus University.
 Spring 2003
 Lecturer, Algorithms and Data Structures (with Erik Meineche Schmidt). Department of Computer Science, Aarhus University.
 Autumn 2002
 Lecturer, Algorithms and Data Structures (with Rolf Fagerberg). Department of Computer Science, Aarhus University.
 Autumn 2002
 Lecturer, Algorithms for Web Indexing and Searching (with Rolf Fagerberg). Department of Computer Science, Aarhus University.
 Spring 2002
 Lecturer, Algorithms and Data Structures (with Erik Meineche Schmidt). Department of Computer Science, Aarhus University.
 Autumn 2001
 Lecturer, External Memory Algorithms and Data Structures (with Rolf Fagerberg). Department of Computer Science, Aarhus University.
 Spring 2001
 Three lectures on I/Oalgorithms, Advanced Algorithms (Stephen Alstrup and Theis Rauhe). IT University of Copbenhagen.
 Spring 2001
 Lecturer, Algorithms study group. BRICS International PhD School, Department of Computer Science, Aarhus University.
 Autumn 2000
 Lecturer, External Memory Algorithms and Data Structures (with Rolf Fagerberg). Department of Computer Science, Aarhus University.
 Autumn 1999
 Lecturer, External Memory Algorithms and Data Structures (with Rolf Fagerberg). Department of Computer Science, Aarhus University.
 Autumn 1999
 Lecturer, Algorithms (with Rolf Fagerberg). BRICS International PhD School, Department of Computer Science, Aarhus University.
 Autumn 1998
 Lecturer, Algorithms. BRICS International PhD School, Department of Computer Science, Aarhus University.
 May 1998
 Lecturer, MPII Advanced Mini Course: Functional Data Structures. MaxPlanckInstitut für Informatik.
 Autumn 1996
 Lecturer, Algorithms and Data Structures: A course for students at the Engineering College of Aarhus. Department of Computer Science, Aarhus University.
 Spring 1995
 Administrator and Teaching Assistant (Instruktor), dADS: Algorithms and Data Structures. Department of Computer Science, Aarhus University.
 Spring 1994
 Teaching Assistant (Instruktor), dAlg: Algorithmic. Department of Computer Science, Aarhus University.
 Autumn 1993
 Teaching Assistant (Instruktor), 2 classes, dOvs: Compiler Construction. Department of Computer Science, Aarhus University.
 Spring 1993
 Teaching Assistant (Instruktor), dAlg: Algorithmic. Department of Computer Science, Aarhus University.
 Autumn 1992
 Teaching Assistant (Instruktor), dProg2: Object Oriented Programming. Department of Computer Science, Aarhus University.
Advising
PhD
 August 2014present
 PhD advisor for Konstantinos Mampentzidis.
 April 2014present
 PhD advisor for Edvin Berglin.
 April 2014September 2017
 PhD coadvisor for Ingo van Duijn.
 February 2011September 2015
 PhD advisor for Jesper Sindahl Nielsen. Thesis: Implicit Data Structures, Sorting, and Text Indexing (slides).
 February 2009November 2013
 PhD advisor for Casper KejlbergRasmussen (Danske Commodities). Thesis: Dynamic Data Structures: The Interplay of Invariants and Algorithm Design (slides).
 August 2008January 2015
 PhD advisor for Jakob Truelsen (SCALGO). Thesis: Space Efficient Data Structures and External Terrain Algorithms (slides).
 May 2008July 2011
 PhD advisor for Pooya Davoodi (Polytechnic Institute of New York University). Thesis: Data Structures: Range Queries and Space Efficiency (slides).
 February 2008January 2013
 PhD advisor for Mark Greve (discontinued) (Octoshape). Thesis: Online Sorted Range Reporting and Approximating the Mode (Progress report).
 August 2007September 2011
 PhD advisor for Kostantinos Tsakalidis (The Chinese University of Hong Kong). Thesis: Dynamic Data Structures: Orthogonal Range Queries and Update Efficiency (slides).
 February 2006February 2010
 PhD advisor for Allan Grønlund Jørgensen (Siemens Wind Power A/S). Thesis: Data Structures: Sequence Problems, Range Queries, and Fault Tolerance (slides).
 September 2005November 2009
 PhD advisor for Martin Olsen (Aarhus University, Institute of Business and Technology). Thesis: Link building (slides).
 August 2004October 2007
 PhD advisor for Johan Nilsson (Octoshape). Thesis: Combinatorial algorithms for graphs and partially ordered sets (slides).
 August 2003September 2007
 PhD advisor for Gabriel Moruz (Johann Wolfgang GoetherUniversität Frankfurt). Thesis: Hardware Aware Algorithms and Data Structures (slides).
 February 2001February 2002
 PhD advisor for Riko Jacob (Technische Universität München). Thesis: Dynamic Planar Convex Hull (slides).
MSc
 FebruaryJune 2016
 MSc advisor for Peter Gabrielsen og Christoffer Holbæk Hansen (formal advisor; project advisor Kasper Green Larsen). Thesis: Threesided Range Reporting in External Memory.
 FebruaryJune 2016
 MSc advisor for Jonas Nicolai Hovmand and Morten Houmøller Nygård (formal advisor; project advisor Kasper Green Larsen). Thesis: Estimating Frequencies and Finding Heavy Hitters.
 FebruaryJune 2016
 MSc advisor for Thor Bagge and Kent Grigo (formal advisor; project advisor Kasper Green Larsen). Thesis: Getting to Know the Captain's Mistress with Reinforcement Learning.
 FebruaryJune 2016
 MSc advisor for Troels Thorsen (formal advisor; project advisor Kasper Green Larsen). Thesis: Categorical Range Searching.
 FebruaryJune 2016
 MSc advisor for Kenn Daniel and Casper Fægemand. Thesis: Selection in a Heap.
 SeptemberDecember 2015
 MSc advisor for Jens Christan Christensen Jensen. Thesis: Event Detection in Soccer using SpatioTemporal Data.
 September 2015January 2016
 MSc advisor for Henrik Knakkegaard Christensen. Thesis: Algorithms for Finding Dominators in Directed Graphs.
 September 2015January 2016
 MSc advisor for Jakob Peter Landbo and Casper Green (formal advisor; project advisor Kasper Green Larsen). Thesis: Range Mode Queries in Arrays.
 FebruaryJuly 2015
 MSc advisor for Simon Nordved Madsen and Rasmus HallenbergLarsen (formal advisor; project advisor Peyman Afshani). Thesis: Computing Set Operations on Simple Polygons Using Binary Space Partition Trees.
 FebruaryJune 2015
 MSc advisor for Mathies Boile Christensen and Thomas Sandholt (formal advisor; project advisor Peyman Afshani). Thesis: Geometric Measures of Depth.
 FebruaryAugust 2015
 MSc advisor for Lukas Walther (formal advisor; project advisor Peyman Afshani). Thesis: Intersection of Convex Objects in the Plane.
 FebruaryJune 2015
 MSc advisor for Anders StrandHolm Vinther and Magnus StrandHolm Vinther (formal advisor; project advisor Peyman Afshani). Thesis: Pathfinding in Twodimensional Worlds.
 FebruaryJune 2015
 MSc advisor for Mads Ravn (formal advisor; project advisor Kasper Green Larsen). Thesis: Orthogonal Range Searching in 2D with Ball Inheritance.
 December 2014June 2015
 MSc advisor for Jan Hessellund Knudsen and Roland Larsen Pedersen. Thesis: Engineering Rank and Select Queries on Wavelet Trees.
 November 2014April 2015
 MSc advisor for Kris Vestergaard Ebbesen. Thesis: On the Practicality of DataOblivious Sorting.
 August 2014February 2015
 MSc advisor for Bo Mortensen (project advisor Peyman Afshani). Thesis: Algorithms for Computing Convex Hulls Using Linear Programming.
 May 2014March 2015
 MSc advisor for Claus Jespersen. Thesis: Monte Carlo Evaluation of Financial Options Using a GPU.
 May 2013June 2014
 MSc advisor for Daniel Winther Petersen (Nykredit). Thesis: Orthogonal Range Skyline Counting Queries.
 April 2013April 2014
 MSc advisor for Jana Kunert. Thesis: Hashing and Random Graphs.
 May 2013January 2014
 MSc advisor for Jakob Mark Friis (Lind Capital) and Steffen Beier Olesen (Lind Capital). Thesis: An Experimental Comparison of Max Flow Algorithms.
 November 2012August 2013
 MSc advisor for Jørgen Fogh. Thesis: Engineering a Fast Fourier Transform.
 October 2012June 2013
 MSc advisor for Morten Holt and Jens Johansen (thesis awarded the best Danish MSc thesis in Computer Science in 2013, by the Danish Society for Computer Science). Thesis: Computing Triplet and Quartet Distances.
 August 2012October 2013
 MSc advisor for Jeppe Schou. Thesis: Range Minimum Data Structures.
 April 2012January 2015
 MSc advisor for Mikkel Engelbrecht Hougaard. Thesis: On the Complexity of RedBlack Trees for Higher Dimensions.
 September 2011March 2012
 MSc advisor for Andreas KoefoedHansen (Aarhus University). Thesis: Representations for Path Finding in Planar Environments.
 FebruarySeptember 2010
 MSc advisor for David Kjær (Milestone Systems). Thesis: Range Median Algorithms.
 September 2009September 2010
 MSc advisor (joint with Mohammad Ali Abam) for Jonas Suhr Christensen. Thesis: Experimental Study of Kinetic Geometric Spanner Algorithms.
 April 2008April 2009
 MSc advisor for Henrik Bitsch Kirk (Statsbiblioteket). Thesis: Searching with Dynamic Optimality: In Theory and Practice.
 January 2008February 2009
 MSc advisor for Krzysztof Piatkowski (Peopleway). Thesis: Implementering og udvikling af maksimum delsum algoritmer.
 FebruaryDecember 2008
 MSc advisor for Claus Andersen (Translucent). Thesis: An optimal minimum spanning tree algorithm.
 September 2007March 2008
 MSc advisor for Jonas Maturana Larsen (Trifork) and Michael Nielsen (Plushost). Thesis: En undersøgelse af algoritmer til løsning af generalized movers problem i 3D.
 September 2006August 2007
 MSc advisor for Thomas Rasmussen. Thesis: Evaluering af en skæringsalgoritme for Bezier kurver i planen.
 September 2006March 2007
 MSc advisor for Bjørn Casper Torndahl and Bo Søndergaard Carstensen. Thesis: Cache Oblivious String Dictionaries.
 March 2006August 2007
 MSc advisor for Lasse Østerlund Gram (Marcantec). Thesis: Robusthed af netværk  med focus på scalefree grafer.
 July 2005January 2007
 MSc advisor for Kristian DorphPetersen (Danske Bank). Thesis: Praktisk brug af dynamisk sampling i data streams.
 February 2005June 2006
 MSc advisor for Dennis Søgaard (Accenture). Thesis: Minimising the Number of Collision Tests in Probabilistic Road Maps using Approximations in a Binary Connection Strategy.
 January 2005January 2006
 MSc advisor for Jesper Buch Hansen (Danske Bank). Thesis: Computing the Visibility Graph of Points Within a Polygon.
 February 2004May 2006
 MSc advisor for Morten Laustsen. Thesis: Orthogonal Range Counting in The Cache Oblivious Model.
 August 2002January 2004
 MSc advisor for Louise Skouboe Bjerg (Systematic Software Engineering A/S) and Lone Asferg Laursen. Thesis: Approksimative afstande i planare grafer.
 August 2002June 2003
 MSc advisor (joint with Rolf Fagerberg) for Kristoffer Vinther (Bang & Olufsen). Thesis: Engineering CacheOblivious Sorting Algorithms.
 February 2000January 2001
 MSc advisor for Kristian Høgsberg Kristensen (Intel). Thesis: Automated Layout of Classified Ads.
Other
 FebruarySeptember 2000
 Project advisor for Jakob Skyberg. Title: Implementation of three Convex Hull algorithms in Java.
Service
Department of Computer Science, Aarhus University
 August 2016
 Organizing chair of ALGO 2016 (319 participants) that covered the joinly conferences and workshops: ESA, WABI, IPEC, WAOA, ALGOCLOUD, ALGOSENSORS, ATMOS, MASSIVE.
 February 2015present
 Member of the study board of the Aarhus School of Science (ASOS), Aarhus University.
 September 2014present
 Chair of the departments education committee.
 October 2013present
 Member of the departments PostDoc committee.
 May 2013February 2016
 Member of the departments PhD committee.
 NovemberDecember 2009
 Chair of assessment committee for associate professor position.
 December 2008present
 Member of the departments officecommittee.
 June 2006
 Organizing chair of the Summer School on Game Theory in Computer Science.
 July 2003
 Member of the organizing committee of the 18th IEEE Conference on Computational Complexity.
 JuneJuly 2002
 Organizing chair of the EEF Summer School on Massive Data Sets (55 participants), BRICS, Aarhus University, Denmark.
 August 2001
 Organizing chair of ALGO 2001 (178 participants) that covered the joinly conferences and workshops: 9th Annual European Symposium on Algorithms, 5th Workshop on Algorithm Engineering, 1st Workshop on Algorithms in BioInformatics, and 2nd International Workshop on Approximation and Randomized Algorithms in Communication Networks.
 January 1999December 2005
 Coorganizer of the BRICS minicourses.
 February 2002November 2009
 Member of the departments webcommittee.
 May 1999May 2000
 Member of the departments webcommittee.
 August 1998present
 Coorganizer of the algorithms and complexity theory seminars.
To the profession
 May 2014present
 coEditorinChief Journal of Discrete Algorithms.
 April 2006March 2018
 Member of the Danish Censor list for Computer Science.
 April 2014March 2018
 Member of the Danish Censor list for Engineering (Mathematics, Physics, and Social Sciences).
 January 2007January 2016
 Member of the Steering Committee, Meeting on Algorithm Engineering and Experiments (ALENEX).
 April 2010December 2016
 Member of the Computer Science Group (Group 38) of the Danish Bibliometric Research Indicator, chair January 2014December 2016.
 January 2010present
 Member of the Scientific Advising Group for the ESS Data Management Centre.
 MarchOctober 2010
 Member of the Scientific Panel for eScience, the Danish National Roadmap for Research Infrastructures.
 September 2004September 2007
 Member of the Steering Committee, European Symposium on Algorithms (ESA).
 March 2006
 Responsible for the electronic submission server and the eletronic server for the program committee of the 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia.
 September 2000January 2004
 Responsible for the electronic server handling ALCOMFT technical reports.
 July 1999
 Coresponsible for the electronic submission server and the eletronic server for the program committee of the 3rd Workshop on Algorithm Engineering, London, UK.
 August 1997
 Editor of the Oberwolfach report ``Tagungsbericht 29/1997  Effiziente Algorithmen''.
MaxPlanckInstitut für Informatik
 August 1998
 Member of the organizing committee of the 2nd Workshop on Algorithm Engineering.
 JanuaryJuly 1998
 Member of the travel committee.
Examiner
 August 2016
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense, reexams BSc project/DM507/DM553/DM860/DM546 (14 students).
 August 2017
 Course examiner, Department of Computer Science, Aarhus University. Algorithmic Gems (2017 Q4, 5 ECTS) Kasper Green Larsen (2 students).
 June 2017
 MSc thesis examiner, Kristine Vitting Klinkby Knudsen, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Advisor Jørgen BangJensen.
 June 2017
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. DM553 Complexity and Computability (10 ECTS, 23 student) and DM508 Algorithms and Complexity (5 ECTS, 1 student), Jørgen BangJensen.
 June 2017
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Approximation Algorithms (IMADA DM833, 5 ECTS), Lene Monrad Favrholdt (1 student).
 June 2017
 Course examiner, Department of Computer Science, Aarhus University. Distribuerede systemer (2017 Q3+Q4, 5 ECTS) Claudio Orlandi (17 students).
 June 2017
 Bachelor project examiner, Department of Computer Science, Aalborg University. Stefan Schmid and KlausTycho Förster (7 students).
 June 2017
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Algorithms and Data Structures (IMADA DM507, 10 ECTS), Rolf Fagerberg (130 students).
 March 2017
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense, reexams DM543/DM557/VKDKME1v16/DM534/DM558 (9 students).
 January 2016
 Course examiner, Department of Computer Science, Aarhus University. Visualisering og projektkommunikation (2016 Q2, 5 ECTS) Majken Kirkegård Rasmussen (13 students).
 January 2017
 Course examiner, Department of Computer Science, Aarhus University. IO Algorithms (Q3+Q4 2016, 10 ECTS), Lars Arge (12 students).
 January 2017
 Course examiner, Department of Computer Science, Aarhus University. Programming 2 (dProg 2, Q2 2016, 5 ECTS, 40 students), Gudmund Skovbjerg Frandsen.
 October 2016
 Course examiner, Department of Computer Science, Aarhus University. Computability and Logic (14 students).
 August 2016
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense, reexams DM508/DM553/DM817/DM556 (9 students).
 June 2016
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. DM553 Complexity and Computability (10 ECTS, 21 students).
 June 2016
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Algorithms and Data Structures (IMADA DM507, 10 ECTS), Rolf Fagerberg (118 students).
 February 2016
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense, reexams DM557/IITS5El/VKDKME1, DM819, DM551, DM207, DM847 (14 students).
 January 2016
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. I/OEfficient Algoritms and Data Structures (IMADA DM207, 10 ECTS), Rolf Fagerberg (10 students).
 January 2016
 Course examiner, Department of Computer Science, Aarhus University. Computational Geometry (Q1+Q2 2015, 10 ECTS), Peyman Afshani (6 students).
 January 2016
 Course examiner, Department of Computer Science, Aarhus University. Programming 2 (dProg 2, Q2 2015, 5 ECTS), Gudmund Skovbjerg Frandsen.
 November 2015
 MSc thesis examiner, Michael Nørskov, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Advisor Jørgen BangJensen.
 August 2015
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Algorithms and Complexity (IMADA DM508, 5 ECTS), Joan Boyar and Bjarne Toft (1 student).
 August 2015
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Algorithms and Data Structures (IMADA DM507, 10 ECTS), Rolf Fagerberg (8 students).
 June 2015
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. DM538 Algorithms and Probability (5 ECTS, 1 student) Lene Monrad Favrholdt, DM553 Complexity and Computability (10 ECTS, 1 student) and DM508 Algorithms and Complexity (5 ECTS, 6 students) Joan Boyar.
 June 2015
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Algorithms and Data Structures (IMADA DM507, 10 ECTS), Rolf Fagerberg (106 students).
 March 2015
 Course examiner, Department of Computer Science, Aarhus University. Fysisk Design (2015 Q3, 5 ECTS), Peter Krogh (22 students).
 March 2015
 Course examiner, Department of Computer Science, Aarhus University. Visualisering og projektkommunikation (ITvap, 2014 Q2, 5 ECTS), Peter Krogh (4 students, reexam).
 January 2015
 Course examiner, Department of Computer Science, Aarhus University. Visualisering og projektkommunikation (ITvap, 2014 Q2, 5 ECTS), Aviaja Borup (13 students).
 January 2015
 Course examiner, Department of Computer Science, Aarhus University. Programming 2 (dProg 2, Q2 2014, 5 ECTS), Gudmund Skovbjerg Frandsen (32 students).
 October 2014
 Course examiner, Department of Computer Science, Aarhus University. Pervasive Computing (OS, Q1 2014, 5 ECTS), Niels Olof Bouvin (14 students).
 September 2014
 Bachelor project examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense (Summer 2014). Rolf Fagerberg (1 student).
 June 2014
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Algorithms and Data Structures (IMADA DM507, 10 ECTS), Rolf Fagerberg (73 students).
 June 2014
 Course examiner, Department of Computer Science, Aarhus University. Discrete Computaional Geometry (Q3+Q4 2014, 10 ECTS), Peyman Afshani (5 students).
 June 2014
 Course examiner, Department of Computer Science, Aarhus University. Advanced Realtime Graphics Effects (Q4 2014, 5 ECTS), Toshiya Hachisuka (15 students).
 June 2014
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Algorithms and Complexity (IMADA DM508, 5 ECTS), Joan Boyar (33 students).
 June 2014
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Approximation Algorithms (IMADA DM833, 5 ECTS), Lene Monrad Favrholdt (10 students).
 May 2014
 Course examiner, Department of Computer Science, Aarhus University. Dynamic Algorithms (Q4 2013, 5 ECTS), Gudmund Skovbjerg Frandsen (1 student).
 May 2014
 Study group examiner, Department of Computer Science, Aarhus University. Advisor Toshiya Hachisuka (1 student).
 January 2014
 MSc thesis examiner, Thomas Nørbo Jensen, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Advisor Rolf Fagerberg.
 January 2014
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. String Algorithms (IMADA DM823, 5 ECTS), Rolf Fagerberg (4 students).
 January 2014
 Course examiner, Department of Computer Science, Aarhus University. IO Algorithms (Q3+Q4 2013, 10 ECTS), Lars Arge (12 students).
 January 2014
 MSc thesis examiner, Søren Erling Lynnerup, Department of Computer Science, University of Copenhagen. Advisor Pawel Winter.
 January 2014
 BSc project examiner, Niklas Thiemann and Claus Vium, Department of Computer Science, University of Copenhagen. Advisor Pawel Winter.
 January 2014
 Course examiner, Department of Computer Science, Aarhus University. Programming 2 (dProg 2, Q2 2013, 5 ECTS), Gudmund Skovbjerg Frandsen (55 students).
 December 2013
 Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Computer Game Programming IV: Projects (IMADA DM816, 5 ECTS), Rolf Fagerberg (2 students).
 September 2013
 MSc thesis examiner, Thomas Palludan Hargreaves, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Advisor Rolf Fagerberg.
 June 2013
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Algorithms and Data Structures (IMADA DM507, 10 ECTS), Rolf Fagerberg (47 students).
 June 2013
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Algorithms and Complexity (IMADA DM508, 5 ECTS), Joan Boyar (28 students).
 June 2013
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Computer Game Programming III: Physics (IMADA DM815, 5 ECTS), Rolf Fagerberg (6 students).
 June 2013
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Approximation Algorithms (IMADA DM833, 5 ECTS), Lene Monrad Favrholdt (22 students).
 June 2013
 Course examiner, Department of Computer Science, Aarhus University. Dynamic Algorithms (Q4 2013, 5 ECTS), Gudmund Skovbjerg Frandsen (1 student).
 January 2013
 Course examiner, Department of Computer Science, Aarhus University. Computational Geometry (Q1+Q2 2012, 10 ECTS), Peyman Afshani (20 students).
 January 2013
 Course examiner, Department of Computer Science, Aarhus University. Programming 2 (dProg 2, Q2 2012, 5 ECTS), Gudmund Skovbjerg Frandsen (59 students).
 January 2013
 Course examiner, Department of Computer Science, Aarhus University. Operativ Systemer (dOpSys, Q2 2012, 5 ECTS), Erik Ernst (6 students).
 December 2012
 MSc thesis examiner, Stoyan Ivanov Kamburoy, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Advisor Rolf Fagerberg.
 August 2012
 Course examiner, Department of Computer Science, Aarhus University. Programming 2 (dProg 2, Q2 2011, 5 ECTS), Gudmund Skovbjerg Frandsen (13 students).
 June 2012
 Project examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Rolf Fagerberg (1 student).
 June 2012
 Bachelor projects examiner, DTU Informatik, Technical University of Denmark (Spring 2012). Phillip Bille and Inge Li Gørtz (5 students).
 June 2012
 Course examiner, Department of Computer Science, Aarhus University. IO Algorithms (Q3+Q4 2012, 10 ECTS), Lars Arge (9 students).
 March 2012
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Algorithms and Complexity (IMADA DM508, 5 ECTS), Joan Boyar (27 students).
 January 2012
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. I/OEfficient Algoritms and Data Structures (IMADA DM207, 10 ECTS), Rolf Fagerberg (4 students).
 January 2012
 Course examiner, Department of Computer Science, Aarhus University. Programming 2 (dProg 2, Q2 2011, 5 ECTS), Gudmund Skovbjerg Frandsen (42 students).
 September 2011
 MSc thesis examiner, Jens Henrik Hertz and Martin Ancher Müller Neiiendam, DTU Informatik, Technical University of Denmark. Advisor Philip Bille and Inge Li Gørtz.
 August 2011
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Algoritmer og Datastrukturer (IMADA DM507, 37 ECTS), Lene Monrad Favrholdt (4 students).
 August 2011
 MSc thesis examiner, Hjalte Wedel Vildhøj and Søren Vind, DTU Informatik, Technical University of Denmark. Advisor Philip Bille and Inge Li Gørtz.
 June 2011
 Course examiner, Department of Computer Science, Aarhus University. IO Algorithms (Q3+Q4 2011, 10 ECTS), Lars Arge (21 students).
 June 2011
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Algoritmer og Datastrukturer (IMADA DM507, 37 ECTS), Lene Monrad Favrholdt (11 students).
 April 2011
 MSc thesis examiner, Jakob Lund, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Advisor Rolf Fagerberg and Kim Skak Larsen.
 March 2011
 Course examiner, Department of Computer Science, Aarhus University. FunctionalProgramming Techniques (dTFP, Q3 2011, 5 ECTS), Olivier Danvy (10 students).
 March 2011
 Course examiner, Department of Computer Science, Aarhus University. Introduction to Functional Programming (dIFP Q1 2010, 5 ECTS), Olivier Danvy (1 student).
 January 2011
 Course examiner, Department of Computer Science, Aarhus University. Programming 2 (dProg 2, Q2 2010, 5 ECTS), Gudmund Skovbjerg Frandsen (35 students).
 January 2011
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Computer Game Programming III: Physics (IMADA DM815, 5 ECTS), Rolf Fagerberg (11 students).
 January 2011
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Discrete Mathematics (IMADA MM524DM527, 5 ECTS), Daniel Merkle (5 students).
 October 2010
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Discrete Mathematics (IMADA MM524DM527, 5 ECTS), Daniel Merkle (70 students).
 October 2010
 Course examiner, Department of Computer Science, Aarhus University. Introduction to Functional Programming (dIFP Q1 2010, 5 ECTS), Olivier Danvy (20 students).
 May 2010
 MSc thesis examiner, Nikolaj Bytsø, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Advisor Rolf Fagerberg.
 April 2010
 Course examiner, Department of Computer Science, Aarhus University. Reliable Software Architetures (5 ECTS), Henrik Bærbak Christensen (4 students).
 January 2010
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. I/OEfficient Algoritms and Data Structures (IMADA DM207, 10 ECTS), Rolf Fagerberg (3 students).
 January 2010
 Course examiner, Department of Computer Science, Aarhus University. Programming 2 (dProg 2, Q2 2009, 5 ECTS), Gudmund Skovbjerg Frandsen (28 students).
 October 2009
 Course examiner, Department of Computer Science, Aarhus University. Introduction to Programming (dIntProg, Q1 2009, 5 ECTS), Michael Caspersen.
 August 2009
 MSc thesis examiner, Thomas Nordahl Pedersen, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Advisor Lene Monrad Favrholdt.
 August 2009
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Algorithms and Data Structures (IMADA DM507, 10 ECTS), Lene Monrad Favrholdt (5 students).
 January 2009
 Course examiner, Department of Computer Science, Aarhus University. Programming 2 (dProg 2, Q2 2008, 5 ECTS), Gudmund Skovbjerg Frandsen (78 students).
 October 2008
 Course examiner, Department of Computer Science, Aarhus University. Introduction to Programming (dIntProg, Q1 2008, 5 ECTS), Michael Caspersen.
 June 2008
 Course examiner, Department of Computer Science, Aarhus University. IO Algorithms (Q3+Q4 2008, 10 ECTS), Lars Arge (17 students).
 June 2008
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. I/OEfficient Algoritms and Data Structures (IMADA DM808, 10 ECTS), Rolf Fagerberg (4 students).
 June 2008
 MSc thesis examiner, Torsten Bonde Christiansen, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Advisor Rolf Fagerberg.
 January 2008
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Algorithms for Web Indexing and Searching (IMADA DM79, 10 ECTS), Rolf Fagerberg (7 students).
 January 2008
 Course examiner, Department of Computer Science, Aarhus University. Programming 2 (dProg 2, Q2 2007, 5 ECTS), Gudmund Skovbjerg Frandsen (37 students).
 June 2007
 Course examiner, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Topics in Algorithmics (IMADA DM69, 10 ECTS), Lene Monrad Favrholdt (4 students).
 June 2007
 Course examiner, Department of Computer Science, Aarhus University. IO Algorithms (Q3+Q4 2007, 10 ECTS), Lars Arge (19 students).
 October 2006
 Course examiner, Department of Computer Science, University of Copenhagen. The 6th STL Workshop, Jyrki Katajainen (6 students).
 October 2006
 MSc thesis examiner, Martin Ehmsen, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Advisor Kim Skak Larsen.
 July 2006
 MSc thesis examiner, Jacob Allerelli, Department of Mathematics and Computer Science, University of Southern Denmark, Odense. Advisor Rolf Fagerberg.
 June 2006
 Course examiner, Department of Computer Science, Aarhus University. IO Algorithms (Q3+Q4 2006, 10 ECTS), Lars Arge (11 students).
 July 2005
 Course examiner, Department of Computer Science, Aarhus University. Dynamic Algorithms (Q4 2005, 5 ECTS), Gudmund Skovbjerg Frandsen (21 students).
 June 2005
 Course examiner, Department of Computer Science, Aarhus University. IO Algorithms (Q3+Q4 2005, 10 ECTS), Lars Arge (12 students).
 July 2004
 Course examiner, Department of Computer Science, Aarhus University. Dynamic Algorithms (Q4 2004, 5 ECTS), Gudmund Skovbjerg Frandsen (17 students).
PhD Committee
 September 2014
 PhD opponent, Jan Bulanek, Charles University, Prague, Czech Republic.
 November 2011
 PhD committee member, Djamal Belazzougui, LIAFA, Université Paris DiderotParis 7, Paris.
 October 2011
 PhD committee member, Andrea Campagna, IT University of Copenhagen.
 December 2008
 PhD committee member, Deepak Ajwani, Max Planck Institute for Computer Science, Saarbrücken, Germany.
 August 2008
 PhD committee member, Karim Douieb, Université Libre de Bruxelles, Belgium.
 September 2006
 PhD committee member, Anders Gidestam, Chalmers Technical University, Goteborg, Sweden.
Grant Reviewer
 2017
 German Research Foundation (DFG), Excellence Strategy by the German Federal and State Governments to Promote Science and Research at German Universities, Research panel on Engineering Sciences.
 2016
 German Research Foundation (DFG), Priority Programme "Algorithms for Big Data" (SPP 1736/2).
 2014
 The Research Council of Norway, ICT Panel 1, FRINATEK Applications.
 2013
 The Research Council of Norway, ICT Panel 2, FRINATEK Applications.
 German Research Foundation (DFG), Priority Programme "Algorithms for Big Data" (SPP 1736).
 2012
 The Research Council of Norway, ICT Panel 1, FRINATEK Applications.
Journal Review
 ACM Journal of Experimental Algorithmics, 1998, 2000, 2012, 2015, 2016.
 Algorithmica, 1998, 1999, 2000, 2001, 2002, 2004, 2005, 2008, 2010, 2011, 2012, 2013, 2014, 2015, 2017.
 Applicable Algebra in Engineering, Communication and Computing, 2003.
 Applied Computing and Informatics, 2015.
 ETRI Journal, 2004.
 Fundamenta Informaticae, 2014.
 HigherOrder and Symbolic Computation, 1999, 2003.
 Information Processing Letters, 2000, 2002, 2003, 2008, 2009, 2014, 2016.
 Information and Computation, 1998.
 International Journal of Computational Geometry and Applications, 2011, 2012.
 Journal of Algorithms, 1998.
 Journal of Algorithms  Algorithms in Cognition, Informatics and Logic, 2008.
 Journal of Automata, Languages and Combinatorics, 2003.
 Journal of Combinatorial Optimization, 2013.
 Journal of Computational Biology, 2016.
 Journal of Discrete Algorithms, 2000, 2011.
 Journal of Functional Programming, 1998.
 Journal of Parallel and Distributed Computing, 1997, 1998.
 Journal of Systems and Software, 2003.
 Journal of the Association for Computing Machinery, 1997.
 Nordic Journal of Computing, 1999, 2014.
 SIAM Journal of Computing, 2004, 2007, 2012.
 Software: Practice and Experience, 2006.
 The Computer Journal, 2005.
 Theoretical Computer Science, 2000, 2004, 2006.
 Transactions on Algorithms, 2013, 2017.
 Transportation Science, 2013.
Conference Referee
 2018
 29th Annual ACMSIAM Symposium on Discrete Algorithms.
 2017
 44th ACM SIGPLAN Symposium on Principles of Programming Languages.
 43rd International Conference on Current Trends in Theory and Practice of Computer Science.
 28th Annual International Symposium on Algorithms and Computation.
 28th Annual ACMSIAM Symposium on Discrete Algorithms.
 2016
 57th Annual Symposium on Foundations of Computer Science.
 48th Annual ACM Symposium on Theory of Computing.
 35th ACM SIGMODSIGACTSIGART Symposium on Principles of Database Systems.
 33rd Annual Symposium on Theoretical Aspects of Computer Science.
 27th Annual ACMSIAM Symposium on Discrete Algorithms.
 18th Workshop on Algorithm Engineering and Experiments.
 2015
 9th International Frontiers of Algorithmics Workshop.
 56th Annual Symposium on Foundations of Computer Science.
 31st European Workshop on Computational Geometry.
 26th International Workshop on Combinatorial Algorithms.
 23rd Annual European Symposium on Algorithms.
 17th Workshop on Algorithm Engineering and Experiments.
 2014
 41st International Colloquium on Automata, Languages, and Programming.
 39th International Symposium on Mathematical Foundations of Computer Science.
 25th International Workshop on Combinatorial Algorithms.
 25th Annual International Symposium on Algorithms and Computation.
 25th Annual ACMSIAM Symposium on Discrete Algorithms.
 14th Scandinavian Workshop on Algorithm Theory.
 2013
 7th International Conference on Language and Automata Theory and Applications.
 54th Annual Symposium on Foundations of Computer Science.
 40th International Colloquium on Automata, Languages, and Programming.
 32nd ACM SIGMODSIGACTSIGART Symposium on Principles of Database Systems.
 27th IEEE International Parallel & Distributed Processing Symposium.
 24th Annual ACMSIAM Symposium on Discrete Algorithms.
 24rd International Workshop on Combinatorial Algorithms.
 21st Annual European Symposium on Algorithms.
 19th International Symposium on Fundamentals of Computation Theory.
 13th International Workshop on Algorithms and Data Structures.
 2012
 53rd Annual Symposium on Foundations of Computer Science.
 39th International Colloquium on Automata, Languages, and Programming.
 31st ACM SIGMODSIGACTSIGART Symposium on Principles of Database Systems.
 23th Annual International Symposium on Algorithms and Computation.
 23rd International Workshop on Combinatorial Algorithms.
 23rd Annual ACMSIAM Symposium on Discrete Algorithms.
 20th Annual European Symposium on Algorithms.
 14th Workshop on Algorithm Engineering and Experiments.
 10th Latin American Symposium on Theoretical Informatics.
 2011
 6th International Computer Science Symposium in Russia.
 43rd Annual ACM Symposium on Theory of Computing.
 3rd Workshop on Massive Data Algorithmics.
 38th International Colloquium on Automata, Languages, and Programming.
 30th ACM SIGMODSIGACTSIGART Symposium on Principles of Database Systems.
 22nd International Workshop on Combinatorial Algorithms.
 22nd Annual ACMSIAM Symposium on Discrete Algorithms.
 10th International Symposium on Experimental Algorithms.
 2010
 9th Latin American Symposium on Theoretical Informatics.
 21th Annual International Symposium on Algorithms and Computation.
 21st Annual ACMSIAM Symposium on Discrete Algorithms.
 12th Workshop on Algorithm Engineering and Experiments.
 12th Scandinavian Workshop on Algorithm Theory.
 2009
 8th International Symposium on Experimental Algorithms.
 50th Annual Symposium on Foundations of Computer Science.
 41st Annual ACM Symposium on Theory of Computing.
 36th International Colloquium on Automata, Languages, and Programming.
 21st ACM Symposium on Parallelism in Algorithms and Architectures.
 20th Annual International Symposium on Algorithms and Computation.
 20th Annual ACMSIAM Symposium on Discrete Algorithms.
 1st Workshop on Massive Data Algorithmics.
 17th Annual European Symposium on Algorithms.
 11th Workshop on Algorithm Engineering and Experiments.
 11th International Workshop on Algorithms and Data Structures.
 2008
 IPDPS 2008  IEEE International Parallel & Distributed Processing Symposium.
 Computability in Europe 2008  Logic and Theory of Algorithms.
 7th International Workshop on Experimental Algorithms.
 40th Annual ACM Symposium on Theory of Computing.
 19th Annual Symposium on Combinatorial Pattern Matching.
 16th Scandinavian Workshop on Algorithm Theory.
 11th Scandinavian Workshop on Algorithm Theory.
 2007
 International Workshop on Algorithmic Topics in Constraint Programming (cancelled).
 6th International Workshop on Experimental Algorithms.
 34th International Colloquium on Automata, Languages, and Programming.
 27th Conference on Foundations of Software Technology and Theoretical Computer Science.
 24th Annual Symposium on Theoretical Aspects of Computer Science.
 18th Annual International Symposium on Algorithms and Computation.
 18th Annual ACMSIAM Symposium on Discrete Algorithms.
 15th Annual European Symposium on Algorithms.
 10th International Workshop on Algorithms and Data Structures.
 2006
 47th Annual Symposium on Foundations of Computer Science.
 33rd International Colloquium on Automata, Languages, and Programming.
 31st International Symposium on Mathematical Foundations of Computer Science.
 25th ACM SIGMODSIGACTSIGART Symposium on Principles of Database Systems.
 17th Annual Symposium on Combinatorial Pattern Matching.
 17th Annual ACMSIAM Symposium on Discrete Algorithms.
 14th Annual European Symposium on Algorithms.
 10th Scandinavian Workshop on Algorithm Theory.
 2005
 9th International Workshop on Algorithms and Data Structures.
 7th Workshop on Algorithm Engineering and Experiments.
 4th International Workshop on Efficient and Experimental Algorithms.
 37th Annual ACM Symposium on Theory of Computing.
 32nd International Colloquium on Automata, Languages, and Programming.
 20th IEEE Conference on Computational Complexity.
 16th Annual ACMSIAM Symposium on Discrete Algorithms.
 13th Annual European Symposium on Algorithms.
 2004
 9th Scandinavian Workshop on Algorithm Theory.
 6th Latin American Symposium on Theoretical Informatics.
 3rd International Conference on Fun With Algorithms.
 31st International Colloquium on Automata, Languages, and Programming.
 24th Conference on Foundations of Software Technology and Theoretical Computer Science.
 21st Annual Symposium on Theoretical Aspects of Computer Science.
 15th Annual Symposium on Combinatorial Pattern Matching.
 15th Annual ACMSIAM Symposium on Discrete Algorithms.
 12th Annual European Symposium on Algorithms.
 2003
 International Conference on Software Engineering and Formal Methods.
 8th International Workshop on Algorithms and Data Structures.
 5th Workshop on Algorithm Engineering and Experiments.
 20th Annual Symposium on Theoretical Aspects of Computer Science.
 11th Annual European Symposium on Algorithms.
 2002
 8th Scandinavian Workshop on Algorithm Theory.
 43rd Annual Symposium on Foundations of Computer Science.
 34th Annual ACM Symposium on Theory of Computing.
 13th Annual Symposium on Combinatorial Pattern Matching.
 11th Euromicro Conference on Parallel Distributed and Networking based Processing, Special session on Memory Hierachies.
 10th Annual European Symposium on Algorithms.
 2001
 9th Annual European Symposium on Algorithms.
 42nd Annual Symposium on Foundations of Computer Science.
 28th International Colloquium on Automata, Languages and Programming.
 2000
 8th Annual European Symposium on Algorithms.
 7th Scandinavian Workshop on Algorithm Theory.
 1999
 Workshop on Algorithmic Aspects of Advanced Programming Languages.
 3rd Workshop on Algorithm Engineering.
 19th Annual Conference on Foundations of Software Technology and Theoretical Computer Science.
 16th Annual Symposium on Theoretical Aspects of Computer Science.
 1998
 6th Annual European Symposium on Algorithms.
 2nd Workshop on Algorithm Engineering.
 25th International Colloquium on Automata, Languages, and Programming.
 18th International Conference on Foundations of Software Technology & Theoretical Computer Science.
 15th Annual Symposium on Theoretical Aspects of Computer Science.
 1996
 Theory and Practice of Informatics; 23rd Seminar on Current Trends in Theory and Practice of Informatics.
 ACM SIGPLAN International Conference on Functional Programming.
 5th Scandinavian Workshop on Algorithm Theory.
 4th Annual European Symposium on Algorithms.
 1995
 Theory and Practice of Software Development. 6th International Joint Conference CAAP/FASE.
 ACM SIGPLAN Workshop on Partial Evaluation and SemanticsBased Program Manipulation.
 1994
 4th Scandinavian Workshop on Algorithm Theory.
 21st International Colloquium on Automata, Languages and Programming.