Students

Current Students:

  • PhD students:
    1. Simon Erfurth * (serfurth.dk) - Trust and News Authenticity
  • Master's students:
      None currently
  • Bachelor's students:
      None currently

Former Students:

These students graduated from the University of Southern Denmark unless otherwise stated. Students with a * after their name had more than one advisor.
  • PhD students:
    1. Carsten Lund *, 1991, University of Chicago.
    2. Rolf Fagerberg, 1996, Odense University - Search Trees and Priority Queues: Closing Some Gaps
    3. Peter Høyer *, 2000 - Quantum Algorithms
    4. Morten Nyhave Nielsen*, 2002 - On Measuring the Quality of On-Line Algorithms
    5. Lene Monrad Favrholdt, 2002 - On-Line Problems with Restricted Input
    6. Sanne Wøhlk *, 2005 - Contributions to Arc Routing
    7. Uffe Flarup *, 2008 - Optimization and Evaluation Problems over the Real Numbers
    8. Sushmita Gupta *, 2013 - New Perspectives on Paging and Server Problems
    9. Abyay Maiti *, 2013 - Analysis of Online Searching and Streaming Problems via a Diverse Collection of Performance Measures
    10. Magnus Find, 2015 - Linearity and Nonlinearity: Complexity and Measures
    11. Christian Kudahl *, 2017 - On the Nature of Online Computation
    12. Jesper With Mikkelsen *, 2017 - Online Decision-Making with Advice: Complexity and Algorithms
  • Master's students (mostly Cand. Scient.):
    1. Peter Bro Miltersen, 1990, Aarhus University.
    2. Søren Eskildsen *, 1993, Odense University.
    3. Peter Lind Damkjær, 1994, Odense University.
    4. Niels Kirkegaard, 1994, Odense University.
    5. Laila Mathiassen, 1997, Odense University.
    6. Martin Markvardsen, 1998, Odense University.
    7. Mads Rasmussen, 1999.
    8. Pia Routhe, 2000.
    9. Jihad Haddad, 2000.
    10. Sanne Wøhlk, Cand. Scient. Oecon. 2002.
    11. Paul Medvedev, 2004.
    12. Bitten Andreasen, 2004.
    13. Frank Tetsche, Cand. Scient. Oecon. 2005.
    14. Anna Rasmussen *, 2008.
    15. Mikkel Busch, 2009.
    16. Thomas Bundgaard, 2009.
    17. Morten Kristensen, 2010.
    18. Johnny Svensson, 2011 - Minimizing the number of XOR gates in circuits computing linear forms.
    19. Camilla Wendelboe, 2012 - Secure 2-party computation using garbled circuits
    20. Lena Erbs, 2012 - On-line competitive analysis and relative worst order analysis of graph coloring algorithms
    21. Søren Haagerup, 2013 - Complexity theoretic results on coin flipping
    22. Christian Kudahl *, 2013 - On-line graph coloring
    23. Jakob Rodenberg, 2015 - Lattice-based cryptography
    24. Laura Ehlers, 2015 - Threshold implementations of small S-boxes
    25. Joel Händig, 2020 - Container orchestration optimization modeled by online bin packing
    26. Nicolai Bille Brahe, 2021 - Exact algorithms from priority algorithms with advice for vertex cover in graphs of maximum degree 3
    27. Jørn Guldberg *, 2021 - A password capability based system with integrated capability based cryptographic file system
    28. Simon S. Erfurth, 2021 - Oblivious transfer in quantum cryptography
    29. Sebastian Eklund Larsen, 2022 - Using online algorithms for call admission control
    30. Thomas Bülow Buhl, 2022 - Priority exact algorithms for the minimum vertex cover problem
    31. Martin K. Lorenzen, 2023 - Online algorithms with machine learning predictors for scheduling
    32. Laura Kristensen, 2023 - Twin cover as a parameter for graph problems
  • Bachelor's students:
    1. Peter Høyer, 1994, Odense University.
    2. Mads Rasmussen, 1996, Odense University.
    3. Brian Pedersen, 1997, Odense University.
    4. Jihad Haddad, 1998, Odense University.
    5. Tim Doege, 1998, Odense University.
    6. Susan Krarup, 2000.
    7. Frank Tetsche, 2001.
    8. Bitten Andreasen, 2002.
    9. Mogens Svendsen *, 2002.
    10. Mikkel Busch, 2006.
    11. Andreas Falk, 2006.
    12. Magnus Gausdal Find, 2009.
    13. Christian Kudahl, 2011 - Quality measures for on-line algorithms
    14. Isabel Quintero, 2011 - Short programs for computing linear forms
    15. Martin Storgaard, 2012 - Cryptographic hashing, with testing of SHA-3
    16. Asbjørn Bille Smed Mikkelsen, 2016 - The RSA cryptosystem - Security and implementation
    17. Line Mandrup Dahl, 2020 - Comparison of probabilistic primality tests
    18. Martin Lorenzen, 2020 - The bounded degree vertex cover problem
    19. Asker Rone Nielsen, 2021 - Exact algorithms for the bounded degree maximum independent set problem
    20. Morten Jakobsen, 2022 - Exact algorithms for maximum independent set in graphs of bounded degree
    21. Christoffer Magnussen Brandenhoff, 2022 - Comparing efficient primality tests
    22. Carl Sebastian Bøgeholm Folkmann, 2023 - Exact algorithms for the bounded degree vertex cover problem
Students marked with a * had more than one advisor.
 
 
Professor Joan Boyar
joan@imada.sdu.dk  ▪  imada.sdu.dk/~joan/