Name: David Hammer. Reachable at hammer@imada.sdu.dk.

I’m a PhD student at the University of Southern Denmark and Goethe University Frankfurt as part of a cotutelle agreement. The title of my project and my main research interest is “Theory and practice of external memory algorithms”. My supervisors are Rolf Fagerberg and Ulrich Meyer.

My current office is the “42” at IMADA, SDU, Odense. Technically, it has the very convenient name Ø18-511b-2.

• Simulating Population Protocols in Sub-Constant Time per Interaction
  • Authors: Petra Berenbrink, David Hammer, Dominik Kaaser, Ulrich Meyer, Manuel Penschuck, Hung Tran
  • To appear at the 28th Annual European Symposium on Algorithms (ESA 2020), track B
  • Full paper on arXiv
• On Optimal Balance in B-trees: What Does it Cost to Stay in Perfect Shape?
  • Authors: Rolf Fagerberg, David Hammer, Ulrich Meyer
  • 30th International Symposium on Algorithms and Computation (ISAAC 2019)
• Fragile Complexity of Comparison-Based Algorithms
  • Authors: Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava
  • 27th Annual European Symposium on Algorithms (ESA 2019), track A best paper
  • Full paper on arXiv

For students of DM533/MM850: notes will be uploaded here during the corona crisis.

Full list of courses on which I’ve been TA (or co-TA):

2020 spring

DM533/MM850 - Complexity and Computability

• My notes for the exercise sessions can be found here.
• Example solutions for assignment 3 here

2018/2019 winter semester (Frankfurt)

Parallel and Distributed Algorithms

2018 spring

DM533 - Complexity and Computability

2017 fall

DM549 - Discrete Methods for Computer Science

2016 fall

DM536 - Introduction to Programming

2016 spring

DM507 - Algorithms and Data Structures

2015 fall

DM547 - Discrete Math

While following DM841 (Geometric algorithms), I made two small demo implementations of algorithms discussed in the course:

• Graham’s scan to compute the convex hull of a set of points
• Check if a point is in the interior of a convex polygon in logarithmic time

Both were mostly tested on Firefox, so I have no idea if either work on your browser.