J. Audibert, R. Munos, and C. Szepesvári, Variance estimates and exploration function in multi-armed bandit, 2007.
DOI : 10.1016/j.tcs.2009.01.016
URL : http://doi.org/10.1016/j.tcs.2009.01.016

P. Auer, N. Cesa-bianchi, and P. Fischer, Finite-time analysis of the multiarmed bandit problem, Machine Learning, vol.47, issue.2/3, pp.235-256, 2002.
DOI : 10.1023/A:1013689704352

P. Auer, R. Ortner, and C. Szepesvári, Improved Rates for the Stochastic Continuum-Armed Bandit Problem, Conference on Learning Theory, 2007.
DOI : 10.1007/978-3-540-72927-3_33
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.2399

P. Coquelin and R. Munos, Bandit algorithms for tree search, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00150207

R. Coulom, Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search, 5th International Conference on Computer and Games, 2006.
DOI : 10.1007/978-3-540-75538-8_7
URL : https://hal.archives-ouvertes.fr/inria-00116992

S. Gelly, Y. Wang, R. Munos, and O. Teytaud, Modication of UCT with patterns in Monte-Carlo go, 2006.

L. Györfi, L. Devroye, and G. Lugosi, A Probabilistic Theory of Pattern Recognition, 1996.

L. Kocsis and C. Szepesvari, Bandit Based Monte-Carlo Planning, European Conference on Machine Learning, pp.282-293, 2006.
DOI : 10.1007/11871842_29
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.1296