2 citations · 3 across the 3 of their papers we have counts for
3 papers
math.CO2018
A new Bound for the Maker-Breaker Triangle Game
Christian Glazik, Anand Srivastav
The triangle game introduced by Chvátal and Erdős (1978) is one of the most famous combinatorial games. For , the -triangle game is played by two players,…
cs.DS2017★ 1 cited
Finding Euler Tours in One Pass in the W-Streaming Model with O(n log(n)) RAM
Christian Glazik, Jan Schiemann, Anand Srivastav
We study the problem of finding an Euler tour in an undirected graph G in the W-Streaming model with O(n polylog(n)) RAM, where n resp. m is the number of nodes resp. edges of G. O…
cs.DS2016★ 2 cited
On the Query Complexity of Black-Peg AB-Mastermind
Mourad El Ouali, Christian Glazik, Volkmar Sauerland +1
Mastermind game is a two players zero sum game of imperfect information. The first player, called codemaker, chooses a secret code and the second player, called codebreaker, tries…