activity
20132020
most citedImproved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation

2 citations · 4 across the 2 of their papers we have counts for

collaborators
Showing 2016Show all

1 paper · 1 filter

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…