2 citations · 3 across the 8 of their papers we have counts for
4 papers · 1 filter
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…
Swap Equilibria under Link and Vertex Destruction
Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav
We initiate the study of the \emph{destruction model} (\aka \emph{adversary model}) introduced by Kliemann (2010), using the stability concept of \emph{swap equilibrium} introduced…
An Improved Filtering Algorithm for Big Read Datasets
Axel Wedemeyer, Lasse Kliemann, Anand Srivastav +3
For single-cell or metagenomic sequencing projects, it is necessary to sequence with a very high mean coverage in order to make sure that all parts of the sample DNA get covered by…
Finding Euler Tours in the StrSort Model
Lasse Kliemann, Jan Schiemann, Anand Srivastav
We present a first algorithm for finding Euler tours in undirected graphs in the StrSort model. This model is a relaxation of the semi streaming model. The graph is given as a stre…