Christian Glazik

According to our database, Christian Glazik authored at least 6 papers between 2017 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

A One Pass Streaming Algorithm for Finding Euler Tours.

Christian Glazik, Jan Schiemann, Anand Srivastav

Theory Comput. Syst., August, 2023

2022

A new bound for the Maker-Breaker triangle game.

Christian Glazik, Anand Srivastav

Eur. J. Comb., 2022

2021

Bounds for the Static Permutation Mastermind game.

Christian Glazik, Gerold Jäger, Jan Schiemann, Anand Srivastav

Discret. Math., 2021

2018

On the Query Complexity of Black-Peg AB-Mastermind.

Mourad El Ouali, Christian Glazik, Volkmar Sauerland, Anand Srivastav

Games, 2018

2017

Finding Euler Tours in One Pass in the W-Streaming Model with O(n log(n)) RAM.

Christian Glazik, Jan Schiemann, Anand Srivastav

CoRR, 2017

Bounds for Static Black-Peg AB Mastermind.

Christian Glazik, Gerold Jäger, Jan Schiemann, Anand Srivastav

Proceedings of the Combinatorial Optimization and Applications, 2017