Research Group Discrete Optimization

Christian Glazik, M.Sc.

PhD Student

Christian-Albrechts-Platz 4, R. 915a (CAP 4)
Phone: +49 431 880-7548
Telefax: +49 431 880-1725

Tasks/ Research Area:

I’m interested in algorithms in external memory models with strictly limited RAM, such as the streaming model, especially graph-streaming.

Lower bounds can be found via communication theory, upper bounds by using established randomized techniques as sketching, but also by finding new techniques for problems as finding an Eulerian Tour in a Graph in the streaming model.

I‘m also concerned with combinatorial games, for example multiple variants of mastermind, like the static or permutation version. I‘m dealing with both upper and lower bounds for these versions.


Christian Glazik, Gerold Jäger, Jan Schiemann and Anand Srivastav: Bounds for Static Black-Peg AB Mastermind.In: Proceedings of 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2017), Springer Berlin/Heidelberg, 2017