Author:
Glazik Christian,Jäger Gerold,Schiemann Jan,Srivastav Anand
Publisher
Springer International Publishing
Reference15 articles.
1. Asuncion, A.U., Goodrich, M.T.: Nonadaptive mastermind algorithms for string and vector databases, with case studies. IEEE Trans. Knowl. Data Eng. 25(1), 131–144 (2013)
2. Baker, R.C., Harman, G., Pintz, J.: The difference between consecutive primes II. Proc. Lond. Math. Soc. 83(3), 532–632 (2001)
3. Cáceres, J., Hernando, C., Mora, M., Pelayo, I.M., Puertas, M.L., Seara, C., Wood, D.R.: On the metric dimension of cartesian products of graphs. SIAM J. Discret. Math. 21(2), 423–441 (2007)
4. Doerr, B., Doerr, C., Spöhel, R., Thomas, H.: Playing Mastermind With Many Colors. J. ACM 63(5), 42:1–42:23 (2016). ACM
5. El Ouali, M., Glazik, C., Sauerland, V., Srivastav, A.: On the query complexity of black-peg AB-mastermind. CoRR, abs/1611.05907 2016)
http://arxiv.org/abs/1611.05907
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献